A route pre-computation algorithm for integrated services networks

Abstract

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 with V vertices. The results can be used for routing connections with guaranteed capacity in a communication network. © 1995 Plenum Publishing Corporation.