Topology-informed Internet replica placement

Authors:
Pavlin Radoslavov;Ramesh Govindan;Deborah Estrin
Affiliations:
USC/Information Sciences Institute, 4676 Admiralty Way, Suite 1001, Marina del Rey, CA 90292-6695, USA;USC/Information Sciences Institute, 4676 Admiralty Way, Suite 1001, Marina del Rey, CA 90292-6695, USA;USC/Information Sciences Institute, 4676 Admiralty Way, Suite 1001, Marina del Rey, CA 90292-6695, USA and LECS, 3440 Boelter Hall UCLA, Los Angeles, CA 90095 USA
Venue:
Computer Communications
Year:
2002

Citing 7
Cited 11

Scaling of multicast trees: comments on the Chuang-Sirbu scaling law

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A random graph model for massive graphs

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The cache location problem

IEEE/ACM Transactions on Networking (TON)
MBone Provides Audio and Video Across the Internet

Computer
An analysis of multicast forwarding state scalability

ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Modeling Internet topology

IEEE Communications Magazine

Increasing the Performance of CDNs Using Replication and Caching: A Hybrid Approach

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Improving the accuracy of measurement-based geographic location of internet hosts

Computer Networks and ISDN Systems
Exact algorithms for the joint object placement and request routing problem in content distribution networks

Computers and Operations Research
A traffic engineering approach for placement and selection of network services

IEEE/ACM Transactions on Networking (TON)
Combining replica placement and caching techniques in content distribution networks

Computer Communications
Improving the accuracy of measurement-based geographic location of Internet hosts

Computer Networks: The International Journal of Computer and Telecommunications Networking
Replicating data objects in large distributed database systems: an axiomatic game theoretic mechanism design approach

Distributed and Parallel Databases
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions

Computer Communications
Monitoring, aggregation and filtering for efficient management of virtual networks

Proceedings of the 7th International Conference on Network and Services Management
The three-criteria servers replication and topology assignment problem in wide area networks

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Document replication strategies for geographically distributed web search engines

Information Processing and Management: an International Journal

Quantified Score

Hi-index	0.24

Visualization

Abstract

Recently, several studies have looked into the problem of replicated server placement on the Internet. Some of those studies have demonstrated that there exists a replica placement algorithm that can perform within a factor of 1.1-1.5 of the optimal solution. However, this particular greedy algorithm requires detailed knowledge about network topology, and knowledge about expected client locations on the topology. One of these previous studies has also looked at topology-informed replica placement. They consider placing replicas at highly connected nodes in the Autonomous System level graph. In this paper, we extend their work by investigating the performance of topology-informed placement on Internet router-level topology. In our evaluation, we consider approximated policy-based paths, and examine the sensitivity of our results to different client placements. We find that topology-informed replica placement methods can achieve average client latencies which are within a factor of 1.1-1.2 of the greedy algorithm, but only if the placement method is designed carefully.