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...
Saved in:
| Published in: | Computer networks (Amsterdam, Netherlands : 1999) Vol. 36; no. 2; pp. 251 - 268 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Amsterdam
Elsevier B.V
01.07.2001
Elsevier Sequoia S.A |
| Subjects: | |
| ISSN: | 1389-1286, 1872-7069 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!