On a class of reliable networks

  • A.T. Amin
  • Published 1992 in
    Eleventh Annual International Phoenix Conference…

Abstract

A communication network N in which links are subject to failures is typically modeled by a probabilistic graph G in which each edge exists independently with a fixed probability p, 0<p<1. The pair-connected reliability of G is the expected number of connected pairs of vertices in G. The network N when link are overloaded and hence unavailable may be modeled… (More)

Topics

2 Figures and Tables

Slides referencing similar topics