Abstract
The Differentiated Services (Diffserv) architecture is a scalable solution for providing Quality of Service (QoS) over packet switched networks. By its very definition, Diffserv is not intended to provide strict performance guarantees to its subscribers. We purpose in this paper a particular form of relative performance guarantees. Specifically, the network manager’s goal is to maintain pre-defined ratios between common congestion measures over the different service classes. We assume that each service class is advertised with a constant price. Thus, in order to induce its goal, the manager dynamically allocates available capacity between the service classes. This scheme is studied within a network flow model, with self-optimizing users, where each user can choose the amount of flow to ship on each service class according to its service utility and QoS requirements. We pose the entire problem as a non-cooperative game. Concentrating on a simplified single-link model with multiple service classes, we establish the existence and uniqueness of the Nash equilibrium where the relative performance goal is obtained. Accordingly, we show how to compute and sustain the required capacity assignment. The extension to a general network topology is briefly outlined.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Altman, E., Wynter, L.: Equilibrium, games, and pricing in transportation and telecommunications networks. Networks and Spacial Economics 4(1), 7–21 (2004)
Baker, F., Chan, K., Smith, A.: Management information base for the differentiated services architecture. RFC 3289 (2002)
Bertsekas, D.P., Gallager, R.G.: Data Networks. Prentice-Hall, Englewood Cliffs (1992)
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An architecture for differentiated services. RFC 2475 (1998)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2003)
Courcoubetis, C., Weber, R.: Pricing Communication Networks: Economics, Technology and Modelling. Wiley, Chichester (2003)
Davie, B., Charny, A., Bennett, J., Benson, K., Boudec, J.L., Courtney, W., Davari, S., Firoiu, V., Stiliadis, D.: An expedited forwarding PHB (per-hop behavior). RFC 3246 (2001)
Dovrolis, C., Stiliadis, D., Ramanathan, P.: Proportional differentiated services: Delay differentiation and packet scheduling. IEEE/ACM Transactions on Networking (2002)
Hayel, Y., Ros, D., Tuffin, B.: Less-than-best-effort services: Pricing and scheduling. In: Proceedings of IEEE INFOCOM (2004)
Heinanen, J., Baker, F., Weiss, W., Wroclawski, J.: Assured forwarding PHB group. RFC 2597 (1999)
Kelly, F.P., Maulloo, A., Tan, D.: Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society 49, 237–252 (1998)
Korilis, Y.A., Lazar, A.A., Orda, A.: Architecting noncooperative networks. IEEE Journal on Selected Areas in Communication 13(7), 1241–1251 (1995)
Mandjes, M.: Pricing strategies under heterogeneous service requirements. In: Proceedings of IEEE INFOCOM, pp. 1210–1220 (2003)
Menache, I., Shimkin, N.: Capacity assignment in Diffserv networks for proportional QoS. Technical Report CCIT-544, Technion (July 2005)
Menache, I., Shimkin, N.: Proportional QoS in differentiated services networks: Capacity management, equilibrium analysis and elastic demands (July 2005), Extended version , Available from: http://www.ee.technion.ac.il/people/shimkin/preprints/MS05x.pdf
Mendelson, H., Whang, S.: Optimal incentive-compatible priority pricing for the M/M/1 queue. Operations Research 38, 870–883 (1990)
Odlyzko, A.M.: Paris metro pricing for the internet. In: Proceedings of the ACM Conference on Electronic Commerce, pp. 140–147 (1999)
Orda, A., Rom, R., Shimkin, N.: Competitive routing in multi-user environments. IEEE/ACM Transactions on Networking 1, 510–521 (1993)
Parekh, A.K., Gallager, R.G.: A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Transactions on Networking 1(3), 344–357 (1993)
Richman, O., Shimkin, N.: Topological uniqueness of the Nash equilibrium for non-cooperative routing. Mathematics of Operations Research (October 2004) (submitted for publication)
Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)
Xiao, X., Ni, L.M.: Internet QoS: A big picture. IEEE Network 36(11), 8–18 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Menache, I., Shimkin, N. (2005). Proportional QoS in Differentiated Services Networks: Capacity Management, Equilibrium Analysis and Elastic Demands. In: Deng, X., Ye, Y. (eds) Internet and Network Economics. WINE 2005. Lecture Notes in Computer Science, vol 3828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11600930_73
Download citation
DOI: https://doi.org/10.1007/11600930_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30900-0
Online ISBN: 978-3-540-32293-1
eBook Packages: Computer ScienceComputer Science (R0)