Dynamic Routing in Fully Connected Networks
Richard Gibbens, Frank P. Kelly · IMA Journal of Mathematical Control and Information · 1990
This paper considers various aspects of dynamic routing in fully connected circuit-switched networks. Bounds are obtained for the performance of any dynamic routing scheme, some theoretical considerations affecting the choice of trunk reservation parameters are presented, and a very simple dynamic routing scheme called dynamic alternative routing is described, which performs well under a variety of conditions. Finally, some of the capacity planning issues which arise for networks using dynamic routing are discussed.