An analysis of bandwidth allocation strategies in multiservice networks

In this paper we consider calculating blocking probabilities for several bandwidth allocation policies in a multi rate multi class networks. A request can require multiple units of each resource (the multi-rate case) and it does not have to be the same for different requests of the same traffic type. We consider the standard complete-sharing policy, guaranteed-minimum sharing policies and a preemptive policy in a prioritized multi class system. The goal of this paper is to determine the probability of a new customer being admitted with a desired grade of service. We present approximate analytical tools to obtain blocking probabilities in a multi rate multi class system, where users of the same class can have different resource requirements. To validate our approach, we also develop a simulation of the system.

[1]  Mischa Schwartz,et al.  Circuit Access Control Strategies in Integrated Digital Networks , 1984, INFOCOM.

[2]  Kin K. Leung,et al.  An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models , 1994, Fifth IEEE International Workshop on Computer-Aided Modeling, Analysis, and Design of Communication Links and Networks.

[3]  Ian F. Akyildiz,et al.  A new preemption policy for DiffServ-aware traffic engineering to minimize rerouting , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  Chunming Qiao,et al.  QoS performance of optical burst switching in IP-over-WDM networks , 2000, IEEE Journal on Selected Areas in Communications.

[5]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[6]  Francois Le Faucheur,et al.  Requirements for support of Diff-Serv-aware MPLS Traffic Engineering , 2000 .

[7]  Victor S. Frost,et al.  Prioritized resource allocation for stressed networks , 2001, TNET.

[8]  Chunming Qiao,et al.  Optical burst switching (OBS) - a new paradigm for an Optical Internet^{1} , 1999, J. High Speed Networks.

[9]  Angela L. Chiu,et al.  Overview and Principles of Internet Traffic Engineering , 2002, RFC.

[10]  W. Whitt,et al.  An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models , 1995, Advances in Applied Probability.

[11]  Cory Beard,et al.  Support for High Priority Traffic Using Preemption , .

[12]  D. Awduche,et al.  Multiprotocol lambda switching: combining MPLS traffic engineering control with optical crossconnects , 2001, IEEE Commun. Mag..

[13]  Wai Sum Lai,et al.  Requirements for Support of Differentiated Services-aware MPLS Traffic Engineering , 2003, RFC.

[14]  Ajay D. Kshemkalyani,et al.  Decentralized Network Connection Preemption Algorithms , 1998, Comput. Networks.

[15]  QiaoChunming,et al.  Optical burst switching (OBS) - a new paradigm for an optical Internet , 1999 .

[16]  A. A. Nilsson,et al.  On multi-rate Erlang-B computations , 1999 .

[17]  Michael Devetsikiotis,et al.  Dynamic utility-based bandwidth allocation policies: the case of overloaded network , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[18]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[19]  Ward Whitt,et al.  Efficiently providing multiple grades of service with protection against overloads in shared resources , 1995, AT&T Technical Journal.