Jean Cherbonnier, Ilias Iliadis, et al.
Annales Des Télécommunications
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.
Jean Cherbonnier, Ilias Iliadis, et al.
Annales Des Télécommunications
Jean-Yves Le Boudec, Andreas Meier, et al.
Computer Networks and ISDN Systems
Tony Przygienda, Patrick Droz, et al.
ICATM 1998
Tony Przygienda, Patrick Droz, et al.
Telecommunication Systems