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
Asymptotic Behavior of a Markovian Stochastic Algorithm with Constant Step
SIAM Journal on Control and Optimization
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Optimization problems in congestion control
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
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
Resource pricing and the evolution of congestion control
Automatica (Journal of IFAC)
The potential costs and benefits of long-term prefetching for content distribution
Computer Communications
Stability of size-based scheduling disciplines in resource-sharing networks
Performance Evaluation - Performance 2005
Remote active queue management
Proceedings of the 18th International Workshop on Network and Operating Systems Support for Digital Audio and Video
Yes, we LEDBAT: playing with the new BitTorrent congestion control algorithm
PAM'10 Proceedings of the 11th international conference on Passive and active measurement
InSite: QoE-aware video delivery from cloud data centers
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Tackling bufferbloat in 3G/4G networks
Proceedings of the 2012 ACM conference on Internet measurement conference
| Hi-index | 0.00 |
Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefetching. Although the design of such a service is reasonably easy when the underlying network supports service differentiation, it becomes more challenging without such network support. We describe an application level approach to designing a low priority service -- one that is 'lower than best-effort' in the context of the current Internet. We require neither network support nor changes to TCP. Instead, we use a receive window control to limit the transfer rate of the application, and the optimal rate is determined by detecting a change-point. We motivate this joint control-estimation problem by considering a fluid-based optimisation framework, and describe practical solutions, based on stochastic approximation and binary search techniques. Simulation results demonstrate the effectiveness of the approach.