Hierarchical routing with soft-state replicas in TerraDir

TitleHierarchical routing with soft-state replicas in TerraDir
Publication TypeConference Papers
Year of Publication2004
AuthorsSilaghi B, Gopalakrishnan V, Bhattacharjee B, Kelcher P
Conference NameParallel and Distributed Processing Symposium, 2004. Proceedings. 18th International
Date Published2004/04//
Keywordsad-hoc, adaptive, allocation;, asymmetrical, balancing;, bottlenecks;, consistency, constraints;, delivering;, demand, distribution;, guarantees;, hierarchical, latency, load, low, namespaces;, peer-to-peer, protocol;, protocols;, replica, replicas;, replication, resource, routing;, soft-state, systems;, TerraDir;, topological

Summary form only given. Recent work on peer-to-peer systems has demonstrated the ability to deliver low latencies and good load balance when demand for data is relatively uniform. We describe an adaptive replication protocol that delivers low latencies, good load balance even when demand is heavily skewed. The protocol can withstand arbitrary and instantaneous changes in demand distribution. Our approach also addresses classical concerns related to topological constraints of asymmetrical namespaces, such as hierarchical bottlenecks in the context of hierarchical namespaces. The protocol replicates routing state in an ad-hoc manner based on profiled information, is lightweight, scalable, and requires no replica consistency guarantees.