Method for realizing shortest path of double layers based on cluster computing unit

Abstract

The invention provides a method for realizing the shortest path of double layers based on a cluster computing unit. The method comprises the following steps: adding node identification information responsible for each cluster computing unit layer in a flooding information packet of the cluster computing unit layer according to a routing protocol expanding the cluster computing unit layer so as to improve the permeability of layer topology of the cluster computing unit layer, calculating the shortest path reaching a target cluster computing unit from a source cluster computing unit, and directly transmitting a path selection request to the target cluster computing unit along the shortest path to avoid blooding of the path selection requests, thereby greatly reducing the problem of network overloading caused by information blooding. Meanwhile, the adopted method of double layer shortest path can greatly save path selecting resources, reduce convergence time of path selection in large scale, and reduce the complexity of path selection. According to the method, the problem of excessive blooding information caused by mass path selection requests, and problems of time convergence difficulty and computing resource waste in path selection in multiple domains can be solved.

Description

technical field [0001] The invention relates to the technical field of Automatically Switched Optical Networks (ASON, Automatically Switched Optical Networks), in particular to a method for realizing a two-layer shortest path based on a group computing unit. Background technique [0002] In the dual routing computing unit system based on ASON hierarchical routing and Path Computation Element (PCE, Path Computation Element), the ASON routing module acts as an individual computing unit (UCE, Unit Computation Element) to provide functions such as topology discovery and routing calculation; according to PCE technology The set group computing element (GCE, Group Computation Element) provides a group computing service dedicated to complex and restricted routing processes. [0003] In the multi-layer multi-domain optical network dual routing computing unit system, the traffic engineering database (TED, Traffic Engineering Database) has different network horizons; the routing elemen...

AI Technical Summary

Problems solved by technology

In this process, a large amount of path request flood information will be generated, which will increase the network load; at the same time, in the process of backtracking path calculation, path selection exists in the form of broadcast, and finally a tree-type shortest path with the destination node as the root is formed , there is a large computational redundancy in this process, and the convergence time of route selection is relatively long

[0013] In particular, in the GCE-based backtracking routing algorithm, when the number of GCEs or the types of domains is very large, since the routing requests will be flooded at the GCE level, a large number of routing requests will be flooded. At the same time, due to the purpose The GCE where the node is located initiates broadcast route calculation along the direction of the source node, which causes too many GCEs to participate in the route selection process, thus occupying a large amount of GCE computing resources, and the convergence time of route selection cannot be guaranteed

Images