On the complexity of quality of service routing

Information Processing Letters

Volumn 69, Issue 3, 1999, Pages 111-114

  Wang, Zheng ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Computational complexity; Multiple constraints; NP completeness; Routing; Shortest path

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA COMMUNICATION SYSTEMS; OPTIMIZATION; TELECOMMUNICATION SERVICES; TELECOMMUNICATION TRAFFIC;

QUALITY OF SERVICE (QOS) ROUTING;

CONGESTION CONTROL (COMMUNICATION);

EID: 0033076389     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00206-3     Document Type: Article

References (5)

1. D. Bertsekas, R. Gallager, Data Networks, Prentice-Hall, Englewood Cliffs, NJ, 1987.
2. M.R. Garey, D.S. Johnson, Computers and Intractability -A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
3. J. Jaffe, Algorithms for finding paths with multiple constraints, in: Networks 14 (1984) 95-116.
4. Z. Wang, J. Crowcroft, Bandwidth-delay based routing algorithms, in: Proc. IEEE GlobeCom'95, Singapore, November 1995.
5. Q. Ma, P. Steenkiste, H. Zhang, Routing high-bandwidth traffic in max-rain fair share networks, in: Proc. IEEE SIGCOMM'96, California, August 1996.