Mobility

Application of the Classical Reliability to Address Optimization Problems in Mesh Networks

Download Now Free registration required

Executive Summary

Failures in communication networks may arise from natural catastrophes, component wear out, or action of intentional enemies. A communication network can be modeled by an undirected graph (or digraph) G= (V,E), where V and E are the set of nodes and edges (links) of G, respectively. Moreover the failure probabilities of the network components are represented by assigning probabilities of failure to the nodes and/or edges (links) of its underlying graph (digraph). In this paper, the authors will discuss a reliability model called the edge reliability-model, and they present a clear description of its applicability to assess performance objectives of real communication networks such as mesh networks.

  • Format: PDF
  • Size: 705.43 KB