A resource-allocation queueing fairness measure

Performance Evaluation Review

Volumn 32, Issue 1, 2004, Pages 130-141

  Raz, David ^a   Levy, Hanoch ^a   Avi Itzhak, Benjamin ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Fairness; FCFS; Job scheduling; M M 1; Processor sharing; PS; Queue disciplines; Resource allocation; Unfairness

Indexed keywords

MATHEMATICAL MODELS; QUEUEING NETWORKS; RANDOM PROCESSES; SCHEDULING; SERVERS; TELECOMMUNICATION SYSTEMS; WORLD WIDE WEB;

FAIRNESS; JOB SCHEDULING; M/M/1; PROCESSOR SHARING (PS); QUEUE DISCIPLINES; UNFAIRNESS;

RESOURCE ALLOCATION;

EID: 8344241322     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1012888.1005704     Document Type: Conference Paper

References (18)

1. B. Avi-Itzhak and H. Levy. On measuring fairness in queues. Advances of Applied Probability, to appear, 2004.
2. E. G. Coffman, Jr., R. R. Muntz, and H. Trotter. Waiting time distribution for processor-sharing systems. J. ACM, 17:123-130, 1970.
3. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. Internetworking Research and Experience, 1:3-26, 1990.
4. A. G. Greenberg and N. Madras. How fair is fair queueing? Journal of the ACM, 3(39):568-598, 1992.
5. M. Harchol-Balter, B. Schroeder, N. Bansal, and M. Agrawal. Size-based scheduling to improve web performance. ACM Transactions on Computer Systems, 21(2):207-233, May 2003.
6. L. Kleinrock. Analysis of a time-shared processor. Nav. Res. Log. Quarterly, 11:59-73, 1964.
7. L. Kleinrock. Time-shared systems: A theoretical treatment. J. ACM, 14:242-261, 1967.
8. R. C. Larson. Perspective on queues: Social justice and the psychology of queueing. Operations Research, 35:895-905, Nov-Dec 1987.
9. I. Mann. Queue culture: The waiting line as a social system. Am. J. Social., 75:340-354, 1969.
10. C. Palm. Methods of judging the annoyance caused by congestion. Tele. (English Ed.), 2:1-20, 1953.
11. A. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The single node case. IEEE/ACM Trans. Networking, 1:344-357, June 1993.
12. A. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The multiple node case. IEEE/ACM Trans. Networking, 2:137-150, 1994.
13. A. Rafaeli, G. Barron, and K. Haber. The effects of queue structure on attitudes. Journal of Service Research, 5(2): 125-139, 2002.
14. A. Rafaeli, E. Kedmi, D. Vashdi, and G. Barron. Queues and fairness: A multiple study investigation. Faculty of Industrial Engineering and Management, Technion. Haifa, Israel. Under review, 2003.
15. D. Raz, B. Avi-Itzhak, and H. Levy. Classes, priorities and fairness in queueing systems. Forthcoming, 2004.
16. Y. T. Wang and R. J. T. Morris. Load sharing in distributed systems. IEEE Trans. on computers, C-34(3):204-217, 1985.
17. W. Whitt. The amount of overtaking in a network of queues. Networks, 14(3):411-426, 1984.
18. A. Wierman and M. Harchol-Balter. Classifying scheduling policies with respect to unfairness in an M/GI/1. In Proceedings of ACM Sigmetrics 2003 Conference on Measurement and Modeling of Computer Systems, San Diego, CA, June 2003.