Chapter

Peer-to-Peer Systems

Volume 2429 of the series Lecture Notes in Computer Science pp 306-318

Date:

Dynamic Replica Placement for Scalable Content Delivery

  • Yan ChenAffiliated withComputer Science Division, University of California
  • , Randy H. KatzAffiliated withComputer Science Division, University of California
  • , John D. KubiatowiczAffiliated withComputer Science Division, University of California

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this paper, we propose the dissemination tree, a dynamic content distribution system built on top of a peer-to-peer location service. We present a replica placement protocol that builds the tree while meeting QoS and server capacity constraints. The number of replicas as well as the delay and bandwidth consumption for update propagation are significantly reduced. Simulation results show that the dissemination tree has close to the optimal number of replicas, good load distribution, small delay and bandwidth penalties for update multicast compared with the ideal case: static replica placement on IP multicast.