Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

86

Voted

TPDS
2002

favoriteEmaildiscussreport

167views more TPDS 2002»

Fair and Efficient Packet Scheduling Using Elastic Round Robin

14 years 10 months ago

Fair and Efficient Packet Scheduling Using Elastic Round Robin

Download www.cse.unsw.edu.au

Salil S. Kanhere, Harish Sethu, Alpa B. Parekh

Real-time Traffic

Interconnection Networks | Round Robin | Scheduling Disciplines | TPDS 2002 |

claim paper

Related Content

» Lowlatency guaranteedrate scheduling using Elastic Round Robin

» On the latency and fairness characteristics of preorder deficit round Robin

» Group round robin improving the fairness and complexity of packet scheduling

» Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Inte...

» Uplink Downlink Limited Round Robin Scheduling Algorithms

» Fair and Efficient FrameBased Scheduling Algorithm for Multimedia Networks

» Credit based fair scheduling for packet switched networks

» Efficient and scalable multiprocessor fair scheduling using distributed weighted roundrobi...

» A Dynamically Reconfigurable Queue Scheduler

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	TPDS
Authors	Salil S. Kanhere, Harish Sethu, Alpa B. Parekh

Comments (0)