On cost-based routing in connection-oriented broadband networks

We propose a distributed cost-based routing scheme which has much less complexity than the centralized least-cost routing. We evaluate the performance of two cost-based routing schemes and the results indicate that the discrepancy between the performance of both schemes is small. We also compare them with least-loaded routing to demonstrate the ability of cost-based routing in stabilizing the network performance under heavy traffic. In addition, to make cost-based routing a viable option for a high-speed network, we had developed a theory of cost quantization that can significantly reduce the complexity of cost computation. The paper also demonstrates that the degradation of network performance is insignificant while the cost quantization is applied to cost computation.

[1]  Andre Girard,et al.  Routing and Dimensioning in Circuit-Switched Networks , 1990 .

[2]  V. P. Chaudhary,et al.  Technology-trial of dynamic traffic routing with 5 minute updates , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[3]  K. Krishnan,et al.  State-dependent routing for telephone traffic: Theory and results , 1986, 1986 25th IEEE Conference on Decision and Control.

[4]  Jim Kurose,et al.  State dependent routing for multirate loss networks , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[5]  R. Bellman,et al.  Dynamic Programming and Markov Processes , 1960 .

[6]  Christian Huitema,et al.  Routing in the Internet , 1995 .

[7]  Chin-Tau A. Lea,et al.  Optimization of call admission in a reduced state space , 1998, J. High Speed Networks.

[8]  Debasis Mitra,et al.  State-dependent routing on symmetric loss networks with trunk reservations. I , 1993, IEEE Trans. Commun..

[9]  G.R. Ash.  Design and control of networks with dynamic nonhierarchical routing , 1990, IEEE Communications Magazine.

[10]  Chin-Tau A. Lea,et al.  Quantization and cost computation of MDP-based admission and routing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[11]  Chin-Tau A. Lea,et al.  Bandwidth quantization and states reduction in the broadband ISDN , 1995, TNET.

[12]  Joseph Y. Hui,et al.  Least cost routing in multiple-service networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[13]  J. M. Akinpelu,et al.  The overload performance of engineered networks with nonhierarchical and hierarchical routing , 1984, AT&T Bell Laboratories Technical Journal.

[14]  Gerald R. Ash,et al.  Teletraffic and Datatraffic in a Period of Change, Itc-13 Real-time Network Routing in a Dynamic Class-of-service Network , 2011 .

[15]  S. Gupta,et al.  Dynamic routing in multi-class non-hierarchical networks , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.