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

  • Yan Chen
  • Randy H. Katz
  • John D. Kubiatowicz
Conference paper

DOI: 10.1007/3-540-45866-2_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2414)
Cite this paper as:
Chen Y., Katz R.H., Kubiatowicz J.D. (2002) SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network. In: Mattern F., Naghshineh M. (eds) Pervasive Computing. Pervasive 2002. Lecture Notes in Computer Science, vol 2414. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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