QoS routing: Average complexity and hopcount in m dimensions

Title

QoS routing: Average complexity and hopcount in m dimensions

 Author

Kuipers, F.
Van Mieghem, P.

Faculty

Electrical Engineering, Mathematics and Computer Science

 Department

Network Architectures and Services

 Date

2001-09-24

 Abstract

QoS routing is expected to be an essential building block of a future, efficient and scalable QoS-aware network architecture. We present SAMCRA, an exact QoS routing algorithm that guarantees to find a feasible path if such a path exists. The complexity of SAMCRA is analyzed. Because SAMCRA is an exact algorithm, most findings can be applied to QoS routing in general. The second part of this paper discusses how routing with multiple independent constraints affects the hopcount distribution. Both the complexity as the hopcount analysis indicate that for a special class of networks, QoS routing exhibits features similar to single-parameter routing.

 To reference this document use:

http://resolver.tudelft.nl/uuid:1f1df95f-dd13-470f-9cbc-1474778ed878

 Source

Quality of Future Internet Services: Second COST 263 International Workshop, Qofis 2001, Coimbra, Portugal, September 24-26, 2001

 Part of collection

Institutional Repository

 Document type

conference paper

 Rights

(c) 2001 Kuipers, F.; Van Mieghem, P.
Files
PDF kuipernmieghem.pdf 317.14 KB
Close viewer