Sciweavers

6 search results - page 1 / 2
» Optimizing Capacity-Heterogeneous Unstructured P2P Networks ...
Sort
View
CN
2007
148views more  CN 2007»
13 years 4 months ago
Optimizing random walk search algorithms in P2P networks
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
Nabhendra Bisnik, Alhussein A. Abouzeid
INFOCOM
2009
IEEE
13 years 11 months ago
Budget-Based Self-Optimized Incentive Search in Unstructured P2P Networks
—Distributed object search is the primary function of Peer-to-Peer (P2P) file sharing system to locate and transfer the file. The predominant search schemes in unstructured P2P...
Yi Hu, Min Feng, Laxmi N. Bhuyan, Vana Kalogeraki
TON
2008
149views more  TON 2008»
13 years 4 months ago
Building heterogeneous peer-to-peer networks: protocol and analysis
In this paper, we propose a simple protocol for building heterogeneous unstructured peer-to-peer (P2P) networks. The protocol consists of two parts--the joining process and the reb...
Kin Wah Kwong, Danny H. K. Tsang
INFOCOM
2006
IEEE
13 years 10 months ago
Performance of Full Text Search in Structured and Unstructured Peer-to-Peer Systems
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
Yong Yang, Rocky Dunlap, Mike Rexroad, Brian F. Co...