Advertisement

The Case for Cooperative Networking*

  • Venkata N. Padmanabhan
  • Kunwadee Sripanidkulchai
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2429)

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.

Keywords

Network Bandwidth Cooperative Networking Proxy Cache Improve Network Performance Flash Crowd 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. G. Andersen, H. Balakrishnan, M.F. Kaashoek and R. Morris. “Resilient Overlay Networks”, ACM SOSP, October 2001.Google Scholar
  2. 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. 3.
    R. Fielding et al. “Hypertext Transfer Protocol — HTTP/1.1”, RFC-2616, IETF, June 1999.Google Scholar
  4. 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. 5.
    C. Kommareddy, N. Shankar, and B. Bhattacharjee. “Finding Close Friends on the Internet”, IEEE ICNP, November 2001.Google Scholar
  6. 6.
    B. Krishnamurthy and J. Wang.“ On Network-Aware Clustering of Web Clients”, ACM SIGCOMM, August 2001.Google Scholar
  7. 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. 8.
    T.S.E. Ng and H. Zhang.“Towards Global Network Positioning”, ACM SIGCOMM Internet Measurement Workshop, November 2001.Google Scholar
  9. 9.
    V.N. Padmanabhan and L. Subramanian. “An Investigation of Geographic Mapping Techniques for Internet Hosts”, ACM SIGCOMM, August 2001.Google Scholar
  10. 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. 11.
    S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker.“ A Scalable Content-Addressable Network”, ACM SIGCOMM, August 2001.Google Scholar
  12. 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. 13.
    S. Saroiu. “Bottleneck Bandwidths”, October 2001. http://www.cs.washington.edu/homes/tzoompy/sprobe/webb.htm
  14. 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. 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. 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. 17.
    M. Waldvogel, G. Varghese, J. Turner, and B. Plattner. “Scalable High Speed IP Routing Lookups”, ACM SIGCOMM, September 1997.Google Scholar
  18. 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. 20.
  20. 21.
    MSNBC Web site. http://www.msnbc.com/

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Venkata N. Padmanabhan
    • 1
  • Kunwadee Sripanidkulchai
    • 2
  1. 1.Microsoft ResearchCambridgeUSA
  2. 2.Carnegie Mellon UniversityCambridgeUSA

Personalised recommendations