A discrimination frequency based queueing fairness measure with regard to job seniority and service requirement

NGI 2005 - Next Generation Internet Networks: Traffic Engineering

Volumn 2005, Issue , 2005, Pages 106-113

  Sandmann, Werner ^a  

^a UNIVERSITY OF BAMBERG   (Germany)

Author keywords

Fairness; QoS from the user perspective; Queueing; Scheduling

Indexed keywords

CUSTOMER SATISFACTION; OPERATIONS RESEARCH; QUALITY OF SERVICE; SCHEDULING;

CUSTOMERS; FAIRNESS; QOS FROM THE USER PERSPECTIVE; QUEUEING;

QUEUEING NETWORKS;

EID: 33744486357     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NGI.2005.1431654     Document Type: Conference Paper

References (25)

1. A.O. Allen, Probability, Statistics, and Queueing Theory with Computer Science Applications, Academic Press, 2nd ed., 1990.
2. B. Avi-Itzhak, and H. Levy, Measuring fairness in queues, Advances in Applied Probability, vol. 36, no. 3, pp. 919-936, 2004.
3. B. Avi-Itzhak, H. Levy, and D. Raz, Quantifying Fairness in Queueing Systems: Principles and Applications, Rutcor Research Report, RRR 26-2004, July 2004.
4. N. Bansal, and M. Harchol-Balter, Analysis of SRPT scheduling: investigating unfairness, Proceedings of the 2001 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, 2001.
5. J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Scheduling Computer and Manufacturing Processes, Springer, Berlin Heidelberg, 2nd ed., 2001.
6. G. Bolch, S. Greiner, H. de Meer, K.S. Trivedi, Queueing Networks and Markov Chains, Wiley, 1998.
7. E.G. Coffman, and P.J. Denning, Operating Systems Theory, Prentice Hall, Englewood Cliffs, 1973.
8. R.W. Conway, W.L. Maxwell, and L.W. Miller, Theory of Scheduling, Addison-Wesley, Reading, Massachusetts, 1967.
9. R.B. Cooper, Introduction to Queueing Theory, Elsevier, North-Holland, 2nd ed., 1981.
10. N. Gans, G. Koole, and A. Mandelbaum, Telephone call centers: tutorial, review, and research prospects, Manufacturing and Service Operations Management, vol. 5, pp. 79-141, 2003.
11. E. Gelenbe, G. Puyol, and J.C.C. Nelson, Introduction to Queueing Networks, Wiley, New York, 1987.
12. M. Harchol-Balter, K. Sigman, and A. Wierman, Asymptotic convergence of scheduling policies with respect to slowdown, Performance 2002 IFIP WG 7.3. International Symposium on Computer Modelling, Measurement and Evaluation, to appear, Preprint submitted to Elsevier Science, 7 July 2002.
13. B.R. Haverkort, Performance Evaluation of Computer Communication Systems - A Model-Based Approach, Wiley, 1998.
14. L. Kleinrock, Queueing Systems Vol. I: Theory, Wiley, New York, 1975.
15. L. Kleinrock, Queueing Systems Vol. II: Computer Applications, Wiley, New York, 1976.
16. H. Levy, B. Avi-Itzhak, and D. Raz, Principles of fairness quantification in queueing systems: a tutorial, 2nd International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks, HET-NETs '04, Ilkley, UK, 26-28 July 2004.
17. M. Mittler, and N. Gerlich, Reducing the Variance of Sojourn Times in Queueing Networks with Overtaking, University of Würzburg, Institute of Computer Science, Research Report Series, Report No. 73, 1993.
18. M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice Hall, Upple Saddle River, 2nd ed., 2002.
19. D. Raz, B. Avi-Itzhak, and H. Levy, Classes, Priorities and Fairness in Queueing Systems, Rutcor Research Report, RRR 21-2004, July 2004.
20. D. Raz, H. Levy, and B. Avi-Itzhak, A resource-allocation queueing fairness measure, Proceedings of the ACM SIGMETRICS/Performance Conference, New York, June 12-16, 2004.
21. D. Raz, H. Levy, and B. Avi-Itzhak, RAQFM: A Resource Allocation Queueing Fairness Measure, Rutcor Research Report, RRR 32-2004, September 2004.
22. J. Walrand, An Introduction to Queueing Networks, Prentice Hall, Englewood Cliffs, 1988.
23. W. Whitt, The amount of overtaking in a network of queues, Networks, 14(3), pp. 411-426, 1984.
24. W. Whitt, Stochastic models for the design and management of customer contact centers: some research directions, Working Paper, www.columbia.edu/ ~ww2040/CallCenterF04/, March 2002.
25. A. Wierman, and M. Harchol-Balter, Classifying scheduling policies with respect to unfairness in an M/GI/1, Proceedings of the 2003 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, San Diego, CA, USA, pp. 238-249, 2003.