A Comprehensive and Efficient Topology Representation in Routing Computation for Large-Scale Transmission Networks

Large-scale transmission network (LSTN) puts forward high requirements to 6G in quality of service (QoS). In the LSTN, bounded and low delay, low packet loss rates, and controllable bandwidth are required to provide guaranteed QoS, involving techniques from the network layer and physical layer. In those techniques, routing computation is one of the fundamental problems to ensure high QoS, especially for bounded and low delay. Routing computation in LSTN researches include the routing recovery based on searching and pruning strategies, individual-component routing and fiber connections, and multi-point relaying (MRP)-based topology and routing selection. However, these schemes reduce the routing time only through simple topological pruning or linear constraints, which is unsuitable for efficient routing in LSTN with increasing scales and dynamics. In this paper, an efficient and comprehensive {routing computation algorithm namely multi-factor assessment and compression for network topologies (MC) is proposed. Multiple parameters from nodes and links in networks are jointly assessed, and topology compression for network topologies is executed based on MC to accelerate routing computation. Simulation results show that MC brings space complexity but reduces time cost of routing computation obviously. In larger network topologies, compared with classic and advanced routing algorithms, the higher performance improvement about routing computation time, the number of transmitted service, average throughput of single routing, and packet loss rates of MC-based routing algorithms are realized, which has potentials to meet the high QoS requirements in LSTN.