Optimal Double Route Search in a Telecommunication Network: A Telecontrol Network Application Articles uri icon

authors

  • FEIJOO MARTINEZ, JUAN RAMON
  • CID SUEIRO, JESUS
  • GARCIA LOPEZ, JUAN ANTONIO
  • CONDE PARDO, PATRICIA

publication date

  • March 2011

start page

  • 341

end page

  • 350

issue

  • 1

volume

  • 60

international standard serial number (ISSN)

  • 0018-9529

electronic international standard serial number (EISSN)

  • 1558-1721

abstract

  • High availability communication networks with very low failure rates are often designed by using physical diversity, i.e., the traffic between a given pair of nodes is routed by using several physically disjoint paths. The selection of the pair of routes that maximizes the connectivity of a node is not an easy problem, because such connectivity cannot be expressed as an additive function of the availability of links and nodes in the path pairs. Previous algorithms for searching the optimal route use additive costs, which can be a loose assumption either when high failure rates can be locally present, or when fully disjoints paths do not exist. In this paper, we construct a Bayesian network to encode the probabilistic relation between the connectivity of a node and the availability of nodes and links. The problem of selecting an optimal pair of routes becomes equivalent to optimizing the structure of the Bayesian network. By introducing appropriate approximations on the double route availability equations, we propose a new algorithm, which outperforms other classical methods when there are sporadic high error rate elements in the network. Simulations and an application example in an electric transport telecontrol network show the performance of the method when compared to standard search.