• DocumentCode
    2198447
  • Title

    DLPSPN: New Efficient Super-Peer Network Based on Double-Loop Petersen Graph

  • Author

    Tan Yi-Hong ; Luan Xi-Dao ; Lin Ya-Ping ; Bi-hai, Zhao

  • Author_Institution
    Dept. of Inf. & Comput. Sci., Changsha Univ., Changsha, China
  • Volume
    2
  • fYear
    2011
  • fDate
    14-15 May 2011
  • Firstpage
    201
  • Lastpage
    205
  • Abstract
    Super-peer network adopts two-layer based architecture helps to improve the network performance and the search efficiency. While the dynamic maintenance and broadcast routing mechanism of network topology has an important influence on these two properties. Existing network topology structure has some defects, such as complex maintenance and consuming an excessive amount of bandwidth. This paper proposes a new scalable topology structure based on double-loop Petersen graph, and a new super-peer network DLPSPN, which greatly reduces the maintenance complexity and the bandwidth consuming compared with existing super-peer networks. The efficiency of DLPSPN is also verified by theoretical analysis and simulation experiments.
  • Keywords
    graph theory; peer-to-peer computing; telecommunication network topology; DLPSPN; double-loop Petersen graph; maintenance complexity; network topology; super-peer network; two-layer based architecture; Broadcasting; Maintenance engineering; Network topology; Peer to peer computing; Routing; Semantics; Topology; Petersen graph; network topology structure; search routing mechanism; super-peer network; topology dynamic maintenance;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network Computing and Information Security (NCIS), 2011 International Conference on
  • Conference_Location
    Guilin
  • Print_ISBN
    978-1-61284-347-6
  • Type

    conf

  • DOI
    10.1109/NCIS.2011.138
  • Filename
    5948821