Hierarchical Routing with Soft-State Replicas in TerraDir

In The 18th International Parallel and Distributed Processing Symposium, April 2004.

Bujor Silaghi, Vijay Gopalakrishnan, Bobby Bhattacharjee and Pete Keleher


Abstract:
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. 

@inProceedings{ipdps04,
	title = "Hierarchical Routing with Soft-State Replicas in TerraDir",
	author = "Bujor Silaghi and Vijay Gopalakrishnan and Bobby Bhattacharjee and Pete Keleher",
	booktitle = {The 18th International Parallel and Distributed Processing Symposium},
	month = {April},
	year = {2004},
}

Available: bibtex, abstract,
Edit