ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지
DOI QR코드

DOI QR Code

An Approach to Scheduling Bursty Traffic

  • Farzanegan, Mahmoud Daneshvar (Department of Electrical & Computer Engineering, Isfahan University of Technology (IUT)) ;
  • Saidi, Hossein (Department of Electrical & Computer Engineering, Isfahan University of Technology (IUT)) ;
  • Mahdavi, Mehdi (Department of Electrical & Computer Engineering, Isfahan University of Technology (IUT))
  • Received : 2012.08.02
  • Accepted : 2013.08.16
  • Published : 2014.02.01
Download PDF
⟨ Previous Next ⟩

Abstract

The scheduling scheme in packet switching networks is one of the most critical features that can affect the performance of the network. Hence, many scheduling algorithms have been suggested and some indices, such as fairness and latency, have been proposed for the comparison of their performances. While the nature of Internet traffic is bursty, traditional scheduling algorithms try to smooth the traffic and serve the users based on this smoothed traffic. As a result, the fairness index mainly considers this smoothed traffic and the service rate as the main parameter to differentiate among different sessions or flows. This work uses burstiness as a differentiating factor to evaluate scheduling algorithms proposed in the literature. To achieve this goal, a new index that evaluates the performance of a scheduler with bursty traffic is introduced. Additionally, this paper introduces a new scheduler that not only uses arrival rates but also considers burstiness parameters in its scheduling algorithms.

Keywords

