P2P网络非对称DHT方法及负载均衡技术研究

doi:1000-436X(2007)09-0060-08

Abstract

Abstract:

Asymmetric structure P2P-ASP2P was presented for constructing and optimizing P2P network in heterogene-ous environments.ASP2P introduced a compositive proximity metric including parameters such as reliability,bandwidth and latency for selecting neighbors.Neighbor selection algorithm and routing algorithm were both based on this compo-sitive proximity metric.A load balance mechanism was introduced to avoid overload of nodes.Simulations show that ASP2P can fit the heterogeneous networks better.By the simulation results,the average path length in form of hops of random messages was reduced to 50% of that in basic Chord network; the average delay was reduced to 65%,while the overload of fat nodes was effectively controlled.

Key words: computer networks, distributed hash table, load balancing, self-adaptation

San-feng ZHANG,Guo-xin WU. Study of asymmetric DHT method and load balancing in P2P network[J]. Journal on Communications, 2007, 28(9): 60-67.

Figures/Tables 9

References 19

[1]	KARGER D , KAASHOEK F , STOICA I . Chord: a scalable peer-to-peer lookup service for Internet applications[A]. Proceedings of ACM SIGCOMM[C]. San Diego, 2001. 140-160.
[2]	RATNASAMY S , FRANCES P , HANDLEY M . A scalable con-tent-addressable network[A]. Proceedings of ACM SIGCOMM[C]. San Diego, 2001. 161-172.
[3]	ZHAO B Y , HUANG L , STRIBLING J . Tapestry: a resilient global-scale overlay for service deployment[J]. IEEE Journal on Se-lected Areas in Communications, 2004,22(1): 41-53.
[4]	ROWSTRO A , DRUSCHEL P . Pastry: scalable,decentralized object location and routing for large-scale peer-to-peer systems [A].Proceedings of ACM/IFIP/USENIX Middleware 2001[C]. Heidelberg,Germany, 2001. 329-350.
[5]	LI D , LU X , WU J . FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs[A]. Proceedings of IEEE INFOCOM[C]. 2005. 1677-1688.
[6]	FRANS K , KARGER D . Koorde: a simple degree-optimal distributed hash table[A]. Proceedings of IPTPS 2003[C]. Berkeley, 2003. 98-107.
[7]	LOGUINOV D , KUMAR A , RAI V . Graph theoretic analysis of structured peer-to-peer systems: routing distances and fault resil-ience[A]. Proceedings of SIGCOMM[C]. Karlsruhe, 2003. 395-406.
[8]	XU J , KUMMAR A , YU X . On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks[J]. IEEE Journal on Selected Areas in Communications (JSAC), 2004,22(1): 151-163.
[9]	CASTRO M , DRUSCHEL P , HU Y . Proximity Neighbor Selection in Tree-Based Structured Peer-to-Peer Overlays[R]. MSR-TR-2003-52,Microsoft Research, 2003.
[10]	GUMMADI K , GUMMADI R , GRIBBLE S . The impact of DHT routing geometry on resilience and proximity[A]. Proceedings of ACM SIGCOMM[C]. Karlruhe,Germany, 2003. 381-394.
[11]	CHUN B , ZHAO B . Impact of neighbor selection on performance and resilience of structured P2P networks[A]. Proceedings of IPTPS[C]. Ithaca NY USA, 2005. 264-274.
[12]	ZHAO Y , DUAN Y , HUANG L . Brocade: landmark routing on over-lay networks[A]. Proceedings of IPTPS[C]. Cambridge MA USA, 2002. 34-44.
[13]	XU Z , MAHALINGAM M , KARLSSON M . Turning heterogeneity into an advantage in overlay routing[A]. Proceedings of IEEE IN-FOCOM[C]. San Francisco, 2003. 1499-1509.
[14]	DABEK F , LI J , SIT E et al. Designing a DHT for low latency and high throughput[A]. Proceedings of NSDI[C]. San Francisco, 2004. 85-98.
[15]	DABEK F , COX R , KAASHOEK F . Vivaldi: a decentralized network coordinate system[A]. Proceedings of ACM SIGCOMM[C]. Portland, 2003. 15-26.
[16]	MIT[EB/OL]. . 2006.
[17]	AST[EB/OL]. . 2005.
[18]	RICE[EB/OL]. .
[19]	MIT[EB/OL]. . 2005.

