A Study of Discovery Mechanisms for Peer-to-Peer Applications

Authors:
M. Kelaskar;V. Matossian;P. Mehra;D. Paul;M. Parashar
Affiliations:
-;-;-;-;-
Venue:
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Year:
2002

Citing 0
Cited 4

Jelly: A Dynamic Hierarchical P2P Overlay Network with Load Balance and Locality

ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
An architecture for incorporating decentralized economic models in application layer networks

Multiagent and Grid Systems - Smart Grid Technologies & Market Models
Evaluation of DHTs from the viewpoint of interpersonal communications

Proceedings of the 6th international conference on Mobile and ubiquitous multimedia
Service organisation and information consistency for service grid

International Journal of Web and Grid Services

Quantified Score

Hi-index	0.00

Visualization

Abstract

Peer-to-peer applications allow peers to connect ordisconnect from a network at any time and are based on a loosely coupled resource distribution model. As a result,robust and efficient discovery mechanisms are central tothe efficient functioning of such applications. In this paper we evaluate four discovery mechanisms (flooding and the forward routing algorithms CHORD, Pastry and CAN) against the requirements of three prevalent classes of peer-to-peer applications, and investigate the suitability of these mechanisms for the applications.