Distributed Search in P2P Networks
IEEE Internet Computing
A distributed JXTA-based architecture for searching and retrieving solar data
Future Generation Computer Systems - Special issue: P2P computing and interaction with grids
Distributed random digraph transformations for peer-to-peer networks
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Resource-Aware Update Policy for Highly Dynamic P2P Networks
WI-IATW '07 Proceedings of the 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops
The power of memory in randomized broadcasting
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Leveraging web-services and peer-to-peer networks
CAiSE'03 Proceedings of the 15th international conference on Advanced information systems engineering
Reliable broadcasting in random networks and the effect of density
INFOCOM'10 Proceedings of the 29th conference on Information communications
Efficient broadcasting in random power law networks
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
| Hi-index | 0.00 |
The goal of this paper is to review and classify the different approaches to search in peer-to-peer networks. We then describe the approach implemented in JXTA search. JXTA is an open peer-to-peer network environment. JXTA search is a network of hubs that index the content of a peer-to-peer network. Finally, we propose an organization of the JXTA search hubs, which reduces the storage and communication requirements between the hubs.