Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
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
Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP
ACM SIGCOMM Computer Communication Review
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A mean-field model for multiple TCP connections through a buffer implementing RED
Performance Evaluation
Modeling the Stationary Behavior of TCP Reno Connections
QoS-IP '01 Proceedings of the International Workshop on Quality of Service in Multiservice IP Networks
Fluid models and solutions for large-scale IP networks
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
TCP Nice: a mechanism for background transfers
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Modeling short-lived TCP connections with open multiclass queuing networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
MPAT: Aggregate TCP Congestion Management as a Building Block for Internet QoS
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
A stochastic model of TCP/IP with stationary random losses
IEEE/ACM Transactions on Networking (TON)
Real-Time Streaming over Wireless Links: A Comparative Study
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Interaction of TCP flows as billiards
IEEE/ACM Transactions on Networking (TON)
Using partial differential equations to model TCP mice and elephants in large IP networks
IEEE/ACM Transactions on Networking (TON)
TCP-LP: low-priority service via end-point congestion control
IEEE/ACM Transactions on Networking (TON)
OverQos: an overlay based architecture for enhancing internet Qos
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Probe-Aided MulTCP: an aggregate congestion control mechanism
ACM SIGCOMM Computer Communication Review
MulTFRC: providing weighted fairness for multimediaapplications (and others too!)
ACM SIGCOMM Computer Communication Review
Markov models of internet traffic and a new hierarchical MMPP model
Computer Communications
Multiple TFRC streaming in a WiMAX environment
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
MULTFRC-LERD: an improved rate control scheme for video streaming over wireless
PCM'04 Proceedings of the 5th Pacific Rim conference on Advances in Multimedia Information Processing - Volume Part III
Multiple TFRC Connections Based Rate Control for Wireless Networks
IEEE Transactions on Multimedia
| Hi-index | 0.00 |
In the first part of this paper, we present a simple extension of the well-known TCP steady-state throughput equation that can be used to calculate the throughput of several flows that share an end-to-end path. The value of this extension, which we show to work well with simulations as well as real-life measurements, is its practical applicability. Thus, in the second part of this paper, we present its application in MulTFRC, a TCP-friendly rate control (TFRC)-based congestion control mechanism that is fair to a number of parallel TCP flows while maintaining a smoother sending rate than multiple real TFRC flows do. MulTFRC enables its users to prioritize transfers by controlling the fairness among them in an almost arbitrary fashion.