Title: A new scalable and efficient packet scheduling method in high-speed packet switch networks
Abstract:While weighted fair queueing (WFQ) and many other fair scheduling methods can provide guaranteed worst case delay bounds, they are not scalable to a large number of connections due to per-flow queuing...While weighted fair queueing (WFQ) and many other fair scheduling methods can provide guaranteed worst case delay bounds, they are not scalable to a large number of connections due to per-flow queuing. This paper presents a new packet scheduling method-round-robin priority queuing (RRPQ). RRPQ guarantees a per-session-based delay bound without per-flow queuing. It also avoids many other implementation complexities in fair queuing scheduling. The scalability and low implementation cost of RRPQ make it a practical solution in providing guaranteed delay bounds in high-speed networks.Read More
Publication Year: 2002
Publication Date: 2002-11-13
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 5
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot