Predicting bottleneck bandwidth sharing by generalized TCP flows

Authors:
Archan Misra;Teunis Ott;John Baras
Affiliations:
IBM Research, 19 Skyline Drive, Hawthorne, NY;Department of Computer and Information Science, New Jersey Institute for Technology, University Heights, Newark, NJ;Department of Electrical and Computer Engineering, University of Maryland, College Park, MD
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2002

Citing 11
Cited 2

Congestion avoidance and control

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic

ACM SIGCOMM Computer Communication Review
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Broadband integrated networks

Broadband integrated networks
The macroscopic behavior of the TCP congestion avoidance algorithm

ACM SIGCOMM Computer Communication Review
Modeling TCP throughput: a simple model and its empirical validation

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Explicit allocation of best-effort packet delivery service

IEEE/ACM Transactions on Networking (TON)
Comparative performance analysis of versions of TCP in a local network with a lossy link

IEEE/ACM Transactions on Networking (TON)
BLUE: an alternative approach to active queue management

NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Fixed point approximations for TCP behavior in an AQM network

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Window-Based Error Recovery and Flow Control with a Slow Acknowledgement Channel: A Study of TCP/IP Performance

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution

Simulation of large networks: modeling and simulation of telecommunication networks for control and management

Proceedings of the 35th conference on Winter simulation: driving innovation
Transient behavior of processes in the tcp paradigm

Probability in the Engineering and Informational Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottleneck buffer is assumed to perform congestion feedback via randomized packet marking or drops. We first present a fixed point-based analytical technique to compute the mean congestion window sizes, the mean queue occupancy and the individual throughputs when the TCP flows perform idealized congestion avoidance. We subsequently extend the technique to analyze the case where TCP flows perform generalized congestion avoidance and demonstrate the use of this technique under the Assured Service model, where each flow is assured a minimum traffic rate. Simulations are used to demonstrate the accuracy of this technique for relatively low values of packet dropping probability and a much wider range of packet marking probability.