Abstract
In order to manage fairly the service of the queueing elements, the support of QoS with a sophisticated packet scheduling algorithms that is a part of the Fair Queuing family can be considered as essential. Two are the main parts that this work focuses; First, the Palindromic Motion (PM) algorithm that works as a timestamp (or sorted priority) scheduler keeping the flow service priority and second, the two backup flexible credit methods for adjustment of the weight which are used instead of the fixed credit method with a lower maximum weight. A feedback mechanism is used for adjusting the weight size considering the current packet size. The provisional increase of the weight is proposed by the two backup methods; the Direct Increase Weight (DIW) algorithm and the Compound Round Robin (CRR) algorithm. Advantages over recent schemes like Group Round Robin (GRR) etc are presented. Simulation experiments are provided.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ferrari, D.: Client requirements for real time communication services. IEEE Communication Magazine 28(11) (1990)
Cheung, S., Pencea, C.: BSFQ: Bin Sort Fair Queuing. In: Infocom 2002, NY (June 2002)
Bennett, J., Zhang, H.: WF2Q: Worst-case Fair Weighted Fair Queueing. In: Proc. IEEE Infocom 1996, pp. 120–128 (March 1996)
Zhang, L.: A new Architecture for Packet Switched Network Protocols, PhD Dissertation, MIT (July 1989)
Golestani, S.: A self-clocked fair queueing scheme for broadband applications. In: IEEE Infocom 1994, Toronto, CA, pp. 636–646 (June 1994)
Suri, S., Vargese, G., Chandranmenon, G.: Leap Forward Virtual Clock: A new fair Queuing Scheme with Guaranteed Delays and Throughput Fairness. In: IEEE Infocom 1997, pp. 557–565 (1997)
Goyal, P., Vin, H.: Start time Fair Queueing: A scheduling Algorithm for Integrated Services Packet Switching Networks. IEEE/ACM Trans. On Networking 5(4), 561–571 (1997)
Shreedhar, M., Vargese, G.: Efficient Fair Queuing using deficit Round Robin. ACM/IEEE Trans. on Networking 4(3), 375–385 (1996)
Eug, T.: Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors. In: IEEE Infocom 1998, pp. 1103–1111 (March 1998)
Bennett, J., Stephens, D., Zhang, H.: High Speed, Scalable, and Accurate Implementation of Packet Fair Queuing Algorithms in ATM Networks. In: ICNP 1997, Atlanta,GA, pp. 7–14 (October 1997)
Brown, R.: Calendar Queues: A Fast Priority Queue Implementation for the Simulation Event Set Problem. Comm. of the ACM 31 (10), 1220–1227 (1988)
Wrikson, K., Ladner, R., LaMarca, A.: Optimizing Static Calendar Queues. In: Proceedings of IEEE Symp. on Foundation of Computer Science, November 20-22 (1994)
Rexford, J., Greengerg, A., Bonomi, F.: Hardware-Efficient Fair Queueing Architectures for High-Speed Networks. In: IEEE Infocom 1996, pp. 638–646 (1996)
Kanhere, S., Setha, H., Parekh, A.: Fair and Efficient Packet Scheduling using Elastic Round Robin. IEEE Trans. On Parallel and Distributed Systems 13(3), 324–336 (2000)
Tanenbaum, A.: Computer Networks. Prentice-Hall, Englewood Cliffs (1996)
Stiliadis, D., Varma, A.: Latency-Rate Servers: A general Model for Analysis of Traffic Scheduling Algorithms. IEEE/ACM Trans. on Networking 6 (5) (1998)
Ramabhadram, S., Pasquale, J.: Stratified Round Robin: A low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay. In: Sigcomm 2003, Germany (August 2003)
Carpita, B., Chan, W., Nieh, J.: Group Round Robin: Improving the Fairness and complexity of Packet Scheduling. Dept of Computer Science, Columbia Univesrity, Technical Report CUCS-018-03 (June 2003)
Chuanxiong, G.: SRR: An O(1) Time Complexity Packet Scheduler for Flows in Multi-Service Packet Networks. In: Sigcomm 2001, San Diego, USA ( August 2001)
Lenzini, L., Mingozzi, E., Stea, G.: Tradeoffs Between Low Complexity, Low Latency, and Fairness with Deficit Round-Robin Schedulers. IEEE/ACM Transactions on Networking 12(4), 681–693 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsiligaridis, J., Acharya, R. (2005). A Hybrid Framework of RR Scheduler to Ensure Priority, Low Complexity and Delay with Relative Fairness. In: Ramos, F.F., Larios Rosillo, V., Unger, H. (eds) Advanced Distributed Systems. ISSADS 2005. Lecture Notes in Computer Science, vol 3563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533962_10
Download citation
DOI: https://doi.org/10.1007/11533962_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28063-7
Online ISBN: 978-3-540-31674-9
eBook Packages: Computer ScienceComputer Science (R0)