An M/G/1 Queuing System with Multiple Vacations to Assess the Performance of a Simplified Deficit Round Robin Model

  • L. Lenzini
  • B. Meini
  • E. Mingozzi
  • G. Stea
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2794)

Abstract

Deficit Round-Robin (DRR) is a packet scheduling algorithm devised for providing fair queuing in the presence of variable length packets. Upper bounds on the buffer occupancy and scheduling delay of a leaky bucket regulated flow have been proved to hold under DRR. However, performance bounds are important for real-time traffic such as video or voice, whereas regarding data traffic average performance indices are meaningful in most of the cases. In this paper we propose and solve a specific worst-case model that enables us to calculate quantiles of the queue length distribution at any time (and hence average delays) as a function of the offered load, when the arrival process is Poissonian. The model proposed is a discrete time discrete state Markov chain of M/G/1-Type, and hence we used the matrix analytic methodology to solve it. The structure of the blocks belonging to the transition probability matrix is fully exploited. As a result of the above exploitation an effective algorithm for computing the matrix G is proposed. The algorithm consists in diagonalizing suitable matrix functions by means of Discrete Fourier Transform and in applying Newton’s method.

Keywords

Packet Arrival Packet Length Markovian Arrival Process Buffer Occupancy Queue Length Distribution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Davis, P.J.: Circulant matrices. John Wiley and Sons, New York (1979)MATHGoogle Scholar
  2. 2.
    Lenzini, L., Mingozzi, E., Stea, G.: Aliquem: a Novel DRR Implementation to Achieve Better Latency and Fairness at O(1) Complexity. In: Proc. of the 10th International Workshop on Quality of Service (IWQOS), Miami Beach, USA (May 2002)Google Scholar
  3. 3.
    Zhang, H.: Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks. Proceedings of the IEEE 83(10), 1374–1396 (1995)CrossRefGoogle Scholar
  4. 4.
    Stiliadis, D., Varma, A.: Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms. IEEE/ACM Trans. on Networking 6, 675–689 (1998)Google Scholar
  5. 5.
    Stiliadis, D., Varma, A.: Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms. T.R. CRL-95-38, Univ. of California at S. Cruz, USA (July 1995)Google Scholar
  6. 6.
    Shreedhar, M., Varghese, G.: Efficient Fair Queueing Using Deficit Round Robin. IEEE/ACM Trans. on Networking 4, 375–385 (1996)CrossRefGoogle Scholar
  7. 7.
    Braden, R., Clark, D., Shenker, S.: Integrated Services in the Internet Architecture: an Overview. RFC 1633, The Internet Society (June 1994)Google Scholar
  8. 8.
    Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An Architecture for Differentiated Services. RFC 2475, The Internet Society (December 1998)Google Scholar
  9. 9.
    Davie, B., et al.: An Expedited Forwarding PHB (Per-Hop Behavior). RFC 3246, The Internet Society (March 2002)Google Scholar
  10. 10.
    Charny, A., et al.: Supplemental Information for the New Definition of the EF PHB (Expedited Forwarding Per-Hop Behavior). RFC 3247, The Internet Society (March 2002)Google Scholar
  11. 11.
    Neuts, M.F.: Structured Stochastic Matrices of M/G/1 Type and their Applications. Marcel Dekker, Inc., New York (1989)MATHGoogle Scholar
  12. 12.
    Ramaswami, V.: A stable recursion for the steady state vector in Markov chains of M/G/l type. Stochastic Models 4, 183–188 (1988)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Wolf, R.W.: Stochastic Modeling and the Theory of Queues. Prentice-Hall International Editions, Englewood Cliffs (1989)Google Scholar
  14. 14.
    Schellhaas, H.: On Ramaswami’s algorithm for the computation of the steady state vector in Markov chains of M/G/1-type. Comm. Statist. Stochastic Models 6(3), 541–550 (1990)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Takagi, H.: Queuing Systems: Vacations and Priority Systems, Part 1, vol. 1. North Holland, Amsterdam (1991)Google Scholar
  16. 16.
    Agilent Technology Website, http://advanced.comms.agilent.com/
  17. 17.
    The ns-2 simulator, available at http://www.isi.edu/

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • L. Lenzini
    • 1
  • B. Meini
    • 2
  • E. Mingozzi
    • 1
  • G. Stea
    • 1
  1. 1.Department of Information EngineeringUniversity of PisaPisaItaly
  2. 2.Department of MathematicsUniversity of PisaPisaItaly

Personalised recommendations