Scalable P2P Search

	This Article
	Subscribers, please Login Purchase article: $19 PDF HTML IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Daniel A. Menasc?

Scalable P2P Search

March/April 2003 (vol. 7 no. 2)

pp. 83-87

	ASCII Text	x
	Daniel A. Menasc?, "Scalable P2P Search," IEEE Internet Computing, vol. 7, no. 2, pp. 83-87, March/April, 2003.

	BibTex	x
	@article{ 10.1109/MIC.2003.1189193, author = {Daniel A. Menasc?}, title = {Scalable P2P Search}, journal ={IEEE Internet Computing}, volume = {7}, number = {2}, issn = {1089-7801}, year = {2003}, pages = {83-87}, doi = {http://doi.ieeecomputersociety.org/10.1109/MIC.2003.1189193}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - MGZN JO - IEEE Internet Computing TI - Scalable P2P Search IS - 2 SN - 1089-7801 SP83 EP87 EPD - 83-87 A1 - Daniel A. Menasc?, PY - 2003 VL - 7 JA - IEEE Internet Computing ER -

Daniel A. Menasc?, George Mason University

PA probabilistic approach to resource-location can provide an efficient search mechanism for peer-to-peer systems.

Citation:

Daniel A. Menasc?, "Scalable P2P Search," IEEE Internet Computing, vol. 7, no. 2, pp. 83-87, Mar./Apr. 2003, doi:10.1109/MIC.2003.1189193

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