Virtual partitioning by dynamic priorities: Fair and efficient resource-sharing by several services
We propose a scheme for sharing an unbuffered resource, such as bandwidth or capacity, by various services. The scheme assigns a nominal capacity to each service class and implements a form of virtual partitioning by means of state-dependent priorities. That is, instead of each class of traffic having a fixed priority, as in traditional trunk reservation schemes, the priorities depend on the state of the system. An approximate method of analysis based on fixed point equations is given. Numerical results are obtained from the approximation, exact computations and simulations. The results show that the scheme is robust, fair and efficient.
KeywordsArrival Rate Optimal Policy Blocking Probability Spare Capacity Nominal Capacity
Unable to display preview. Download preview PDF.
- Ash, G.R., Chen, J.S., Frey, A.E., Huang, B.D.: Real-time network routing in an integrated network. Proceedings of the International Teletraffic Congress (ITC-13), Copenhagen (1991).Google Scholar
- Gopal, I.S., Stern, T.E.: Optimal call blocking policies in an integrated services environment. Proceedings of the Conference on Information Sciences and Systems, Johns Hopkins University (1983) 383–388.Google Scholar
- Kelly, F.P.: Loss networks. Ann. Appl. Prob. 1 (1991) 319–378.Google Scholar
- Kraimeche, B., Schwartz, M.: Traffic access control strategies in integrated digital networks. Proceedings of Infocom '84 (1984) 230–235.Google Scholar
- Mason, L., Dziong, Z., Tetreault, N.: Fair-efficient call admission control policies for broadband networks. Proceedings of Globecom '92 (1992).Google Scholar
- Ross, K.W.: Multirate Loss Models for Broadband Telecommunications Networks. Springer (1995).Google Scholar
- Ross, S.M.: Introduction to Stochastic Dynamic Programming. Academic Press (1983).Google Scholar
- Tijms, H.C.: Stochastic Modelling and Analysis: A Computational Approach. Wiley (1986).Google Scholar