Mathematical models for failure reconfiguration of telecommunication networks : Part 1
- Authors: Dzalilov, Zari , Ouveysi, Iradj
- Date: 2009
- Type: Text , Journal article
- Relation: Optimization Vol. 58, no. 5 (2009), p. 483-504
- Full Text: false
- Reviewed:
- Description: This article proposes various mathematical modelling of networks for failure recovery. We consider a survivable communication network which is designed to carry different types of services under service level agreements (SLAs) between the network provider and the network users. Two different approaches for dynamical reconfiguration of networks are presented: with and without penalization. The approach without penalization does not require to consider the status of SLAs during the process of network reconfiguration. The second approach considers the status of the SLAs in the network and the corresponding re-optimization model for network reconfiguration is more complicated as the dimension of the linear programming problem in this case is higher than one for the problem of optimization without penalization. Some mathematical models and solution methodologies for this network operation problem are presented and an extensive implementation result has been provided.
Mathematical models for failure reconfiguration of telecommunication networks : Part 2
- Authors: Dzalilov, Zari , Ouveysi, Iradj
- Date: 2009
- Type: Text , Journal article
- Relation: Optimization Vol. 58, no. 5 (2009), p. 505-520
- Full Text: false
- Reviewed:
- Description: This article proposes an efficient network reconfiguration model for failure recovery of a communication network. The novelty of our methodology is that, it considers a small neighbourhood of failed component(s) in the network in order to perform network reconfiguration. This approach significantly reduces the size of proposed linear programming problem, making our reconfiguration procedure theoretically scalable and practically implementable. Targeting a small neighbourhood of failed area in the network also minimizes the amount of traffic rerouting in the network. This is ideal in the management of a communication network.