BD-CAT: Balanced dynamic content addressing in trees

Publikation: Beitrag in Buch/Konferenzbericht/Sammelband/GutachtenBeitrag in KonferenzbandBeigetragenBegutachtung

Beitragende

Abstract

Balancing the load in content addressing schemes for route-restricted networks represents a challenge with a wide range of applications. Solutions based on greedy embeddings maintain minimal state information and enable efficient routing, but any such solutions currently result in either imbalanced content addressing, overloading individual nodes, or are unable to efficiently account for network dynamics. In this work, we propose a greedy embedding in combination with a content addressing scheme that provides balanced content addressing while at the same time enabling efficient stabilization in the presence of network dynamics. We point out the tradeoff between stabilization complexity and maximal permitted imbalance when deriving upper bounds on both metrics for two variants of the proposed algorithms. Furthermore, we substantiate these bounds through a simulation study based on both real-world and synthetic data.

Details

OriginalspracheEnglisch
TitelIEEE INFOCOM 2017 - IEEE Conference on Computer Communications
Herausgeber (Verlag)Wiley-IEEE Press
Seiten1-9
Seitenumfang9
ISBN (Print)978-1-5090-5337-7
PublikationsstatusVeröffentlicht - 4 Mai 2017
Peer-Review-StatusJa

Konferenz

Titel2017 IEEE Conference on Computer Communications
KurztitelIEEE INFOCOM 2017
Dauer1 - 4 Mai 2017
StadtAtlanta
LandUSA/Vereinigte Staaten

Externe IDs

Scopus 85034026278

Schlagworte

Schlagwörter

  • Routing, Topology, Heuristic algorithms, Content addressable storage, Complexity theory, Conferences, Network topology