Distributed Object Location in a Dynamic Network

Distributed Object Location in a Dynamic Network (2004)

by Kirsten Hildrum , John D. Kubiatowicz , Satish Rao , Ben Y. Zhao

Citations:

Datum	Value	Source
TITLE	Theory of Computing Systems	SVM HeaderParse 0.1
AUTHOR NAME	Kirsten Hildrum	SVM HeaderParse 0.1
AUTHOR ADDR	Berkeley, CA 94720, USA	SVM HeaderParse 0.1
AUTHOR NAME	John D. Kubiatowicz	SVM HeaderParse 0.1
AUTHOR ADDR	Berkeley, CA 94720, USA	SVM HeaderParse 0.1
AUTHOR NAME	Satish Rao	SVM HeaderParse 0.1
AUTHOR ADDR	Berkeley, CA 94720, USA	SVM HeaderParse 0.1
AUTHOR NAME	Ben Y. Zhao	SVM HeaderParse 0.1
AUTHOR ADDR	Berkeley, CA 94720, USA	SVM HeaderParse 0.1
ABSTRACT	Abstract. Modern networking applications replicate data and services widely, leading to a need for location-independent routing—the ability to route queries to objects using names independent of the objects ’ physical locations. Two important properties of such a routing infrastructure are routing locality and rapid adaptation to arriving and departing nodes. We show how these two properties can be efficiently achieved for certain network topologies. To do this, we present a new distributed algorithm that can solve the nearest-neighbor problem for these networks. We describe our solution in the context of Tapestry, an overlay network infrastructure that employs techniques proposed by Plaxton et al. [24]. 1.	SVM HeaderParse 0.1
CITATIONS	37 found	ParsCit 1.0