On measuring fairness in queues

Advances in Applied Probability

Volumn 36, Issue 3, 2004, Pages 919-936

  Avi Itzhak, Benjamin ^a   Levy, Hanoch ^b  

^a RUTGERS UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Customer scheduling; Fairness; Queue discipline; Queueing; Service order

Indexed keywords

CUSTOMER SATISFACTION; MATHEMATICAL MODELS; SCHEDULING; TELECOMMUNICATION SERVICES; THEOREM PROVING;

CUSTOMER SCHEDULING; FAIRNESS; QUEUE DISCIPLINE; QUEUEING; SERVICE ORDER;

QUEUEING THEORY;

EID: 7444254110     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1093962241     Document Type: Article

References (17)

1. Bennet, J. C. R. and Zhang, H. (1996). WF2Q: worst case fair weighted fair queueing. In Proc. IEEE INFOCOM 1996 (San Francisco, CA, March 1996), pp. 120-128.
2. Cox, D. R. and Smith, W. L. (1961). Queues. John Wiley, New York.
3. Demers, A., Keshav, S. and Shenker, S. (1990). Analysis and simulation of a fair queueing algorithm. Internetworking Res. Experience 1, 3-26.
4. Golestani, S. J. (1994). A self-clocked fair queueing scheme for broadband applications. In Proc. IEEE INFOCOM 1994 (Toronto, Ontario, June 1994), pp. 636-646.
5. Greenberg, A. G. and Madras, N. (1992). How fair is fair queueing? J. Assoc. Comput. Mach. 39, 568-598.
6. Kelly, F. P. (1979). Reversibility and Stochastic Networks. John Wiley, New York.
7. Kingman, J. F. C. (1962). The effect of queue discipline on waiting time variance. Proc. Camb. Phil. Soc. 58, 163-164.
8. Larson, R. C. (1987). Perspective on queues: social justice and the psychology of queueing. Operat. Res. 35, 895-905.
9. Mann, I. (1969). Queue culture: the waiting line as a social system. Amer. J. Sociol. 75, 340-354.
10. Palm, C. (1953). Methods of judging the annoyance caused by congestions. TELE 4, 189-208.
11. Parekh A. (1992). A generalized processor sharing approach to flow control in integrated services networks. Doctoral Thesis, MIT.
12. Parekh, A. and Gallager, R. G. (1993). A generalized processor sharing approach to flow control in integrated services networks: the single node case. IEEE/ACM Trans. Networking 1, 344-357.
13. Parekh, A. and Gallager, R. G. (1994). A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Trans. Networking 2, 137-150.
14. Rexford, J., Greenberg, A. and Bonomi, F. (1996). Hardware-efficient fair queueing architectures for high-speed networks. In Proc. IEEE INFOCOM 1996 (San Francisco, CA, March 1996) pp. 638-646.
15. Rothkopf, M. H. and Rech, P. (1987). Perspectives on queues: combining queues is not always beneficial. Operat. Res. 35, 906-909.
16. Wang, Y. T. and Morris, R. J. T. (1985). Load sharing in distributed systems. IEEE Trans. Comput. 34, 204-217.
17. Whitt, W. (1984). The amount of overtaking in a network of queues. Networks 14, 411-426.