Graph-theoretic analysis of structured peer-to-peer systems

Abstract

This paper examines graph-theoretic properties of existing peer-to-peer architectures and proposes a new infrastructure based on optimal-diameter de Bruijn graphs. Since generalized de Bruijn graphs possess very short average routing distances and high resilience to node failure, they are well suited for structured peer-to-peer networks. Using the example of Chord, CAN, and de Bruijn, we first study routing performance, graph expansion, and clustering properties of each graph. We then examine bisection width, path overlap, and several other properties that affect routing and resilience of peer-to-peer networks. Having confirmed that de Bruijn graphs offer the best diameter and highest connectivity among the existing peer-to-peer structures, we offer a very simple incremental building process that preserves optimal properties of de Bruijn graphs under uniform user joins/departures. We call the combined peer-to-peer architecture ODRI -Optimal Diameter Routing Infrastructure.

Contributions to the Resilience Management in the Internet of Things

“…In ecology, resilience can be measured by looking at the time that the system takes to return to its equilibrium state after a perturbation [73]. But it is difficult to provide a clear quantitative assessment of network resilience to node failure [95]. The conventional evaluation is the number of failures the network can sustain before network disconnection, or the probability to keep the network connected [104].…”