Loading...
research article
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.
Loading...
Name
LeBoudecP95.pdf
Access type
openaccess
Size
3.67 MB
Format
Adobe PDF
Checksum (MD5)
ebedd06f9b208c36bd23fefa502ce924