Weighted fair discard scheme for buffer management in the presence of network congestion

Authors:
Luo Tao;K. R. Subramanian;He Feng;Xiaofan Deng
Affiliations:
The School of EEE, Nanyang Technological University, Singapore, Singapore;The School of EEE, Nanyang Technological University, Singapore, Singapore;EE, Manitoba University, Winnipeg, Canada;Sichuan Construction Bank, Chendu, People's Republic of China
Venue:
Computer Communications
Year:
2002

Citing 13
Cited 1

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Rate-proportional servers: a design methodology for fair queueing algorithms

IEEE/ACM Transactions on Networking (TON)
Uniform versus priority dropping for layered video

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Maintaining high throughput during overload in ATM switches

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
An efficient admission control scheme for the real-time VBR traffic in the ATM network: deterministic bandwidth allocation

Computer Communications
Design and analysis of the virtual-time-based round robin fair scheduling algorithm for QoS guarantees

Computer Communications
Quality of service development in the vBNS

IEEE Communications Magazine
Hierarchical coding of digital television

IEEE Communications Magazine
MPEG coding for variable bit rate video transmission

IEEE Communications Magazine
Network delay analysis of a class of fair queueing algorithms

IEEE Journal on Selected Areas in Communications

Loss rate aware preferential treamtment scheme at the congested router

ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Data discarding is widely used in networks as a mechanism for buffer management. It enables networks to satisfy various QoS requirements. In this paper, we propose a general weighted fair discard algorithm (WFD) for buffer management in the presence of network congestion and buffer overflow. WFD comprises two parts, discard weight and discard mechanism. Whenever there is a situation of buffer overflow, WFD removes some data from the buffer. The amount of data removed from individual connections is controlled by WFD and is proportional to connections' discard weights. Since discard weights can be flexibly assigned and dynamically adjusted, WFD can thus optimize the performance of various applications more efficiently, as compared with other discard disciplines, such as 'drop tail'. In addition, certain interesting attributes of WFD are also analyzed in this paper, and results show that we can estimate possible data losses in advance and control them in realtime, as they are extremely useful for multi-streaming or adaptive applications.