MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  A Dynamic Routing Procedure for Connections with Quality of Service Requirements

Download:
Download as a PDF | Download as a PS
by Abdelhakim Hafid, Michel Gendreau
ftp://ftp.crim.ca/mmns97/outgoing/p19.ps.gz
Add To MetaCart

Abstract:

Abstract: Emerging high-speed networks will support a number of realtime services required by distributed multimedia applications, such as video-on-demand. To support these services, appropriate routing procedures should be used; upon receipt of a request to open a new connection with certain quality of service (QoS) requirements, an appropriate routing procedure calculates an "optimal " route (with respect to a certain cost function) which satisfies the connection requirements. Most existing routing procedures for real-time connections determine routes which satisfy only a subset of QoS requirements and optimize in terms of QoS information (e.g. a route with the smallest end-to-end delay). In this paper we present a routing procedure which finds a route, if it does exist, which satisfies the whole set of QoS requirements; the route could be optimal in terms of QoS information, money to pay for the utilization of network resources, or network reliability; it is up to the network operator to select the optimization criteria to be used by the routing procedure. We describe also how the proposed routing procedure can be used in ATM environment. Keywords: routing, quality of service, multimedia applications, ATM,

Citations

93 SRP: a resource reservation protocol for guaranteed-performance communication in the Internet – Anderson - 1990
45 Routing and admission control in general topology networks – Gawlick, Kamath, et al. - 1995
32 A Dynamic Connection Management Scheme for Guaranteed Performance Services in Packet-Switching Integrated Services Networks – Parris, Ferrari - 1993
11 H.Zhang, \Network support for multimedia - A discussion of the Tenet approach – Ferrari, Banerjea - 1992
7 Computational experience with an algorithm for finding the k shortest paths in a network – Shier - 1974
5 I.350, General Aspects of Quality of Service and Network Performance – Rec - 1993
5 Quality of Service Issues in High Speed Networks – Nagarajan - 1993
3 ATM user-network interface specification V3.0 – Forum - 1993
3 Two Techniques For Multicasting for Multimedia Applications – Kompella, Pasquale, et al. - 1992
3 Optimization Algorithms for Networks and Graphs, Industrial Engineering vol.1 – Minieka - 1978
1 R.Guerin, Dynamic Routing and Call Control – Ahmadi, Chen - 1991
1 All Shortest Routes in a Graph,Theory of – Dantzig
1 et al., Chapter 2. Time Constrained Routing and – Desrosiers
1 Optimization Algorithms for Networks and Graphs, Eds – Evans
1 Routing with Quality of Service Constraints – Nour, Hafid, et al. - 1997
1 Iterative Methods for Determining the k-Shortest Paths in a Network – Shier - 1976
1 Single path routing delay consideration – Simha, Narahari - 1992