TU Darmstadt / ULB / TUbiblio

Provable Polylog Routing for Darknets

Roos, Stefanie and Strufe, Thorsten (2012):
Provable Polylog Routing for Darknets.
In: 4th IEEE ICDCS International Workshop on Hot Topics in Peer-to-Peer Computing and Online Social Networking (HotPost), [Conference or Workshop Item]

Abstract

Darknets, anonymous and membership-concealing P2P networks, aim at providing censorship-resistance without relying on a central authority. An efficient routing algorithm is needed to create Darknets that offer an acceptable performance to a large number of users. Designing such an algorithm is hard due to the restricted topology of Darknets, which has not been modelled adequately up to now. We present such a model of Darknets by modifying Kleinberg’s small-world model [1] and a new algorithm, NextBestOnce. It is shown analytically that NextBestOnce takes O(log2 n) steps on our model, simulations show that it performs better than existing Darknet routing algorithms such as the one used in the dark Freenet [2], especially with regard to the maximal path length which is bounded by O(log2 n) for NextBestOnce, but scales linearly in case of Freenet.

Item Type: Conference or Workshop Item
Erschienen: 2012
Creators: Roos, Stefanie and Strufe, Thorsten
Title: Provable Polylog Routing for Darknets
Language: German
Abstract:

Darknets, anonymous and membership-concealing P2P networks, aim at providing censorship-resistance without relying on a central authority. An efficient routing algorithm is needed to create Darknets that offer an acceptable performance to a large number of users. Designing such an algorithm is hard due to the restricted topology of Darknets, which has not been modelled adequately up to now. We present such a model of Darknets by modifying Kleinberg’s small-world model [1] and a new algorithm, NextBestOnce. It is shown analytically that NextBestOnce takes O(log2 n) steps on our model, simulations show that it performs better than existing Darknet routing algorithms such as the one used in the dark Freenet [2], especially with regard to the maximal path length which is bounded by O(log2 n) for NextBestOnce, but scales linearly in case of Freenet.

Title of Book: 4th IEEE ICDCS International Workshop on Hot Topics in Peer-to-Peer Computing and Online Social Networking (HotPost)
Divisions: LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
20 Department of Computer Science > Peer-to-Peer Netzwerke
LOEWE > LOEWE-Zentren
20 Department of Computer Science
LOEWE
Date Deposited: 27 Jul 2016 16:32
Identification Number: TUD-CS-2012-0129
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)

View Item View Item