Sciweavers

39 search results - page 1 / 8
» Analysis models for unguided search in unstructured P2P netw...
Sort
View
IJAHUC
2008
118views more  IJAHUC 2008»
13 years 4 months ago
Analysis models for unguided search in unstructured P2P networks
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
Bin Wu, Ajay D. Kshemkalyani
INFOCOM
2009
IEEE
13 years 11 months ago
Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
Stratis Ioannidis, Peter Marbach
APWEB
2008
Springer
13 years 6 months ago
SemSearch: A Scalable Semantic Searching Algorithm for Unstructured P2P Network
Resource searching in the current peer-to-peer (P2P) applications is mainly based on the keyword match. However, more and more P2P applications require an efficient semantic search...
Wei Song, Ruixuan Li, Zhengding Lu, Mudar Sarem
ICC
2009
IEEE
155views Communications» more  ICC 2009»
13 years 11 months ago
Modeling Random Walk Search Algorithms in Unstructured P2P Networks with Social Information
—Random walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algori...
Jing Xie, King-Shan Lui
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