A route pre-computation algorithm for integrated services networks

We provide an algorithm for computing best paths on a graph where edges have a multidimensional cost, one dimension representing delay, the others representing available capacity. Best paths are those which guarantee maximum capacity with least possible delay. The complexity of the algorithm is of the order of O(V3) in the bidimensional case, for a graph withV vertices. The results can be used for routing connections with guaranteed capacity in a communication network.


Published in:
Journal of Network and Systems Management, 3, 4, 427-449
Year:
1995
Other identifiers:
Laboratories:




 Record created 2004-08-31, last modified 2018-04-15

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)