Loss rate aware preferential treamtment scheme at the congested router

Authors:
Dongping Zhao;Deyun Zhang;Jiuxing Cao;Weibin Zheng;Zhiping An
Affiliations:
Department of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China;Department of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China;Department of Computer Science and Technology, Southeast University, Nanjing, China;Department of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China;Department of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China
Venue:
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 6
Cited 0

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
Tuning RED for Web traffic

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Comparison of Tail Drop and Active Queue Management Performance for Bulk-Data and Web-Like Internet Traffic

ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
Controlling High-Bandwidth Flows at the Congested Router

ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Weighted fair discard scheme for buffer management in the presence of network congestion

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

One weakness of the RED algorithm typical of routers is that at any given time, it imposes the same loss probability on all flows, regardless of their QoS. In this paper, we propose an improved packet discard algorithm based on RED for real-time multimedia service, which does its endeavor to avoid dropping packets from the same flow continuously in terms of instantaneous loss rate and short-time average loss rate. It traces the concerned flow’s state whenever every packet’s arrival and then dynamically adjusts the packet drops to achieve a given loss rate. When network is congested, it drops all packets of certain invalid flows mandatorily to avoid a majority of applications being invalidated simultaneously because of packet loss. Our evaluation results indicate that the proposed algorithm provides better QoS for real-time multimedia service, whether network is congested or not.