SKY: efficient peer-to-peer networks based on distributed Kautz graphs

被引：15
|
作者：
Zhang YiMing [1 ]
Lu XiCheng [1 ]
Li DongSheng [1 ]
机构：
[1] Natl Univ Def Technol, Natl Lab Parallel & Distributed Proc, Changsha 410073, Hunan, Peoples R China
来源：
SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES | 2009年 / 52卷 / 04期
基金：
中国国家自然科学基金;
关键词：
peer-to-peer network; Kautz graph; constant degree; topology maintenance; D-Kautz graph; DIGRAPH;
D O I：
10.1007/s11432-009-0016-x
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Many proposed P2P networks are based on traditional interconnection topologies. Given a static topology, the maintenance mechanism for node join/departure is critical to designing an efficient P2P network. Kautz graphs have many good properties such as constant degree, low congestion and optimal diameter. Due to the complexity in topology maintenance, however, to date there have been no effective P2P networks that are proposed based on Kautz graphs with base > 2. To address this problem, this paper presents the "distributed Kautz (D-Kautz) graphs", which adapt Kautz graphs to the characteristics of P2P networks. Using the D-Kautz graphs we further propose SKY, the first effective P2P network based on Kautz graphs with arbitrary base. The effectiveness of SKY is demonstrated through analysis and simulations.
引用
收藏
页码：588 / 601
页数：14
相关论文
共 50 条
  • [1] SKY: efficient peer-to-peer networks based on distributed Kautz graphs
    YiMing Zhang
    XiCheng Lu
    DongSheng Li
    [J]. Science in China Series F: Information Sciences, 2009, 52 : 588 - 601
  • [2] SKY:Efficient peer-to-peer networks based on distributed Kautz graphs
    ZHANG YiMing
    [J]. Science China(Information Sciences), 2009, (04) : 588 - 601
  • [3] SKY:Efficient peer-to-peer networks based on distributed Kautz graphs
    ZHANG YiMingLU XiCheng LI DongSheng National Laboratory for Parallel and Distributed ProcessingNational University of Defense TechnologyChangsha China
    [J]. Science in China(Series F:Information Sciences)., 2009, 52 (04) - 601
  • [4] Quasi-Kautz Digraphs for Peer-to-Peer Networks
    Guo, Deke
    Wu, Jie
    Liu, Yunhao
    Jin, Hai
    Chen, Hanhua
    Chen, Tao
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2011, 22 (06) : 1042 - 1055
  • [5] BAKE:A balanced Kautz tree structure for peer-to-peer networks
    Guo, Deke
    Liu, Yunhao
    Li, Xiangyang
    [J]. 27TH IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM), VOLS 1-5, 2008, : 351 - 355
  • [6] Graph Theoretical Analysis on Distributed Line Graphs for Peer-to-Peer Networks
    Manada, Akiko
    Morita, Hiroyoshi
    [J]. IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2019, 6 (03): : 326 - 335
  • [7] Building an Efficient Distributed Reputation Scheme for Peer-to-Peer Networks
    Tian, Chunqi
    Cheng, Jiujun
    [J]. ISISE 2008: INTERNATIONAL SYMPOSIUM ON INFORMATION SCIENCE AND ENGINEERING, VOL 2, 2008, : 285 - 288
  • [8] An efficient and distributed file search in unstructured peer-to-peer networks
    Mohammad Shojafar
    Jemal H. Abawajy
    Zia Delkhah
    Ali Ahmadi
    Zahra Pooranian
    Ajith Abraham
    [J]. Peer-to-Peer Networking and Applications, 2015, 8 : 120 - 136
  • [9] An efficient and distributed file search in unstructured peer-to-peer networks
    Shojafar, Mohammad
    Abawajy, Jemal H.
    Delkhah, Zia
    Ahmadi, Ali
    Pooranian, Zahra
    Abraham, Ajith
    [J]. PEER-TO-PEER NETWORKING AND APPLICATIONS, 2015, 8 (01) : 120 - 136
  • [10] Efficient peer-to-peer lookup based on a distributed trie
    Freedman, MJ
    Vingralek, R
    [J]. PEER-TO-PEER SYSTEMS, 2002, 2429 : 66 - 75
12345