Data networks
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Fair and Efficient Packet Scheduling Using Elastic Round Robin
IEEE Transactions on Parallel and Distributed Systems
Deficits for Bursty Latency-Critical Flows: DRR++
ICON '00 Proceedings of the 8th IEEE International Conference on Networks
Fair scheduling with tunable latency: a round-robin approach
IEEE/ACM Transactions on Networking (TON)
Dynamic core provisioning for quantitative differentiated services
IEEE/ACM Transactions on Networking (TON)
Monitoring and controlling QoS network domains
International Journal of Network Management
SRR: an O(1) time-complexity packet scheduler for flows in multiservice packet networks
IEEE/ACM Transactions on Networking (TON)
Variably weighted round robin queueing for core IP routers
PCC '02 Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International
A probabilistic priority scheduling discipline for multi-service networks
Computer Communications
LGRR: A new packet scheduling algorithm for differentiated services packet-switched networks
Computer Communications
Distribution-based bandwidth access scheme in slotted all-optical packet-switched networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Agile bandwidth management techniques in slotted all-optical packet switched networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We propose a new fair scheduling technique, called OCGRR (Output Controlled Grant-based Round Robin), for the support of DiffServ traffic in a core router. We define a stream to be the same-class packets from a given immediate upstream router destined to an output port of the core router. At each output port, streams may be isolated in separate buffers before being scheduled in a frame. The sequence of traffic transmission in a frame starts from higher-priority traffic and goes down to lower-priority traffic. A frame may have a number of small rounds for each class. Each stream within a class can transmit a number of packets in the frame based on its available grant, but only one packet per small round, thus reducing the intertransmission time from the same stream and achieving a smaller jitter and startup latency. The grant can be adjusted in a way to prevent the starvation of lower priority classes. We also verify and demonstrate the good performance of our scheduler by simulation and comparison with other algorithms in terms of queuing delay, jitter, and start-up latency.