Probabilistic scalable P2P resource location services

Scalable resource discovery services form the core of directory and other middleware services. Scalability requirements preclude centralized solutions. The need to have directory services that are highly robust and that can scale with the number of resources and the performance of individual nodes, points to Peer-to-Peer (P2P) architectures as a promising approach. The resource location problem can be simply stated as "given a resource name, find the location of a node or nodes that manage the resource." We call this the deterministic location problem. In a very large network, it is clearly not feasible to contact all nodes to locate a resource. Therefore, we modify the problem statement to "given a resource name, find with a given probability, the location of a node or nodes that manage the resource." We call this a probabilistic location approach. We present a protocol that solves this problem and develop an analytical model to compute the probability that a dire...

• Type: Journal
• Year: 2002
• Where: SIGMETRICS
• Authors: Daniel A. Menascé, Lavanya Kanchanapalli
• Keywords: Hardware, Location Problem, Resource, Scalable Resource Discovery, SIGMETRICS 2002