Virtual Partitioning by Dynamic Priorities: Fair and Efficient Resource-Sharing by Several Services
作者： Debasis Mitra , Ilze Ziedins
DOI: 10.1007/BFB0022226
关键词:
摘要: We propose a scheme for sharing an unbuffered resource, such as bandwidth or capacity, by various services. The assigns nominal capacity to each service class and implements form of virtual partitioning means state-dependent priorities. That is, instead traffic having fixed priority, in traditional trunk reservation schemes, the priorities depend on state system. An approximate method analysis based point equations is given. Numerical results are obtained from approximation, exact computations simulations. show that robust, fair efficient.
springer.com
springerlink.com参考文章(6)
Mischa Schwartz, Belka Kraimeche, Circuit Access Control Strategies in Integrated Digital Networks. international conference on computer communications. pp. 230- 235 ,(1984)
Sheldon Ross, Discounted Dynamic Programming Introduction to Stochastic Dynamic Programming. pp. 29- 48 ,(1983) , 10.1016/B978-0-12-598420-1.50006-4
A. W. Kemp, H. C. Tijms, Stochastic modelling and analysis: a computational approach The Statistician. ,vol. 36, pp. 417- ,(1986) , 10.2307/2348845
Sheldon M. Ross, Introduction to Stochastic Dynamic Programming ,(2014)
G. Foschini, B. Gopinath, J. Hayes, Optimum Allocation of Servers to Two Types of Competing Customers IEEE Transactions on Communications. ,vol. 29, pp. 1051- 1055 ,(1981) , 10.1109/TCOM.1981.1095090
L.G. Mason, Z. Dziong, N. Tetreault, Fair-efficient call admission control policies for broadband networks Proceedings of ICC '93 - IEEE International Conference on Communications. ,vol. 2, pp. 976- 982 ,(1993) , 10.1109/ICC.1993.397416