Roos, Stefanie ; Strufe, Thorsten (2012)
Provable Polylog Routing for Darknets.
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (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.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2012 |
| Autor(en): | Roos, Stefanie ; Strufe, Thorsten |
| Art des Eintrags: | Bibliographie |
| Titel: | Provable Polylog Routing for Darknets |
| Sprache: | Deutsch |
| Publikationsjahr: | 2012 |
| Buchtitel: | 4th IEEE ICDCS International Workshop on Hot Topics in Peer-to-Peer Computing and Online Social Networking (HotPost) |
| Kurzbeschreibung (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. |
| ID-Nummer: | TUD-CS-2012-0129 |
| Fachbereich(e)/-gebiet(e): | LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt 20 Fachbereich Informatik > Peer-to-Peer Netzwerke LOEWE > LOEWE-Zentren 20 Fachbereich Informatik LOEWE |
| Hinterlegungsdatum: | 27 Jul 2016 16:32 |
| Letzte Änderung: | 17 Mai 2018 13:02 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum