Replica Placement Algorithms with Latency Constraints in Content Distribution Networks

@inproceedings{Su2004ReplicaPA,
  title={Replica Placement Algorithms with Latency Constraints in Content Distribution Networks},
  author={Jie Su and Douglas S. Reeves},
  year={2004}
}
Content distribution networks (CDNs) are a recent development to improve the performance of networked applications. The design of replica placement algorithms is one of the foremost problems in CDNs. Current replica placement methods do not guarantee a bound on the maximum latency to any client. In this paper, we propose several algorithms for replica placement with latency constraints. The algorithms are compared with respect to scalability and performance under a variety of conditions… CONTINUE READING

Figures, Tables, and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS

LARAS: Locality aware replication algorithm for the Skip Graph

  • NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium
  • 2016
VIEW 1 EXCERPT
CITES METHODS

Dynamic Data Replication-Driven Model in Data Grids

  • 2015 IEEE 39th Annual Computer Software and Applications Conference
  • 2015
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

Optimal placement of replicas in trees with read , write , and storage costs

J. Roberts J. Kanashrrju, K. Ross
  • IEEE Transactions of Parallel and Distributed Systems
  • 2001

Optimal placement of replicas in trees with read, write, and storage costs.IEEE Transactions of Parallel and Distributed Systems

K. Kalpakisa, K. Dasgupta, O. Wolfson
  • 2001
VIEW 2 EXCERPTS

Similar Papers

Loading similar papers…