A Self-Adaptive Model of Two-Level for Dynamic Peer-to-Peer Networks


Article Preview

The present thesis puts forward a hierarchical P2P model: self-adaptive P2P model of two-level. Super peers compose a self-adaptive DHT network on the top layer, and lower ordinary peers take super peer in the same group as their center server to form a cluster. Data are stored in ordinary peers and super peers hold indices of data and answer for request from ordinary peers. When super peer join or leave, it does not maintain consistency of entire network’s logic topology but only update routing table of its predecessor and successor, besides, super peers update their routing table cache when they transmit messages. The ordinary peers keep backup of super peer for system restore when super peer fails. System can optimize network structure by select peers with high capacity to be super peer and restrict amount of peers in each group.



Key Engineering Materials (Volumes 460-461)

Edited by:

Yanwen Wu




F. X. Huang and Z. J. Li, "A Self-Adaptive Model of Two-Level for Dynamic Peer-to-Peer Networks", Key Engineering Materials, Vols. 460-461, pp. 479-484, 2011

Online since:

January 2011




[1] FOSTER I. Service-Oriented Science : Science, Vol. 308 (2005),P. 814 – 817.

[2] YAN Bingheng, QIAN Depei. A Gateway-Based Framework for Data Interoperation between Grids : JOURNAL OF XI'AN JIAOTONG UNIVERSITY Vol. 43(2009) ,P. 20-24.

[3] GUO Suchang, YANG Bo, HUANG Hongzhong. Modeling and Analysis for Grid Service Reliability Considering Peer Recovery: JOURNAL OF XI'AN JIAOTONG UNIVERSITY Vol. 42(2008) ,P. 693-696, 790.

[4] LI Zhijie, CHENG Chuntian, HUANG Feixue, et al. A Sequential Game-Based Resource Allocation Strategy in Grid Environment: Journal of Software Vol. 17(2006) ,P. 2373-2383.

DOI: https://doi.org/10.1360/jos172373

[5] HUANG Fei-xue; JIANG Xin-na; LI Zhi-jie, et al. Task scheduling based on cost-time optimization of pruning strategy in economic grid: Journal of Dalian University of Technology Vol. 48(2008) ,P. 298-303.

[6] LI Zhijie, CHENG Chuntian, HUANG Feixue. Bid strategy for grid resource allocation based on linear cost function: SYSTEMS ENGINEERING - THEORY & PRACTICE, 2008, 28(4) ,P. 73-80.

[7] LI Zhijie, CHENG Chuntian, HUANG Feixue, et al. Grid resource allocation strategy based on maximum entropy method: SYSTEMS ENGINEERING AND ELECTRONICS Vol. 29(2007) ,P. 1738-1741.

[8] LIU Yang, GUI Xiaolin, XU Yuwen. Study on Scheduling Methods Based on Priorities in Grid Workflow: JOURNAL OF XI'AN JIAOTONG UNIVERSITY Vol. 40(2006) ,P. 411-414, 419.

[9] CHAKRAVARTI AJ, BAUMGARTNER G, LAURIA M. The organic grid: Self-organizing computation on a peer-to-peer networks: IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans Vol. 35(2005) ,P. 373-384.

DOI: https://doi.org/10.1109/tsmca.2005.846396

[10] FU Xianghua, FENG Boqin, MA Zhaofeng, et al. Grid Testing Engine: an Infrastructure for Constructing Grid Testing Environment: JOURNAL OF XI'AN JIAOTONG UNIVERSITY Vol. 39(2005) ,P. 1327-1330.

[11] YANG Zhi, ZHU Jun, DAI Yafei. Efficient Data Maintenance Scheme for Peer-to-Peer Storage Systems: Journal of Software Vol. 20(2009) ,P. 80-95.

DOI: https://doi.org/10.3724/sp.j.1001.2009.00080

[12] SKOBELTSYN G, LUU T, PODNAR ŽARKO I, et al. Query-driven indexing for scalable peer-to-peer text retrieval: Future Generation Computer Systems, Vol. 25(2009) ,P. 89-99.

DOI: https://doi.org/10.1016/j.future.2008.03.006

[13] STOICA I, MORRIS R, LIBEN-NOSTRONG D, et al. Chord: a scalable peer-to-peer lookup protocol for internet applications: IEEE/ACM Transactions on Networking Vol. 11 (2003) ,P. 17-32.

DOI: https://doi.org/10.1109/tnet.2002.808407

[14] RATSANAMY S, FRANCIS P, HANDLEY M, et al. A scalable content-addressable network: ACM SIGCOMM Computer Communication Review Vol. 31 (2001) ,P. 161 - 172.

DOI: https://doi.org/10.1145/964723.383072

[15] ZHAO B Y, HUANG L, STRIBLING J, et al. Tapestry: A Resilient Global-scale Overlay for Service Deployment: IEEE Journal on Selected Areas in Communications Vol. 22(2004) ,P. 41-53.

DOI: https://doi.org/10.1109/jsac.2003.818784

Fetching data from Crossref.
This may take some time to load.