Enhancing TCP performance with a load-adaptive RED mechanism
International Journal of Network Management
Aggregate traffic performance with active queue management and drop from tail
ACM SIGCOMM Computer Communication Review
ACM SIGCOMM Computer Communication Review
The BLUE active queue management algorithms
IEEE/ACM Transactions on Networking (TON)
File and Object Replication in Data Grids
Cluster Computing
Dynamic buffer management scheme based on rate estimation in packet-switched networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficiency/Fairness Tradeoffs in Networks with Wireless Components and Transient Congestion
The Journal of Supercomputing
TCP Westwood and Easy RED to Improve Fairness in High-Speed Networks
PIHSN '02 Proceedings of the 7th IFIP/IEEE International Workshop on Protocols for High Speed Networks
Cactus Application: Performance Predictions in Grid Environments
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
A Modular and Scalable Simulation Tool for Large Wireless Networks
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Active queue management with flow proportional buffering
International Journal of Network Management
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
Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control
ACM SIGCOMM Computer Communication Review
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Network modeling and simulation: on standardized network topologies for network research
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Modeling and Taming Parallel TCP on the Wide Area Network
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
TCP Nice: a mechanism for background transfers
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Performance Predictions for a Numerical Relativity Package in Grid Environments
International Journal of High Performance Computing Applications
REFWA: an efficient and fair congestion control scheme for LEO satellite networks
IEEE/ACM Transactions on Networking (TON)
Cloud control with distributed rate limiting
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Design of a peer-to-peer system for optimized content replication
Computer Communications
An alliance based peering scheme for peer-to-peer live media streaming
Proceedings of the 2007 workshop on Peer-to-peer streaming and IP-TV
Dandelion: cooperative content distribution with robust incentives
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
An SLA perspective on the router buffer sizing problem
ACM SIGMETRICS Performance Evaluation Review
Router buffer sizing revisited: the role of the output/input capacity ratio
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Measurement and analysis of TCP throughput collapse in cluster-based storage systems
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Improving fairness in a WRED-based DiffServ network: A fluid-flow approach
Performance Evaluation
Removing exponential backoff from TCP
ACM SIGCOMM Computer Communication Review
Experimental study of router buffer sizing
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Perspectives on router buffer sizing: recent results and open problems
ACM SIGCOMM Computer Communication Review
Modeling and emulation of internet paths
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
A new methodology for TCP evaluation in a multiuser web environment
Computer Communications
Router buffer sizing for TCP traffic and the role of the output/input capacity ratio
IEEE/ACM Transactions on Networking (TON)
Upgrading mice to elephants: effects and end-point solutions
IEEE/ACM Transactions on Networking (TON)
Do incentives build robustness in bit torrent
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
TCP behavior in sub packet regimes
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
TCP behavior in sub packet regimes
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Camdoop: exploiting in-network aggregation for big data applications
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
TCP with sender-based delay control
Computer Communications
TCP behavior over HFC cable modem access networks
Computer Communications
A switch-based approach to throughput collapse and starvation in data centers
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
TCP's ability to share a bottleneck fairly and efficiently decreases as the number of competing flows increases. This effect starts to appear when there are more flows, than packers in the delay-bandwidth product. In the limit of large numbers of flows, TCP forces a packet loss rate approaching 50%, causing delays that users are likely to notice. TCP's minimum congestion window of one packet is the source of these problems: it causes a few flows to send too fast while the rest wait in re-transmission time-out. The particular packet loss rate is a function of TCP's abrupt transition front exponential backoff to sending with a window of one or more packets, and of the high rate at which TCP increases small congestion windows. Analysis of packet traces suggests that these aspects of TCP's algorithms contribute substantially to the total loss rate observed on the Internet. One way to work around the problem is to make sure routers have not just one round-trip time of buffering, but buffering proportional to the total number of active flows. A more fundamental cure might make TCP less aggressive and more adaptive when its congestion window is small.