'Dominating-set-based' searching in peer-to-peer networks

Authors:
Chunlin Yang;Xiuqi Li
Affiliations:
Siemens Network Convergence LLC, 33487 Boca Raton, FL, USA.;Department of Computer Science and Engineering, Florida Atlantic University, 33431 Boca Raton, FL, USA
Venue:
International Journal of High Performance Computing and Networking
Year:
2005

Citing 7
Cited 2

On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Finding Good Peers in Peer-to-Peer Networks

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup

WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
The Cost of Application-Level Broadcast in a Fully Decentralized Peer-to-Peer Network

ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Routing Indices For Peer-to-Peer Systems

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Improving Search in Peer-to-Peer Networks

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
NEVRLATE: Scalable Resource Discovery

CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid

A hybrid searching scheme in unstructured P2P networks

International Journal of Parallel, Emergent and Distributed Systems
ISRL: intelligent search by reinforcement learning in unstructured peer-to-peer networks

International Journal of Parallel, Emergent and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The 'peer-to-peer' network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the question 'Where is X?'. In this paper, we propose a 'dominating-set-based', 'peer-to-peer' searching algorithm to maximise the return of searching results while keeping a low cost for both searching and creating/maintaining the 'connected dominating set' (CDS) of the 'peer to peer' network. This approach is based on random walk. However, the searching space is restricted to dominating nodes. Simulation has been done and results are compared with the one using regular random walk.