• DocumentCode
    403466
  • Title

    Achieving heterogeneity and fairness in Kademlia

  • Author

    Kadobayashi, Youki

  • Author_Institution
    Nara Inst. of Sci. & Technol., Japan
  • fYear
    2004
  • fDate
    26-30 Jan. 2004
  • Firstpage
    546
  • Lastpage
    551
  • Abstract
    Attempts to construct overlay networks in ubiquitous networked environments will face challenges of both performance and resource heterogeneity. We describe enhancements to Kademlia, a peer-to-peer system which has provable consistency and performance in a fault-prone environment. Our enhancements can accommodate nodes with arbitrary degree of heterogeneity, while at the same time ensuring fairness, without adding much overhead. A probabilistic mechanism to check parameter integrity is introduced, which in turn is exploited to probabilistically check compliance of nodes to advertised parameters. To demonstrate the feasibility of this approach, we have implemented a prototype and then evaluated its ability to accommodate arbitrary degree of heterogeneity.
  • Keywords
    distributed processing; ubiquitous computing; Kademlia; advertised parameters; fault-prone environment; heterogeneity degree; node compliance; overlay networks; parameter integrity; peer-to-peer system; performance heterogeneity; resource heterogeneity; ubiquitous networked environments; Algorithm design and analysis; Bandwidth; Computer architecture; Intelligent networks; Intrusion detection; Nominations and elections; Peer to peer computing; Personal digital assistants; Prototypes; Space exploration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Applications and the Internet Workshops, 2004. SAINT 2004 Workshops. 2004 International Symposium on
  • Print_ISBN
    0-7695-2050-2
  • Type

    conf

  • DOI
    10.1109/SAINTW.2004.1268686
  • Filename
    1268686