Skip to main content
SpringerLink
Log in

The Case for Cooperative Networking*

  • Conference paper
  • First Online:
Peer-to-Peer Systems (IPTPS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2429))

Included in the following conference series:

Abstract

In this paper, we make the case for Cooperative Networking (CoopNet) where end-hosts cooperate to improve network performance perceived by all. In CoopNet, cooperation among peers complements traditional client-server communication rather than replacing it.W e focus on the Web flash crowd problem and argue that CoopNet offers an effective solution. We present an evaluation of the CoopNet approach using simulations driven by traffic traces gathered at the MSNBC website during the flash crowd that occurred on September 11, 2001.

For more information, please visit the CoopNet project Web page at http://www.research.microsoft.com/~padmanab/projects/CoopNet/.

The author was an intern at Microsoft Research through much of this work.

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

Access this chapter

Log in via an institution
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. G. Andersen, H. Balakrishnan, M.F. Kaashoek and R. Morris. “Resilient Overlay Networks”, ACM SOSP, October 2001.

    Google Scholar 

  2. W.J. Bolosky, J. R. Douceur, D. Ely, and M. Theimer. “Feasibility of a Serverless Distributed File System Deployed on an Existing Set of Desktop PCs”, ACM SIGMETRICS, June 2000.

    Google Scholar 

  3. R. Fielding et al. “Hypertext Transfer Protocol — HTTP/1.1”, RFC-2616, IETF, June 1999.

    Google Scholar 

  4. P. Joubert, R. King, R. Neves, M. Russinovich, and J. Tracey.“ High-Performance Memory-Based Web Servers: Kernel and User-Space Performance”, Usenix 2001, June 2001.

    Google Scholar 

  5. C. Kommareddy, N. Shankar, and B. Bhattacharjee. “Finding Close Friends on the Internet”, IEEE ICNP, November 2001.

    Google Scholar 

  6. B. Krishnamurthy and J. Wang.“ On Network-Aware Clustering of Web Clients”, ACM SIGCOMM, August 2001.

    Google Scholar 

  7. K. Lai and M. Baker.“Nettimer: A Tool for Measuring Bottleneck Link Bandwidth”, USENIX Symposium on Internet Technologies and Systems, March 2001.

    Google Scholar 

  8. T.S.E. Ng and H. Zhang.“Towards Global Network Positioning”, ACM SIGCOMM Internet Measurement Workshop, November 2001.

    Google Scholar 

  9. V.N. Padmanabhan and L. Subramanian. “An Investigation of Geographic Mapping Techniques for Internet Hosts”, ACM SIGCOMM, August 2001.

    Google Scholar 

  10. V.N. Padmanabhan, H.J. Wang, P. A. Chou, and K. Sripanidkulchai.“ Distributing Streaming Media Content Using Cooperative Networking”, ACM NOSSDAV, May 2002.

    Google Scholar 

  11. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker.“ A Scalable Content-Addressable Network”, ACM SIGCOMM, August 2001.

    Google Scholar 

  12. A. Rowstron and P. Druschel.“S torage Management and Caching in PAST, A Large-scale, Persistent Peer-to-peer Storage Utility”, ACM SOSP, October 2001.

    Google Scholar 

  13. S. Saroiu. “Bottleneck Bandwidths”, October 2001. http://www.cs.washington.edu/homes/tzoompy/sprobe/webb.htm

  14. S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson. “The End-to-End Effects of Internet Path Selection”, ACM SIGCOMM, August 1999.

    Google Scholar 

  15. C. Shields and B.N. Levine. “A Protocol for Anonymous Communication Over the Internet”, ACM Conference on Computer and Communication Security, November 2000.

    Google Scholar 

  16. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. “Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications”, ACM SIGCOMM, August 2001.

    Google Scholar 

  17. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner. “Scalable High Speed IP Routing Lookups”, ACM SIGCOMM, September 1997.

    Google Scholar 

  18. B. Zhao, J. Kubiatowicz, and A. Joseph. “Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing”, U. C. Berkeley Technical Report UCB//CSD-01-1141, April 2001.

    Google Scholar 

  19. Akamai. http://www.akamai.com/

  20. MSNBC Web site. http://www.msnbc.com/

Download references

Author information

Authors and Affiliations

  1. Microsoft Research, 200 Technology Square, Cambridge, MA, USA

    Venkata N. Padmanabhan

  2. Carnegie Mellon University, 200 Technology Square, Cambridge, MA, USA

    Kunwadee Sripanidkulchai

Authors
  1. Venkata N. Padmanabhan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kunwadee Sripanidkulchai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Rice University, MS 132, 88005, Houston, TX, USA

    Peter Druschel

  2. MIT Laboratory of Computer Science, 200 Technology Square, Cambridge, MA, USA

    Frans Kaashoek

  3. Microsoft Research Ltd., 7 J J Thomson Avenue, CB3 0FB, Cambridge, UK

    Antony Rowstron

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Padmanabhan, V.N., Sripanidkulchai, K. (2002). The Case for Cooperative Networking* . In: Druschel, P., Kaashoek, F., Rowstron, A. (eds) Peer-to-Peer Systems. IPTPS 2002. Lecture Notes in Computer Science, vol 2429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45748-8_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-45748-8_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44179-3

  • Online ISBN: 978-3-540-45748-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation