[1]
YuShao-Shan, YuJiong, Kamil, SunQi-Gang, DR-Chord: An Efficient Double- Ring Chord Protocol[C], The Sixth International Conference on Grid and Cooperative Computing, 2007: 197-202.
DOI: 10.1109/gcc.2007.61
Google Scholar
[2]
Wang Jing, Yang Shoubao, Guo Leitao. A bidirectional query chord system based on latency-sensitivity[C]. Proceeding of the Fifth International Conference on Grid and Cooperative Computing. Washington: IEEE Computer Society, 2006: 164-167.
DOI: 10.1109/gcc.2006.1
Google Scholar
[3]
Hongwei Chen, Zhiwei Ye. BChord: Bi-directional Routing DHT based on Chord[J], IEEE Press, 2008: 410-414.
DOI: 10.1109/cscwd.2008.4537014
Google Scholar
[4]
Shihui Duan, JinLin Wang. MChord: Chord Algorithm based on limited multicasting[C], 2008 International Conference on Computer and Electrical Engineering, 2008: 233-237.
DOI: 10.1109/iccee.2008.18
Google Scholar
[5]
Biqing Wang, Peng He. L-Chord: Routing Model for Chord Based on Layer-Dividing[C], 2007 International Conference on Computational Intellig- ence and Security, (2007).
DOI: 10.1109/cis.2007.62
Google Scholar
[6]
Yi Jiang, Jinyuan You. A Low Latency Chord Routing Algorithm for DHT[C], 2006 1st International Symposium on Pervasive Computing and Applications, (2006).
DOI: 10.1109/spca.2006.297539
Google Scholar
[7]
Kwon G, Ryu K.D. BYPASS: Topplogy-Aware Lookup Overlay for DHT-Based P2P File Locating Services[A]. Proc of INFOCOM'02. 2002: 1190-1199.
DOI: 10.1109/icpads.2004.1316108
Google Scholar
[8]
Jiang Junjie, Tang Feilong, Pan Feng, et al. Using bidirectional links to improve peer-to-peer lookup performance[J]. Journal of Zhejiang University: Science A, 2006, 7(6): 945-951.
DOI: 10.1631/jzus.2006.a0945
Google Scholar
[9]
Gerald Kunzmann, Andreas Binzenbofer, Robert Henjes. Analyzing and modifying Chord's Stabilization Algorithm to Handle High Churn Rates[C]. 2005: 885-890.
DOI: 10.1109/icon.2005.1635633
Google Scholar
[10]
Dong Xuan, Sriram Chellappan, Muralidhar Krishnamoorthy. RChord: An Enhanced Chord System Resilient to Routing Attacks[C], Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing, (2003).
DOI: 10.1109/iccnmc.2003.1243053
Google Scholar
[11]
S Ratnasamy, P Francis, M Handley, et al. A Scalable Content-Addressable Network[C]. In SIGCOMM, ACM Press. 2001: 161-172.
DOI: 10.1145/964723.383072
Google Scholar
[12]
Marti S, Ganesan P, Garcia-Molina H. DHT routing using social links[C]. The 3rd International Workshop on Peer-to-Peer Systems. La Jolla: Springer, 2004: 100-111.
DOI: 10.1007/978-3-540-30183-7_10
Google Scholar
[13]
Ye-In Chang, Hue-Ling Chen, Sih-Ning Li and Hung-Ze Liu, A Dynamic Hashing Approach to Supporting Load Balance in P2P Systems[J], The 28th International Conference on Distributed Computing Systems Workshops, 2008: 429-434.
DOI: 10.1109/icdcs.workshops.2008.109
Google Scholar
[14]
Gennaro Cordasco, Alessandra Sala. 2-Chord Halved[C], Proceedings of the 2005 Second International Workshop on Hot Topics in Peer-to-Peer Systems, (2005).
DOI: 10.1109/hot-p2p.2005.1
Google Scholar
[15]
Liu Ye, Yang Peng, Chu Zi, Wu Jiagao. TCS-Chord: An Improved Routing Algorithm to Chord Based on the Topology-aware Clustering in Self- organiziong Mode[C], Proceedings of the first International Conference on Semantics, Knowledge and Grid, (2006).
DOI: 10.1109/skg.2005.121
Google Scholar