R. Guerin, S. Kamat, and S. Herzog. QoS Path Management with RSVP. In Proceedings of the 2nd IEEE Global Internet Mini-Conference, pages 1914-1918, Phoenix, AZ, November  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to what network mechanism should the provider employ in order to guarantee multimedia delivery with QoS constraints. In this section there are three major candidate technologies, MPLS [6] Multiprotocol Label Switching) DiffServ (Differentiated Services) 7] and IntServ (Integrated Services) [8] which can play this role. Although each one has its special characteristics, it is strongly advisable their complementary operation (e.g. MPLS IntServ, MPLS DiffServ, IntServ DiffServ) 9] 3. OVERALLPROPOSEDARCHITECTURE In the following paragraphs we will present a multimedia network ....

R. Guerin, S. Kamat, and S. Herzog, "QoS Path Management with RSVP", Internet Draft, Mar. 1997

....requires that the two paths of a FT flow are fixed throughout the flow s lifetime. This is true in a connectionoriented network. In connectionless networks, where the path of a flow can change dynamically, the recently suggested technique of path pinning can be used to fix the paths of FT flows [8]. Note that, regular flows can still use dynamic path changes (as in [5] and or other fault recovery methods. RBone Fault Model. We consider noncoincident RBone link and node failures. The term non coincident means here that the time between successive failures is large enough for the RBone to ....

R. Guerin, S. Kamat, and S. Herzog, QoS Path Management with RSVP, March 1997. Internet Draft: draft-qos-path-mgmt-rsvp00. txt (work in progress).

....IP network. Routing changes may not be a frequent event in the Internet as a whole, but there are certain links in which they occur quite often [81] If a certain end to end QoS is guaranteed to a flow, the architecture should be able to either forbid routing changes for that flow (route pinning) [46], or to reserve the required forwarding resources, while the session is in progress, in the flow s new path. Both these operations are hard to implement in practice. Similar complexities arise when IntServ flows need fault tolerance [32] Other factors that have contributed to the weak deployment ....

R. Guerin, S. Kamat, and S. Herzog. QoS Path Management with RSVP, March 1997. Internet Draft: draft-qos-path-mgmt-rsvp-00.txt.

....at most h hops. The bw and neighbor fields of the (m; h) entry are then updated to reflect this new values. This records the next hop from the computing node on the best path identified thus far for destination node m and with h or less hops. In conjunction with the QoS extension, Guerin et. al [55, 37, 56] have also proposed a QoS path management mechanism that aims at allowing management, through the RSVP protocol, of paths selected by their proposed QoS driven OSPF and have extended the interface between RSVP and routing to support a broader range of routing mechanisms than allowed by the current ....

R. Guerin, S. Kamat, and S. Herzog. QoS path management with RSVP. IETF Internet-Draft, March 1997.

....Orda (ariel ee.technion.ac.il) is with the Dept. Elec. Eng. Technion I.I.T. Haifa, 32000 Israel. Part of this work was done while visiting the IBM T.J. Watson Research Center. 1 As discussed in [2] a hop by hop model can also be considered, but requires additional care to avoid loops (see [3] for a discussion of this issue) routed, etc. Each of these criteria can influence the outcome of the path selection process, e.g. the network may identify a path capable of satisfying the requirement of the flow, but decide not to use it because it is too expensive in terms of the amount of ....

R. Guerin, S. Kamat, and S. Herzog, "QoS path management with RSVP," in Proceedings of GLOBECOM, Phoenix, AZ, November 1997.

....requires that the two paths of a FT flow are fixed throughout the flow s lifetime. This is true in a connectionoriented network. In connectionless networks, where the path of a flow can change dynamically, the recently suggested technique of path pinning can be used to fix the paths of FT flows [8]. Note that, regular flows can still use dynamic path changes (as in [5] and or other fault recovery methods. RBone Fault Model. We consider noncoincident RBone link and node failures. The term non coincident means here that the time between successive failures is large enough for the RBone to ....

R. Guerin, S. Kamat, and S. Herzog, QoS Path Management with RSVP, March 1997. Internet Draft: draft-qos-path-mgmt-rsvp00. txt (work in progress).

....recent work allows receiver oriented setup of non opportunistic branches in a multicast tree [PGLA97] but again only along shortest path routes and at the expense of considerably more state to prevent looping. Finally, Guerin et al. have recently proposed a senderoriented route pinning mechanism [RG97] but the approach is applicable only to unicast routing and uses only shortest path routes. We have discussed several route construction heuristics that do not require global distribution of topology. Alaettinoglu explored route construction using aggregation and hierarchical heuristics for ....

S. Herzog R. Guerin, S. Kamat. "QoS Path Management with RSVP". work in progress, March 1997.

No context found.

R. Guerin, S. Kamat, and S. Herzog. QoS Path Management with RSVP. In Proceedings of the 2nd IEEE Global Internet Mini-Conference, pages 1914-1918, Phoenix, AZ, November

....QoS routing is again queried to obtain (and pin) a new next hop. The unpinning of the path upon detecting changes in either the PHOP or the IP TTL value of an incoming PATH message is used to ensure that transient loops caused by inconsistent routing information are eventually cleared [GKH97]. PATH TEAR message processing: Processing is similar to what is currently done. PATH and RESV states are removed. RESV message processing: The only change needed is for the case when the resource reservation attempt fails. As currently specified, a RESV ERR message with admission control ....

....such an approach is the subject of future work. Guerin, et al. Expires 30 September 1997 [Page 35] Internet Draft QoS Routing Mechanisms 25 March 1997 For a detailed discussion of how these QoS path management rules within RSVP prevent loops and handle race conditions, the reader is referred to [GKH97]. F.4. Alternatives and Extensions In the path management approach described here, bulk of the responsibility for QoS path management, i.e. pinning and unpinning of next hop information, lies with RSVP. This was motivated in part by the need to couple path management with the RSVP soft state ....

R. Guerin, S. Kamat, and S. Herzog. QoS Path Management with RSVP (draft-ietf-guerin-qos-pathmgt-rsvp-00.txt). INTERNET-DRAFT, Internet Engineering Task Force, March 1997.

.... because of its potentially significant gains in terms of processing load, e.g. see [25] Similarly, we opted for a hop by hop routing mode, simply because it can be accommodated without major changes to RSVP [12] the signaling protocol that we assume is used to request QoS guarantees, e.g. see [15]. Our implementation computes QoS paths using the widestshortest path selection criterion described in [10] At a router, a modified Bellman Ford algorithm is used to pre compute paths from the router to all destinations in the network. For each destination, the algorithm computes paths of all ....

R. Guerin, S. Kamat, and S. Herzog. "QoS path management with RSVP." In Proceedings GLOBECOM'97, Phoenix, AZ, November, 1997.

.... because of its potentially significant gains in terms of processing load, e.g. see [25] Similarly, we opted for a hop by hop routing mode, simply because it can be accommodated without major changes to RSVP [12] the signaling protocol that we assume is used to request QoS guarantees, e.g. see [15]. Note that RSVP is one of the possible choices for reservation protocol, our design does not explicitly assume RSVP. Our implementation computes QoS paths using the widestshortest path selection criterion described in [10] At a router, the algorithm pre computes paths from the router to all ....

R. Guerin, S. Kamat, and S. Herzog. "QoS path management with RSVP." In Proceedings GLOBECOM'97, Phoenix, AZ, November, 1997.

.... because of its potentially significant gains in terms of processing load, e.g. see [15] Similarly, we opted for a hop by hop routing mode, simply because it can be accommodated without major changes to RSVP [19] the signaling protocol that we assume is used to request QoS guarantees, e.g. see [20]. Our implementation computes QoS paths using the widest shortest path selection criterion described in [18] At a router, the algorithm pre computes paths from the router (the source vertex s) to all destinations in the network. For each destination, the algorithm computes paths of all possible ....

....bandwidth in successive entries in the row associated with the flow s destination. The search stops at the first entry with an available bandwidth larger than the requested value, at which point the corresponding next hop is returned and used to determine where to forward the request next (see [20] for details) If there is more than one next hop, one of them must be chosen. A possible selection criterion is to choose the path at random based on the available bandwidth on the associated local interface. That is, the probability p i of forwarding the request to next hop n i reachable through ....

[Article contains additional citation context not shown here]

R. Guerin, S. Kamat, and S. Herzog, "QoS path management with RSVP," in Proceedings of GLOBECOM, Phoenix, AZ, November 1997.

....it has become unsuitable. The focus of this paper is the selection of an appropriate path based on link metrics information and flow requirements. Obviously, a complete proposal for QoS routing requires the specification of many other aspects, as mentioned above, and the reader is referred to [5] [6] for more details. C. Simplifying Assumptions In order to achieve our goal of minimum impact to the existing routing infrastructure, we impose certain restrictions on the range of requirements the QoS path selection algorithm needs to deal with directly. Specifically, the path selection ....

.... how our approach could be used to also account for delay requirements, assuming they could be expressed in a form consistent with recent Internet service specifications [11] Details on how the algorithms are to be incorporated in a specific proposal to extend OSPF can be found in [5] as well as [6], which covers the issue of path management when RSVP [4] is used as the signaling protocol. There are several aspects of the proposal for which additional work is needed. Two of the more important are the mechanisms used to determine when to update link information, and the relationship to call ....

R. Guerin, S. Kamat, and S. Herzog, "QoS Path Managementwith RSVP," INTERNET-DRAFT, March 1997, work in progress.

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