On achieving fairness in the joint allocation of processing and bandwidth resources: Principles and algorithms

IEEE/ACM Transactions on Networking

Volumn 13, Issue 5, 2005, Pages 1054-1067

  Zhou, Yunkai ^a   Sethu, Harish ^b  

^a MICROSOFT   (United States)

^b Drexel University   (United States)

Author keywords

Fairness; Max min; Processor sharing; Resource allocation

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); GATEWAYS (COMPUTER NETWORKS); OPTICAL COMMUNICATION; OPTICAL LINKS; RESOURCE ALLOCATION; TELECOMMUNICATION TRAFFIC;

BANDWIDTH RESOURCES; JOINT ALLOCATION; OPTICAL NETWORKING; PROCESSOR SHARING;

FIBER OPTIC NETWORKS;

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

References (24)

1. D. Cohen and K. Narayanaswamy. A Fair Service Approach to Defending Against Packet Flooding Attacks. [Online]. Available: http://www.cs3-inc. com/ddos.html
2. J. Xu and W. Lee, "Sustaining availability of web services under distributed denial of service attacks," IEEE Trans. Comput., vol. 52, no. 2, pp. 195-208, Feb. 2003.
3. D. K. Y. Yau, J. C. S. Lui, and F. Liang, "Defending against distributed denial-of-service attacks with max-min fair server-centric router throttles," in Proc. Int. Workshop on Quality of Service (IWQoS), Stanford, CA, May 2002, pp. 35-44.
4. D. P. Bertsekas and R. Gallager, Data Networks, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 1991.
5. A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," in Proc. ACM SIGCOMM, Austin, TX, Sep. 1989, pp. 1-12.
6. A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated service networks - the single node case," in Proc. IEEE INFOCOM, Florence, Italy, May 1992, pp. 915-924.
7. S. Keshav, An Engineering Approach to Computer Networking: ATM Network, the Internet, and the Telephone Network. Reading, MA: Addison-Wesley, 1997.
8. F. Kelly, "Charging and rate control for elastic traffic," Eur. Trans. Telecommun., vol. 8, no. 1, pp. 33-37, Jan. 1997.
9. Z. Cao and E. W. Zegura, "Utility max-min: An application-oriented bandwidth allocation scheme," in Proc. IEEE INFOCOM, New York, Mar. 1999, pp. 793-801.
10. L. Kleinrock, Queueing Systems. New York: Wiley, 1976, vol. 2. Computer Applications.
11. S. J. Golestani, "A self-clocked fair queueing scheme for broadband applications," in Proc. IEEE INFOCOM, Toronto, ON, Canada, Jun. 1994, pp. 636-646.
12. M. Shreedhar and G. Varghese, "Efficient fair queuing using deficit round-robin," IEEE/ACM Trans. Netw., vol. 4, no. 3, pp. 375-385, Jun. 1996.
13. 2Q: Worst-case fair weighted fair queueing," in Proc. IEEE INFOCOM, San Francisco, CA, Mar. 1996, pp. 120-128.
14. S. S. Kanhere, H. Sethu, and A. B. Parekh, "Fair and efficient packet scheduling using elastic round robin," IEEE Trans. Parall. Distr. Syst., vol. 13, no. 3, pp. 324-336, Mar. 2002.
15. J. M. Blanquer and B. Özden, "Fair queuing for aggregated multiple links," in Proc. ACM SIGCOMM, San Diego, CA, Aug. 2001, pp. 189-197.
16. K. Mochalski, J. Micheel, and S. Donnelly, "Packet delay and loss at the Auckland internet access path," in Proc. Passive Active Measure. Workshop, Fort Collins, CO, Mar. 2002, pp. 46-55.
17. 2WFQ: An energy efficient fair scheduling policy for wireless systems," in Proc. Int. Symp. Low Power Electr. Design, Monterey, CA, Aug. 2002, pp. 30-35.
18. Y. Zhou and H. Sethu, "Toward end-to-end fairness: A framework for the allocation of multiple prioritized resources," in Proc. IEEE Int. Perf. Comput. Commun. Conf., Phoenix, AZ, Apr. 2003, pp. 495-504.
19. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. (1998, Dec.) An Architecture for Differentiated Services. [Online]. Available: http://www.ietf.org/rfc/rfc2475.txt
20. L. Lenzini, E. Mingozzi, and G. Stea, "Trade-offs between low complexity, low latency, and fairness with deficit round-robin schedulers," IEEE/ACM Trans. Netw., vol. 12, no. 4, pp. 681-693, Aug. 2004.
21. S. Lu, V. Bhargavan, and R. Srikant, "Fair scheduling in wireless packet networks," IEEE/ACM Trans. Netw., vol. 7, no. 4, pp. 473-489, Aug. 1999.
22. Auckland-VI Trace Data [Online]. Available: http://pma.nlanr.net/Traces/ long
23. S. Floyd and V. Jacobson, "Link-sharing and resource management models for packet networks," IEEE/ACM Trans. Netw., vol. 3, no. 4, pp. 365-386, Aug. 1995.
24. S. Lu, V. Bharghavan, and R. Srikant, "Fair scheduling in wireless packet networks," in Proc. ACM SIGCOMM, Cannes, France, Sep. 1997, pp. 63-74.