An Alternative Design Topology for Metropolitan Area Networks
DOI:
https://doi.org/10.5614/itbj.ict.2012.6.2.1Abstract
One of the key issues in designing a network topology is vulnerability. The vulnerability parameter measures the resistance of a network to disruption of operation after the failure of certain stations or communication links. One counter-measure to address the vulnerability of a network is edge connectivity.In this paper, a more selective concept of edge connectivity is introduced, called component order edge connectivity for MAN topology design. This parameter equals the smallest number of edges that must be removed in order to ensure that the order of each component of the resulting sub -network or sub-graph is less than k.
Downloads
References
Harary, F., Graph Theory, Addison Wesley, Reading, MA, 1969.
Boesch, F., Gross, D., Suffel, C., Saccoman, John T., Kazmierczak, L.W.& Suhartomo, A., A Generalization of A Theorem of Chartrand, Networks, 2009, DOI 10.1002/net.
Boesch, F., Gross, D., Kazmierczak, L., Suhartomo, A. & Suffel, C., Component Order Edge Connectivity-An Introduction, Congressus Numerantium, 178, pp. 7-14, 2006.
Suhartomo, A., Component Order Edge Connectivity: A Vulnerability Parameter for Communication Networks, Doctoral Thesis, Stevens Institute of Technology, Hoboken NJ, May 2007.
Suhartomo, A., A Measure of Vulnerability for Communication Networks: Component Order Edge Connectivity, Proceeding of CITEE, UGM, ISBN: 2085-6350, pp. 28-31, 2009.
Boesch, F., Gross, D., Kazmierczak, L.W., Suhartomo, A. & Suffel, C., Bounds Component Order Edge Connectivity, Congressus Numerantium, 185, pp. 159-171, 2007.
