CCLBR: Congestion Control-Based Load Balanced Routing in Unstructured P2P Systems

被引:9
作者
Shen, Xiang-Jun [1 ]
Chang, Qing [1 ]
Liu, Lu [2 ,3 ]
Panneerselvam, John [2 ]
Zha, Zheng-Jun [4 ]
机构
[1] Jiangsu Univ, Sch Comp Sci & Commun Engn, Zhenjiang 212013, Peoples R China
[2] Univ Derby, Dept Comp & Math, Derby DE22 1GB, England
[3] Jiangsu Univ, Sch Comp Sci & Telecommun Engn, Zhenjiang 212013, Peoples R China
[4] Univ Sci & Technol China, Sch Informat Sci & Technol, Hefei 230026, Anhui, Peoples R China
来源
IEEE SYSTEMS JOURNAL | 2018年 / 12卷 / 01期
基金
中国国家自然科学基金;
关键词
Collaborative Q-learning; congestion control; load balancing; query routing; unstructured peer-to-peer (P2P) systems; TO-PEER NETWORKS; DISCOVERY;
D O I
10.1109/JSYST.2016.2558515
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Given the growing popularity of the peer-to-peer (P2P) network systems in the recent years, efficient query routing under highly dynamic environments is still lacking in several P2P network systems. In response to this challenge, this paper proposes a new churn-resilient system to find alternative routing paths for the purpose of balancing the query loads under higher network churns and heavy workloads, ultimately to improve the search efficiency. Two novel methods are devised to balance the network query loads among both inter- and intragroup level peers. First, a resource grouping and a rewiring method is proposed to spontaneously organize and cluster the peers having same resources together. This strategy facilitates the peers to evolve the network into a cluster-like topology and balances the query loads among the intergroup peers. Second, a collaborative Q-learning method is proposed to balance the query loads among the intragroup peers in order to intelligently avoid queries being forwarded to the congested peers in the network. Experiments conducted under dynamic network scenarios demonstrate that our proposed method achieves better search performances with a more balanced network load than the existing methods, and further exhibits higher robustness and adaptability under higher network churns and heavy network loads.
引用
收藏
页码:802 / 813
页数:12
相关论文
共 26 条
[1]  
Azar M. G., 2011, ADV NEURAL INFORM PR, P2411
[2]  
Chen H, 2004, 2004 IEEE INTERNATIONAL SYMPOSIUM ON CLUSTER COMPUTING AND THE GRID - CCGRID 2004, P27
[3]   Efficient random walk sampling in distributed networks [J].
Das Sarma, Atish ;
Molla, Anisur Rahaman ;
Pandurangan, Gopal .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2015, 77 :84-94
[4]   A peer to peer (P2P) architecture for dynamic workflow management [J].
Fakas, GJ ;
Karakostas, B .
INFORMATION AND SOFTWARE TECHNOLOGY, 2004, 46 (06) :423-431
[5]  
Gkantsidis C, 2004, IEEE INFOCOM SER, P120
[6]   Optimizing cluster formation in super-peer networks via local incentive design [J].
Kurve, Aditya ;
Griffin, Christopher ;
Miller, David J. ;
Kesidis, George .
PEER-TO-PEER NETWORKING AND APPLICATIONS, 2015, 8 (01) :1-21
[7]   An Efficient Superpeer Overlay Construction and Broadcasting Scheme Based on Perfect Difference Graph [J].
Li, Jung-Shian ;
Chao, Chih-Hung .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2010, 21 (05) :594-606
[8]   A Socioecological Model for Advanced Service Discovery in Machine-to-Machine Communication Networks [J].
Liu, Lu ;
Antonopoulos, Nick ;
Zheng, Minghui ;
Zhan, Yongzhao ;
Ding, Zhijun .
ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2016, 15 (02)
[9]   A SURVEY AND COMPARISON OF PEER-TO-PEER OVERLAY NETWORK SCHEMES [J].
Lua, Eng Keong ;
Crowcroft, Jon ;
Pias, Marcelo ;
Sharma, Ravi ;
Lim, Steven .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2005, 7 (02) :72-93
[10]   Understanding and Improving Piece-Related Algorithms in the BitTorrent Protocol [J].
Luo, Jiaqing ;
Xiao, Bin ;
Bu, Kai ;
Zhou, Shijie .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2013, 24 (12) :2526-2537