• DocumentCode
    1821614
  • Title

    HyperCircle: An Efficient Broadcast Protocol for Super-Peer P2P Networks

  • Author

    Lin, Feiyu ; Henricsson, Christopher ; Abbas, Syed Muhammad ; Sandkuhl, Kurt

  • Author_Institution
    Jonkoping Univ., Jonkoping, Sweden
  • Volume
    2
  • fYear
    2009
  • fDate
    29-31 Aug. 2009
  • Firstpage
    426
  • Lastpage
    433
  • Abstract
    The challenge ofpeer-to-peer (P2P) applications is how to efficiently broadcast in large-scale P2P networks. This paper presents the 8-point Hyper Circle protocol for efficient broadcasting and routing of messages in P2P networks. The Hyper Circle topology consists of n-dimensional 8-point circles where each point in each dimension can consist of an 8-point circle. A Hyper Circle node requires 2*k steps to spread the message to all nodes. The construction and maintenance of the topology including the broadcast algorithm with Hyper Circle are introduced. A simulation framework with the Hyper Circle protocol is implemented based on Over Sim. Initial experimental results comparing protocols like Chord, Kademlia and Hyper Circle are reported. Hyper Circle provides the most efficient broadcasting messages.
  • Keywords
    graph theory; peer-to-peer computing; protocols; telecommunication network routing; graph topology; hyper circle topology; hypercircle broadcast protocol; message routing; peer-to-peer network; super-peer P2P network; Broadcasting; Computer networks; Hypercubes; IP networks; Large-scale systems; Network topology; Peer to peer computing; Routing protocols; Scalability; Semantic Web; Efficient Broadcast; HyperCircle; Super-Peer P2P;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Science and Engineering, 2009. CSE '09. International Conference on
  • Conference_Location
    Vancouver, BC
  • Print_ISBN
    978-1-4244-5334-4
  • Electronic_ISBN
    978-0-7695-3823-5
  • Type

    conf

  • DOI
    10.1109/CSE.2009.247
  • Filename
    5284089