Skip to main content
Springer Nature Link
Log in

Transform-Domain Analysis of Packet Delay in Network Nodes with QoS-Aware Scheduling

  • Chapter
Network Performance Engineering

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 5233))

Abstract

In order to differentiate the perceived QoS between traffic classes in heterogeneous packet networks, equipment discriminates incoming packets based on their class, particularly in the way queued packets are scheduled for further transmission. We review a common stochastic modelling framework in which scheduling mechanisms can be evaluated, especially with regard to the resulting per-class delay distribution. For this, a discrete-time single-server queue is considered with two classes of packet arrivals, either delay-sensitive (1) or delay-tolerant (2). The steady-state analysis relies on the use of well-chosen supplementary variables and is mainly done in the transform domain. Secondly, we propose and analyse a new type of scheduling mechanism that allows precise control over the amount of delay differentiation between the classes. The idea is to introduce N reserved places in the queue, intended for future arrivals of class 1.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abate, J., Whitt, W.: Numerical Inversion of Probability Generating Functions. Operations Research Letters 12(4), 245–251 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Abate, J., Whitt, W.: Limits and Approximations for the M/G/1 LIFO Waiting-time Distribution. Operations Research Letters 20, 199–206 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bae, J.J., Suda, T.: Survey of Traffic Control Schemes and Protocols in ATM Networks. Proceedings of the IEEE 79(2), 170–189 (1991)

    Article  Google Scholar 

  4. Blake, S., et al.: An Architecture for Differentiated Services. Internet RFC 2475 (December 1998)

    Google Scholar 

  5. Bruneel, H., Kim, B.G.: Discrete-Time Models for Communication Systems Including ATM. Kluwer Academic Publishers, Boston (1993)

    Book  Google Scholar 

  6. Bruneel, H.: Performance of Discrete-Time Queueing Systems. Computers & Operations Research 20(3), 303–320 (1993)

    Article  MATH  Google Scholar 

  7. Bruneel, H., Steyaert, B., Desmet, E., Petit, G.: Analytic Derivation of Tail Probabilities for Queue Lengths and Waiting Times in ATM Multiserver Queues. European Journal of Operational Research 76, 563–572 (1994)

    Article  MATH  Google Scholar 

  8. Burakowski, W., Tarasiuk, H.: On New Strategy for Prioritising the Selected Flow in Queuing System. In: Proceedings of the COST 257 11th Management Committee Meeting, Barcelona, Spain, January 20-21 (2000); COST-257 TD(00)03

    Google Scholar 

  9. Choi, B.D., Choi, D.I., Lee, Y., Sung, D.K.: Priority Queueing System with Fixed-length Packet-train Arrivals. IEE Proceedings-Communications 145(5), 331–336 (1998)

    Article  Google Scholar 

  10. Chuang, L., Wanming, L., Baoping, Y., Chanson, S.: A Dynamic Partial Buffer Sharing Scheme for Packet Loss Control in Congested Networks. In: Proceedings of the International Conference on Communication Technology, ICCT 2000, Beijing, China, August 21-25, vol. 2, pp. 1286–1293 (2000)

    Google Scholar 

  11. Cidon, I., Georgiadis, L., Guerin, R., Khamisy, A.: Optimal Buffer Sharing. IEEE Journal on Selected Areas in Communications 13, 1229–1240 (1995)

    Article  Google Scholar 

  12. Cox, D.: The Analysis of non-Markovian Stochastic Processes by the Inclusion of Supplementary Variables. Proceedings of the Cambridge Philosophical Society 51, 433–441 (1955)

    Article  MathSciNet  MATH  Google Scholar 

  13. Demers, A., Keshav, S., Shenker, S.: Analysis and Simulation of a Fair Queueing Algorithm. In: Proceedings of the ACM Symposium on Communications Architectures & Protocols, SIGCOMM 1989, Austin, TX, USA, September 19-22, pp. 1–12 (1989)

    Google Scholar 

  14. De Vuyst, S., Wittevrongel, S., Bruneel, H.: Delay Differentiation by Reserving Space in Queue. Electronics Letters 41(9), 69–70 (2005)

    Article  Google Scholar 

  15. De Vuyst, S., Wittevrongel, S., Bruneel, H.: Place Reservation: Delay Analysis of a Novel Scheduling Mechanism. Computers and Operations Research, Special Issue on “Queues in Practice” 35(8), 2447–2462 (2008)

    Article  MATH  Google Scholar 

  16. De Vuyst, S., Wittevrongel, S., Bruneel, H.: Parametric Delay Differentiation Between Packet Flows Using Multiple Reserved Spaces. In: Proceedings of VALUETOOLS 2006, the First International Conference on Performance Evaluation Methodologies and Tools, Pisa, Italy, October 11-13 (2006)

    Google Scholar 

  17. De Vuyst, S., Wittevrongel, S., Fiems, D., Bruneel, H.: Controlling the Delay Trade-off Between Packet Flows Using Multiple Reserved Places. Performance Evaluation 65(6-7), 484–511 (2008)

    Article  Google Scholar 

  18. Dovrolis, C., Stiliadis, D., Ramanathan, P.: Proportional Differentiated Services: Delay Differentiation and Packet Scheduling. ACM Computer Communications Review 29(4), 109–120 (1999)

    Article  Google Scholar 

  19. Feyaerts, B., De Vuyst, S., Wittevrongel, S., Bruneel, H.: Analysis of a Discrete-time Priority Queue with Place Reservations and Geometric Service Times. In: Proceedings of DASD 2008, the 6th Symposium on Design, Analysis and Simulation of Distributed Systems, Edinburgh, UK, June 16-19, pp. 140–147 (2008)

    Google Scholar 

  20. Feyaerts, B., Wittevrongel, S.: Performance analysis of a priority queue with place reservation and general transmission times. In: Thomas, N., Juiz, C. (eds.) EPEW 2008. LNCS, vol. 5261, pp. 197–211. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  21. Fiems, D., Bruneel, H.: A Note on the Discretization of Little’s Result. Operations Research Letters 30(1), 17–18 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  22. Flatto, L.: The Waiting Time Distribution for the Random Order Service M/M/1 Queue. Annals of Applied Probability 7, 382–409 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  23. Floyd, S., Jacobson, V.: Random Early Detection Gateways for Congestion Avoidance. IEEE-ACM Transactions on Networking 1(4), 397–413 (1993)

    Article  Google Scholar 

  24. Gail, H.R., Hantler, S.L., Taylor, B.A.: On a Preemptive Markovian Queue with multiple servers and two priority classes. Mathematics of Operations Research 17(2), 365–391 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  25. Gevros, P., Crowcroft, J., Kirstein, P., Bhatti, S.: Congestion Control Mechanisms and the Best Effort Service Model. IEEE Network, 16–26 (May-June 2001)

    Google Scholar 

  26. Hurley, P., Le Boudec, J.-Y., Thiran, P., Kara, M.: ABE: Providing a Low-Delay Service within Best Effort. IEEE Network, 60–69 (May-June 2001)

    Google Scholar 

  27. Kausha, S., Sharma, R.K.: Modeling and Analysis of Adaptive Buffer Sharing Scheme for Consecutive Packet Loss Reduction in Broadband Networks. International Journal of Computer Systems Science and Engineering 4(1), 8–15 (2007)

    Google Scholar 

  28. Kosten, L.: Stochastic Theory of a Multi-entry Buffer (1). Delft Progress Report 1, 10–18 (1974)

    MathSciNet  MATH  Google Scholar 

  29. Kontovasilis, K., Wittevrongel, S., Bruneel, H., Van Houdt, B., Blondia, C.: Performance of Telecommunication Systems: Selected Topics. In: Proceedings of the 17th IFIP World Computer Congress, Montreal, August 25-30, pp. 61–93 (2002)

    Google Scholar 

  30. Laevens, K., Bruneel, H.: Delay Analysis for ATM Queues with Random Order of Service. Electronic Letters 31(5), 346–347 (1995)

    Article  Google Scholar 

  31. Leslie, P.H.: On the Use of Matrices in Certain Population Mathematics. Biometrika 33, 183–212 (1945)

    Article  MathSciNet  MATH  Google Scholar 

  32. Lim, Y., Kobza, J.E.: Analysis of a Delay-dependent Priority Discipline in an Integrated Multiclass Traffic Fast Packet Switch. IEEE Transactions on Communications 38(5), 659–685 (1990)

    Article  Google Scholar 

  33. Liu, K.Y., Petr, D.W., Frost, V.S., Zhu, H.B., Braun, C., Edwards, W.L.: Design and Analysis of a Bandwidth Management Framework for ATM-Based Broadband ISDN. IEEE Communications Magazine 35(5), 138–145 (1997)

    Article  Google Scholar 

  34. Little, J.D.C.: A Proof of the Queuing Formula L = λW. Operations Research 9(3), 383–387 (1961)

    Article  MathSciNet  Google Scholar 

  35. Maertens, T., Walraevens, J., Bruneel, H.: On Priority Queues with Priority Jumps. Performance Evaluation 63, 1235–1252 (2006)

    Article  MATH  Google Scholar 

  36. Maertens, T., Walraevens, J., Bruneel, H.: Performance Comparison of Several Priority Schemes with Priority Jumps. Annals of Operations Research 162, 109–125 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  37. Maertens, T., Walraevens, J., Bruneel, H.: Non-exponential Tail Probabilities in Queuing Systems. In: Proceedings of ITC-19, 19th International Teletraffic Congress, August 29-September 2, pp. 1155–1164 (2005)

    Google Scholar 

  38. Menth, M., Schmid, M., Heiss, H., Reim, T.: MEDF – A Simple Scheduling Algorithm for Two Real-time Transport Service Classes with Application in the UTRAN. In: Proceedings of INFOCOM 2003, San Francisco, USA, March 30-April 3 (2003)

    Google Scholar 

  39. Van Mieghem, P., Steyaert, B., Petit, G.H.: Performance of Cell Loss Priority Management Schemes in a Single Server Queue. International Journal of Communication Systems 10, 161–180 (1997)

    Article  Google Scholar 

  40. Mowbray, M., Karlsson, G., Köhler, T.: Capacity Reservation for Multimedia Traffic. Distrib. Syst. Engng. 5, 12–18 (1998)

    Article  Google Scholar 

  41. Parekh, A.K., Gallager, R.G.: A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case. IEEE/ACM Transactions on Networking 1(3), 344–357 (1993)

    Article  Google Scholar 

  42. Semeria, C.: Supporting Differentiated Service Classes: Queue Scheduling Disciplines, Juniper Networks, White Paper (2001)

    Google Scholar 

  43. Sivaraman, V., Chiussi, F.: Providing End-to-End Statistical Delay Guarantees with Earliest Deadline First Scheduling and Per-Hop Traffic Shaping. In: Proceedings of INFOCOM 2000, Tel Aviv, Israel, March 26-30 (2000)

    Google Scholar 

  44. Striegel, A., Manimaran, G.: Packet Scheduling with Delay and Loss Differentiation. Computer Communications 25, 21–31 (2000)

    Article  Google Scholar 

  45. Takine, T., Sengupta, B., Hasegawa, T.: An Analysis of a Discrete-Time Queue for Broadband ISDN with Priorities Among Traffic Classes. IEEE Transactions on Communications 42(2-4), 1837–1845 (1994)

    Article  Google Scholar 

  46. Tham, C.-K., Yao, Q., Jian, Y.: A Multi-class Probabilistic Priority Scheduling Discipline for Differentiated Services Networks. Computer Communications 25, 1487–1496 (2002)

    Article  Google Scholar 

  47. Walraevens, J., Steyaert, B., Bruneel, H.: Performance Analysis of a Single-Server ATM Queue with a Priority Scheduling. Computers & Operations Research 30(12), 1807–1829 (2003)

    Article  MATH  Google Scholar 

  48. Walraevens, J., Wittevrongel, S., Bruneel, H.: A Discrete-Time Priority Queue with Train Arrivals. Stochastic Models 23(3), 489–512 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  49. Wittevrongel, S., Bruneel, H.: Discrete-time ATM Queues with Independent and Correlated Arrival Streams. In: Performance Evaluation and Applications of ATM Networks, ch. 16, pp. 387–412. Kluwer Academic Publishers, Boston (2000)

    Google Scholar 

  50. Wittevrongel, S., Bruneel, H.: Per-source Mean Cell Delay and Mean Buffer Contents in ATM Queues. Electronics Letters 33(6), 461–462 (1997)

    Article  Google Scholar 

  51. Yashkov, S.F.: Processor Sharing Queues: Some Progress in Analysis. Queueing Systems 2, 1–17 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  52. Zhang, L.: Virtual Clocks: a New Traffic Control Algorithm for Packet Switching Networks. In: Proceedings of the ACM Symposium on Communications Architectures & Protocols, SIGCOMM 1990, Philadelpia, PA, USA, September 24-27, pp. 19–29 (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SMACS Research Group, Department of Telecommunications and Information Processing, Ghent University, Sint-Pietersnieuwstraat 41, 9000, Gent, Belgium

    Stijn De Vuyst, Sabine Wittevrongel & Herwig Bruneel

Authors
  1. Stijn De Vuyst
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sabine Wittevrongel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Herwig Bruneel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing, Informatics and Media, University of Bradford, Richmond Road, BD7 1DP, Bradford, UK

    Demetres D. Kouvatsos

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

De Vuyst, S., Wittevrongel, S., Bruneel, H. (2011). Transform-Domain Analysis of Packet Delay in Network Nodes with QoS-Aware Scheduling. In: Kouvatsos, D.D. (eds) Network Performance Engineering. Lecture Notes in Computer Science, vol 5233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02742-0_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02742-0_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02741-3

  • Online ISBN: 978-3-642-02742-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics