Query routing in the TerraDir distributed directory

Bujor Silaghi; Samrat Bhattacharjee; Peter J. Keleher

doi:10.1117/12.475281

Translator Disclaimer

8 July 2002 Query routing in the TerraDir distributed directory

Bujor Silaghi, Samrat Bhattacharjee, Peter J. Keleher

Author Affiliations +

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