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

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

Celý popis

Podrobná bibliografia

Vydané v:	Global Telecommunications Conference (GLOBECOM), 1999 IEEE Ročník 3; s. 1694 - 1698 vol.3
Hlavní autori:	Korkmaz, T., Krunz, M.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 1999
Predmet:	Approximation algorithms Bandwidth Computational complexity Computer networks Costs Delay Heuristic algorithms Polynomials Quality of service Routing
ISBN:	0780357965, 9780780357969
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!