Cycloid: A constant-degree and lookup-efficient P2P overlay network

被引:67
作者
Shen, HY
Xu, CZ [1 ]
Chen, GH
机构
[1] Wayne State Univ, Dept Elect & Comp Engn, Detroit, MI 48202 USA
[2] Nanjing Univ, State Key Lab Novel Software Technol, Nanjing 210008, Peoples R China
基金
美国国家科学基金会; 美国国家航空航天局;
关键词
Cycloid; peer-to-peer; Viceroy; Koorde; distributed hash table; constant-degree DHT;
D O I
10.1016/j.peva.2005.01.004
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require 0(log it) hops per lookup request with 0(log it) neighbors per node, where n is the network size. In this paper, we present a constant-degree P2P architecture, namely Cycloid, which emulates a cube-connected cycles (CCC) graph in the routing of lookup requests. It achieves a time complexity of O(d) per lookup request by using O(l) neighbors per node, where n = d x 2(d). We compare Cycloid with other two constant-degree systems, Viceroy and Koorde in various architectural aspects via simulation. Simulation results show that Cycloid has more advantages for large scale and dynamic systems that have frequent node arrivals and departures. In particular, Cycloid delivers a higher location efficiency in the average case and exhibits a more balanced distribution of keys and query loads between the node.,,. (D (C) 2005 Elsevier B.V. All Rights Reserved.
引用
收藏
页码:195 / 216
页数:22
相关论文
共 50 条
[21]   COCONET: Co-operative Cache Driven Overlay NETwork for p2p Vod Streaming [J].
Bhattacharya, Abhishek ;
Yang, Zhenyu ;
Pan, Deng .
QUALITY OF SERVICE IN HETEROGENEOUS NETWORKS, 2009, 22 :52-68
[22]   Exploiting Communities for Enhancing Lookup Performance in Structured P2P Systems [J].
Bandara, H. M. N. Dilum ;
Jayasumana, Anura P. .
2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2011,
[23]   A Symmetric Lookup-based Secure P2P Routing Algorithm [J].
Luo, Bingqing ;
Jin, Yiai ;
Luo, Shengmei ;
Sun, Zhixin .
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2016, 10 (05) :2203-2217
[24]   Efficient semantic-based content search in P2P network [J].
Shen, HT ;
Shu, YF ;
Yu, B .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2004, 16 (07) :813-826
[25]   3D P2P overlay over MANETs [J].
Abid, S. A. ;
Othman, Mazliza ;
Shah, Nadir .
COMPUTER NETWORKS, 2014, 64 :89-111
[26]   On the Dimensioning of an Aggregation Service for P2P Service Overlay Networks [J].
Fiorese, Adriano ;
Simoes, Paulo ;
Boavida, Fernando .
MANAGING THE DYNAMICS OF NETWORKS AND SERVICES, 2011, 6734 :136-147
[27]   An Efficient Unstructured P2P Overlay for File Sharing over MANETs Using Underlying Reactive Routing [J].
Shah, Nadir ;
Qian, Depei ;
Wang, Rui .
JOURNAL OF INTERNET TECHNOLOGY, 2011, 12 (03) :517-530
[28]   P2P Overlay for CDN-P2P Being Aware of the Upload Capacity of Participants [J].
Okada, Shotaro ;
Fujita, Satoshi .
2014 20TH IEEE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2014, :823-828
[29]   Topology Investigation of a large-Scale P2P VoD Overlay Network based on Active Measurement [J].
Li, Bing ;
Ma, Maode ;
Jin, Zhigang ;
Zhao, Dongxue .
2010 IEEE GLOBECOM WORKSHOPS, 2010, :519-523
[30]   A P2P Overlay Network Routing Algorithm Based on Group-Average Agglomerative Clustering Topology [J].
Ma, Yi ;
Tan, Zhenhua ;
Chang, Guiran ;
Gao, Xiaoxing .
HIS 2009: 2009 NINTH INTERNATIONAL CONFERENCE ON HYBRID INTELLIGENT SYSTEMS, VOL 2, PROCEEDINGS, 2009, :445-+