Minimum-cost spanning tree as a path-finding problem
Information Processing Letters
Linear network optimization: algorithms and codes
Linear network optimization: algorithms and codes
Distributed dynamic routing schemes
IEEE Communications Magazine
Dynamic multicast routing in VLSI
Computer Communications
| Hi-index | 0.24 |
A graph-theoretic based dynamic routing algorithm to identify efficient and optimal route(s) for a real-time network management system is presented. It uses a clustering concept to identify the set of routes in the presence of closed loops within a network topology. The philosophy behind the clustering process is to identify and cluster directed loops of lowest order in a network graph and repeat the process until the network topology becomes acyclic. The clustering concept uses Boolean operations on the elements of an incidence matrix using a 'choose and select' concept to reduce the computational complexity of network topology without affecting the overall functionality of the network management system. It lends itself well towards a VLSI-efficient implementation as it uses simple logical 'OR' and 'AND' operations on the rows and columns of the incidence matrix. The implementation details of the proposed algorithm are explained with the help of an example.