Analysis of routing policies in broad-band networks

This paper derives sequential routing, random alternate routing, least-loaded routing, and minimum cost routing policies for multirate, multipoint broadband networks. These routing policies are obtained by generalizing similar schemes used in circuit-switched networks. Fixed-point performance evaluation algorithms are developed and numerical studies are performed to compare the routing policies in networks of different size and traffic conditions. The routing policies are further extended to the multipoint environment, wherein relative performance and the issues relating to implementation are discussed.

[1]  Yasuhiro Miyao,et al.  A call admission control scheme in ATM networks , 1991, ICC 91 International Conference on Communications Conference Record.

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

[3]  Richard J. Gibbens,et al.  Dynamic Routing in Fully Connected Networks , 1990 .

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

[5]  Keith W. Ross,et al.  Computing approximate blocking probabilities for large loss networks with state-dependent routing , 1993, TNET.

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

[7]  Z. Dziong,et al.  An analysis of near optimal call admission and routing model for multi-service loss networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.