Dynamic buffer management scheme based on rate estimation in packet-switched networks

Authors:
Jeong-woo Cho;Dong-ho Cho
Affiliations:
Department of Electrical Engineering and Computer Science, Korea Advanced Institute of Science and Technology (KAIST), 373-1 Kusong-dong, Yusong-gu, Taejon 305-701, South Korea;Department of Electrical Engineering and Computer Science, Korea Advanced Institute of Science and Technology (KAIST), 373-1 Kusong-dong, Yusong-gu, Taejon 305-701, South Korea
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2002

Citing 16
Cited 2

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round robin

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Simulation-based comparisons of Tahoe, Reno and SACK TCP

ACM SIGCOMM Computer Communication Review
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
The macroscopic behavior of the TCP congestion avoidance algorithm

ACM SIGCOMM Computer Communication Review
Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Promoting the use of end-to-end congestion control in the Internet

IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno performance: a simple model and its empirical validation

IEEE/ACM Transactions on Networking (TON)
Equation-based congestion control for unicast applications

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
On inferring TCP behavior

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Towards More Complete Models of TCP Latency and Throughput

The Journal of Supercomputing
TCP behavior with many flows

ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Controlling High-Bandwidth Flows at the Congested Router

ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Real-time Internet video using error resilient scalable compressionand TCP-friendly transport protocol

IEEE Transactions on Multimedia
Beyond best effort: router architectures for the differentiated services of tomorrow's Internet

IEEE Communications Magazine

Quick paging IP scheme using residence pattern of mobile node

ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Novel Radio Link Buffer Management Schemes for End-User Multi-class Traffic in High Speed Packet Access Networks

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

While traffic volume of real-time applications is rapidly increasing, current routers do not guarantee minimum QoS values of fairness and drop packets in random fashion. If routers provide a minimum QoS, resulting less delays, more fairness, and smoother sending rates, TCP-friendly rate control (TFRC) can be adopted for real-time applications. We propose a dynamic buffer management scheme that meets the requirements described above, and can be applied to TCP flow and to data flow for transfer of real-time applications. The proposed scheme consists of a virtual threshold function, an accurate and stable per-flow rate estimation, a per-flow exponential drop probability, and a dropping strategy that guarantees fairness when there are many flows. Moreover, we introduce a practical definition of active flows to reduce the overhead coming from maintaining per-flow states. We discuss how proposed scheme motivates real-time applications to adopt TFRC.