International Journal of Computer Network and Information Security (IJCNIS)
IJCNIS Vol. 7, No. 5, 8 Apr. 2015
Cover page and Table of Contents: PDF (size: 896KB)
Weighted Round Robin and Rate Limiter based Fair Queuing for WRR
Full Text (PDF, 896KB), PP.51-60
Views: 0 Downloads: 0
Author(s)
Tomas Balogh
1,*
Martin Medvecky
1
Index Terms
QoS, delay, throughput, WRR, queuing fairness, WRRRLbFQ
Abstract
In this paper we present a new packet scheduling method based on parallel usage of multiple WRR schedulers, rate limiters and output bandwidth calculation for modern NGN networks. The main idea of the presented method is to provide queueing fairness within queues. The method provides the same results in output bandwidth allocation as the compared algorithm, while within one queue flows with different packet size and arrival rates gets the same output bandwidth. With this method we are able to achieve the overall result of bandwidth assignment as algorithms like WRR, WFQ, WRRPQ and LLQ by only changing the mathematical model used to calculate the bandwidth assignment. We call this method Weighted Round Robin and Rate Limiter based Fair Queuing (WRRRLbFQ). We prove the model outcome with simulation results using NS2 simulator and compare the behavior with the WRR scheduler.
Cite This Paper
Tomáš Balogh, Martin Medvecký, "Weighted Round Robin and Rate Limiter based Fair Queuing for WRR", International Journal of Computer Network and Information Security(IJCNIS), vol.7, no.5, pp.51-60, 2015. DOI:10.5815/ijcnis.2015.05.07
Reference
[1]Chromy, E., Jadron, M., and Behul, T.: Admission Control Methods in IP Networks. In: Advances in Multimedia, vol. 2013, Article ID 918930, 7 pages, 2013, ISSN: 1687-5680 (Print), ISSN: 1687-5699 (Online), doi:10.1155/2013/918930.
[2]Chromy, E., Misuth, T., Weber, A.: Application of Erlang Formula in Next Generation Networks. In International Journal of Computer Network and Information Security. Vol. 4, No. 1 (2012), s.59-66. ISSN 2074-9104.
[3]Chromy, E., Jadron, M., and Behul, T.: Measurement Based Admission Control Methods in IP Networks. In International Journal of Information Technology and Computer Science. Vol. 5, Iss. 10 (2013), s.1-8. ISSN 2074-9007.
[4]A. Demers, S. Keshav, and S. Shenker, “Analysis and simulation of a fair queuing algorithm,” ACM Computer Communication Review (SIGCOMM'89), pp. 3-12, 1989.Hari Balakrishnan; ?Scheduling for Fairness: Fair Queuing and CSFQ“ 1998. http://nms.csail.mit.edu/6.829-f05/lectures/L8-fq.pdf.
[5]L. Zhang, “Virtual clock: A new traffic control algorithm for packet switching networks,” ACM Transactions on Computer Systems, vol.9 no.2, pp.101-124, 1990.
[6]M. Katevenis, S. Sidiropoulos and C. Courcoubetis. Weighted round-robin cell multiplexing in a general-purpose ATM switch chip. In IEEE Journal on Selected Areas in Communications, vol.9, no.8, pp.1265-1279.
[7]Cisco Systems, Cisco IOS Software Releases 12.0 T, Low Latency Queuing http://www.cisco.com/en/US/docs/ios/12_0t/12_0t7/feature/guide/pqcbwfq.pdf.
[8]J. Mao, W.M Moh, and B. Wei, "PQWRR scheduling algorithm in supporting of DiffServ," Communications, 2001. ICC 2001. IEEE International Conference on , vol.3, no., pp.679-684 vol.3, 2001.
[9]L. Kleinrock; 1976; ?Queuing Systems vol. 2, Computer Applications“; New York: Wiley-Interscience.
[10]H. M. Chaskar and U. Madhow. Fair scheduling with tunable latency: a round-robin approach. In IEEE/ACM Trans. Netw. 11.
[11]Balogh, Tomá?; Medvecky, Martin. Mean Bandwidth Allocation Model of WRR for IP Networks. In: Telecommunications and Signal Processing TSP-2012 : 35rd International Conference on Telecommunications and Signal Processing. Prague, Czech Republic, 3.-4.7.2012. - Prague : Asszisztencia Szervez? Kft., 2012. – ISBN 978-1-4673-1116-8. - pp. 156-160.
[12]Chaskar H., and Madhow U. Fair scheduling with tunable latency: A Round Robin approach. In: Proc. IEEE GLOBECOM, 1999.
[13]The Network Simulator - ns-2, http://www.isi.edu/nsnam/ns/.
[14]Sergio Andreozzi: DiffServ4NS, http://sergioandreozzi.com/research/network/diffserv4ns/.