SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network

  • Yan Chen
  • Randy H. Katz
  • John D. Kubiatowicz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2414)


We present SCAN, the Scalable Content Access Network. SCAN combines dynamic replica placement with a self-organizing application-level multicast tree to meet client QoS and server resource constraints. It utilizes an underlying distributed object routing and location system (DOLR) as an essential component. Simulation results on both flash-crowd-like synthetic workloads and real Web server traces show that SCAN deploys close to an optimal number of replicas, achieves good load balance, and incurs a small delay and bandwidth penalty for update multicast relative to static replica placement on IP multicast. We envision that SCAN could enhance a number of different applications, such as content distribution and peer-to-peer file sharing.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Akamai Technologies Inc.
  2. 2.
    BBNPlanet. telnet:// Scholar
  3. 3.
    M. Castro and B. Liskov. Proactive recovery in a byzantine-fault-tolerant system. In Proc. of USENIX Symp. on OSDI, 2000.Google Scholar
  4. 4.
    Y. Chawathe, S. McCanne, and E. Brewer. RMX: Reliable multicast for heterogeneous networks. In Proceedings of IEEE INFOCOM, 2000.Google Scholar
  5. 5.
    Y. Chen et al. Dynamic replica placement for scalable content delivery. In Proc. of 1st International Workshop on Peer-to-Peer Systems (IPTPS), Mar. 2002.Google Scholar
  6. 6.
    Y. Chu, S. Rao, and H. Zhang. A case for end system multicast. In Proceedings of ACM SIGMETRICS, June 2000.Google Scholar
  7. 7.
    Digital Island Inc.
  8. 8.
    P. Francis. Yoid: Extending the Internet multicast architecture. Technical report, ICIR,, April, 2000.
  9. 9.
    J. Gray, P. Helland, P. O’Neil, and D. Shasha. The dangers of replication and a solution. In Proc. of ACM SIGMOD Conf., pages 173–182, 1996.Google Scholar
  10. 10.
    James Gwertzman and Margo Seltzer. World-Wide Web Cache Consistency, 1996.Google Scholar
  11. 11.
    K. Hildrum, J. Kubiatowicz, S. Rao, and B. Zhao. Distributed data location in a dynamic network. In Proc. of ACM SPAA, 2002.Google Scholar
  12. 12.
    S. Jamin, C. Jin, A. Kurc, D. Raz, and Y. Shavitt. Constrained mirror placement on the Internet. In Proceedings of IEEE Infocom, 2001.Google Scholar
  13. 13.
    J. Jannotti et al. Overcast: Reliable multicasting with an overlay network. In Proceedings of OSDI, 2000.Google Scholar
  14. 14.
    J. Kistler and M. Satyanarayanan. Disconnected operation in the Coda file system. ACM Transactions on Computer Systems, 10(1):3–25, February 1992.Google Scholar
  15. 15.
    B. Krishnamurthy and J. Wang. On network-aware clustering of Web clients. In Proc. of SIGCOMM, 2000.Google Scholar
  16. 16.
    John Kubiatowicz et al. Oceanstore: An architecture for global-scale persistent storage. In Proceeedings of 9th ASPLOS, 2000.Google Scholar
  17. 17.
  18. 18.
  19. 19.
    D. Pendarakis, S. Shi, D. Verma, and M. Waldvogel. ALMI: An application level multicast infrastructure. In Proceedings of 3rd USITS, 2001.Google Scholar
  20. 20.
    L. Qiu, V. N. Padmanabhan, and G. Voelker. On the placement of Web server replicas. In Proceedings of IEEE Infocom, 2001.Google Scholar
  21. 21.
    S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, 2001.Google Scholar
  22. 22.
    P. Rodriguez and S. Sibal. SPREAD: Scaleable platform for reliable and efficient automated distribution. In Proceedings of WWW, 2000.Google Scholar
  23. 23.
    A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. of Middleware 2001.Google Scholar
  24. 24.
    A. Rowstron, A-M. Kermarrec, M. Castro, and P. Druschel. SCRIBE: The design of a large-scale event notification infrastructure. In Proceedings of NGC, 2001.Google Scholar
  25. 25.
  26. 26.
    I. Stoica et al. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of ACM SIGCOMM, 2001.Google Scholar
  27. 27.
    E. Zegura, K. Calvert, and S. Bhattacharjee. How to model an Internetwork. In Proceedings of IEEE INFOCOM, 1996.Google Scholar
  28. 28.
    S. Q. Zhuang et al. Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In Proceedings of ACM NOSSDAV, 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Yan Chen
    • 1
  • Randy H. Katz
    • 1
  • John D. Kubiatowicz
    • 1
  1. 1.Computer Science DivisionUniversity of California at BerkeleyUSA

Personalised recommendations