• DocumentCode
    2694293
  • Title

    Exploiting Power-Law Node Degree Distribution in Chord Overlays

  • Author

    Ktari, Salma ; Hecker, Artur ; Labiod, Houda

  • Author_Institution
    TELECOM ParisTech, Paris, France
  • fYear
    2009
  • fDate
    1-3 July 2009
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable broadcast search support. We consider routing algorithms for a bidirectional variant of Chord network and show how the resulting structure extends the search region and provides an efficient resource lookup service at a very little additional cost.
  • Keywords
    directed graphs; peer-to-peer computing; telecommunication network routing; telecommunication network topology; Chord overlays; Chord topology; bidirectional graph; power-law node degree distribution; routing algorithms; scalable broadcast search support; super-peer based lookup algorithm; Broadcasting; Computer network reliability; Computer networks; Costs; Distributed computing; Floods; Network topology; Peer to peer computing; Routing; Telecommunication network topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Next Generation Internet Networks, 2009. NGI '09
  • Conference_Location
    Aveiro
  • Print_ISBN
    978-1-4244-4244-7
  • Electronic_ISBN
    978-1-4244-4245-4
  • Type

    conf

  • DOI
    10.1109/NGI.2009.5175761
  • Filename
    5175761