On composing a resilient tree in a network with intermittent links based on stress centrality

Abstract

This paper discusses a composition problem of a resilient tree on a graph modeling a communication network whose links are intermittent. The resiliency of a tree is defined exploiting the binary relation on two kinds of edge weights: availability and commonality. Availability represents a probabilistic stability of a communication link corresponding to an edge, and commonality indicates the influence of an edge based on relative locations of edges on a tree. Our simulation analyzes that the trees satisfying the proposed ordering property on the binary relation provide more stable connections among communication nodes.