Sciweavers

31 search results - page 2 / 7
» Efficient and scalable query routing for unstructured peer-t...
Sort
View
COMCOM
2008
127views more  COMCOM 2008»
13 years 5 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...
ICCCN
2007
IEEE
13 years 9 months ago
Scalable Peer-to-Peer File Sharing with Efficient Complex Query Support
A good P2P file sharing system is usually expected to achieve the following design goals: scalability, routing efficiency and complex query support. In this paper, we propose such ...
Yan Li, Jyoti Ahuja, Li Lao, Jun-Hong Cui
CCGRID
2010
IEEE
13 years 6 months ago
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
Imen Filali, Fabrice Huet
DEXAW
2005
IEEE
125views Database» more  DEXAW 2005»
13 years 7 months ago
Exploiting Local Popularity to Prune Routing Indices in Peer-to-Peer Systems
Routing in unstructured peer-to-peer systems relies either on broadcasting (also called flooding) or on routing indices. An approach using routing indices is only scalable if the...
Stéphane Bressan, Achmad Nizar Hidayanto, Z...
TKDE
2011
528views more  TKDE 2011»
13 years 7 days ago
The CoQUOS Approach to Continuous Queries in Unstructured Overlays
—The current peer-to-peer (P2P) content distribution systems are constricted by their simple on-demand content discovery mechanism. The utility of these systems can be greatly en...
Lakshmish Ramaswamy, Jianxia Chen