bramp.net

Idris A. Rai, Andrew Brampton, Andrew MacQuire, and Laurent Mathy. In proceedings of the 4th International Workshop on Peer-to-Peer Systems (HOTP2P'07) We propose several models based on discrete-time Markov chains for the analysis of Distributed Hash Tables (DHTs). Specifically, we examine the Pastry routing protocol, as well as a Stealth DHT adaptation of Pastry to compute ...

Andrew Brampton, Andrew MacQuire, Idris A. Rai, Nicholas J. P. Race, and Laurent Mathy. In proceedings of the 2nd Conference on Future Networking Technologies (CoNEXT'06) Most Distributed Hash Tables (DHTs) simply consider interconnecting homogeneous nodes on the same overlay. However, realistically nodes on a network are heterogeneous in terms of their capabilities. Because of this, traditional ...

Andrew MacQuire, Andrew Brampton, Idris A. Rai, and Laurent Mathy. In Proceedings of the 32nd Euromicro Conference on Software Engineering and Advanced Applications Most existing DHT algorithms assume that all nodes have equal capabilities. This assumption has previously been shown to be untrue in real deployments, where the heterogeneity of nodes can actually have a detrimental ...

Andrew MacQuire, Andrew Brampton, Idris A. Rai, and Laurent Mathy. In proceedings of the 3rd International Workshop on Mobile Peer-to-Peer Computing (MP2P'06) The advances in wireless networking and the consequent emergence of new applications that wireless networks increasingly support inevitably leads to low capability mobile nodes connecting to peer-to-peer networks. However, the characteristics of mobile nodes ...

Andrew Brampton, Andrew MacQuire, Idris A. Rai, Nicholas J. P. Race, and Laurent Mathy. In Proceedings of the ACM Conference on Emerging Network Experiments and Technology (CoNEXT) (Student Workshop Session), Toulouse, France, October 2005. Download