Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Adaptive algorithms and stochastic approximations
Adaptive algorithms and stochastic approximations
TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Understanding TCP Vegas: a duality model
Journal of the ACM (JACM)
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Reliable Blast UDP: Predictable High Performance Bulk Data Transfer
CLUSTER '02 Proceedings of the IEEE International Conference on Cluster Computing
Measuring interactions between transport protocols and middleboxes
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Designing DCCP: congestion control without reliability
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
An empirical evaluation of TCP performance in online games
Proceedings of the 2006 ACM SIGCHI international conference on Advances in computer entertainment technology
Complexity analysis and algorithm design for advance bandwidth scheduling in dedicated networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
The next generation large-scale computing applications require network support for interactive visualization, computational steering and instrument control over wide-area networks. In particular, these applications require stable transport streams over wide-area networks, which are not adequately supported by current transport methods. We propose a new class of protocols capable of stabilizing a transport channel at a specified throughput level in the presence of random network dynamics based on the classical Robbins-Monro stochastic approximation approach. These protocols dynamically adjust the window size or sleep time at the source to achieve stable throughput at the destination. The target throughput typically corresponds to a small fraction of the available connection bandwidth. This approach yields provably probabilistically stable protocols as a consequence of carefully adjusted step sizes. The superior and robust stabilization performance of the proposed approach is extensively evaluated in a simulated environment and further verified through real-life implementations and deployments over both Internet and dedicated connections under disparate network conditions in comparison with existing transport methods.