In order to show the free time slots on all available routes between every two ADM NEs in the managerial domain of sub-network management system(SNMS), this routing algorithm calculates out all usable routes from the start node to the end node simultaneously.
为查询子网管理系统(SNMS)管理域中任意两个插/分处处用器(ADM)网元之间所有路由上的空闲时隙,此路由算法一次性计算出从起点网元(NE)到终点NE的所有可用路由,经实践验证,存储量需求和计算时间较好。