Metrics

Recommended 0

No Suggested Reading articles found!

参数	m	w_d	w_r	sLen	thd_a	thd₀	load_cycle	p_unit
取值	128	1	1	16	0.5	0.8	200ms	0.2

Study of asymmetric DHT method and load balancing in P2P network

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 9

References 19

Related Articles 15

Metrics

Recommended 0

[1]	Mingchuan YANG, Guanchang XUE, Qingyi LI. Neighbor satellite load based low orbit satellite distributed routing algorithm [J]. Journal on Communications, 2021, 42(8): 43-51.
[2]	Aijing SUN, Shichang LI, Yicai ZHANG. WSN clustering routing algorithm based on PSO optimized fuzzy C-means [J]. Journal on Communications, 2021, 42(3): 91-99.
[3]	Yingxu LAI,Yewei PU,Jing LIU. Research on switch migration method based on minimum cost path [J]. Journal on Communications, 2020, 41(2): 131-142.
[4]	Bowen CHEN,Xiaodong FU,Yu LEI. Joint optimization method of failure probability and fiber-link load balancing in flexible bandwidth optical network [J]. Journal on Communications, 2019, 40(9): 136-144.
[5]	Fenghua LI,Dingyan LI,Wei JIN,Zhu WANG,Yunchuan GUO,Kui GENG. Hierarchical scalable storage architecture for massive electronic bill [J]. Journal on Communications, 2019, 40(5): 79-87.
[6]	Guo CHEN,Weifeng ZHANG. ELAB:end-host-based congestion aware load balancing for data center network [J]. Journal on Communications, 2019, 40(3): 196-205.
[7]	Li LI,Guozhen SHI,Kui GENG,Xiuze DONG,Fenghua LI. Scheduling algorithm for stochastic job stream cipher service based on load balancing [J]. Journal on Communications, 2018, 39(6): 11-19.
[8]	Tao HU,Jianhui ZHANG,Weigong KONG,Sen YANG,Lujia CAO. Dynamic deployment algorithm for multi-controllers based on bidirectional matching in software defined networking [J]. Journal on Communications, 2018, 39(1): 159-169.
[9]	Tao HU,Jian-hui ZHANG,Teng MA,Wei ZHAO. Multi-controller balancing deployment strategy based on reliability evaluation in SDN [J]. Journal on Communications, 2017, 38(11): 188-198.
[10]	Bin CAO,Shi-chao XIA,Fang HE,Yun LI. Research of embedding algorithm for wireless network virtualization [J]. Journal on Communications, 2017, 38(1): 35-43.
[11]	Xiao-bo SHI,Yin ZHANG,Shan ZHAO,Deng-ming XIAO. Discrete multi-objective optimization of particle swarm optimizer algorithm for multi-agents collaborative planning [J]. Journal on Communications, 2016, 37(6): 29-37.
[12]	Bo ZHENG,Heng-yang ZHANG,Bao-liang WANG,Wei ZHAO. Load balancing geographic routing strategy for aeronautical ad hoc networks [J]. Journal on Communications, 2016, 37(12): 67-76.
[13]	Kuang-yu QIN,Chuan-he HUANG,Cai-hua WANG,Jiao-li SHI,Di WU,Xi CHEN. Balanced multiple controllers placement with latency and capacity bound in software-defined network [J]. Journal on Communications, 2016, 37(11): 90-103.
[14]	Xiao-jian SHEN,Zhi-gang CHEN,Li LIU. Load balancing multicast routing based on network coding in wireless mesh network [J]. Journal on Communications, 2015, 36(4): 90-95.
[15]	Yong-hong ZHU,En-jie DING. Method of node distribution for heterogeneous WMSN based on load balancing [J]. Journal on Communications, 2015, 36(10): 157-164.