6Telecommunication network failures
30103 Numerical and Computational Mathematics
3Optimisation
3Optimization
2Dynamic alternative routing
2Linear and integer programming
2Linear programming
2Mathematical modelling
2Network
2Network survivability
2Path analysis
2Reconfiguration
10102 Applied Mathematics
1Bandwidth allocation
1Clustering algorithms
1Dynamic systems theory
1Efficiency-fairness tradeoff
1Fairness
1Graph theory
1Hierarchies

Show More

Show Less

Format Type

A lifetime measure for telecommunication network : Theoretical aspects

- Dzalilov, Zari, Rubinov, Alex, Ouveysi, Iradj

**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

**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

An extended lifetime measure for telecommunication network

- Dzalilov, Zari, Ouveysi, Iradj, Rubinov, Alex

**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.

**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.

An extended lifetime measure for telecommunications networks : Improvements and implementations

- Dzalilov, Zari, Ouveysi, Iradj, Bektas, Tolga

**Authors:**Dzalilov, Zari , Ouveysi, Iradj , Bektas, Tolga**Date:**2012**Type:**Text , Journal article**Relation:**Journal of Industrial and Management Optimization Vol. 8, no. 3 (2012), p. 639-649**Full Text:****Reviewed:****Description:**Predicting the lifetime of a network is a stochastic and very hard task. Sensitivity analysis of a network in order to identify the weakest points in the network, provides valuable knowledge to draw an optimum investment strategy for the expansion of the networks for the network carriers. To achieve this goal, a new measure, called topology lifetime, was recently proposed for measuring the performance of a telecommunication network. This measure not only allows to perform a sensitivity analysis of the networks, but also it provides the means to compare the different topologies with respect to the ability of the network in supporting growth in network traffic before new capacity/facility is installed. This paper addresses some improvements upon the previously defined measures and presents the implementation results of the various lifetime measure methodologies. Computational analysis on some commonly used topologies show how the new measure can be utilized in assessing network performance.**Description:**2003010401

**Authors:**Dzalilov, Zari , Ouveysi, Iradj , Bektas, Tolga**Date:**2012**Type:**Text , Journal article**Relation:**Journal of Industrial and Management Optimization Vol. 8, no. 3 (2012), p. 639-649**Full Text:****Reviewed:****Description:**Predicting the lifetime of a network is a stochastic and very hard task. Sensitivity analysis of a network in order to identify the weakest points in the network, provides valuable knowledge to draw an optimum investment strategy for the expansion of the networks for the network carriers. To achieve this goal, a new measure, called topology lifetime, was recently proposed for measuring the performance of a telecommunication network. This measure not only allows to perform a sensitivity analysis of the networks, but also it provides the means to compare the different topologies with respect to the ability of the network in supporting growth in network traffic before new capacity/facility is installed. This paper addresses some improvements upon the previously defined measures and presents the implementation results of the various lifetime measure methodologies. Computational analysis on some commonly used topologies show how the new measure can be utilized in assessing network performance.**Description:**2003010401

Challenging issues in dynamic reconfiguration of telecommunication networks

- Dzalilov, Zari, Ouveysi, Iradj

**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

**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

Dynamic reconfiguration of telecommunication networks

- Dzalilov, Zari, Ouveysi, Iradj, Rubinov, Alex

**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

Mathematical models for failure reconfiguration of telecommunication networks : Part 1

- Dzalilov, Zari, Ouveysi, Iradj

**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

- Dzalilov, Zari, Ouveysi, Iradj

**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.

On the implementation of dynamic reconfiguration in telecommunication networks

- Dzalilov, Zari, Ouveysi, Iradj

**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

**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

Optimization based clustering algorithms in multicast group hierarchies

- Jia, Long, Ouveysi, Iradj, Rubinov, Alex, Bagirov, Adil

**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

**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

Optimization in telecommunication network maintenance

- Jia, Long, Rubinov, Alex, Ouveysi, Iradj

**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

Queueing programming models in telecommunication network maintenance

- Ugon, Julien, Jia, Long, Ouveysi, Iradj

**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

To be fair or efficient or a bit of both

- Zukerman, Moshe, Mammadov, Musa, Tan, Liansheng, Ouveysi, Iradj, Andrew, Lachlan

**Authors:**Zukerman, Moshe , Mammadov, Musa , Tan, Liansheng , Ouveysi, Iradj , Andrew, Lachlan**Date:**2008**Type:**Text , Journal article**Relation:**Computers and Operations Research Vol. 35, no. 12 (2008), p. 3787-3806**Full Text:****Reviewed:****Description:**IIntroducing a new concept of (®, ¯)-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 · ® · 1, nor more than ¯ ¸ 1, times its fair share, this paper provides a framework to optimize efficiency (utilization, throughput or revenue) subject to fairness constraints in a general telecommunications network for an arbitrary fairness criterion and cost functions. We formulate a non-linear program (NLP) that finds the optimal bandwidth allocation by maximizing efficiency subject to (®, ¯)-fairness constraints. This leads to what we call an efficiency-fairness function, which shows the benefit in efficiency as a function of the extent to which fairness is compromised. To solve the NLP we use two algorithms. The first is a well known branch-and-bound-based algorithm called Lipschitz Global Optimization and the second is a recently developed algorithm called Algorithm for Global Optimization Problems (AGOP). We demonstrate the applicability of the framework to a range of example from sharing a single link to efficiency fairness issues associated with serving customers in remote communities.**Description:**C1

**Authors:**Zukerman, Moshe , Mammadov, Musa , Tan, Liansheng , Ouveysi, Iradj , Andrew, Lachlan**Date:**2008**Type:**Text , Journal article**Relation:**Computers and Operations Research Vol. 35, no. 12 (2008), p. 3787-3806**Full Text:****Reviewed:****Description:**IIntroducing a new concept of (®, ¯)-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 · ® · 1, nor more than ¯ ¸ 1, times its fair share, this paper provides a framework to optimize efficiency (utilization, throughput or revenue) subject to fairness constraints in a general telecommunications network for an arbitrary fairness criterion and cost functions. We formulate a non-linear program (NLP) that finds the optimal bandwidth allocation by maximizing efficiency subject to (®, ¯)-fairness constraints. This leads to what we call an efficiency-fairness function, which shows the benefit in efficiency as a function of the extent to which fairness is compromised. To solve the NLP we use two algorithms. The first is a well known branch-and-bound-based algorithm called Lipschitz Global Optimization and the second is a recently developed algorithm called Algorithm for Global Optimization Problems (AGOP). We demonstrate the applicability of the framework to a range of example from sharing a single link to efficiency fairness issues associated with serving customers in remote communities.**Description:**C1

- «
- ‹
- 1
- ›
- »

Are you sure you would like to clear your session, including search history and login status?