A randomized algorithm for finding a path subject to multiple QoS requirements

An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies a set of end-to-end QoS requirements (or constraints) while efficiently using network resources. In general, finding a path subject to multiple additive constrai...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computer networks (Amsterdam, Netherlands : 1999) Jg. 36; H. 2; S. 251 - 268
Hauptverfasser:	Korkmaz, Turgay, Krunz, Marwan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.07.2001 Elsevier Sequoia S.A
Schlagworte:	Algorithms Constraints Heuristic Jitter Multi-constrained path selection Networks QoS-based routing Quality of service Routing Scalable routing Selection Studies QoS-based routing Scalable routing Multi-constrained path selection
ISSN:	1389-1286, 1872-7069
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!