Summary
International Technical Conference on Circuits/Systems, Computers and Communications
2016
Session Number:T1-3
Session:
Number:4444
A New Approach to Solve the Partitioning Problem to Realize Highly Reliable Telecommunications Networks
Takayuki Saito, Masahiro Hayashi ,
pp.427-430
Publication Date:2016/7/10
Online ISSN:2188-5079
DOI:10.34385/proc.61.4444
PDF download (1.5MB)
Summary:
We propose a new algorithm to solve the partitioning problem. The problem is to check whether a telecommunication network can be divided into two subnetworks such that we can ensure the independence of two paths by assigning these paths in different subnetworks. The basic idea of our proposed algorithm is to transform a special type of configuration called delta to simplify the network topology. Numerical examples show that it realizes actually faster execution time for checking rather than previous algorithm.