Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Computer networks (3rd ed.)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Fair and Efficient Packet Scheduling Using Elastic Round Robin
IEEE Transactions on Parallel and Distributed Systems
Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delay and Throughput Fairness
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers
IEEE/ACM Transactions on Networking (TON)
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Hardware-efficient fair queueing architectures for high-speed networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Providing delay constraint services with the palindrome scheduler schemes
AEE'06 Proceedings of the 5th WSEAS international conference on Applications of electrical engineering
| Hi-index | 0.00 |
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.