Modelling and analysis of routing and resource allocation techniques in multi-service networks

In this paper a novel call level model based on the extension of the classical Erlang multi-rate model for broadband integrated services networks is proposed. We use the model to study routing strategies in multi-service networks where service classes with/without QoS guarantees coexist. Examples for such networks include ATM and IP-based integrated networks. In ATM, the CBR and VBR service classes provide QoS guarantees, while the ABR and UBR service classes are of the best effort type. In IP, traditional TCP/IP traffic is of the best effort type, while new protocols like the RSVP or the differentiated services with central resource handling attempt to support QoS parameters. The coexistence of guaranteed and best effort traffic gives rise to new challenging problems since for a given elastic (best effort) connection the bottleneck link determines the available bandwidth and thereby puts constraints on the bandwidth at the other links along the connection’s path. Since the available bandwidth fluctuates in time following the load on the links, routing and link allocation in this environment together with blocking probability calculations and fairness issues need to be studied. By means of our proposed model we are able to conduct a survey of various routing and link allocation techniques as well as to develop a modified shortest path routing algorithm which, according to the numerical examples, performs well in this environment. Copyright ( 1999 John Wiley & Sons, Ltd.

[1]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[2]  Tibor Cinkler,et al.  Blocking Probability Approximations and Revenue Optimization in Multirate Loss Networks , 1997, Simul..

[3]  Rouch Guerin,et al.  Queueing-blocking system with two arrival streams and guard channels , 1988, IEEE Trans. Commun..

[4]  K. G. Ramakrishnan,et al.  ATM network design and optimization: a multirate loss network framework , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[5]  F. Kelly.  Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.

[6]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..

[7]  Raj Jain.  Congestion Control and Traffic Management in ATM Networks: Recent Advances and a Survey , 1996, Comput. Networks ISDN Syst..

[8]  Steven H. Low,et al.  An optimization approach to ABR control , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[9]  Raj Jain,et al.  On determining the fair bandwidth share for ABR connections in ATM networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[10]  András Rácz,et al.  Simulative Analysis of Routing and Link Allocation Strategies in ATM Networks Supporting ABR Services , 1998 .

[11]  J. W. Roberts,et al.  Performance evaluation and design of multiservice networks , 1992 .

[12]  K. K. Ramakrishnan,et al.  An efficient rate allocation algorithm for ATM networks providing max-min fairness , 1995, HPN.

[13]  Serge Fdida,et al.  Evaluation of the ER Algorithm ERAQLES in Different ABR Environments , 1997, Modelling and Evaluation of ATM Networks.

[14]  Yiwei Thomas Hou,et al.  ATM ABR Traffic Control with a Generic Weight-Based Bandwidth Sharing Policy: Theory and a Simple Implementation , 1998 .

[15]  Iakovos S. Venieris,et al.  Simulative Analysis of Optimal Resource Allocation and Routing in IBCN's , 1991, IEEE J. Sel. Areas Commun..

[16]  Lorne G. Mason,et al.  A multiserver queue with narrow- and wide-band customers and wide-band restricted access , 1988, IEEE Trans. Commun..

[17]  John Adams,et al.  Available Bit Rate - A New Service for ATM , 1996, Comput. Networks ISDN Syst..

[18]  K. K. Ramakrishnan,et al.  Scalability issues for distributed explicit rate allocation in ATM networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[19]  F. Kelly.  Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.

[20]  Peter Steenkiste,et al.  Routing high-bandwidth traffic in max-min fair share networks , 1996, SIGCOMM '96.

[21]  Vijay K. Samalam,et al.  The available bit rate service for data in ATM networks , 1996 .