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...

Celý popis

Podrobná bibliografia

Vydané v:	Computer networks (Amsterdam, Netherlands : 1999) Ročník 36; číslo 2; s. 251 - 268
Hlavní autori:	Korkmaz, Turgay, Krunz, Marwan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.07.2001 Elsevier Sequoia S.A
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!