TY - CONF T1 - Hierarchical routing with soft-state replicas in TerraDir T2 - Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International Y1 - 2004 A1 - Silaghi,B. A1 - Gopalakrishnan,Vijay A1 - Bhattacharjee, Bobby A1 - Kelcher,P. KW - ad-hoc KW - adaptive KW - allocation; KW - asymmetrical KW - balancing; KW - bottlenecks; KW - consistency KW - constraints; KW - delivering; KW - demand KW - distribution; KW - guarantees; KW - hierarchical KW - latency KW - load KW - low KW - namespaces; KW - peer-to-peer KW - protocol; KW - protocols; KW - replica KW - replicas; KW - replication KW - resource KW - routing; KW - soft-state KW - systems; KW - TerraDir; KW - topological AB - 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. JA - Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International M3 - 10.1109/IPDPS.2004.1302967 ER -