Skip to main content
SpringerLink
Log in

A Scheduling Algorithm for Bursty Traffic: Controlling of Service Rate and Burst

  • Research Article - Electrical Engineering
  • Published:
Arabian Journal for Science and Engineering Aims and scope Submit manuscript

Abstract

Quality of service (QoS) provisioning in communication networks highly depends on packet scheduling algorithms. In a well-known group of scheduling algorithms, i.e., Rate proportional servers (RPS), service rate of each session is used to isolate service disciplines. Some type of services, e.g., video streaming and interactive gaming not only have a bursty traffic but also need a minimum delay bound to obtain an acceptable QoS. However, unfortunately such applications may impose an unacceptable delay when the RPS scheduling algorithms are applied. In this paper, we propose a scheduling algorithm, which attempts to involve burstiness in addition to service rate, for isolating service disciplines in the scheduler. The proposed algorithm belongs to fluid flow paradigm and assigns a time variable weight that indicates the instantaneous service rate, to each session. The arrival constraint is assumed to be leaky bucket and our algorithm tries to provide a service discipline similar to the arrival constraint. Evaluation of the algorithm is carried out by calculating packet delay through a simulation where various kinds of traffic are scheduled by the proposed algorithm. The simulation results are compared with a well-known RPS scheduling algorithm and show that average, maximum and variance values of delay are more controllable in our algorithm by adjusting the parameters of each session.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Sabri, A.; El-Badawy, H.; Shehata, K.; Ali, A.: Video scheduling in the uplink over WiMAX networks by the novel concept ‘Adaptive Minimum Service Interval’. In: Proceedings of International Conference on Computer Engineering and Applications, ICCEA, vol. 2, pp. 3–7 (2010)

  2. Kalle, R.; Devi, U.C.; Kalyanaraman, S.: Multi-tiered, burstiness-aware bandwidth estimation and scheduling for VBR video flows. In: Proceedings of IEEE International Workshop on Quality of Service (IWQoS), pp. 1–9, (2011)

  3. John Shortle F., Martin Fischer J.: Approximation for a two-class weighted fair queueing discipline. Perform. Eval. Elsevier J. 67, 946–958 (2010)

    Article  Google Scholar 

  4. Dwekat Z., Rouskas G.N.: A practical fair queuing scheduler: Simplification through quantization. Comput. Netw. Elsevier J. 55, 2392–2406 (2011)

    Article  Google Scholar 

  5. Vaishnavi, I.; Bulterman, D.: Estimate and serve: scheduling soft real-time packets for delay sensitive media applications on the internet. In: Proceedings of NOSSDAV, pp. 109–114 (2009)

  6. Sbrina F.: A novel resource scheduling algorithm for QoS-aware services on the Internet. J. Comput. Electr. Eng. 36(4), 718–734 (2010)

    Article  Google Scholar 

  7. Zhang, H.; Keshav, S.: Comparison of rate-based service disciplines. In: Proceedings of the Conference on Communications Architecture & Protocols ACM, pp. 113–121 (1991)

  8. Parekh A., Gallager R.: A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Netw. (TON) 1(3), 344–357 (1993)

    Article  Google Scholar 

  9. Golestani, S.: A self-clocked fair queueing scheme for broadband applications. In: Proceedings of IEEE INFOCOM, vol. 94, pp. 636–646 (1994)

  10. Aldeer M.M.N.: Performance comparison of packet-level multiplexing algorithms with bursty traffic. J. Eng. Sci. Technol. 3(1), 46–52 (2010)

    Google Scholar 

  11. Turner J.S.: New directions in communications (or which way to the information age?). IEEE Commun. Mag. 24(10), 50–57 (1986)

    Article  Google Scholar 

  12. Raymond Yeung, W.: Fundamental tradeoff between burstiness and delay in traffic shaping. In: Proceedings of International Symposium on Information Theory, ISIT, pp. 2129–2132 (2005)

  13. Xiaolong, J.; Geyong, M.: Analytical queue length distributions of GPS systems with long range dependent service capacity. Simul. Model. Pract. Theory Elsevier J. 17, 1500–1510 (2009)

    Google Scholar 

  14. Giacomazzi, P.; Saddemi, G.: End to end delay approximation in cascades of Generalized Processor Sharing Schedulers. In: Proceeding of IEEE ICC, pp. 1–6 (2009)

  15. Lelarge M.: Asymptotic behavior of generalized processor sharing queues under subexponential assumptions. J. Queueing Syst. 62(1–2), 51–73 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  16. Samar, S.: Round-robin with credits: an improved scheduling strategy for rate-allocation in high-speed packet-switching. In: Proceedings of IEEE GLOBECOM, vol. 1, pp. 334–338 (1994)

  17. Zhu, H.; Cao, G.: On improving service differentiation under bursty data traffic in wireless networks. In: Proceedings of INFOCOM, pp. 871–881 (2004)

  18. Lee, D. Sh.; Chen, Ch. M.; Tang, Ch.Y.: Weighted fair queueing and compensation techniques for wireless packet switched networks. IEEE Trans. Veh. Technol. 56(1), 887–891 (2007)

  19. Sariowan, H.; Cruz, R.L.; Polyzos, G.C.: Scheduling for quality of service guarantees via service curves. In: Proceedings of ICCCN, pp. 512–520 (1995)

  20. Golestani S.J.: Congestion-free communication in high-speed packet network. IEEE Trans. Commun. 39(12), 1802–1812 (1991)

    Article  Google Scholar 

  21. Hamadoui M., Ramanathan P.: A dynamic priority assignment technique for streams with (m, k)-firm deadlines. IEEE Trans. Comput. Commun. 44(12), 1443–1451 (1995)

    Article  Google Scholar 

  22. Young-Jin C., Hyung-Myung K.: A new scheduling scheme: for high-speed packet networks Earliest-virtual-deadline-first. Comput. Commun. Elsevier J. 30, 2291–2300 (2007)

    Article  Google Scholar 

  23. Hanada, M.; Nakazato, H.: ORC-GPS: Output rate-controlled scheduling policy for delay guarantees. In: Proceedings of ICC, pp. 530–535 (2007)

  24. Kwon, T.G.; Lee, S.H.; Rho, J.K.: Scheduling algorithm for real-time burst traffic using dynamic weighted round robin. Proc. IEEE Int. Symp. Circuits Syst. (6), 506–509 (1998)

  25. Quynh, T.; Karl, H.; Wolisz, A.; Rebensburg, K.: Relative jitter packet scheduling for differentiated services. In: Proceedings of IFIP Conference Performance Modeling and Evaluation of ATM and IP networks (2001)

  26. Yaghmaei, M.; Bahekmat, M.; Khojasteh, T.: A novel fuzzy logic base scheduling mechanism for service differentiation in IP networks. J. Iran. Assoc. Electr. Electron. Eng. (2008)

  27. Victor S.: Frost and Benjamin Melamed. Traffic modeling for telecommunications networks. IEEE Commun. Mag. 32(3), 70–81 (1994)

    Google Scholar 

  28. Jagerman, D.; Melamed, B.: Burstiness descriptors of traffic streams: indices of dispersion and peakedness. In: Proceedings of Annual Conference on Information Sciences and Systems, pp. 24–28 (1994)

  29. Au T.M., Mehrpour H.: Tat-Ming. Delay performance of a leaky bucket regulated multiplexer based on burstiness characterization. Proc. IEEE Global Telecommun. Conf. 2(13–17), 843–847 (1995)

    Google Scholar 

  30. Wang, L.; Min, G.; Awan, I.: Stochastic modeling and analysis of GRED-I congestion control for differentiated bursty traffic. In: Proceedings of International Conference on Advanced Information Networking and Applications, pp. 1022–1030 (2007)

  31. Leland W., Taqqu M., Willinger W., Wilson D.: On the self-similar nature of Ethernet traffic (extended version). IEEE/ACM Trans. Netw. (ToN) 2(1), 1–15 (1994)

    Article  Google Scholar 

  32. Siriwong, K.; Lipsky, L.; Ammar, R.: Study of bursty internet traffic. In: Proceedings of IEEE International Symposium on Network Computing and Applications, pp. 53–60 (2007)

  33. Neidhardt A.; Wang, J.: The concept of relevant time scales and its application to queuing analysis of self-similar traffic (or is Hurst naughty or nice?). In: Proceedings of ACM Joint International Conference on Measurement and Modeling of Computer Systems, pp. 222–232 (1998)

  34. Cruz R.: A calculus for network delay, part I: Network elements in isolation. IEEE Trans. Inf. Theory 37(1), 114–131 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  35. Kodama, Y.; Kudoh, T.; Matsuda, M.; Okazaki, F.: Real-time burstiness measurement, In: Proceedings of International Workshop on Protocols for Fast Long-Distance Networks (PFLDnet) (2006)

  36. Farrera M.P., Fleury M., Guild K., Ghanbari M.: Measurement and analysis study of congestion detection for internet video streaming. J. Commun. 5(2), 169–177 (2010)

    Article  Google Scholar 

  37. Mahmoud A.S.H., AlQahtani S.A.: A framework of call admission control procedures for integrated services mobile wireless networks. Arab. J. Sci. Eng. 32(1B), 115–130 (2007)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Isfahan University of Technology, Isfahan, Iran

    Mahmoud Daneshvar Farzanegan, Hossein Saidi & Mehdi Mahdavi

Authors
  1. Mahmoud Daneshvar Farzanegan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hossein Saidi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mehdi Mahdavi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mahmoud Daneshvar Farzanegan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Daneshvar Farzanegan, M., Saidi, H. & Mahdavi, M. A Scheduling Algorithm for Bursty Traffic: Controlling of Service Rate and Burst. Arab J Sci Eng 39, 4753–4764 (2014). https://doi.org/10.1007/s13369-014-1086-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13369-014-1086-7

Keywords

Search

Navigation