A Fully Distributed Method to Detect and Reduce Cut Vertices in Large-Scale Overlay Networks

Download Now Date Added: Jul 2011
Format: PDF

A cut vertex is defined as a network node whose removal increases the number of network components. Failure of a cut vertex disconnects a network component and downgrades the network performance. Overlay networks are resilient to the failure of random nodes, but cut vertices that have been observed in real world overlay traces make the network very vulnerable to well-constructed and targeted attacks. Traditional methods of detecting cut vertices are centralized and are very difficult, if not impossible, to be applied to large-scale and highly dynamic overlay networks.