Computing and maximizing the exact reliability of wireless backhaul networks - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2016

Computing and maximizing the exact reliability of wireless backhaul networks

(1) , (2) , (3) , (1)
1
2
3

Abstract

The reliability of a fixed wireless backhaul network is the probability that the network can meet all the communication requirements considering the uncertainty (e.g., due to weather) in the maximum capacity of each link. We provide an algorithm to compute the exact reliability of a backhaul network, given a discrete probability distribution on the possible capacities available at each link. The algorithm computes a conditional probability tree, where each leaf in the tree requires a valid routing for the network. Any such tree provides an upper and lower bound on the reliability, and the algorithm improves these bounds by branching in the tree. We also consider the problem of determining the topology and configuration of a backhaul network that maximizes reliability subject to a limited budget. We provide an algorithm that exploits properties of the conditional probability tree used to calculate reliability of a given network design. We perform a computational study demonstrating that the proposed methods can calculate reliability of large backhaul networks, and can optimize topology for modest size networks.
Fichier principal
Vignette du fichier
backhaul-rr.pdf (365.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01394593 , version 1 (09-11-2016)

Identifiers

  • HAL Id : hal-01394593 , version 1

Cite

David Coudert, James Luedtke, Eduardo Moreno, Konstantinos Priftis. Computing and maximizing the exact reliability of wireless backhaul networks. [Research Report] Inria Sophia Antipolis; I3S. 2016, pp.9. ⟨hal-01394593⟩
263 View
150 Download

Share

Gmail Facebook Twitter LinkedIn More