A two-stage depth-first search routing computation method for narrowband communication networks

Abstract

This invention discloses a two-stage depth-first search routing calculation method for narrowband communication networks, belonging to the field of computer communication technology. Traditional narrowband routing methods suffer from difficulties in Hello mechanism routing protocol interaction and decoupling of a single communication method from parallel links when dealing with narrowband communication network topologies featuring heterogeneous communication methods. This invention, by merging parallel links, constructing an inter-node adjacency matrix, and through the equivalent mapping of communication links to virtual nodes, and by performing a two-stage depth-first search, effectively meets the routing calculation requirements for decoupling a single communication method from composite methods in multi-graph topology scenarios without relying on the periodic protocol information interaction of the Hello mechanism.

Images