A Peer-to-Peer Overlay Network Routing Algorithm Based on Multiple Circle Topology

doi:-

Journal of Northeastern University:Natural Science ›› 2013, Vol. 34 ›› Issue (1): 44-47.DOI: -

• 论著 • Previous Articles Next Articles

A Peer-to-Peer Overlay Network Routing Algorithm Based on Multiple Circle Topology

MA Yi¹， CHEN Dong-ming¹， CHANG Gui-ran²， TAN Zhen-hua¹

1. School of Software， Northeastern University， Shenyang 110819， China; 2. Computer Center， Northeastern University， Shenyang 110819， China.

Received:2012-03-29 Revised:2012-03-29 Online:2013-01-15 Published:2013-01-26
Contact: MA Yi
About author:-
Supported by:
-

Abstract

Abstract: The routing algorithm of randomly selecting neighbor nodes is mostly used in P2P applications， which decreases the routing efficiency and increases the routing hops. To solve this problem， a new routing algorithm named RMCT based on multiple circle topology was presented. Nodes were dynamically divided into a number of clusters which used sub-supernodes to manage. A short routing table based on constant grade was defined. In RMCT， maintaining the route table for nodes entering/exiting were presented， as well as the clusters building method and distributed election algorithm for sub-supernodes. Compared to the performance of such typical algorithms as Chord， the RMCT algorithm greatly improved the performance in regard to routing table maintaining， routing hops， and network delay. Simulations and analysis results showed that the RMCT was an efficient routing algorithm though some problems were to be studied further.

Key words: peer-to-peer, multiple circle topology, cluster, routing algorithm, DHT(distributed Hash table)

CLC Number:

TP393

MA Yi， CHEN Dong-ming， CHANG Gui-ran， TAN Zhen-hua. A Peer-to-Peer Overlay Network Routing Algorithm Based on Multiple Circle Topology[J]. Journal of Northeastern University:Natural Science, 2013, 34(1): 44-47.

References

[1]Jacky C，Kevin L，Neil L B.An evaluation of Chord using traces of peer-to-peer files sharing［C］//SIGMETRICS 2004/Performance 2004:Joint International Conference on Measurement and Modeling of Computer Systems.New York:Association for Computing Machinery Press，2004:432-433.
[2]Rowstron A，Druschel P.Pastry:scalable，distributed object location and routing for large-scale peer-to-peer systems［J］.Lecture Notes in Computer Science，2001，2218:329-350.
[3]Zhao B Y，Kubiatowicz J，Joseph A D.Tapestry:an infrastructure for fault-tolerant wide-area location and routing［R］.Berkeley:University of California，2001.
[4]Ratnasamy S，Francis P，Handley M，et al.A scalable content-addressable network［C］//Proceedings of the 2001 Conference on Applications，Technologies，Architectures，and Protocols for Computer Communications.New York:Association for Computing Machinery Press，2001:161-172.
[5]Jain S，Mahajan R，Wetherall D.A study of the performance potential of DHT-based overlays［C］//Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003).Berkeley:USENIX Association，2003:252-266.
[6]胡进锋，黎明，郑纬民，等.带宽自适应的P2P 网络路由协议［J］.软件学报，2006，16(5):991-999.(Hu Jin-feng，Li Ming，Zheng Wei-min，et al.A self-adaptive peer-to-peer routing protocol［J］.Journal of Software，2006，16(5):991-999.)
[7]Xiao W J，He M X，Liang H M.CayleyCCC:a robust P2P overlay network with simple routing and small-world features［J］.Journal of Networks，2011，6(9):1247-1253.
[8]Gupta A，Liskov B，Rodrigues R.One hop lookups for peer-to-peer overlays［C］//Proceedings of the 9th Workshop on Hot Topics in Operating Systems.Hawaii:USENIX Association，2003:6-12.
[9]Joung Y J，Wang J C.Chord2:a two-layer Chord for reducing maintenance overhead via heterogeneity［J］.Computer Networks，2007，51(3):712-731.
[10]Fan D M，Zhu Q.Research of adaptive routing method on P2P network［J］.International Journal of Digital Content Technology and Its Applications，2011，5(4):296-301.

