Priority service and max-min fairness

IEEE/ACM Transactions on Networking

Volumn 11, Issue 5, 2003, Pages 733-746

  Marbach, Peter ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Game theory; Max min fairness; Pricing; Priority service; Quality of service; Rate control

Indexed keywords

BANDWIDTH; CHANNEL CAPACITY; FREQUENCY ALLOCATION; GAME THEORY; INTEGRAL EQUATIONS; INTERNET; MATHEMATICAL MODELS; PROBABILITY; QUALITY OF SERVICE; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

MAX-MIN FAIRNESS; PRIORITY SERVICE; RIEMANN-STIELTJES INTEGRAL;

PACKET NETWORKS;

EID: 0242365671     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2003.818196     Document Type: Article

References (29)

1. J. Heinanen, F. Baker, W. Weiss, and J. Wroclawski, "Assured Forwarding PHB Group," IETF, RFC 2597, 1999.
2. R. Gibbons, Game Theory for Applied Economists. Princeton, NJ: Princeton Univ. Press, 1992.
3. A. Ganesh, K. Laevans, and R. Steinberg, "Congestion pricing and user adaptation," in Proc. IEEE INFOCOM, 2001, pp. 959-965.
4. F. P. Kelly, A. Maulloo, and D. Tan, "Rate control for communication networks: Shadow prices, proportional fairness and stability," J. Oper. Res. Soc., vol. 49, 237-252, 1998.
5. H. Varian, Microeconom. Anal., New York: Norton, 1992.
6. A. Haurie and P. Marcotte, "On the relationship between Nash-Cournot and Wardrop equilibria," Networks, vol. 15, pp. 295-308, 1985.
7. J. Wardrop, "Some theoretical aspects of road traffic research," Proc. Inst. Civil Eng. II, vol. 1, pp. 325-378, 1952.
8. P. Marbach, "Pricing priority classes in differentiated services networks," in 37th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sept. 1999.
9. R. J. La and V. Anantharam, "Utility-based rate control in the internet for elastic traffic," IEEE/ACM Trans. Networking, vol. 10, pp. 272-286, Apr. 2002.
10. S. H. Low and D. E. Lapsley, "Optimization flow control, part I: Basic algorithm and convergence," IEEE/ACM Trans. Networking, vol. 7, pp. 861-875, Dec. 1999.
11. J. Mo and J. Walrand, "Fair end-to-end window-based congestion control," IEEE/ACM Trans. Networking, vol. 8, pp. 556-567, Oct. 2000.
12. H. Yaiche, R. Mazumdar, and C. Rosenberg, "A game-theoretic framework for rate allocation and charging of elastic connections in broadband networks," IEEE/ACM Trans. Networking, vol. 8, pp. 667-678, Oct. 2000.
13. A. Demers, S. Keshav, and S. Shenker, "Analysis and simulations of a fair queueing algorithm," in Proc. ACM SIGCOMM, 1989, pp. 1-12.
14. E. L. Hahne, "Round-robin scheduling for max-min fairness in data networks," IEEE J. Select. Areas Commun., vol. 9, pp. 1024-1039, July 1991.
15. M. Katevenis, "Fast switching and fair control of congested flow in broad-band networks," IEEE J. Select. Areas Commun., vol. 5, pp. 1315-1326, Aug. 1987.
16. A. Charny, "An algorithm for rate allocation in a packet-switching network with feedback," Master's thesis, Massachusetts Inst. Technol., Cambridge, 1994.
17. S. Chen and K. Park, "An architecture for noncooperative QoS provision in many-switch systems," in Proc. IEEE INFOCOM, 1999, pp. 864-872.
18. R. Cocchi, S. Shenker, D. Estrin, and L. Zhang, "Pricing in computer networks: Motivation, formulation, and example," IEEE/ACM Trans. Networking, vol. 1, pp. 614-627, Dec. 1993.
19. A. M. Odlyzko, "Paris metro pricing: The minimalist differentiated services solution," in Proc. 7th Int. Workshop Quality of Service, 1999, pp. 159-161.
20. ____, "Paris metro pricing for the Internet," in Proc. ACM Conf. Electronic Commerce, 1999, pp. 140-147.
21. K. Park, M. Sitharam, and S. Chen, "Quality of service provision in noncooperative networks: Heterogeneous preferences, multi-dimensional QoS vectors, and burstiness," in Proc. Int. Conf. Information and Computation Economies, 1998, p.
22. J. K. MacKie-Mason and H. R. Varian, "Pricing the internet," in Public Access to the Internet, B. Kahin and J. Keller, Eds. Englewood Cliffs, NJ: Prentice-Hall, 1994.
23. W. Rudin, Principles of Mathematical Analysis. New York: McGraw-Hill, 1976.
24. D. P. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1992.
25. "Traffic Management Specification, Version 4.0," ATM Forum Traffic Management Working Group, Tech. Rep. AF-TM-0056.000, Apr. 1996.
26. X. Huang and B. Bensaou, "On max-min fairness and scheduling in wireless ad-hoc networks: Analytical framework and implementation," in Proc. 2nd ACM Int. Symp. Mobile Ad-Hoc Networking and Computing, 2001, pp. 221-231.
27. L. Tassiulas and S. Sarkar, "Maxmin scheduling in wireless networks," in Proc. IEEE INFOCOM, 2002, pp. 763-772.
28. D. Rubenstein, J. Kurose, and D. Towsley, "The impact of multicast layering on network fairness," IEEE/ACM Trans. Networking, vol. 10, pp. 169-181, Apr. 2002.
29. D. Smart, Fixed Point Theorems. London, U.K.: Cambridge Press, 1974.