Abstract
Discriminatory Processor Sharing models play important role in analysing bandwidth allocation schemes in packet based communication systems. Users in such systems usually have access rate limitations which also influence their bandwidth shares. This paper is concerned with DPS models which incorporate these access rate limitations in a bandwidth economical manner.
In this paper the interlock between access rate limited Discriminatory Processor Sharing (DPS) models and some constrained optimization problems is investigated. It is shown, that incorporating the access rate limit into the DPS model is equivalent to extending the underlying constrained optimization by constraints on the access rates. It also means that the available bandwidth share calculation methods for the access rate limited DPS are also non-conventional solution methods for the extended constrained optimization problem.
We also foreshadow that these results might be important steps towards obtaining efficient pricing and resource allocation mechanism when users are selfish and subject to gaming behavior when competing for communication resources.
The publication was supported by the TAMOP-4.2.2.C-11/1/KONV-2012-0001 project. The project has been supported by the European Union, co-financed by the European Social Fund.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avrachenkov, K., Ayesta, U., Brown, P., Nez-Queija, R.: Discriminatory processor sharing revisited. In: Proc. IEEE Infocom 2005, Miami, FL, pp. 784–795 (2005)
Ayesta, U., Mandjes, M.: Bandwidth-sharing networks under a diffusion scaling. Annals Operation Research 170(1), 41–58 (2009)
Cheung, S., van den Berg, H., Boucherie, R.: Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues. Performance Evaluation 62(1-4), 100–116 (2005)
Fan, Z.: Dimensioning Bandwidth for Elastic Traffic. In: Gregori, E., Conti, M., Campbell, A.T., Omidyar, G., Zukerman, M. (eds.) NETWORKING 2002. LNCS, vol. 2345, pp. 826–837. Springer, Heidelberg (2002)
Fayolle, G., Mitrani, I., Iasnogorodski, R.: Sharing a processor among many job classes. J. ACM 27(3), 519–532 (1980)
Frolkova, M., Reed, J., Zwart, B.: Fixed-point approximations of bandwidth sharing networks with rate constraints. Performance Evaluation Review 39(3), 47–49 (2011)
Johari, R.: The Price of Anarchy and the Design of Scalable Resource Allocation Mechanisms. In: Algorithmic Game Theory, pp. 543–568. Cambridge Univ. Press (2007)
Kelly, F.: Charging and rate control for elastic traffic. European Transactions on Telecommunications 8, 33–37 (1997)
van Kessel, G., Nunez-Queija, R., Borst, S.: Asymptotic regimes and approximations for discriminatory processor sharing. ACM SIGMETRICS Performance Evaluation Review 32(2), 44–46 (2004)
Kőrösi, A., Székely, B., Vámos, P., Bíró, J.: Characterization of peak-rate limited DPS with Pareto-efficient bandwidth sharing. Annales Mathematicae et Informaticae 39 (2012)
Kleinrock, L.: Time-shared systems: A theoretical treatment. J. of ACM 14(2), 242–261 (1967)
Lakshmikantha, A., Srikant, R., Beck, C.: Differential equation models of flow-size based priorities in internet routers. International Journal of Systems, Control and Communications 2(1), 170–196 (2010)
Lindberger, K.: Balancing quality of service, pricing and utilisation in multiservice networks with stream and elastic traffic. In: ITC-16: International Teletraffic Congress, pp. 1127–1136 (1999)
O’Donovan, T.M.: Direct solutions of M/G/1 processor-sharing models. Operations Research 22, 1232–1235 (1974)
Pályi, P.L., Kőrösi, A., Székely, B., Bíró, J., Rácz, S.: Characterization of peak-rate limited bandwidth efficient DPS. Acta Polytechnica Hungarica 9 (2012)
Rege, K., Sengupta, B.: Queue length distribution for the discriminatory processor-sharing queue. Operation Research 44, 653–657 (1996)
Riedl, A., Bauschert, T., Frings, J.: A framework for multi-service IP network planning. In: International Telecommunication Network Strategy and Planning Symposium (Networks), pp. 183–190 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biro, J., Bérczes, T., Kő̈rösi, A., Heszberger, Z., Sztrik, J. (2013). Discriminatory Processor Sharing from Optimization Point of View. In: Dudin, A., De Turck, K. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2013. Lecture Notes in Computer Science, vol 7984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39408-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-39408-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39407-2
Online ISBN: 978-3-642-39408-9
eBook Packages: Computer ScienceComputer Science (R0)