-
1
-
-
0031250731
-
Hierarchical packet fair queueing algorithms
-
Oct.
-
J. Bennett and H. Zhang, "Hierarchical Packet Fair Queueing Algorithms," ACM/IEEE Trans. Networking, vol.5, no.5, pp. 675-689, Oct. 1997.
-
(1997)
ACM/IEEE Trans. Networking
, vol.5
, Issue.5
, pp. 675-689
-
-
Bennett, J.1
Zhang, H.2
-
3
-
-
34948832511
-
Group round robin: Improving the fairness and complexity of packet scheduling
-
B. Caprita, J. Nieh, and W. Chan, "Group Round Robin: Improving the Fairness and Complexity of Packet Scheduling," Proc. Symp. Architecture for Networking and Comm. Systems (ANCS '05), pp. 29-40, 2005.
-
(2005)
Proc. Symp. Architecture for Networking and Comm. Systems (ANCS '05)
, pp. 29-40
-
-
Caprita, B.1
Nieh, J.2
Chan, W.3
-
5
-
-
0024889726
-
Analysis and simulation of a fair queuing algorithm
-
A. Demers, S. Keshav, and S. Shenker, "Analysis and Simulation of a Fair Queuing Algorithm," Proc. ACM SIGCOMM '89, pp. 1-12, 1989.
-
(1989)
Proc. ACM SIGCOMM '89
, pp. 1-12
-
-
Demers, A.1
Keshav, S.2
Shenker, S.3
-
6
-
-
0028599989
-
A self-clocked fair queueing scheme for broadband applications
-
S. Golestani, "A Self-Clocked Fair Queueing Scheme for Broadband Applications," Proc. IEEE INFOCOM '94, pp. 636-646, 1994.
-
(1994)
Proc. IEEE INFOCOM '94
, pp. 636-646
-
-
Golestani, S.1
-
7
-
-
11844296021
-
SRR, an O(1) time complexity packet scheduler for flows in multiservice packet networks
-
Dec.
-
C. Guo, "SRR, an O(1) Time Complexity Packet Scheduler for Flows in MultiService Packet Networks," IEEE/ACM Trans. Networking, vol.12, no.6, pp. 1144-1155, Dec. 2004.
-
(2004)
IEEE/ACM Trans. Networking
, vol.12
, Issue.6
, pp. 1144-1155
-
-
Guo, C.1
-
8
-
-
84948389379
-
-
L. Lenzini, E. Mingozzi, and G. Stea, "Aliquem: A Novel DRR Implementation to Achieve Better Latency and Fairness at O(1) Complexity," Proc. 10th Int'l Workshop Quality of Service (IWQoS '02), pp. 77-86, 2002.
-
(2002)
Aliquem: A Novel DRR Implementation to Achieve Better Latency and Fairness at O(1) Complexity," Proc. 10th Int'l Workshop Quality of Service (IWQoS '02)
, pp. 77-86
-
-
Lenzini, L.1
Mingozzi, E.2
Stea, G.3
-
9
-
-
4644299281
-
Tradeoffs between low complexity, low latency, and fairness with deficit round- robin schedulers
-
Apr.
-
L. Lenzini, E. Mingozzi, and G. Stea, "Tradeoffs between Low Complexity, Low Latency, and Fairness with Deficit Round- Robin Schedulers," IEEE/ACM Trans. Networking, vol.12, no.4, pp. 681-693, Apr. 2004.
-
(2004)
IEEE/ACM Trans. Networking
, vol.12
, Issue.4
, pp. 681-693
-
-
Lenzini, L.1
Mingozzi, E.2
Stea, G.3
-
10
-
-
0036602449
-
Bandwidth sharing: Objectives and algorithms
-
June
-
L. Massouli and J. Roberts, "Bandwidth Sharing: Objectives and Algorithms," IEEE/ACM Trans. Networking, vol.10, no.3, pp. 320-328, June 2002.
-
(2002)
IEEE/ACM Trans. Networking
, vol.10
, Issue.3
, pp. 320-328
-
-
Massouli, L.1
Roberts, J.2
-
12
-
-
0027612043
-
A generalized processor sharing approach to flow control in integrated services networks: The single node case
-
June
-
A. Parekh and R. Gallager, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case," IEEE/ACM Trans. Networking, vol.1, no.3, pp. 344-357, June 1993.
-
(1993)
IEEE/ACM Trans. Networking
, vol.1
, Issue.3
, pp. 344-357
-
-
Parekh, A.1
Gallager, R.2
-
13
-
-
33947287761
-
The stratified round robin scheduler: Design, analysis, and implementation
-
Dec.
-
S. Ramabhadran and J. Pasquale, "The Stratified Round Robin Scheduler: Design, Analysis, and Implementation," IEEE/ACM Trans. Networking, vol.14, no.6, pp. 1362-1373, Dec. 2006.
-
(2006)
IEEE/ACM Trans. Networking
, vol.14
, Issue.6
, pp. 1362-1373
-
-
Ramabhadran, S.1
Pasquale, J.2
-
14
-
-
0029778714
-
Hardware-Efficient fair queueing architectures for high-speed networks
-
J. Rexford, A. Greenberg, and F. Bonomi, "Hardware-Efficient Fair Queueing Architectures for High-Speed Networks," Proc. IEEE INFOCOM '96, pp. 638-646, 1996.
-
(1996)
Proc. IEEE INFOCOM '96
, pp. 638-646
-
-
Rexford, J.1
Greenberg, A.2
Bonomi, F.3
-
15
-
-
0031377376
-
A scalable architecture for fair leaky-bucket shaping
-
J.L. Rexford, F. Bonomi, A. Greenberg, and A. Wong, "A Scalable Architecture for Fair Leaky-Bucket Shaping," Proc. IEEE INFOCOM '97, pp. 1056-1064, 1997.
-
(1997)
Proc. IEEE INFOCOM '97
, pp. 1056-1064
-
-
Rexford, J.L.1
Bonomi, F.2
Greenberg, A.3
Wong, A.4
-
16
-
-
0030147043
-
Design and analysis of frame-based fair queueing: A new traffic scheduling algorithm for packet- switched networks
-
D. Stiliadis and A. Varma, "Design and Analysis of Frame-Based Fair Queueing: A New Traffic Scheduling Algorithm for Packet- Switched Networks," Proc. ACM SIGMETRICS '96, pp. 104-115, 1996.
-
(1996)
Proc. ACM SIGMETRICS '96
, pp. 104-115
-
-
Stiliadis, D.1
Varma, A.2
-
17
-
-
85013295511
-
Efficient fair queuing using deficit round robin
-
M. Shreedhar and G. Varghese, "Efficient Fair Queuing Using Deficit Round Robin," Proc. ACM SIGCOMM '95, pp. 231-242, 1995.
-
(1995)
Proc. ACM SIGCOMM '95
, pp. 231-242
-
-
Shreedhar, M.1
Varghese, G.2
-
18
-
-
0031337596
-
Leap forward virtual clock: An O(loglog N) queuing scheme with guaranteed delays and throughput fairness
-
S. Suri, G. Varghese, and G. Chandranmenon, "Leap Forward Virtual Clock: An O(loglog N) Queuing Scheme with Guaranteed Delays and Throughput Fairness," Proc. IEEE INFOCOM '97, pp. 557-565, 1997.
-
(1997)
Proc. IEEE INFOCOM '97
, pp. 557-565
-
-
Suri, S.1
Varghese, G.2
Chandranmenon, G.3
-
19
-
-
21844438294
-
Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler
-
P. Valente, "Exact GPS Simulation with Logarithmic Complexity, and Its Application to an Optimally Fair Scheduler," Proc. ACM SIGCOMM '04, pp. 269-280, 2004.
-
(2004)
Proc. ACM SIGCOMM '04
, pp. 269-280
-
-
Valente, P.1
-
20
-
-
33744914826
-
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms
-
J. Xu and R.J. Lipton, "On Fundamental Tradeoffs between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms," Proc. ACM SIGCOMM '02, pp. 279-292, 2002.
-
(2002)
Proc. ACM SIGCOMM '02
, pp. 279-292
-
-
Xu, J.1
Lipton, R.J.2
-
21
-
-
77955075128
-
Fair round robin: A low complexity packet scheduler with proportional and worst-case fairness
-
Florida State Univ., Feb.
-
X. Yuan and Z. Duan, "Fair Round Robin: A Low Complexity Packet Scheduler with Proportional and Worst-Case Fairness," Technical Report TR-080201, Dept. Computer Science, Florida State Univ., Feb. 2008.
-
(2008)
Technical Report TR-080201, Dept. Computer Science
-
-
Yuan, X.1
Duan, Z.2
-
22
-
-
85030153179
-
Virtual clock: A new traffic control scheme for packet switching networks
-
L. Zhang, "Virtual Clock: A New Traffic Control Scheme for Packet Switching Networks," Proc. ACM SIGCOMM '90, pp. 19-29, 1990.
-
(1990)
Proc. ACM SIGCOMM '90
, pp. 19-29
-
-
Zhang, L.1
-
23
-
-
8344242918
-
On the computational complexity of maintaining GPS clock in packet scheduling
-
Q. Zhao and J. Xu, "On the Computational Complexity of Maintaining GPS Clock in Packet Scheduling," Proc. IEEE INFOCOM '04, pp. 2383-2392, 2004.
-
(2004)
Proc. IEEE INFOCOM '04
, pp. 2383-2392
-
-
Zhao, Q.1
Xu, J.2
|