Dominating-Set-Based Searching in Peer-to-Peer Networks
作者： Chunlin Yang , Jie Wu
DOI: 10.1007/978-3-540-24679-4_67
关键词:
摘要: The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. searching problem is a basic issue that addresses the question “Where X”. Breadth-first search, mechanism used Gnutella networks [4], floods to maximize return results. Depth-first search Freenet [3] retrieves popular files faster than other but on average results are not maximized. Other algorithms networks, such as iterative deepening [9], local indices routing [2] NEVRLATE [1] provide different improved mechanisms. In this paper, we propose dominating-set-based algorithm of while keeping low cost both creating/maintaining connected-dominating-set (CDS) network. This approach based random walk. However, space restricted dominating nodes. Simulation been done compared with one using regular
springer.com
sci-hub.st 参考文章(10)
Indranil Gupta, Ken Birman, Prakash Linga, Al Demers, Robbert van Renesse, Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead international workshop on peer to peer systems. pp. 160- 169 ,(2003) , 10.1007/978-3-540-45172-3_15
Jie Wu, Hailan Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks international workshop on discrete algorithms and methods for mobile computing and communications. pp. 7- 14 ,(1999) , 10.1145/313239.313261
L. GARCÉS-ERICE, E. W. BIERSACK, K. W. ROSS, P. A. FELBER, G. URVOY-KELLER, Hierarchical peer-to-peer systems Parallel Processing Letters. ,vol. 13, pp. 643- 657 ,(2003) , 10.1142/S0129626403001574
A.T. Mizrak, Yuchung Cheng, Vineet Kumar, S. Savage, Structured superpeers: leveraging heterogeneity to provide constant-time lookup Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003. pp. 104- 111 ,(2003) , 10.1109/WIAPP.2003.1210294
A. Chander, S. Dawson, P. Lincoln, D. Stringer-Calvert, NEVRLATE: Scalable Resource Discovery cluster computing and the grid. pp. 382- 382 ,(2002) , 10.1109/CCGRID.2002.1017165
Zhiyong Xu, Rui Min, Yiming Hu, HIERAS: a DHT based hierarchical P2P routing algorithm international conference on parallel processing. pp. 187- 194 ,(2003) , 10.1109/ICPP.2003.1240580
B. Yang, H. Garcia-Molina, Improving search in peer-to-peer networks international conference on distributed computing systems. pp. 5- 14 ,(2002) , 10.1109/ICDCS.2002.1022237
A. Crespo, H. Garcia-Molina, Routing indices for peer-to-peer systems international conference on distributed computing systems. pp. 23- 32 ,(2002) , 10.1109/ICDCS.2002.1022239
M. Krishna Ramanathan, V. Kalogeraki, J. Pruyne, Finding good peers in peer-to-peer networks international parallel and distributed processing symposium. pp. 158- ,(2002) , 10.1109/IPDPS.2002.1015499
M. Portmann, A. Seneviratne, The cost of application-level broadcast in a fully decentralized peer-to-peer network international symposium on computers and communications. pp. 941- 946 ,(2002) , 10.1109/ISCC.2002.1021785