[1]	GENG Rong， ZHANG Zhao， NIU Tian-shui， WANG Yu-fei. Research and Simulation of Space-based Resource Scheduling Based on Improved Ant Colony Algorithm [J]. Journal of Northeastern University(Natural Science), 2023, 44(2): 168-176.
[2]	MA Shu-hua， YOU Hai-rong， TANG Liang， HE Ping. An Adaptive Density Peak Clustering Algorithm [J]. Journal of Northeastern University(Natural Science), 2022, 43(6): 761-768.
[3]	LIU Jun， DAI Fu-cheng， XIN Ning. Virtual Machine Placement Strategy Based on Multi-objective Optimization [J]. Journal of Northeastern University(Natural Science), 2022, 43(5): 609-617.
[4]	LI Jian-hua， ZHU Ze-yang， XU Li-sheng， SUN Guo-zhe. Interpolation of Missing Physiological Data of ICU Patients Based on Deep Embedded Clustering [J]. Journal of Northeastern University(Natural Science), 2022, 43(5): 639-645.
[5]	ZHENG Yan， JIANG Yuan-xiang. Speaker Clustering Algorithm Based on Feature Fusion [J]. Journal of Northeastern University(Natural Science), 2021, 42(7): 952-959.
[6]	MAO Ya-chun， FU Yu-wen， CAO Wang， ZHAO Zhan-guo. Extraction Method of Open Pit Mine Car Based on UAV Point Cloud Data [J]. Journal of Northeastern University(Natural Science), 2021, 42(6): 842-849.
[7]	LI Zhen-ni, LI Jing-jiao, WANG Jiao, YANG Dan. Deadlock-Free Routing Algorithm of 2D-Torus Network-on-Chip Based on FPGA [J]. Journal of Northeastern University(Natural Science), 2021, 42(1): 1-6.
[8]	WANG Shu-hong， ZHU Bao-qiang， WANG Peng-yu. Application of Simulated Annealing Clustering Algorithm in Grouping of Discontinuity Orientation [J]. Journal of Northeastern University Natural Science, 2020, 41(9): 1328-1333.
[9]	SI Fang-yuan， HAN Ying-hua， ZHAO Qiang， WANG Jin-kuan. Verification of Distribution Network Connectivity Based on AP-LOF Outlier Group Detection [J]. Journal of Northeastern University Natural Science, 2020, 41(8): 1070-1074.
[10]	LIU Xin， ZHANG Wei-jun， SHI Quan， ZHOU Le. Operation Parameters Optimization of Blast Furnaces Based on Data Mining and Cleaning [J]. Journal of Northeastern University Natural Science, 2020, 41(8): 1153-1160.
[11]	GUO Jia-teng， ZHANG Zi-rui， MAO Ya-chun， LIU Shan-jun. Automatic Discontinuity Classification and Parameter Calculation from Rock Mass 3D Point Cloud [J]. Journal of Northeastern University Natural Science, 2020, 41(8): 1161-1166.
[12]	WU Chao， LI Yuan-hui， XU Shuai， DAI Xing-hang. Method for Determining the Lower Limit of Statistical Joints Trace Length in Underground Engineering Rock Mass [J]. Journal of Northeastern University Natural Science, 2020, 41(8): 1167-1173.
[13]	LI Chen， ZHANG Jia-wei， ZHANG Hao， WANG Qian. Generative Adversarial Networks Based Pathological Images Classification of Poorly Differentiated Cervical Cancer [J]. Journal of Northeastern University Natural Science, 2020, 41(7): 1054-1061.
[14]	YU Zhen-liang， SUN Zhi-li， ZHANG Yi-bo， WANG Jian. A Structural Reliability Analysis Method Based on Adaptive PC-Kriging Model [J]. Journal of Northeastern University Natural Science, 2020, 41(5): 667-672.
[15]	CHEN Dong-ming， YUAN Ze-zhi， HUANG Xin-yu， WANG Dong-qi. Node Similarity Measurement and Link Prediction Algorithm in Temporal Networks [J]. Journal of Northeastern University Natural Science, 2020, 41(1): 29-35.

A Peer-to-Peer Overlay Network Routing Algorithm Based on Multiple Circle Topology

RichHTML

PDF (PC)

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

Comments