G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, T. Przygienda, "QoS Routing Mechanisms and OSPF Extensions", IETF RFC 2676, August 1999 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
QoS Routing Granularity in MPLS Networks - Lin, al. (2002) (3 citations) (Correct)
....and the state of resource availability, each QOS capable router finds the least costly path that still satisfies the resource requirements of a flow. Two on demand shortest path computation heuristics are described as the basis in this study. QoS Extensions to Open Shortest Path First (QOSPF) [9] uses the widest shortest path (WSP) selection criterion to select the path with the minimum number of hops (shortest) If there are several such paths, the one with the maximum available bandwidth (widest) is selected. Algorithm 1 shows the algorithm to respond to the route query. Each routing ....
....flow state and routing cache size could be enormous, ultimately resulting in poor scalability. Furthermore, due to the overheads of per flow path computation, on demand path finding is hardly feasible in real networks (with high rate requests. Therefore, path precomputation is implemented in [9], which asynchronously computes feasible paths to destinations. The routing cache of this scheme is functionally divided into three parts, a per pair cache (P cache) an overflowed per flow cache (O cache) and a per destination cache (D cache) To speed up access to the routing entry, caches ....
G. Apostolopoulos et al., "QoS Routing Mechanisms and OSPF Extensions," RFC 2676, Aug. 1999.
Towards an optimization of the routing parameters for IP.. - Staehle, Köhler, Kohlhaas (2000) (1 citation) (Correct)
....in congestion due to the lack of network resources. Efficient routing of IP packets is becoming a crucial issue both from the point of view of the providers, and of the users of the network. The most effort concerning routing optimization is focused on improvements of the routing protocols itself [5, 8, 11]. However, few methods deal with the optimization of the routing of a particular network. Those methods are mainly known from telephone networks with fixed connections [1, 2, 4] In IP networks the possibilities to optimize the routing are more restricted if the existing routing protocols are ....
G. Apostolopoulos et al, "QoS Routing Mechanisms and OSPF Extensions", draftguerin -qos-routing-ospf-04, December, 1998 16
Alternative Paths vs. Inaccurate Link State Information .. - Jia, Nikolaidis.. (2002) (Correct)
....tend to smooth out occasional problems occurring on some paths, including those caused by inaccurate link state information. This was our primary motivation to embark on the present study. Most proposals for QoS routing are based on versions of Link State (LS) routing, e.g. 24] 4] 1] 3] [2], 19] 25] From the viewpoint of a single node, the amount of information that must be processed to keep the link state database up to date grows more than linearly with the number of links in the network. Furthermore, LS information is not merely collected, but must be also relayed to other ....
....In [6] the authors present a shortest paths algorithm and evaluate its performance. However, that work is based on a fully connected network and is not applicable to realistic wide area networking, e.g. the Internet. The Bellman Ford based Widest Shortest algorithm studied in [2] also provides multiple paths between a source destination pair. However, it ignores the equal hop count multiple paths, which property, as we shall see later, impairs the performance of the routing protocol if the link state information is inaccurate. Ma and Steenkiste [20] investigate several ....
[Article contains additional citation context not shown here]
G. Apostolopoulos, R. Guerin, S. Kamat, T. P. A. Orda, and D. Williams. QoS Routing Mechanisms and OSPF Extensions. Internet Request For Comments RFC RFC2676, Internet Engineering Task Force, December 1998.
Constraint-Based Routing in the Internet: Basic Principles and .. - Younis, Fahmy (2003) (1 citation) (Correct)
..... Checking multiple paths simultaneously and providing backups in case of path failure is referred to as multi path routing [9] 10] The problem with storing multiple paths is that routing tables grow dramatically. This necessitates using efficient mechanisms for storage and retrieval [11], 12] Reactive (on demand) routing: In this approach, routes to destinations are computed when they are needed. This approach reduces overhead, at the expense of slower response times. Examples of this approach include flooding protocols, most of of the QoS routing protocols discussed in ....
....In both cases, after a path is selected and reserved, all packets of the flow should be forwarded on that same path. This means that the path should be fixed throughout the lifetime of the flow, or what is referred to as route pinning. A pinned path means that CBR need not be frequently queried [11], 6] One way of ensuring flow packets follow an explicitly specified path is via source routing, where the packets themselves carry the computed path they should follow as they are forwarded to their destina 5 TABLE II CBR PROCESS TYPES CBR Type Description Advantages Disadvantages Off line ....
[Article contains additional citation context not shown here]
G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, and T. Perzygienda, "QoS Routing Mechanisms and OSPF Extensions, " RFC 2676, August 1999.
A Practical QoS Network Management System Considering Load.. - Yu, Das, Gerla (2003) (Correct)
....a possible use of the Bellman Ford algorithm in the link state environment for QoS routing. These works clearly pointed that a set of multiple QoS constraints must be satisfied at the same time for QoS sensitive applications, and they formed meaningful specifications for practical approaches [3]. Along with these foundations, 4] showed the practicality of the basic QoS routing algorithms by applying them to a network environment for IP Telephony. QoS routing issues were further accelerated by the development of the Multiprotocol Label Switching Protocol (MPLS) 5] which deploys fast ....
G. Apostolopoulos, S. Kama, D. Williams, R. Guerin, A. Orda, and T. Przygienda, "QoS routing mechanisms and OSPF extensions," Request for Comments 2676, Internet Engineering Task Force, Aug. 1999.
Multi-Constrained Optimal Path Selection - Korkmaz, Krunz (2001) (9 citations) (Correct)
....of PNNI, or it may be provided via existing routing protocols, as in the case of MPLS. In particular, MPLS relies on protocols such as OSPF (Open Shortest Path First) 9] to provide the link state information (e.g. delay, bandwidth, etc. This requires slightly extending OSPF, as described in [10]. The type of service (TOS) field in OSPF, which has not been much used in the past, has now been redefined to advertise multiple link parameters (see [10] for details) In the case of Diffserv, the constraint based routes can be requested, for example, by network administrators for traffic ....
....Path First) 9] to provide the link state information (e.g. delay, bandwidth, etc. This requires slightly extending OSPF, as described in [10] The type of service (TOS) field in OSPF, which has not been much used in the past, has now been redefined to advertise multiple link parameters (see [10] for details) In the case of Diffserv, the constraint based routes can be requested, for example, by network administrators for traffic engineering purposes. Provisioning of such routes can also be used to guarantee a certain service level agreement (SLA) for aggregated flows [6] In general, ....
G. Apostolopoulos et al., "QoS routing mechanisms and OSPF extensions, " Tech. Rep. RFC 2676, IETF, August 1999.
Distributed Dynamic Scheduling for End-to-End Rate.. - Salonidis, Tassiulas (2004) (1 citation) Self-citation (Williams) (Correct)
No context found.
G. Apostolopoulos, R. Guerin, S. Kamat, A. Orda, T. Przygienda, and D. Williams. Qos routing mechanisms and ospf extensions, 1998.
MEHROM: Micromobility support with Efficient.. - Peters, Moerman.. (Correct)
No context found.
G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, T. Przygienda, "QoS Routing Mechanisms and OSPF Extensions", IETF RFC 2676, August 1999
Enhanced fault recovery methods for protected traffic services in.. - Calle (2004) (Correct)
No context found.
G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, and T. Przygienda "QoS Routing Mechanisms and OSPF Extensions". IETF RFC 2676, August 1999.
Unknown - (2001) (Correct)
No context found.
G. Apostolopoulos, S. Kama, D. Williams, R. Guerin, A. Orda, and T. Przygienda, "QoS routing mechanisms and OSPF extensions," Request for Comments 2676, Internet Engineering Task Force, Aug. 1999.
Scalable QoS-Based Event Routing in Publish-Subscribe.. - Carvalho, Araujo, Rodrigues (2005) (Correct)
No context found.
G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, and T. Przygienda. QoS routing mechanisms and OSPF extensions, August 1999. RFC 2676.
Search Strategies in Inter-Domain Traffic Engineering - Chandrayana, Zhang.. (2002) (Correct)
No context found.
G. Apostolopoulos and et. al., "Qos routing mechanisms and ospf extensions." IETF Network Working Group RFC 3272, 1999.
Optimised Multi Homing - an Approach for Inter-domain.. - Szabó, Takács, Császár (2004) (Correct)
No context found.
G. Apostolopoulos, S. Kama, D. Williams, R. Guerin, A. Orda, and T. Przygienda, "Qos routing mechanisms and ospf extensions," RFC 2676, IETF, Aug. 1999.
Generic Multipath Routing Concept for Dynamic Traffic.. - Takács, Császár, Szabó.. (Correct)
No context found.
G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, and T. Przygienda, "Qos routing mechanisms and ospf extensions," IETF, RFC2676, Dec. 1999.
Path Integrity aware Traffic Engineering - Takács, Császár, Bíró, Szabó, Henk (2004) (Correct)
No context found.
G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, and T. Przygienda, "Qos routing mechanisms and ospf extensions," IETF, RFC RFC2676, Dec. 1999. [Online]. Available: www.apps.ietf.org/rfc/ rfc2676.txt
Hop-by-Hop Routing Algorithms for Premium-Class Traffic in.. - Wang, Nahrstedt (2002) (4 citations) (Correct)
No context found.
G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, and T. Przygienda, "QoS Routing Mechanisms and OSPF Extensions," RFC 2676, Aug. 1999.
Load Balancing In Hop-By-Hop Routing With And Without Traffic.. - Wang (2003) (Correct)
No context found.
G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, and T. Przygienda. QoS Routing Mechanisms and OSPF Extensions. RFC 2676, August 1999.
Building MPLS VPNs with QoS Routing Capability - Zhang, Kantola (2000) (2 citations) (Correct)
No context found.
G. Apostolopoulos, et al: QoS Routing Mechanisms and OSPF Extensions. IETF RFC2676 (1999)
Constraint-Based Routing in the Internet: . . . - Younis (2003) (Correct)
No context found.
G. Apostolopoulos et al., "QoS Routing Mechanisms and OSPF Extensions," RFC 2676, Aug. 1999.
Enhanced fault recovery methods for protected traffic services in.. - Calle (2004) (Correct)
No context found.
G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, and T. Przygienda "QoS Routing Mechanisms and OSPF Extensions". IETF RFC 2676, August 1999.
HIDRA: HIstory Directed Routing Algorithm for IP Networks - Fafali, Patrikakis.. (Correct)
No context found.
G. Apostolopoulos and et. al: QoS Routing Mechanisms and OSPF extensions. IETF RFC 2676 (August 1999)
Internet Traffic Engineering: History monitoring.. - Fafali.. (Correct)
No context found.
G. Apostolopoulos and et. al, "QoS Routing Mechanisms and OSPF extensions", IETF RFC 2676, August 1999.
QoS Routing Computation with Path Caching: A Framework and Network .. - Medhi (2002) (Correct)
No context found.
G. Apostolopoulos, R. Guerin, S. Kamat, A. Orda, T. Przygienda, D. Williams, "QoS Routing Mechanisms and OSPF Extensions," Internet RFC 2676, August 1999. available from www.ietf.org
Reliable Optical Network Design - Guangzhi Li Jennifer (Correct)
No context found.
G. Apostolopoulos et al, " QoS Routing Mechanisms and OSPF Extensions," RFC 2676.
MPLS Traffic Engineering in OSPF Networks - a combined Approach - Köhler, Binzenhöfer (2003) (Correct)
No context found.
G. Apostolopoulos et al, QoS Routing Mechanisms and OSPF Extensions, draftguerin -qos-routing-ospf-04, December, 1998
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC