• DocumentCode
    1698814
  • Title

    A collaboration scheme for making peer-to-peer anonymous routing resilient

  • Author

    Wang, Xiaogang ; Luo, Junzhou

  • Author_Institution
    Sch. of Comput. Sci. & Eng., Southeast Univ., Nanjing
  • fYear
    2008
  • Firstpage
    70
  • Lastpage
    75
  • Abstract
    Node churn is one hurdle to using peer-to-peer (P2P) networks as anonymous networks, which makes the anonymous path fragile and results in message loss and communication failures. A collaboration scheme including friendly neighbor-based incentive (FNI) and re-encryption mechanism is proposed to deal with the high node churn (changes in system membership) characteristic of unstructured P2P networks. The simple FNI mechanism is presented to encourage peers to forward other peers´ queries, and establish more connections to improve the performance of P2P overlay network where only stable and well-behaved nodes can be chosen as relay nodes to prolong single path durability. The re-encryption mechanism is designed to replace those failed relay nodes and achieve routing resilience upon different node availabilities in real- world systems. The results from our security analysis and simulation show that the collaboration scheme greatly improves routing resilience and maintains low latencies and low communication overhead.
  • Keywords
    peer-to-peer computing; telecommunication network routing; telecommunication security; P2P overlay network; anonymous networks; collaboration scheme; friendly neighbor-based incentive; node churn; peer-to-peer anonymous routing resilient; reencryption mechanism; unstructured P2P networks; Bandwidth; Collaboration; Computer science; Mesons; Multicast protocols; Peer to peer computing; Public key; Relays; Resilience; Routing; Anonymous Path; Peer-to-peer; Resilient;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Supported Cooperative Work in Design, 2008. CSCWD 2008. 12th International Conference on
  • Conference_Location
    Xi´an
  • Print_ISBN
    978-1-4244-1650-9
  • Electronic_ISBN
    978-1-4244-1651-6
  • Type

    conf

  • DOI
    10.1109/CSCWD.2008.4536958
  • Filename
    4536958