The Community for Technology Leaders
2013 IEEE 33rd International Conference on Distributed Computing Systems (1999)
Austin, Texas
May 31, 1999 to June 4, 1999
ISBN: 0-7695-0222-9
pp: 0101
Amit Aggarwal , University of Washington
Rajmohan Rajaraman , Rutgers University
Irina Rabinovich , The Dunn & Bradstreet Corp.
This paper proposes a protocol suite for dynamic replication and migration of Internet objects. It consists of an algorithm for deciding on the number and location of object replicas and an algorithm for distributing requests among currently available replicas. Our approach attempts to place replicas in the vicinity of a majority of requests while ensuring at the same time that no servers are overloaded. The request distribution algorithm uses the same simple mechanism to take into account both server proximity and load, without actually knowing the latter. The replica placement algorithm executes autonomously on each node, without the knowledge of other object replicas in the system.The proposed algorithms rely on the information available in databases maintained by Internet routers. A simulation study using synthetic workloads and the network backbone of UUNET, one of the largest Internet service providers, shows that the proposed protocol is effective in eliminating hot spots and achieves a significant reduction in backbone traffic and server response time at the expense of creating only a small number of extra replicas.
Dynamic replication and migration, scalability, Web hosting.
Amit Aggarwal, Rajmohan Rajaraman, Irina Rabinovich, Michael Rabinovich, "A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 0101, 1999, doi:10.1109/ICDCS.1999.776511
98 ms
(Ver 3.3 (11022016))