Abstract
In this study, we examine the stability assessment of the current network by using the number of trees generated when an articulation node within the network becomes functional. As a consequence, we will be able to design networks with more stability using the same amount of resources. Previous studies assessed the stability of a network by using the number of nodes adjacent to a broken node but they were inapplicable to complex networks with more than two broken nodes. The network stability assessment method proposed in this study will be applicable to complex networks with two or more broken nodes and will offer a more detailed assessment by considering the distribution of network risk factors.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kim, Y., Ahn, S., Chung, J.-w.: Importance of network Articulation node of traffic base analysis techniques. In: Proceedings of the Digital Contents Society, December 2007, pp. 113–117 (2007)
Kim, Y.h., Kim, K., Lim, C.S., Ahn, S., Chung, J.-w.: Technique of Analysis of Network’s Importance through Analysis on the Relationship between an Articulation Node and its Adjacent Nodes. In: GESTS, pp. 1–8 (January 2008)
Horowitz, E., Sahni, S., Anderson-Freed, S.: Fundamentals of Data Structure in C, 2nd edn., pp. 265–292. Silicon Press (August 2007)
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley, Reading (1983)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. McGraw-Hill, New York (1990)
Gabow, H.N.: Path-based depth-first search for strong and biconnected components, Tech. Report CU-CS-890-99, revised version, Dept. of Computer Sciencs, University of Colorado at Boulder (2000)
Weiss, M.A.: Data Structures and Algorithm Analysis in C++. Addison-Wesley, Reading (1999)
Huang, S.T.: A new distributed algorithm for the biconnectivity problem. In: Proc. of International Conf. on Parallel Processing, vol. 3, pp. 106–113 (1989)
Tarjan, R.E., Vishkin, U.: An efficient parallel biconnectivity algorithm, TR-69, Ultracomputer Note-51, Courant Institute of Mathematical Sciences, NY (1983)
Chaudhuri, P.: An optimal distributed algorithm for finding articulation points in a network. Computer Communications 21(18), 1707–1715 (1998)
Liang, Y.D., Rhee, C.: Finding biconnected components in O(n) time for a class of graphs. Information Processing Letters 60(3), 159–163 (1996)
Woo, J., Sahni, S.: Computing biconnected components on a hypercube. In: Second IEEE Workshop on Future Trends of 1990 Distributed Computing Systems, pp. 277–283 (1990)
Ziemer, R.E (translator)., Kim, J.-k.: Elements of Engineering Probability and Statistics, November 2003, pp. 90–92. HongRueng pub. (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, Y., Kim, H., Chung, Jw., Cho, Kj., Yu, Ks. (2008). Network Stability Assessment Using the Number of Tree Adjacent to an Articulation Node. In: Gervasi, O., Murgante, B., Laganà, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2008. ICCSA 2008. Lecture Notes in Computer Science, vol 5073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69848-7_98
Download citation
DOI: https://doi.org/10.1007/978-3-540-69848-7_98
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69840-1
Online ISBN: 978-3-540-69848-7
eBook Packages: Computer ScienceComputer Science (R0)