American Institute of Mathematical Sciences

Advanced
  • Previous Article
    Worst-case performance of the successive approximation algorithm for four identical knapsacks
  • JIMO Home
  • This Issue
  • Next Article
    A common set of weight approach using an ideal decision making unit in data envelopment analysis
July  2012, 8(3): 639-649. doi: 10.3934/jimo.2012.8.639

An extended lifetime measure for telecommunications networks: Improvements and implementations

Zari Dzalilov 1, , Iradj Ouveysi 2, and  Tolga Bektaş 2,

1. 

Centre for Informatics and Applied Optimization, The School of Science, Information Technology and Engineering, University of Ballarat, Victoria, Australia
2. 

ARC Special Research Centre for Ultra-Broadband Information Networks (CUBIN), Electrical and Electronic Engineering (EEE) Department, The University of Melbourne, Victoria 3010, Australia, Australia

Received  September 2011 Revised  January 2012 Published  June 2012

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.
Keywords: linear programming., Telecommunications, network performance, lifetime.
Mathematics Subject Classification: Primary: 58F15, 58F17; Secondary: 53C3.
Citation: Zari Dzalilov, Iradj Ouveysi, Tolga Bektaş. An extended lifetime measure for telecommunications networks: Improvements and implementations. Journal of Industrial & Management Optimization, 2012, 8 (3) : 639-649. doi: 10.3934/jimo.2012.8.639
References:
[1]

Z. Dzalilov, I. Ouveysi and A. Rubinov, A lifetime measure for telecommunication network: Theoretical aspects,, in, (2003), 75.   Google Scholar

[2]

Z. Dzalilov, I. Ouveysi and A. Rubinov, An extended lifetime measure for telecommunication network,, Journal of Industrial and Management Optimization, 4 (2008), 329.   Google Scholar

[3]

N. F. Maxemchuk, I. Ouveysi and M. Zukerman, A quantitative measure for telecommunications networks topology design,, IEEE/ACM Transactions on Networking, 13 (2005), 731.  doi: 10.1109/TNET.2005.852889.  Google Scholar

show all references

References:
[1]

Z. Dzalilov, I. Ouveysi and A. Rubinov, A lifetime measure for telecommunication network: Theoretical aspects,, in, (2003), 75.   Google Scholar

[2]

Z. Dzalilov, I. Ouveysi and A. Rubinov, An extended lifetime measure for telecommunication network,, Journal of Industrial and Management Optimization, 4 (2008), 329.   Google Scholar

[3]

N. F. Maxemchuk, I. Ouveysi and M. Zukerman, A quantitative measure for telecommunications networks topology design,, IEEE/ACM Transactions on Networking, 13 (2005), 731.  doi: 10.1109/TNET.2005.852889.  Google Scholar

[1]

Pablo Neme, Jorge Oviedo. A note on the lattice structure for matching markets via linear programming. Journal of Dynamics & Games, 2020  doi: 10.3934/jdg.2021001
[2]

Ali Mahmoodirad, Harish Garg, Sadegh Niroomand. Solving fuzzy linear fractional set covering problem by a goal programming based solution approach. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020162
[3]

Bing Liu, Ming Zhou. Robust portfolio selection for individuals: Minimizing the probability of lifetime ruin. Journal of Industrial & Management Optimization, 2021, 17 (2) : 937-952. doi: 10.3934/jimo.2020005
[4]

Qiang Fu, Yanlong Zhang, Yushu Zhu, Ting Li. Network centralities, demographic disparities, and voluntary participation. Mathematical Foundations of Computing, 2020, 3 (4) : 249-262. doi: 10.3934/mfc.2020011
[5]

Tong Peng. Designing prorated lifetime warranty strategy for high-value and durable products under two-dimensional warranty. Journal of Industrial & Management Optimization, 2021, 17 (2) : 953-970. doi: 10.3934/jimo.2020006
[6]

Yahia Zare Mehrjerdi. A new methodology for solving bi-criterion fractional stochastic programming. Numerical Algebra, Control & Optimization, 2020  doi: 10.3934/naco.2020054
[7]

Shipra Singh, Aviv Gibali, Xiaolong Qin. Cooperation in traffic network problems via evolutionary split variational inequalities. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020170
[8]

Yasmine Cherfaoui, Mustapha Moulaï. Biobjective optimization over the efficient set of multiobjective integer programming problem. Journal of Industrial & Management Optimization, 2021, 17 (1) : 117-131. doi: 10.3934/jimo.2019102
[9]

Yicheng Liu, Yipeng Chen, Jun Wu, Xiao Wang. Periodic consensus in network systems with general distributed processing delays. Networks & Heterogeneous Media, 2020  doi: 10.3934/nhm.2021002
[10]

Rajendra K C Khatri, Brendan J Caseria, Yifei Lou, Guanghua Xiao, Yan Cao. Automatic extraction of cell nuclei using dilated convolutional network. Inverse Problems & Imaging, 2021, 15 (1) : 27-40. doi: 10.3934/ipi.2020049
[11]

Ke Su, Yumeng Lin, Chun Xu. A new adaptive method to nonlinear semi-infinite programming. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2021012
[12]

Tengfei Yan, Qunying Liu, Bowen Dou, Qing Li, Bowen Li. An adaptive dynamic programming method for torque ripple minimization of PMSM. Journal of Industrial & Management Optimization, 2021, 17 (2) : 827-839. doi: 10.3934/jimo.2019136
[13]

Editorial Office. Retraction: Honggang Yu, An efficient face recognition algorithm using the improved convolutional neural network. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 901-901. doi: 10.3934/dcdss.2019060
[14]

Mahdi Karimi, Seyed Jafar Sadjadi. Optimization of a Multi-Item Inventory model for deteriorating items with capacity constraint using dynamic programming. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2021013
[15]

Yu-Jhe Huang, Zhong-Fu Huang, Jonq Juang, Yu-Hao Liang. Flocking of non-identical Cucker-Smale models on general coupling network. Discrete & Continuous Dynamical Systems - B, 2021, 26 (2) : 1111-1127. doi: 10.3934/dcdsb.2020155
[16]

Ziang Long, Penghang Yin, Jack Xin. Global convergence and geometric characterization of slow to fast weight evolution in neural network training for classifying linearly non-separable data. Inverse Problems & Imaging, 2021, 15 (1) : 41-62. doi: 10.3934/ipi.2020077
[17]

Denis Serre. Non-linear electromagnetism and special relativity. Discrete & Continuous Dynamical Systems - A, 2009, 23 (1&2) : 435-454. doi: 10.3934/dcds.2009.23.435
[18]

Vito Napolitano, Ferdinando Zullo. Codes with few weights arising from linear sets. Advances in Mathematics of Communications, 2020  doi: 10.3934/amc.2020129
[19]

Dandan Wang, Xiwang Cao, Gaojun Luo. A class of linear codes and their complete weight enumerators. Advances in Mathematics of Communications, 2021, 15 (1) : 73-97. doi: 10.3934/amc.2020044
[20]

Awais Younus, Zoubia Dastgeer, Nudrat Ishaq, Abdul Ghaffar, Kottakkaran Sooppy Nisar, Devendra Kumar. On the observability of conformable linear time-invariant control systems. Discrete & Continuous Dynamical Systems - S, 2020  doi: 10.3934/dcdss.2020444

2019 Impact Factor: 1.366

Tools

Metrics

  • PDF downloads (42)
  • HTML views (0)
  • Cited by (0)

Other articles
by authors

[Back to Top]

Copyright © 2020 American Institute of Mathematical Sciences