Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Introduction to algorithms
Fundamentals of Sequential and Parallel Algorithms
Fundamentals of Sequential and Parallel Algorithms
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
Probabilistic scalable P2P resource location services
ACM SIGMETRICS Performance Evaluation Review
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Flexible Information Discovery in Decentralized Distributed Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Scalable, Efficient Range Queries for Grid Information Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Location based placement of whole distributed systems
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
The bittorrent p2p file-sharing system: measurements and analysis
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
| Hi-index | 0.00 |
There is an emerging trend of using P2P systems for computational and data intensive tasks, such as online collaborations, distributed database applications and message passing interface (MPI) algorithms. For better resource utilization in these and similar applications, it is necessary to discover the resource capabilities of the collaborating peers. Another requirement of these applications is to locate the optimal resource based on a search criteria, e.g., to seek a resource with earliest execution time. We define this kind of routing as expression based routing. However, in the absence of the centralized controlling node, tracking the capabilities of the participating peers is very difficult. Moreover peers join and leave the system dynamically and, thus, makes the discovery of a desired resource even more complex. In this paper we investigate a novel algorithm for expression based routing in a P2P system. It evaluates peer u such that lu (the value of u) is minimum where e.g. lu is load of the peer u. Our contribution includes a detailed algorithm to search for the least loaded peer in the system. We analyze the accuracy and cost of our proposed algorithm through detailed simulations.