Skip to main content

On the complexity of quality of service routing

Download / Buy Article:

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Keywords: Computational complexity; Multiple constraints; NP-completeness; Routing; Shortest path

Document Type: Short Communication

DOI: http://dx.doi.org/10.1016/S0020-0190(98)00206-3

Affiliations: High Speed Networks Department, Bell Labs Lucent Technologies, 101 Crawfords Corner Road, Holmdel, NJ 07733, USA

Publication date: February 12, 1999

els/00200190/1999/00000069/00000003/art00206
dcterms_title,dcterms_description,pub_keyword
6
5
20
40
5

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more