Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Hierarchical smoothed round robin scheduling in high-speed networks

Hierarchical smoothed round robin scheduling in high-speed networks

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

The hierarchical smoothed round robin (HSRR) packet scheduler that improves the performance of the smoothed round robin (SRR) for real-world packet scheduling scenarios is presented. The SRR suffers from an inability to fairly distribute service in highly skewed weight distributions where such distributions often occur in practice. As a result, the transmission behaviour of the SRR can be bursty and non-smooth for the high weighted (or high priority) flows. A novel aggregation strategy is proposed to reshape the sessions' weight distribution that aims to minimise the variance of the high-priority flows' intra-session service times. The aggregation scheme also provides a new capability that supports the provisioning of high-priority service to an arbitrary set of selected flows. The reshaped weight distribution results in guaranteed lower bound in maximum packet delay for the high-priority flows. Furthermore, empirical analyses show that the cumulative average packet delay and jitter of the high-priority flows are significantly reduced from the original SRR and also overall lower for all flows. Along with the enhanced performance in packet delays, the HSRR scheduler attains a worst-case time complexity of O(1).

Inspec keywords: scheduling; packet radio networks

Other keywords: packet scheduler; high-speed networks; hierarchical smoothed round robin scheduling

Subjects: Radio links and equipment

References

    1. 1)
      • Guo, C.: `G-3: an O(1) time complexity packet scheduler that provides bounded end-to-end delay', 26thAnnual IEEE Conf. Computer Communications, 2007, Anchorage, AK, USA, p. 1109–1117.
    2. 2)
      • Yuan, X., Duan, Z.: `FRR: a proportional and worst-case fair round robin scheduler', 24thAnnual IEEE Conf. Computer Communications, 2005, Miami, FL, USA, 2, p. 831–842.
    3. 3)
      • A. Demers , S. Keshav , S. Shenker . Analysis and simulation of a fair queueing algorithm. ACM SIGCOMM Comput. Commun. Rev. , 4 , 1 - 12
    4. 4)
      • Golestani, S.J.: `A self-clocked fair queueing scheme for broadband applications', 13thAnnual IEEE Conf. Computer Communications: Networking for Global Communications, 1994, Toronto, ON, Canada, 2, p. 636–646.
    5. 5)
      • Wangdong, Q., Min, D., Qingguo, S., Hua, C.: `How smooth is smoothed round robin?', Int. Conf. Communication Technology, 2003, Beijing, China, 1, p. 421–428.
    6. 6)
      • Ramabhadran, S., Pasquale, J.: `Stratified round robin: a low complexity packet scheduler with bandwidth fairness and bounded delay', ACM Conf. Applications, Technologies, Aarchitectures, and Protocols for Computer Communications, 2003, Karlsruhe, Germany, p. 239–250.
    7. 7)
      • P. Goyal , H.M. Vin , H. Cheng . Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks. ACM SIGCOMM Comput. Commun. Rev. , 4 , 157 - 168
    8. 8)
      • L. Zhang . Virtual clock: a new traffic control algorithm for packet switching networks. ACM SIGCOMM Comput. Commun. Rev. , 4 , 19 - 29
    9. 9)
      • A.K. Parekh , R.G. Gallager . A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Netw. , 3 , 344 - 357
    10. 10)
      • C. Guo . SRR: an O(1) time complexity packet scheduler for flows in multi-service packet networks. IEEE/ACM Trans. Netw. , 6 , 1144 - 1155
    11. 11)
    12. 12)
      • Bennett, J.C.R., Zhang, H.: `WF', 15thAnnual IEEE Conf. Computer Communications: Networking the Next Generation, 1996, San Francisco, CA, USA, 1, p. 120–128.
    13. 13)
      • H.M. Chaskar , U. Madhow . Fair scheduling with tunable latency: a round robin approach. IEEE/ACM Trans. Netw. , 4 , 592 - 601
    14. 14)
    15. 15)
      • R. Garg , X. Chen . RRR: recursive round robin scheduler. Comput. Netw.: Int. J. Comput. Telecommun. Netw. , 18 , 1951 - 1966
    16. 16)
      • D. Saha , S. Mukherjee , S.K. Tripathi . Carry-over round robin: a simple cell scheduling mechanism for ATM networks. IEEE/ACM Trans, Netw. , 6 , 779 - 796
    17. 17)
      • M. Shreedhar , G. Varghese . Efficient fair queueing using deficit round-robin. IEEE/ACM Trans. Netw. , 3 , 375 - 385
    18. 18)
      • Caprita, B., Chan, W.C., Nieh, J.: `Group round robin: improving the fairness and complexity of packet scheduling', Symp. Architectures for Networking and Communications Systems, 2005, Princeton, NJ, USA, p. 29–40.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2008.0672
Loading

Related content

content/journals/10.1049/iet-com.2008.0672
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address