Creating and sharing knowledge for telecommunications

Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models

Gouveia, L. ; Patrício, P. ; Sousa, A. F.

Intrnl. Transactions in Operational Research Vol. 18, Nº 3, pp. 335 - 358, May, 2011.

ISSN (print): 0969-6016
ISSN (online): 1475-3995

Scimago Journal Ranking: (in )

Digital Object Identifier: 10.1111/j.1475-3995.2010.00766.x

Abstract
Given an undirected network with link capacities and a set of commodities with known demands, this paper addresses the problem of determining D (with D=2, 3, 4) hop-constrained node disjoint paths for each commodity while minimizing the average or the maximum number of hops. These paths are defined according to two survivability mechanisms − Path Diversity and Path Protection, the latter guaranteeing total demand protection in the event of n failures (with n