Virtual partitioning for robust resource sharing: computational techniques for heterogeneous traffic
Authors:
- D. MitraDMD. Mitra
- 1 June 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 16 (5) , 668-678
Abstract
We consider virtual partitioning (VP), which is a scheme for sharing a resource among several traffic classes in an efficient, fair, and robust manner. In the preliminary design stage, each traffic class is allocated a nominal capacity, which is based on expected offered traffic and required quality of service. During operations, if the current capacity usage by a class exceeds its nominal allocation, then it is declared to be in “overload,” and a state-dependent trunk reservation mechanism gives it lower priority in the admission of new calls. We develop efficient computational algorithms for the case of heterogeneous traffic, and perform extensive numerical experiments to demonstrate the accuracy of the various approximations. The performance of VP is examined and compared to that of complete sharing and complete partitioning. Particular weight is placed on robustness, meaning that traffic classes with arrival rates conforming to the design continue to receive the required quality of service, despite the presence of misbehaving classes with excessive arrival rates. We adopt a reward-penalty paradigm as a combined measure for efficiency and fairness, and show that not only is the revenue generated by VP extremely close to the maximum achievable value, but that the structural form of the optimal policy also closely resembles that of VP. The numerical results confirm that the scheme is efficient, fair, and very robustKeywords
This publication has 9 references indexed in Scilit:
- Virtual partitioning by dynamic priorities: Fair and efficient resource-sharing by several services1996
- Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networksAdvances in Applied Probability, 1995
- Multiservice Loss Models for Broadband Telecommunication Networks1995
- Transport network design of integrated networks with real-time dynamic routingJournal of Network and Systems Management, 1993
- Loss NetworksThe Annals of Applied Probability, 1991
- Optimal Control and Trunk Reservation in Loss NetworksProbability in the Engineering and Informational Sciences, 1990
- The Overload Performance of Engineered Networks With Nonhierarchical and Hierarchical RoutingAT&T Bell Laboratories Technical Journal, 1984
- Blocking in a Shared Resource EnvironmentIEEE Transactions on Communications, 1981
- Optimum Allocation of Servers to Two Types of Competing CustomersIEEE Transactions on Communications, 1981