Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1005686.1005703acmconferencesArticle/Chapter ViewAbstractPublication PagesmetricsConference Proceedingsconference-collections
Article

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

Published: 01 June 2004 Publication History

Abstract

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.

References

[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.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGMETRICS '04/Performance '04: Proceedings of the joint international conference on Measurement and modeling of computer systems
June 2004
450 pages
ISBN:1581138733
DOI:10.1145/1005686
  • cover image ACM SIGMETRICS Performance Evaluation Review
    ACM SIGMETRICS Performance Evaluation Review  Volume 32, Issue 1
    June 2004
    432 pages
    ISSN:0163-5999
    DOI:10.1145/1012888
    Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 2004

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. application reaction
  2. background transfer
  3. binary search
  4. low priority
  5. stochastic approximation

Qualifiers

  • Article

Conference

SIGMETRICS04
SIGMETRICS04: SIGMETRICS 2004 / PERFORMANCE 2004
June 10 - 14, 2004
NY, New York, USA

Acceptance Rates

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 26 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2019)DiverseIEEE Journal on Selected Areas in Communications10.1109/JSAC.2007.07012225:1(222-234)Online publication date: 1-Jan-2019
  • (2018)DRWAIEEE Transactions on Mobile Computing10.1109/TMC.2015.251064115:11(2719-2734)Online publication date: 28-Dec-2018
  • (2017)Mind Your Own BandwidthFog for 5G and IoT10.1002/9781119187202.ch2(24-51)Online publication date: 27-Mar-2017
  • (2016)A Control-Theoretic Analysis of Low-Priority Congestion Control Reprioritization under AQMACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/29346521:4(1-33)Online publication date: 2-Aug-2016
  • (2016)Receiver-Side TCP Countermeasure to Bufferbloat in Wireless Access NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2015.248349415:8(2080-2093)Online publication date: 1-Aug-2016
  • (2014)Fighting the bufferbloat: On the coexistence of AQM and low priority congestion controlComputer Networks10.1016/j.bjp.2014.01.00965(255-267)Online publication date: Jun-2014
  • (2013)Less-than-Best-Effort Service: A Survey of End-to-End ApproachesIEEE Communications Surveys & Tutorials10.1109/SURV.2012.060912.0017615:2(898-908)Online publication date: Oct-2014
  • (2013)Modeling the interdependency of low-priority congestion control and active queue managementProceedings of the 2013 25th International Teletraffic Congress (ITC)10.1109/ITC.2013.6662942(1-9)Online publication date: Sep-2013
  • (2013)Async: De-congestion and yield management in cellular data networks2013 21st IEEE International Conference on Network Protocols (ICNP)10.1109/ICNP.2013.6733596(1-10)Online publication date: Oct-2013
  • (2013)Rethinking the Low Extra Delay Background Transport (LEDBAT) ProtocolComputer Networks10.1016/j.comnet.2013.02.02057:8(1838-1852)Online publication date: Jun-2013
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media