Emulating low-priority transport at the application layer: A background transfer service

Performance Evaluation Review

Volumn 32, Issue 1, 2004, Pages 118-129

  Key, Peter ^a   Massoulié, Laurent ^a   Wang, Bing ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b University of Massachusetts Amherst   (United States)

Author keywords

Application Reaction; Background transfer; Binary Search; Low priority; Stochastic Approximation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SYSTEM FIREWALLS; FILE ORGANIZATION; INTERNET; OPTIMIZATION; RANDOM PROCESSES;

APPLICATION REACTION; BACKGROUND TRANSFER; BINARY SEARCH; LOW PRIORITY; STOCHASTIC APPROXIMATION;

DATA TRANSFER;

EID: 8344266179     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1012888.1005703     Document Type: Conference Paper

References (27)

1. A. Venkataramani, P. Yalagandula, R. Kokku, S. Sharif, and M. Dahlin. The potential costs and benefits of long term prefetching for content distribution. Computer Communication Journal, 25(4):367-375, 2002.
2. Antony I. T. Rowstron and Peter Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Symposium on Operating Systems Principles, pages 188-201, 2001.
3. A. Venkataramani, R. Kokku, and M. Dahlin. TCP Nice: A mechanism for background transfers. In Proc. Operating Systems Design and Implementation, December 2002.
4. A. Kuzmanovic and E. Knightly. TCP-LP: A distributed algorithm for low priority data transfer. In Proc. IEEE INFOCOM, 2003.
5. B. Huffaker, M. Fomenkov, D. Moore, and K. Claffy. Macroscopic analyses of the infrastructure: Measurement and visualization of Internet connectivity and performance. In A Workshop on passive and active measurements, April, 2001.
6. V. Ribeiro, M. Coates, R. Riedi, S. Sarvotham, and R. G. Baraniuk. Multifractal cross-traffic estimation. In Proc. ITC Specialist Seminar on IP Traffic Measurement, Modeling and Management, September 2000.
7. B. Melander, M. Bjorkman, and P. Gunningberg. A new end-to-end probing and analysis method for estimating bandwidth bottlenecks. In Proc. IEEE GLOBECOM, November 2000.
8. M. Jain and C. Dovrolis. End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput. In Proc. ACM SIGCOMM, 2002.
9. Neil T. Spring, Maureen Chesire, Mark Berryman, Vivek Sahasranaman, Thomas Anderson, and Brian N. Bershad. Receiver based management of low bandwidth access links. In Proc. IEEE INFOCOM, volume 1, pages 245-254, 2000.
10. Puneet Mehra, Avideh Zakhor, and Christophe De Vleeschouwer. Receiver-driven bandwidth sharing for TCP. In Proc. IEEE INFOCOM, 2003.
11. M. Crovella and P. Barford. The network effects of prefetching. In Proc. IEEE INFOCOM, 1998.
12. Jon Crowcroft and Philippe Oechslin. Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP. ACM Computer Communication Review, 28(3), July 1998.
13. Y. Dong, R. Rohit, and Z. Zhang. A practical technique to support controlled quality assurance in video streaming across the Internet. In Proc. Packet Video Workshop, 2002.
14. Jeffrey Semke, Jamshid Mahdavi, and Matthew Mathis. Automatic TCP buffer tuning. In Proc. ACM SIGCOMM, pages 315-323, 1998.
15. Manish Jain, Ravi Prasad, and Constantinos Dovrolis. The TCP bandwidth-delay product revisited: network buffering, cross traffic, and socket buffer auto-sizing. Technical Report GIT-CERCS-03-02, College of Computing, Georgia Tech, 2003.
16. Harold J. Kushner and George Yin. Stochastic Approximation Algorithms and Applications. Springer Verlag, 1997.
17. Laurent Massoulie and James Roberts. Bandwidth sharing: Objectives and algorithms. In Proc. IEEE INFOCOM, volume 3, pages 1395-1403, 1999.
18. T.R. Rockafellar. Convex Analysis. Princeton University Press, 1970.
19. S. Kunniyur and R. Srikant. End-to-end congestion control schemes: Utility functions, random losses and ECN marks. In INFOCOM 2000, 2000.
20. R. J. Gibbens and F. P. Kelly. Resource pricing and the evolution of congestion control. Automatica, 35:1969-1985, 1999. http://www.statslab.cam.ac. uk/~frank/PAPERS/evol.html.
21. F. P. Kelly, A. K. Maulloo, and D. K. H Tan. Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49:237-252, 1998.
22. F. P. Kelly. Mathematical modelling of the Internet. In Proceedings of the Fourth International Congress on Industrial and Applied Mathematics, 2000.
23. S. McCanne and S. Floyd. ns-LBNL network simulator. http://www-nrg.ee. lbl.gov/ns/.
24. Richard M. Karp, Elias Koutsoupias, Christos H. Papadimitriou, and Scott Shenker. Optimization problems in congestion control. In IEEE Symposium on Foundations of Computer Science, pages 66-74, 2000.
25. H. Robbins and S Munro. A stochastic approximation method. Annals of Mathematical Statistics, 22:400-407, 1951.
26. Jean-Claude Fort and Gilles Pages. Asymptotic behavior of a Markovian stochastic algorithm with constant step. SIAM J. Control, 37(5): 1456-1482, 1999.
27. Jeonghoon Mo and Jean Walrand. Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking, 8(5):556-567, 2000.