Sciweavers

473 search results - page 7 / 95
» Local Search in Unstructured Networks
Sort
View
LCN
2007
IEEE
14 years 5 months ago
Search Algorithms for Unstructured Peer-to-Peer Networks
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
Reza Dorrigiv, Alejandro López-Ortiz, Pawel...
AINA
2007
IEEE
14 years 5 months ago
A Class-Based Search System in Unstructured P2P Networks
— Efficient searching is one of the important design issues in peer-to-peer (P2P) networks. Among various searching techniques, semantic-based searching has drawn significant a...
Juncheng Huang, Xiuqi Li, Jie Wu
ICPP
2005
IEEE
14 years 4 months ago
A Hybrid Searching Scheme in Unstructured P2P Networks
The existing searching schemes in Peer-to-Peer (P2P) networks are either forwarding-based or non-forwarding based. In forwarding-based schemes, queries are forwarded from the quer...
Xiuqi Li, Jie Wu
COMCOM
2008
127views more  COMCOM 2008»
13 years 11 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...
ICDE
2006
IEEE
190views Database» more  ICDE 2006»
14 years 4 months ago
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
Elke Michlmayr