research-article

Exact bounds for average pairwise network reliability

Authors:

Alexey Rodionov,

Olga RodionovaAuthors Info & Claims

ICUIMC '13: Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication

Article No.: 45, Pages 1 - 6

https://doi.org/10.1145/2448556.2448601

Published: 17 January 2013 Publication History

Abstract

Several methods for finding exact bounds of average pairwise network connectivity (APNC) are proposed. These methods allows faster decision making about if a network is reliable for its purpose. Previous results on cumulitive updating of all-terminal probabilistic connectivity and exact algorithms for calculating average number of disconnected pairs of nodes in a random graph are used as a base for most of presented results.

References

[1]

Palmer C. R., Siganos G., Faloutsos M., Faloutsos C., and Gibbons P. "The connectivity and faulttolerance of the Internet topology," Workshop on Network-Related Data Management (NRDM-2001), http://www.research.att.com/divesh/papers/cjfgs98-ir.ps.

[2]

Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Pardalos, and Taieb Znati. "On new approaches of assessing network vulnerability: hardness and approximation," IEEE/ACM Trans. Netw. 20, n. 2, pp. 609--619, 201.

Digital Library

[3]

Fangting Sun and Mark A. Shayman. "On pairwise connectivity of wireless multihop networks," Int. J. Secur. Netw. 2, n/1/2, pp. 37--49, 2007.

Digital Library

[4]

Potapov, A., Goemann, B., and Wingender, E., "The pairwise disconnectivity index as a new metric for the topological analysis of regulatory networks," BMC Bioinformatics, 9, n. 1, pp. 1--15, 2008.

[5]

Rodionov, A. S., Rodionova, O. K.: Network Probabilistic Connectivity: Expectation of a Number of Disconnected Pairs of Nodes. HPCC 2006, Springer LNCS, 4208 (2006) 101--109.

Digital Library

[6]

Rodionov, A. S., Rodionova, O. K., Choo, H.: On the Expected Value of a Number of Disconnected Pairs of Nodes in Unreliable Network. ICCSA-2007. Proceedings, part III. Springer-Verlag Lecture Notes in Computer Science 4707, Springer, P. 534--543. (2007)

Digital Library

[7]

Rodionova, O. K., Rodionov, A. S., and Choo H., "Network Probabilistic Connectivity: Exact Calculation with Use of Chains," ICCSA-2004, Springer Lecture Notes in Computer Sciences, Vol. 3046, pp. 315--324, 2004.

[8]

A. Satyanarayana, and M. K. Chang, "Network reliability and the factoring theorem," Networks, vol. 13, (1983) pp. 107--120.

[9]

Shooman, A. M., "Algorithms for Network Reliability and Connection Availability Analysis," Electro/95 Int. Professional Program Proc., pp. 309--333, 1995.

[10]

Shooman, A. M., Kershenbaum, A., "Exact Graph-Reduction Algorithms for Network Reliability Analysis," Proc. GLOBECOM' 91. Vol. 2, pp. 1412--1420, 1991.

[11]

J.-M. Won and F. Karray, "Cumulative Update of All-Terminal Reliability for Faster Feasibility Decision," IEEE Trans. Reliability, vol. 59, no. 3, September 2010, pp. 551--562.

[12]

Rodionov, A., Migov, D, Rodionova, O., "Improvements in the Efficiency of Cumulative Updating of All-Terminal Network Reliability," IEEE Transactions on Reliability, 61, n. 2, pp. 460--465, 2012.

[13]

O. K. Rodionova, A. S. Rodionov, D. Migov, and H. Choo, "Network Probabilistic Connectivity: Using Node Cuts," in Proc. EUC Workshops, X. Zhou Ed. et al. August 2006, Vol. 4097, Springer LNCS, (2006) pp. 702--709.

Digital Library

[14]

Migov, D. A. "Formulas for Fast Calculating a Reliability of Graphs with Small Dimension," Problems of Informatics, no. 2(6) (2010) pp. 10--17. (in Russian).

[15]

Rodionov, A. S., Choo H., "On Generating Random Network Structures: Connected Graphs," International Conference on Information Networking ICOIN 2004, Revised selected papers. Springer Lecture Notes in Computer Science, Vol. 3090, pp. 483--491, 2004.

Cited By

