Query routing in the TerraDir distributed directory

Bujor Silaghi; Samrat Bhattacharjee; Peter J. Keleher

doi:10.1117/12.475281

8 July 2002 Query routing in the TerraDir distributed directory

Bujor Silaghi, Samrat Bhattacharjee, Peter J. Keleher

Proceedings Volume 4868, Scalability and Traffic Control in IP Networks II; (2002) https://doi.org/10.1117/12.475281
Event: ITCom 2002: The Convergence of Information Technologies and Communications, 2002, Boston, MA, United States

Abstract

We present the design and evaluation of the query-routing protocol of the TerraDir distributed directory. TerraDir is a wide-area distributed directory designed for hierarchical namespaces, and provides a lookup service for mapping keys to objects. We introduce distributed lookup and caching algorithms that leverage the underlying data hierarchy. Our algorithms provide efficient lookups while avoiding the load imbalances often associated with hierarchical systems. The TerraDir load balancing scheme also incorporates a node replication algorithm that provides configurable failure resilience with provably low overheads.

Citation Download Citation

Bujor Silaghi, Samrat Bhattacharjee, and Peter J. Keleher "Query routing in the TerraDir distributed directory", Proc. SPIE 4868, Scalability and Traffic Control in IP Networks II, (8 July 2002); https://doi.org/10.1117/12.475281

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available