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

Berlin, Germany May 21-May 24

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/CCGRID.2002.1017187

Second IEEE International Symposium o ...

	This Article
	PURCHASE ARTICLE: $0 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by M. Kelaskar Articles by V. Matossian Articles by P. Mehra Articles by D. Paul Articles by M. Parashar

	ASCII Text	x
	M. Kelaskar, V. Matossian, P. Mehra, D. Paul, M. Parashar, "A Study of Discovery Mechanisms for Peer-to-Peer Applications," Cluster Computing and the Grid, IEEE International Symposium on, pp. 444, Second IEEE International Symposium on Cluster Computing and the Grid (CCGRID'02), 2002.

	BibTex	x
	@article{ 10.1109/CCGRID.2002.1017187, author = {M. Kelaskar and V. Matossian and P. Mehra and D. Paul and M. Parashar}, title = {A Study of Discovery Mechanisms for Peer-to-Peer Applications}, journal ={Cluster Computing and the Grid, IEEE International Symposium on}, volume = {0}, year = {2002}, isbn = {0-7695-1582-7}, pages = {444}, doi = {http://doi.ieeecomputersociety.org/10.1109/CCGRID.2002.1017187}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Cluster Computing and the Grid, IEEE International Symposium on TI - A Study of Discovery Mechanisms for Peer-to-Peer Applications SN - 0-7695-1582-7 SP EP A1 - M. Kelaskar, A1 - V. Matossian, A1 - P. Mehra, A1 - D. Paul, A1 - M. Parashar, PY - 2002 KW - Peer-to-peer KW - discovery KW - content location KW - CHORD KW - CAN KW - Pastry KW - flooding KW - forward routing VL - 0 JA - Cluster Computing and the Grid, IEEE International Symposium on ER -

D. Paul

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.

Index Terms:

Peer-to-peer, discovery, content location, CHORD, CAN, Pastry, flooding, forward routing

Citation:

M. Kelaskar, V. Matossian, P. Mehra, D. Paul, M. Parashar, "A Study of Discovery Mechanisms for Peer-to-Peer Applications," ccgrid, pp.444, Second IEEE International Symposium on Cluster Computing and the Grid (CCGRID'02), 2002

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.