Rodionov A(2023)Little tricks leading to a significant acceleration of the calculation of the reliability of a random graph2023 17th International Conference on Ubiquitous Information Management and Communication (IMCOM)10.1109/IMCOM56909.2023.10035637(1-5)Online publication date: 3-Jan-2023
https://doi.org/10.1109/IMCOM56909.2023.10035637
Mutar E(2023)Estimating the reliability of complex systems using various bounds methodsInternational Journal of System Assurance Engineering and Management10.1007/s13198-023-02108-714:6(2546-2558)Online publication date: 25-Aug-2023
https://doi.org/10.1007/s13198-023-02108-7
Sergeev KMigov D(2021)On Parallel Calculation of All-Terminal Network Reliability2021 17th International Asian School-Seminar "Optimization Problems of Complex Systems (OPCS)10.1109/OPCS53376.2021.9588720(104-107)Online publication date: 13-Sep-2021
https://doi.org/10.1109/OPCS53376.2021.9588720
Show More Cited By

Index Terms

Exact bounds for average pairwise network reliability
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
      2. Network flows
2. Theory of computation
  1. Design and analysis of algorithms
    1. Graph algorithms analysis
      1. Network flows

Recommendations

Estimation of all-terminal network reliability using an artificial neural network

The exact calculation of all-terminal network reliability is an NP-hard problem, with computational effort growing exponentially with the number of nodes and links in the network. During optimal network design, a huge number of candidate topologies are ...
Parallel Implementation of the Factoring Method for Network Reliability Calculation
Proceedings of the 14th International Conference on Computational Science and Its Applications ICCSA 2014 - Volume 8584

We consider the problem of a network reliability calculation for a network with unreliable communication links and perfectly reliable nodes. For such networks, we study two different reliability indices: network probabilistic connectivity and its ...
Network reliability optimization problem of interconnection network under node-edge failure model

The network reliability optimization problem for an interconnection network is to maximize the network reliability subjected to some constraints such as the total cost of the network. Even though, the problem is NP-Hard, many researchers have solved ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICUIMC '13: Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication

January 2013

772 pages

ISBN:9781450319584

DOI:10.1145/2448556

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing
SKKU: SUNGKYUNKWAN UNIVERSITY

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 January 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Grants Council of the President of Russian Federation

Conference

ICUIMC '13

Sponsor:

SIGAPP
SKKU

ICUIMC '13: The 7th International Conference on Ubiquitous Information Management and Communication

January 17 - 19, 2013

Kota Kinabalu, Malaysia

Acceptance Rates

Overall Acceptance Rate 251 of 941 submissions, 27%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
51
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Rodionov A(2023)Little tricks leading to a significant acceleration of the calculation of the reliability of a random graph2023 17th International Conference on Ubiquitous Information Management and Communication (IMCOM)10.1109/IMCOM56909.2023.10035637(1-5)Online publication date: 3-Jan-2023
https://doi.org/10.1109/IMCOM56909.2023.10035637
Mutar E(2023)Estimating the reliability of complex systems using various bounds methodsInternational Journal of System Assurance Engineering and Management10.1007/s13198-023-02108-714:6(2546-2558)Online publication date: 25-Aug-2023
https://doi.org/10.1007/s13198-023-02108-7
Sergeev KMigov D(2021)On Parallel Calculation of All-Terminal Network Reliability2021 17th International Asian School-Seminar "Optimization Problems of Complex Systems (OPCS)10.1109/OPCS53376.2021.9588720(104-107)Online publication date: 13-Sep-2021
https://doi.org/10.1109/OPCS53376.2021.9588720
Rodionov AYadykina OMigov D(2018)On Calculation and Estimation of Flow Transmission Probability in a Communication NetworkOptimization Problems and Their Applications10.1007/978-3-319-93800-4_26(321-330)Online publication date: 17-Jun-2018
https://doi.org/10.1007/978-3-319-93800-4_26
Rodionov AMigov D(2017)Obtaining and Using Cumulative Bounds of Network ReliabilitySystem Reliability10.5772/intechopen.72182Online publication date: 20-Dec-2017
https://doi.org/10.5772/intechopen.72182
Toktoshov GYurgenson AMigov D(2017)Design of utility network subject to reliability constraint2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)10.1109/SIBIRCON.2017.8109864(172-175)Online publication date: Sep-2017
https://doi.org/10.1109/SIBIRCON.2017.8109864
Rodionov A(2016)Cumulative estimated values of structural network's reliability indices and their usage2016 Dynamics of Systems, Mechanisms and Machines (Dynamics)10.1109/Dynamics.2016.7819071(1-4)Online publication date: Nov-2016
https://doi.org/10.1109/Dynamics.2016.7819071

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents