An extended lifetime measure for telecommunication network
- Authors: Dzalilov, Zari , Ouveysi, Iradj , Rubinov, Alex
- Date: 2008
- Type: Text , Journal article
- Relation: Journal of Industrial and Management Optimization Vol. 4, no. 2 (2008), p. 329-337
- Full Text:
- Reviewed:
- Description: A new measure for network performance evaluation called topology lifetime was introduced in [4, 5]. 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 of [4] 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.
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
Optimization based clustering algorithms in multicast group hierarchies
- Authors: Jia, Long , Ouveysi, Iradj , Rubinov, Alex , Bagirov, Adil
- Date: 2003
- Type: Text , Conference paper
- Relation: Paper presented at the 2003 Australian Telecommunications Networks and Applications Conference, Melbourne : 8th - 10th December, 2003
- Full Text:
- Reviewed:
- Description: In this paper we propose the use of optimization based clustering algorithms to determine hierarchical multicast trees. This problem is formulated as an optimization problem with a non-smooth, non-convex objective function. Different algorithms are examined for solving this problem. Results of numerical experiments using some artificial and real-world databases are reported. We compare several optimization based clustering methods and their combinations with the k- means method. The results demonstrate the effectiveness of these algorithms.
- Description: E1
- Description: 2003000382