DocumentCode
2526291
Title
A Study of Discovery Mechanisms for Peer-to-Peer Applications
Author
Kelaskar, M. ; Matossian, V. ; Mehra, P. ; Paul, D. ; Parashar, M.
fYear
2002
fDate
21-24 May 2002
Firstpage
444
Lastpage
444
Abstract
Peer-to-peer applications allow peers to connect or disconnect 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 to the 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.
Keywords
CAN; CHORD; Pastry; Peer-to-peer; content location; discovery; flooding; forward routing; Application software; Distributed computing; Floods; Network topology; Peer to peer computing; Protocols; Resource management; Robustness; Routing; Wire; CAN; CHORD; Pastry; Peer-to-peer; content location; discovery; flooding; forward routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Cluster Computing and the Grid, 2002. 2nd IEEE/ACM International Symposium on
Print_ISBN
0-7695-1582-7
Type
conf
DOI
10.1109/CCGRID.2002.1017187
Filename
1540507
Link To Document