Nothing Special   »   [go: up one dir, main page]

Skip to main content

Distributed Active Measurement of Internet Queuing Delays

  • Conference paper
Passive and Active Measurement (PAM 2014)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 8362))

Included in the following conference series:

Abstract

Despite growing link capacities, over-dimensioned buffers are still causing, in the Internet of the second decade of the third millennium, hosts to suffer from severe queuing delays (or bufferbloat). While maximum bufferbloat possibly exceeds few seconds, it is far less clear how often this maximum is hit in practice. This paper reports on our ongoing work to build a spatial and temporal map of Internet bufferbloat, describing a system based on distributed agents running on PlanetLab that aims at providing a quantitative answer to the above question.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. http://internetcensus2012.bitbucket.org/

  2. http://www.caida.org/projects/ark/

  3. http://www.netdimes.org/new/

  4. Bischof, Z., Otto, J., Sánchez, M., Rula, J., Choffnes, D., Bustamante, F.: Crowdsourcing ISP characterization to the network edge. In: ACM SIGCOMM W-MUST (2011)

    Google Scholar 

  5. Bischof, Z.S., Otto, J.S., Bustamante, F.E.: Up, down and around the stack: ISP characterization from network intensive applications. In: ACM SIGCOMM W-MUST (2012)

    Google Scholar 

  6. Bourgeau, T., Augé, J., Friedman, T.: Tophat: supporting experiments through measurement infrastructure federation. In: TridentCom (2010)

    Google Scholar 

  7. Chirichella, C., Rossi, D.: To the moon and back: are internet bufferbloat delays really that large. In: IEEE INFOCOM Workshop on Traffic Measurement and Analysis, TMA (2013)

    Google Scholar 

  8. Jiang, H., Wang, Y., Lee, K., Rhee, I.: Tackling bufferbloat in 3G/4G networks. In: ACM IMC (2012)

    Google Scholar 

  9. Kreibich, C., Weaver, N., Nechaev, B., Paxson, V.: Netalyzr: Illuminating the edge network. In: ACM IMC (2010)

    Google Scholar 

  10. Leonard, D., Loguinov, D.: Demystifying service discovery: implementing an internet-wide scanner. In: ACM IMC (2010)

    Google Scholar 

  11. Sundaresan, S., de Donato, W., Feamster, N., Teixeira, R., Crawford, S., Pescapè, A.: Broadband internet performance: a view from the gateway. In: ACM SIGCOMM (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Casoria, P., Rossi, D., Augé, J., Buob, MO., Friedman, T., Pescapé, A. (2014). Distributed Active Measurement of Internet Queuing Delays. In: Faloutsos, M., Kuzmanovic, A. (eds) Passive and Active Measurement. PAM 2014. Lecture Notes in Computer Science, vol 8362. Springer, Cham. https://doi.org/10.1007/978-3-319-04918-2_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04918-2_31

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04917-5

  • Online ISBN: 978-3-319-04918-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics