Optimization in telecommunication network maintenance
- Authors: Jia, Long , Rubinov, Alex , Ouveysi, Iradj
- Date: 2003
- Type: Text , Conference paper
- Relation: Paper presented at the Symposium on Industrial Optimisation and the 9th Australian Optimisation Day, Perth : 30th September, 2002
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003000349
A lifetime measure for telecommunication network : Theoretical aspects
- Authors: Dzalilov, Zari , Rubinov, Alex , Ouveysi, Iradj
- Date: 2003
- Type: Text , Conference paper
- Relation: Paper presented at ICON 2003 - 2003 11th IEEE International Conference on Networks, Sydney : 28th September, 2003
- Full Text:
- Reviewed:
- Description: A new measure for network performance evaluation called topology lifetime was introduced in [Maxemchuk, N et al., May 2002], see also [Maxemchuk, N et al.]. This measure is based on the notion of unexpected traffic growth and can be used for comparison of topologies. We discuss some advantages and disadvantages of the approach from [Maxemchuk, N et al., May 2002] and suggest some modifications to this approach. In particular we discuss how to evaluate the influence of a subgraph to the lifetime measure and introduce the notion of the order of a path. This notion is useful if we consider a possible extension to the set of working paths in order to support the traffic for the time that is needed for installation of new facilities.
- Description: E1
- Description: 2003000361
Dynamic reconfiguration of telecommunication networks
- Authors: Dzalilov, Zari , Ouveysi, Iradj , Rubinov, Alex
- Date: 2003
- Type: Text , Conference paper
- Relation: Paper presented at the Industrial Optimisation 2003 Conference, Perth : 30th October, 2002
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003000451
Queueing programming models in telecommunication network maintenance
- Authors: Ugon, Julien , Jia, Long , Ouveysi, Iradj
- Date: 2003
- Type: Text , Conference paper
- Relation: Paper presented at the Symposium on Industrial Optimisation and the 9th Australian Optimisation Day, Perth : 30th September, 2002
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003000350
On the implementation of dynamic reconfiguration in telecommunication networks
- Authors: Dzalilov, Zari , Ouveysi, Iradj
- Date: 2008
- Type: Text , Conference paper
- Relation: Paper presented at Second International Conference: Problems of Cybernetics and Informatics, PCI 2008, Baku, Azerbaijan : 10th-12th September 2008 p. 44-47
- Full Text:
- Description: In this paper we summarize our proposed methodology for dynamic reconfiguration of telecommunication networks. This procedure is implemented to achieve network recovery in the case of any failure in the network. We also outline a brief description of path analysis techniques that are considered in the rerouting of Origin-Destination traffic flows and address how these methods are used in the implementation of proposed algorithm
- Description: 2003006858
Challenging issues in dynamic reconfiguration of telecommunication networks
- Authors: Dzalilov, Zari , Ouveysi, Iradj
- Date: 2008
- Type: Text , Conference paper
- Relation: Paper presented at Second International Conference: Problems of Cybernetics and Informatics, PCI 2008, Baku, Azerbaijan : 10th-12th September 2008 p. 48-51
- Full Text:
- Description: For the last quarter of a century understanding of the nature of telecommunication network traffic has been considered as an important research topic. Any well-designed recovery strategy has to take into account the different resilience requirements of the single traffic flows in order to avoid excessive usage of bandwidth for standby links. Here we discuss the issues of a reconfiguration procedure in order to perform network recovery in the case of any failure scenario in the telecommunication networks. We explain the complexities arising in the real life application and propose an optimization technique in order to minimize the size of the optimization problem in the process of reconfiguration. Our suggestion to achieve this is to find the minimal sub-graph surrounding the failure region that contains the required unused capacity to perform network recovery task.
- Description: 2003006857