Proceedings ArticleDOI
Locating nearby copies of replicated Internet servers
James D. Guyton,Michael F. Schwartz +1 more
- Vol. 25, Iss: 4, pp 288-298
TLDR
This paper considers the problem of choosing among a collection of replicated servers, focusing on the question of how to make choices that segregate client/server traffic according to network topology.Abstract:
In this paper we consider the problem of choosing among a collection of replicated servers, focusing on the question of how to make choices that segregate client/server traffic according to network topology. We explore the cost and effectiveness of a variety of approaches, ranging from those requiring routing layer support (e.g., anycast) to those that build location databases using application-level probe tools like traceroute. We uncover a number of tradeoffs between effectiveness, network cost, ease of deployment, and portability across different types of networks. We performed our experiments using a simulation parameterized by a topology collected from 7 survey sites across the United States, exploring a global collection of Network Time Protocol servers.read more
Citations
More filters
Proceedings ArticleDOI
Predicting Internet network distance with coordinates-based approaches
T.S.E. Ng,Hui Zhang +1 more
TL;DR: This work proposes using coordinates-based mechanisms in a peer-to-peer architecture to predict Internet network distance (i.e. round-trip propagation and transmission delay), and proposes the GNP approach, based on absolute coordinates computed from modeling the Internet as a geometric space.
Proceedings ArticleDOI
Topologically-aware overlay construction and server selection
TL;DR: In this paper, the authors present a binning scheme whereby nodes partition themselves into bins such that nodes that fall within a given bin are relatively close to one another in terms of network latency.
Proceedings ArticleDOI
Accessing nearby copies of replicated objects in a distributed environment
TL;DR: A simple randomized algorithm for accessing shared objects that tends to satisfy each access request with a nearby copy is designed, based on a novel mechanism to maintain and distribute information about object locations, and requires only a small amount of additional memory at each node.
Journal ArticleDOI
King: estimating latency between arbitrary internet end hosts
TL;DR: The accuracy of King is significantly better than the accuracy of IDMaps, and that King tends to preserve order among its latency estimates, as well as a variety of measurement studies and applications that could benefit from the tool.
Patent
Optimized network resource location
TL;DR: In this article, a client makes the request of the selected best repeater and the client is possibly rewritten to replace at least some of the resource identifiers contained therein with modified resource identifiers designating the repeater instead of the origin server.
References
More filters
ReportDOI
A hierarchical internet object cache
TL;DR: The design and performance of a hierarchical proxy-cache designed to make Internet information systems scale better are discussed, and performance measurements indicate that hierarchy does not measurably increase access latency.
Journal ArticleDOI
The Harvest information discovery and access system
TL;DR: Harvest as mentioned in this paper is a system that provides a scalable, customizable architecture for gathering, indexing, caching, replicating, and accessing Internet information, which can be used to collect, index, and extract data from the Internet.
Host Anycasting Service
TL;DR: This RFC describes an internet anycasting service for IP and tries to be agnostic about how the service is actually provided by the internetwork.
Proceedings ArticleDOI
The case for geographical push-caching
James S. Gwertzman,Margo Seltzer +1 more
TL;DR: This work presents an architecture that allows a Web server to autonomously replicate HTML pages and proposes geographical push-caching as a way of bringing the server back into the loop.