A buffer management mechanism for achieving approximately fair bandwidth allocation in high-speed networks

IEICE Transactions on Communications

Volumn E85-B, Issue 8, 2002, Pages 1434-1441

  Miyamura, Takashi ^a   Kurimoto, Takashi ^a   Nakagawa, Kenji ^b   Dhananjaya, Prasad ^b   Aoki, Michihiro ^a   Yamanaka, Naoaki ^c  

^a NTT Network Service Systems Laboratories   (Japan)

^b NAGAOKA UNIVERSITY OF TECHNOLOGY   (Japan)

^c NTT Network Innovation Laboratories   (Japan)

Author keywords

Bandwidth management; Diff serv; Fairness; High speed network; QoS

Indexed keywords

ALGORITHMS; INTERNET; NETWORK PROTOCOLS; PERFORMANCE; QUALITY OF SERVICE; QUEUEING THEORY; ROUTERS;

BANDWIDTH ALLOCATION; BUFFER MANAGEMENT MECHANISM; FAIRNESS; HIGH SPEED NETWORKS; INTERNET PROTOCOL; VIRTUAL WEIGHTED FAIR QUEUEING;

BANDWIDTH;

EID: 0036705656     PISSN: 09168516     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. T. Miyamura, T. Kurimoto, K. Nakagawa, P. Dhananjaya, M. Aoki, and N. Yamanaka, "A new queueing mechanism for achieving fair bandwidth allocation in high-speed networks," Proc. APCC 2001, vol.E84-B, pp.473-476, 2001.
2. T. Miyamura, T. Kurimoto, K. Nakagawa, P. Dhananjaya, M. Aoki, and N. Yamanaka, "Active queue control scheme for achieving approximately fair bandwidth allocation," Proc. IEEE ICC, vol.2, pp.1269-1273, 2002.
3. N. Yamanaka, T. Kurimoto, T. Miyamura, and M. Aoki, "MSN Type-X: Next generation Internet backbone switch/router architecture," Proc. IEEE ICC, vol.4, pp.2085-2099, 2002.
4. A. Parekh and G. 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, 1993.
5. S.J. Golestani, "A self-clocked fair queueing scheme for broadband applications," Proc. IEEE INFOCOM, vol.2, pp.636-645, 1994.
6. S. Suri and G. Varghese, "Leap forward virtual clock: A new fair queueing scheme with guaranteed delays and throughput fairness," Proc. IEEE INFOCOM, vol.3, pp.557-565, 1997.
7. M. Schreedhar and G. Varghese, "Efficient fair queueing using deficit round robin," Proc. SIGCOMM'95, Sept. 1995.
8. M. Katevenis, S. Sidiropoulos, and C. Courcoubetis, "Weighted round-robin cell multiplexing in a general-purpose ATM switch chip," IEEE J. Sel. Areas Commun., vol.9, no.8, pp.1265-1279, 1991.
9. I. Stoica, S. Shenker, and H. Zhang, "Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high-speed networks," Proc. ACM SIGCOMM'98, pp.118-130, Sept. 1998.
10. Z. Cao, Z. Wang, and E. Zegura, "Rainbow fair queueing: Fair bandwidth sharing without per-flow state," Proc. IEEE INFOCOM 2000, vol.2, pp.922-931, March 2000.
11. B. Braden, D. Clark, J. Crowcroft, B. Davie, S. Deering, D. Estrin, S. Floyd, V. Jacobson, G. Minshall, C. Partridge, L. Peterson, K. Ramakrishnan, S. Shenker, J. Wroclawski, and L. Zhang, "Recommendations on queue and congestion avoidance in the Internet," IETF, RFC2309, April 1998.
12. M. Grossglauser and S. Keshav, "On CBR service," Proc. IEEE INFOCOM, pp.129-137, 1996.
13. S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. Networking, vol.1, no.4, pp.397-413, 1993.
14. D. Lin and R. Morris, "Dynamics of random early detection," Proc. SIGCOMM'97, pp.127-137, Oct. 1997.
15. UCB/LBNL/VINT, "Network Simulator - NS (Version 2)," http://www-mash.cs.berkley.edu/ns/
16. R. Jain, A. Durresi, and G. Babic, "Throughput fairness index: An explanation," ATM Forum, 99-0045, 1999.
17. Cisco Systems Inc., "Cisco Documentation," http://www.cisco.com/univercd/home/home.htm