Routing with end-to-end QoS guarantees in broadband networks

We consider routing schemes for connections with end-to-end delay requirements, and investigate several fundamental problems. First, we focus on networks which employ rate-based schedulers and, hence, map delay guarantees into nodal rate guarantees, as done with the guaranteed service class proposed...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking Vol. 7; no. 3; pp. 365 - 374
Main Author: Orda, A.
Format: Journal Article
Language:English
Published: IEEE 01.06.1999
Subjects:
Broadband communication
Computational complexity
Delay
IP networks
Network topology
Processor scheduling
Quality of service
Routing
Scalability
Web and internet services
ISSN:1063-6692
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider routing schemes for connections with end-to-end delay requirements, and investigate several fundamental problems. First, we focus on networks which employ rate-based schedulers and, hence, map delay guarantees into nodal rate guarantees, as done with the guaranteed service class proposed for the Internet. We consider first the basic problem of identifying a feasible route for the connection, for which a straightforward yet computationally costly solution exists. Accordingly, we establish several approximation schemes that offer substantially lower computational complexity. We then consider the more general problem of optimizing the route choice in terms of balancing loads and accommodating multiple connections, for which we formulate and validate several optimal algorithms. We discuss the implementation of such schemes in the context of link-state and distance-vector protocols. Next, we consider the fundamental problem of constrained path optimization. This problem, typical of quality of service routing, is NP-hard. While standard approximation methods exist, their complexity may often be prohibitive in terms of scalability. Such approximations do not make use of the particular properties of large-scale networks, such as the face that the path selection process is typically presented with a hierarchical, aggregated topology. By exploiting the structure of such topologies, we obtain an /spl epsiv/-optimal algorithm for the constrained shortest-path problem, which offers a substantial improvement in terms of scalability.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1063-6692
DOI:10.1109/90.779205