Stateless QoS routing in IP networks

QoS routing has generally been addressed in the context of reservation-based network services (e.g. ATM, IntServ), which require explicit (out of band) signaling of reservation requests and maintenance of per-flow state information. It has been recognized that the processing of per-flow state information poses scalability problems, especially at core routers. To remedy this situation, in this paper we introduce an approach for stateless QoS routing in IP networks that assumes no support for signaling or reservation from the network. Simple heuristics are proposed to identify a low-cost delay-constrained path. These heuristics essentially divide the end-to-end path into at most two "superedges" that are connected by a "relay node". Routers that lie on the same superedge use either the cost metric or the delay metric (but not both) to forward the packet. Simulations are presented to evaluate the cost performance of the proposed approach.

[1]  Xipeng Xiao,et al.  Internet QoS: a big picture , 1999, IEEE Netw..

[2]  Juha Heinanen.  Differentiated Services in MPLS Networks , 1999 .

[3]  Jon Postel,et al.  Assigned Numbers , 1979, RFC.

[4]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[5]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[6]  Quan Sun,et al.  A new distributed routing algorithm for supporting delay-sensitive applications , 1998, Comput. Commun..

[7]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[8]  Douglas S. Reeves,et al.  A distributed algorithm for delay-constrained unicast routing , 2000, TNET.

[9]  Vaduvur Bharghavan,et al.  Delay differentiation and adaptation in core stateless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  Geoff Huston,et al.  Next Steps for the IP QoS Architecture , 2000, RFC.

[11]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[12]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[13]  Jon Postel,et al.  Assigned Numbers , 1979, RFC.

[14]  Ron Widyono.  The Design and Evaluation of Routing Algorithms for Real-time Channels , 1994 .

[15]  Jeffrey M. Jaffe,et al.  Algorithms for finding paths with multiple constraints , 1984, Networks.

[16]  Ram Dantu,et al.  Constraint-Based LSP Setup using LDP , 2002, RFC.

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Ion Stoica,et al.  Providing guaranteed services without per flow management , 1999, SIGCOMM '99.

[19]  Charles E. Perkins,et al.  IP Encapsulation within IP , 1996, RFC.

[20]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[21]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[22]  Charles E. Perkins,et al.  Minimal Encapsulation within IP , 1996, RFC.