Proceedings of the Sixth International Workshop on Web Caching and Content Distribution

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 di erent client placements. We nd that topologyinformed 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.

[1]  Arun Venkataramani,et al.  Bandwidth constrained placement in a WAN , 2001, PODC '01.

[2]  Lei Gao,et al.  Resource management for scalable disconnected access to Web services , 2001, WWW '01.

[3]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  Deborah Estrin,et al.  The impact of routing policy on Internet paths , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Douglas S. Reeves,et al.  Optimal Web cache sizing: scalable methods for exact solutions , 2001, Comput. Commun..

[7]  Katia Obraczka,et al.  Network latency metrics for server proximity , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[8]  Randy H. Katz,et al.  An analysis of multicast forwarding state scalability , 2000, Proceedings 2000 International Conference on Network Protocols.

[9]  Virgílio A. F. Almeida,et al.  In search of invariants for e-business workloads , 2000, EC '00.

[10]  P. Krishnan,et al.  The cache location problem , 2000, TNET.

[11]  Virgílio A. F. Almeida,et al.  Business-oriented resource management policies for e-commerce servers , 2000, Perform. Evaluation.

[12]  George Cybenko,et al.  How dynamic is the Web? , 2000, Comput. Networks.

[13]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[14]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[15]  W. Matthews,et al.  Internet end-to-end performance monitoring for the High Energy Nuclear and Particle Physics community , 2000 .

[16]  Amin Vahdat,et al.  Active Names: flexible location and transport of wide-area resources , 1999, Proceedings DARPA Active Networks Conference and Exposition.

[17]  David R. Cheriton,et al.  Scalable Web Caching of Frequently Updated Objects Using Reliable Multicast , 1999, USENIX Symposium on Internet Technologies and Systems.

[18]  Hongsuda Tangmunarunkit,et al.  Scaling of multicast trees: comments on the Chuang-Sirbu scaling law , 1999, SIGCOMM '99.

[19]  P. Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[20]  Martin van den Berg,et al.  Focused Crawling: A New Approach to Topic-Specific Web Resource Discovery , 1999, Comput. Networks.

[21]  Linwei,et al.  Web prefetching between low-bandwidth clients and proxies , 1999 .

[22]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[23]  Jin Zhang,et al.  Active Cache: caching dynamic contents on the Web , 1999, Distributed Syst. Eng..

[24]  Edith Cohen,et al.  Improving end-to-end performance of the Web using server volumes and proxy filters , 1998, SIGCOMM '98.

[25]  Bo Li,et al.  On the Optimal Placement of Web Proxies in the Internet: The Linear Topology , 1998, HPN.

[26]  Divesh Srivastava,et al.  Interaction of query evaluation and buffer management for information retrieval , 1998, SIGMOD '98.

[27]  Michael Dahlin,et al.  Using leases to support server-driven consistency in large-scale systems , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[28]  Balachander Krishnamurthy,et al.  Piggyback Server Invalidation for Proxy Cache Coherency , 1998, Comput. Networks.

[29]  Anja Feldmann,et al.  The changing nature of network traffic: scaling phenomena , 1998, CCRV.

[30]  Paul Barford,et al.  The network effects of prefetching , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[31]  Darrell D. E. Long,et al.  Exploring the Bounds of Web Latency Reduction from Caching and Prefetching , 1997, USENIX Symposium on Internet Technologies and Systems.

[32]  Anja Feldmann,et al.  Rate of Change and other Metrics: a Live Study of the World Wide Web , 1997, USENIX Symposium on Internet Technologies and Systems.

[33]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[34]  Chengjie Liu,et al.  Maintaining strong cache consistency in the World-Wide Web , 1997, Proceedings of 17th International Conference on Distributed Computing Systems.

[35]  Virgílio A. F. Almeida,et al.  Characterizing reference locality in the WWW , 1996, Fourth International Conference on Parallel and Distributed Information Systems.

[36]  Jeffrey C. Mogul,et al.  Using predictive prefetching to improve World Wide Web latency , 1996, CCRV.

[37]  Mark Crovella,et al.  Characteristics of WWW Client-based Traces , 1995 .

[38]  Steven Glassman,et al.  A Caching Relay for the World Wide Web , 1994, Comput. Networks ISDN Syst..

[39]  V. Paxson,et al.  Wide-area traffic: the failure of Poisson modeling , 1994, SIGCOMM.

[40]  Michael R. Macedonia,et al.  MBone provides audio and video across the Internet , 1994, Computer.

[41]  Pang-Ning Tan,et al.  Modeling of Web Robot Navigational Patterns , 2000 .

[42]  Themistoklis Palpanas,et al.  Web prefetching using partial match prediction , 1998 .

[43]  James S. Gwertzman,et al.  An Analysis of Geographical Push-Caching , 1997 .

[44]  M. Klemettinen,et al.  Www Robots and Search Engines , 1996 .

[45]  James Gwertzman,et al.  Autonomous Replication in Wide-Area Internetworks , 1995 .