References

  1. R. Kalle, U.C. Devi, and S. Kalyanaraman, "Multi-tiered, Burstiness-Aware Bandwidth Estimation and Scheduling for VBR Video Flows," ACM/IEEE 19th Int. Workshop Qual. Serv., San Jose, CA, USA, June 6-7, 2011, pp. 1-9.
  2. J.F. Shortle and M.J. Fischer, "Approximation for a Two-Class Weighted Fair Queueing Discipline," Elsevier J. Perform. Eval., vol. 67, no. 10, Oct. 2010, pp. 946-958. https://doi.org/10.1016/j.peva.2010.05.004
  3. Z. Dwekat and G.N. Rouskas, "A Practical Fair Queuing Scheduler: Simplification through Quantization," Elsevier J. Comput. Netw., vol. 55, no. 10, July 14, 2011, pp. 2392-2406. https://doi.org/10.1016/j.comnet.2011.04.004
  4. I. Vaishnavi and D. Bulterman, "Estimate and Serve: Scheduling Soft Real-Time Packets for Delay Sensitive Media Applications on the Internet," Proc. 18th Int. Workshop Netw. Operating Syst. Support Dig. Aud. Vid., Williamsburg, VA, USA, June 3-5, 2009, pp. 109-114.
  5. F. Sbrina, "A Novel Resource Scheduling Algorithm for QoSAware Services on the Internet," Elsevier J. Comput Electr. Eng., vol. 36, no. 4, July 2010, pp. 718-734. https://doi.org/10.1016/j.compeleceng.2008.11.006
  6. D. Stiliadis and A. Varma, "Rate-Proportional Servers: A Design Methodology for Fair Queueing Algorithms," IEEE/ACM Trans. Netw., vol. 6, no. 2, Apr. 1998, pp. 175-185. https://doi.org/10.1109/90.664266
  7. H. Zhang and S. Keshav, "Comparison of Rate-Based Service Disciplines," Proc. Conf. Commun. Arch. Protocols, Zürich, Switzerland, Sept. 3-6, 1991, pp. 113-121.
  8. A. Demers, S. Keshav, and S. Shenker, "Analysis and Simulation of a Fair Queueing Algorithm," Proc. ACM Symp. Commun. Arch. Protocols, Austin, TX, USA, Sept. 19-22, 1989, pp. 1-12.
  9. D. Stiliadis and A. Varma, "Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms," IEEE/ACM Trans. Netw., vol. 6, no. 5, Oct. 1998, pp. 611-624. https://doi.org/10.1109/90.731196
  10. P. Goyal and H.M. Vin, "Generalized Guaranteed Rate Scheduling Algorithms: A Framework," IEEE/ACM Trans. Netw., vol. 5, no. 4, Aug. 1997, pp. 561-571. https://doi.org/10.1109/90.649514
  11. A.K. Parekh and R.G. Gallager, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case," IEEE/ACM Trans. Netw., vol. 1, no. 3, June 1993, pp. 344-357. https://doi.org/10.1109/90.234856
  12. L. Zhang, "Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks," Proc. ACM Symp. Commun. Arch. Protocols, Philadelphia, PA, USA, Sept. 24-27, 1990, pp. 10-29.
  13. S.J. Golestani, "A Self-Clocked Fair Queueing Scheme for Broadband Applications," 13th Annu. Joint Conf. IEEE Comput. Commun. Soc. Netw. Global Commun., Toronto, Ontario, Canada, June 12-16, 1994, pp. 636-646.
  14. J.C.R. Bennett and H. Zhang, "$WF^2$Q: Worst-Case Fair Weighted Fair Queueing," 15th Annu. Joint Conf. IEEE Comput. Soc. Netw. Next Gen., San Francisco, CA, USA, Mar. 24-28, 1996, pp. 120- 128.
  15. D. Stiliadis and A. Varma, "Efficient Fair Queueing Algorithms for Packet-Switched Networks," IEEE/ACM Trans. Netw., vol. 6, no. 2, Apr. 1998, pp. 175-185. https://doi.org/10.1109/90.664266
  16. C. Hu, H. Saidi, and P.S. Min, "DB_WFQ: An Efficient Fair Queueing Using Binary Counter," Int. Conf. Opt. Internet Photonics Switching, Rep. of Korea, July 21-25, 2002.
  17. S.S. Lam and G.G. Xie, "Burst Scheduling: Architecture and Algorithm for Switching Packet Video," 14th Annu. Joint Conf. IEEE Comput. Commun. Soc., Boston MA, USA, vol. 3, Apr. 2- 6, 1995, pp. 940-950.
  18. F. Callegati, A. Campi and W. Cerroni, "A Practical Approach to Scheduler Implementation for Optical Burst/Packet Switching," Conf. Opt. Netw. Des. Mod., Kyoto, Japan, Feb. 2010, pp. 1-6.
  19. Z. Rosberg, et al., "Flow Scheduling in Optical Flow Switched (OFS) Networks Under Transient Conditions," J. Lightw. Technol., vol. 29, no. 21, Nov. 1, 2011, pp. 3250 - 3264. https://doi.org/10.1109/JLT.2011.2167498
  20. S.J. Golestani, "Congestion-Free Communication in High-Speed Packet Network," IEEE Trans. Commun., vol. 39, no. 12, Dec. 1991, pp. 1802-1812. https://doi.org/10.1109/26.120166
  21. M. Hamdaoui and P. Ramanathan, "A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines," IEEE Trans. Comput., vol. 44, no. 12, Dec. 1995, pp. 1443-1451. https://doi.org/10.1109/12.477249
  22. Y.-J. Choi and H.-M. Kim, "A New Scheduling Scheme: for High-Speed Packet Networks Earliest-Virtual-Deadline-First," Elsevier J. Comput. Commun., vol. 30, no. 10, 2007, pp. 2291- 2300. https://doi.org/10.1016/j.comcom.2007.06.003
  23. H. Zhu and G. Cao, "On Improving Service Differentiation Under Bursty Data Traffic in Wireless Networks," 23rd Annu. Joint Conf. IEEE Comput. Commun. Soc., Hong Kong, China, Mar. 7- 11, 2004, pp. 871-881.
  24. D.S. Lee, C.M. Chen, and C.Y. Tang, "Weighted Fair Queueing and Compensation Techniques for Wireless Packet Switched Networks," IEEE Trans. Veh. Technol., vol. 56, no. 1, Jan. 2007, pp. 297-311. https://doi.org/10.1109/TVT.2006.883745
  25. T.G. Kwon, S.H. Lee and J.K. Rho, "Scheduling Algorithm for Real-Time Burst Traffic Using Dynamic Weighted Round Robin," Proc. IEEE Int. Symp. Circuits Syst., Monterey, CA, USA, May 31 - June 3, 1998, pp. 506-509.
  26. M.M.N. Aldeer, "Performance Comparison of Packet-Level Multiplexing Algorithms with Bursty Traffic," J. Eng. Sci. Technol. Rev., vol. 3, no. 1, 2010, pp. 46-52.
  27. M. Hanada and H. Nakazato, "ORC-GPS: Output Rate- Controlled Scheduling Policy for Delay Guarantees," IEEE Int. Conf. Commun., Glasgow, Scotland, June 24-28, 2007, pp. 530- 535.
  28. X. Jin and G. Min, "Analytical Queue Length Distributions of GPS Systems with Long Range Dependent Service Capacity," Elsevier J. Simul. Modeling Practice Theory, vol. 17, no. 9, Oct. 2009, pp. 1500-1510. https://doi.org/10.1016/j.simpat.2009.06.006
  29. P. Giacomazzi and G. Saddemi, "End-to-End Delay Approximation in Cascades of Generalized Processor Sharing Schedulers," IEEE Int. Conf. Commun., Dersden, Germany, June 14-18, 2009, pp. 1-6.
  30. M. Lelarge, "Asymptotic Behavior of Generalized Processor Sharing Queues under Subexponential Assumptions," J. Queueing Syst., vol. 62, no. 1-2, June 2009, pp. 51-73. https://doi.org/10.1007/s11134-009-9114-0
  31. J. Turner, "New Directions in Communications (or Which Way to the Information Age?)" IEEE Commun. Mag., vol. 24, no. 10, Oct. 1986, pp. 8-15.
  32. T. Konstantopoulos and V. Anantharam, "Optimal Flow Control Schemes that Regulates the Burstiness of Traffic," IEEE/ACM Trans. Netw., vol. 3, no. 4, Aug. 1995, pp. 423-432. https://doi.org/10.1109/90.413216
  33. A. Tat-Ming and H. Mehrpour, "Delay Performance of a Leaky Bucket Regulated Multiplexer Based on Burstiness Characterization," IEEE Global Telecommun. Conf., Singapore, Nov. 14-16, 1995, pp. 843-847.
  34. Y. Kodama et al., "Realtime Burstiness Measurement," Int. Workshop Protocols Fast Long-Dist. Netw., Nara, Japan, Feb. 2- 3, 2006.
  35. R.L. Cruz, "A Calculus for Network Delay, Part I: Network Elements in Isolation," IEEE Trans. Inf. Theory, vol. 37, no. 1, Jan. 1991, pp. 114-131. https://doi.org/10.1109/18.61109
  36. M. Daneshvar, H. Saidi and M. Mahdavi, "A Scheduling Algorithm for Bursty Traffic: Controlling of Service Rate and Burst," Arabian J. Sci. Eng., 2014.
  37. M. Daneshvar, H. Saidi and M. Mahdavi, "A Scheduling Algorithm for Controlling of Service Rate and Burst," Adv. Comput. Commun. Conf., Bangalore, India, Dec. 14-16, 2012.