8 search results - page 1 / 2 » G-3: An O(1) Time Complexity Packet Scheduler That Provides ... |
INFOCOM
2007
IEEE
13 years 10 months ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
INFOCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
INFOCOM
2003
IEEE
13 years 9 months ago
2003
IEEE
— In this paper, we propose two schemes for the load balanced Birkhoff-von Neumann switches to provide guaranteed rate services. As in [7], the first scheme is based on an Earli...
ANCS
2005
ACM
13 years 10 months ago
2005
ACM
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
FOCS
1997
IEEE
13 years 8 months ago
1997
IEEE
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...