A routing method and system under a multi-level multi-path switching network

By constructing a directed graph and initializing a routing table, and considering the node switching technology capability, centralized and distributed routing algorithms are designed to solve the path feasibility and ring structure problems in multi-level multi-way switching networks, and to realize the calculation of the minimum cost path and hop-by-hop routing.

CN117955893BActive Publication Date: 2026-07-03SUN YAT SEN UNIV
View PDF 2 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
SUN YAT SEN UNIV
Filing Date
2023-12-22
Publication Date
2026-07-03

AI Technical Summary

Technical Problem

Routing algorithms in multi-level multi-path switching networks face challenges such as path topology connectivity not representing path feasibility and the possibility that the shortest feasible path may contain loop structures. Existing technologies cannot effectively solve these challenges.

Method used

Construct a directed graph where nodes represent switches and edges represent communication links. Consider the switching capabilities of nodes, initialize the routing table, obtain the optimal routing table through iterative calculation, and send data packets hop by hop. Use a matrix to represent the switching capabilities of nodes, design centralized and distributed routing algorithms, and gradually update the routing table to find the minimum cost continuous path.

Benefits of technology

It realizes the calculation of the minimum cost path between any pair of nodes in a multi-level multi-path switching network, supports hop-by-hop routing, and nodes only need to exchange information with neighboring nodes without needing to obtain the complete topology structure, thus solving the problems of path feasibility and ring structure.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117955893B_ABST
    Figure CN117955893B_ABST
Patent Text Reader

Abstract

This invention discloses a routing method and system for a multi-layered, multi-path switching network. The method includes the following steps: constructing a directed graph based on the multi-layered network, wherein nodes in the directed graph represent switches, edges represent communication links, each node has the ability to switch between different switching technologies, and the communication link has the ability to transmit data according to the switching technologies of its two endpoints; for each node in the directed graph, initializing the routing table of that node and iteratively calculating the optimal routing table; given a starting node and a target node, obtaining the next hop of the minimum-cost continuous path from the starting node to the target node according to the optimal routing table of the current node, and sending data packets hop-by-hop to the next node. The routing algorithm proposed in this invention can solve the minimum-cost path problem between all node pairs.
Need to check novelty before this filing date? Find Prior Art