CN108521617B

CN108521617B - Service route discovery method and device and computer readable storage medium

Info

Publication number: CN108521617B
Application number: CN201810673092.8A
Authority: CN
Inventors: 尉海立; 路杨
Original assignee: Raisecom Technology Co Ltd
Current assignee: Raisecom Technology Co Ltd
Priority date: 2018-06-26
Filing date: 2018-06-26
Publication date: 2020-10-23
Anticipated expiration: 2038-06-26
Also published as: CN108521617A

Abstract

The application discloses a service route discovery method and device and a computer readable storage medium, which are applied to a network element for realizing end-to-end service transmission, wherein the method comprises the following steps: determining effective initial connection, finding and creating the uppermost layer service from the source port and the sink port of the effective initial connection respectively, and if no uppermost layer service exists, ending the finding process; if the top layer service exists, setting the top layer service as the current parent layer service; detecting whether the current parent layer service bears the sub-layer service of a lower layer, if not, finishing the discovery process; if the sub-layer service bearing the lower layer exists, setting the newly found sub-layer service as the current parent layer service, and circularly detecting whether the current parent layer service bears the sub-layer service of the lower layer or not. The method and the device improve the service discovery speed by discovering and creating the top layer service from two ends of the effective initial connection and discovering the sub-layer service based on the top layer service.

Description

Service route discovery method and device and computer readable storage medium

Technical Field

The present invention relates to the field of communications network technologies, and in particular, to a method and an apparatus for discovering a service route, and a computer-readable storage medium.

Background

An Optical Transport Network (OTN) is a Transport Network based on a wavelength division multiplexing technology and is a next-generation backbone Transport Network in an Optical layer organization Network. An OTN Element Management System (EMS) may manage a plurality of OTN elements. Discovering and displaying actually configured service information on a network management system is an important function of OTNEMS network management.

The traditional service discovery algorithm performs calculations based on configuration data on the connection, the board, and the port. The representation of the traffic route consists of port and fiber connection data. When executing the service discovery task, the service discovery algorithm starts to calculate from each effective service initial port and continuously searches a next hop port, and if the next hop port is an effective service terminal port, the service discovery is successful; if no suitable next hop port is found, the service discovery fails.

In an OTN system, there are often a plurality of network elements and single boards, so there are a large number of service starting points, and in the process of calculating the next hop from each service starting point backward, if the next hop is obtained from the optical fiber connection data, the speed is faster; if the next hop is obtained from the configuration data, complex algorithm calculation is needed to obtain the next hop information from the configuration data, and the speed is slow. Therefore, the conventional service discovery method has low efficiency and long execution time when the quantity of the network element single boards is large.

Disclosure of Invention

In order to solve the above technical problem, the present invention provides a method and an apparatus for discovering a service route, and a computer-readable storage medium, which can improve a service discovery speed.

In order to achieve the purpose of the invention, the technical scheme of the embodiment of the invention is realized as follows:

the embodiment of the invention provides a service route discovery method, which is applied to a network element for realizing end-to-end service transmission and comprises the following steps:

determining effective initial connection, finding and creating the uppermost layer service from the source port and the sink port of the effective initial connection respectively, and if no uppermost layer service exists, ending the finding process; if the top layer service exists, setting the top layer service as the current parent layer service;

detecting whether the current parent layer service bears the sub-layer service of a lower layer, if not, finishing the discovery process; if the sub-layer service bearing the lower layer exists, setting the newly found sub-layer service as the current parent layer service, and circularly detecting whether the current parent layer service bears the sub-layer service of the lower layer or not.

Further, the determining a valid initial connection includes:

and if the service types of the CTPs of the uppermost layer connection terminal points contained in the source port and the destination port of the connection between the network elements are the same and belong to effective initial service types, determining that the connection between the network elements is the effective initial connection.

Further, when the service type of CTP included in each network element port is obtained from CTP information, before the determining that the connection is effectively initiated, the method further includes:

identifying nodes contained in all network elements, wherein the nodes are a combination of one or more single boards which belong to the same network element and can complete a certain type of specific function;

all CTPs and information thereof inside the identified nodes are acquired, and routing information of each node is acquired.

Further, the discovering and creating the uppermost layer service from the source port and the sink port of the valid initial connection respectively includes:

respectively taking the uppermost CTP contained in the effective initial connection source port and the effective initial connection sink port as the current CTP, searching the routing information of the next hop, when the routing information of the next hop is searched, setting branch numbers according to the routing information number meeting the conditions, updating the current CTP on each branch according to the routing information of the next hop, and repeating the searching process until the route discovery of each branch is finished;

performing parameter matching on the routing information searched by each effective initial connection to combine the routing information into complete routing information;

the combined routing information is merged.

Further, the searching for the routing information of the next hop includes: the backward search for the uppermost CTP included in the sink port for effective initial connection, that is, the backward search is started from the uppermost CTP included in the sink port for effective initial connection, specifically includes:

if the current CTP is terminated, the second half route discovery is successful;

if the current CTP is not the first CTP of the routing information in the identified node or the CTP on the source port of the internode connection or the internetwork connection, finishing the discovery and having no effective routing information;

if the current CTP is not terminated and is the first CTP of the identified routing information in the node, setting branch number according to all routing information numbers meeting the condition, the next hop of each branch is the tail CTP of routing information meeting the condition, updating the next hop of each branch to be the current CTP, and when the current CTP is judged to be the CTP on the source port of the inter-node connection or the inter-network element connection, updating the next hop to be the CTP matched with the current CTP on the sink port of the inter-node connection or the inter-network element connection, and updating the current CTP according to the next hop;

when the first backward search is performed, the current CTP is the uppermost CTP contained by the sink port of the active originating connection.

Further, the searching for the routing information of the next hop includes: the forward search for the uppermost CTP included in the active source port of the originating connection, that is, the forward search is started from the uppermost CTP included in the active source port of the originating connection, specifically includes:

if the current CTP is terminated, the first half route discovery is successful;

if the current CTP is not a terminal CTP which is not the routing information in the identified node or a CTP on the destination port of the internode connection or the internetwork element connection, the discovery is finished and no effective routing information exists;

if the current CTP is not terminated and is the tail CTP of the routing information in the identified node, setting branch numbers according to all routing information numbers meeting conditions, wherein the next hop of each branch is the head CTP of routing information meeting conditions, updating the next hop of each branch to be the current CTP, and when the current CTP is judged to be the CTP on the source port of the inter-node connection or the inter-network element connection, updating the next hop to be the CTP matched with the current CTP on the source port of the inter-node connection or the inter-network element connection and updating the current CTP;

when the first forward search is performed, the current CTP is the uppermost CTP contained in the source port of the active originating connection.

Further, the detecting whether the current parent layer service carries a lower sub-layer service includes:

if the source CTP and the sink CTP which have created the traffic route both contain child CTPs, carrying out pairing combination on the child CTPs contained in the source CTP and the sink CTP; if the sub-CTP is not included or the included sub-CTP is not successfully paired, the discovery process is ended;

otherwise, respectively taking the CTPs at the two ends of each pair of paired combinations as the current CTP, searching the routing information of the next hop, when the routing information of the next hop is searched, setting the branch number according to the routing information number meeting the conditions, updating the current CTP on each branch according to the routing information of the next hop, and repeating the searching process until the route discovery of each branch is finished;

performing parameter matching on the routing information searched by each pair of paired combinations to combine the routing information into complete routing information;

the combined routing information is merged.

Further, the searching for the routing information of the next hop includes starting a backward search from the sink CTP of each pair of paired combinations, and specifically includes:

if the current CTP is not terminated and is not the first CTP of the routing information in the identified node or is not the CTP on the source port of the inter-network element connection or the inter-node connection, the parent layer CTP of the current CTP is taken, if the parent layer CTP of the current CTP is the first CTP of the routing information of the existing service, the child CTP node of the tail CTP of the routing information is searched, and when the CTP matched with the current CTP parameter exists in the child CTP node, the CTP matched with the current CTP parameter is updated to be the next hop, and the current CTP is updated accordingly; if no CTP matched with the current CTP parameter exists in the child CTP nodes, the discovery is finished and no effective routing information exists;

if the current CTP is not terminated and is the first CTP of the routing information in the identified node, setting branch number according to the number of all routing information meeting the condition, the next hop of each branch is the tail CTP of routing information meeting the condition, updating the next hop of each branch to be the current CTP, and when the current CTP is judged to be the CTP on the source port of the inter-network element connection or the inter-node connection, updating the next hop to be the CTP matched with the current CTP on the sink port of the inter-network element connection or the inter-node connection, and updating the current CTP according to the next hop;

when the first backward search is carried out, the current CTP is the host CTP of the pairing combination.

Further, the searching for the routing information of the next hop includes starting a forward search from the source CTP of each pair of pairing combination, and specifically includes:

if the current CTP is terminated, the first half route discovery is successful;

if the current CTP is not terminated and is not the tail CTP of the routing information in the identified node or is not the CTP on the host port of the inter-network element connection or the inter-node connection, the parent layer CTP of the current CTP is taken, if the parent layer CTP of the current CTP is the tail CTP of the routing information of the existing service, the child CTP node of the head CTP of the routing information is searched, and when the CTP matched with the current CTP parameter exists in the child CTP node, the CTP matched with the current CTP parameter is updated to be the next hop, and the current CTP is updated according to the next hop; if no CTP matched with the current CTP parameter exists in the child CTP nodes, the discovery is finished and no effective routing information exists;

if the current CTP is not terminated and is the tail CTP of the routing information in the identified node, setting branch numbers according to all routing information numbers meeting conditions, wherein the next hop of each branch is the head CTP of routing information meeting conditions, updating the next hop of each branch to be the current CTP, and when the current CTP is judged to be the CTP on the sink port of the inter-network element connection or the inter-node connection, updating the next hop to be the CTP matched with the current CTP on the source port of the inter-network element connection or the inter-node connection, and updating the current CTP according to the next hop;

and when the first forward search is carried out, the current CTP is the source end CTP of the pairing combination.

Embodiments of the present invention also provide a computer-readable storage medium, which stores one or more programs that are executable by one or more processors to implement the steps of the traffic route discovery method according to any one of the above.

The embodiment of the invention also provides a service route discovery device, which comprises a processor and a memory, wherein:

the processor is configured to execute a traffic route discovery program stored in the memory to implement the steps of the traffic route discovery method according to any one of the above.

The embodiment of the invention also provides a service route discovery device, which is applied to a network element for realizing end-to-end service transmission, and comprises an uppermost layer search module and a lower layer search module, wherein:

the uppermost layer searching module is used for determining effective initial connection, discovering and creating uppermost layer services from a source port and a sink port of the effective initial connection respectively, and ending the discovering process if no uppermost layer service exists; if the top layer service exists, setting the top layer service as the current parent layer service, and informing a low-layer searching module;

the lower layer searching module is used for receiving the notification of the uppermost layer searching module, detecting whether the current parent layer service bears the sub-layer service of the lower layer, and if the current parent layer service does not bear the sub-layer service of the lower layer, finishing the discovery process; if the sub-layer service bearing the lower layer exists, setting the newly found sub-layer service as the current parent layer service, and circularly detecting whether the current parent layer service bears the sub-layer service of the lower layer or not.

The technical scheme of the invention has the following beneficial effects:

the service route discovery method and device and the computer readable storage medium provided by the invention have the advantages that the service discovery process is improved, the algorithm is simple and the service discovery speed is improved by discovering and creating the top layer service from two ends of effective initial connection and discovering the sub-layer service based on the top layer service;

furthermore, the invention identifies the nodes before discovering the service route, and obtains the CTP attribute information and the routing information inside each node, when discovering the service route, the route calculation inside the node is very fast, and the hop count of route search is reduced.

Drawings

The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the invention and not to limit the invention. In the drawings:

fig. 1 is a schematic flow chart of a service route discovery method according to an embodiment of the present invention;

FIG. 2 is a flow chart illustrating a backward search from the uppermost CTP contained in a sink port that effectively initiates a connection according to an embodiment of the present invention;

FIG. 3 is a flowchart illustrating a backward search from a paired sink CTP according to an embodiment of the present invention;

fig. 4 is a flowchart illustrating another service route discovery method according to an embodiment of the present invention;

fig. 5 is a schematic structural diagram of a service route discovery apparatus according to an embodiment of the present invention;

fig. 6 is a schematic structural diagram of another service route discovery apparatus according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention will be described in detail below with reference to the accompanying drawings. It should be noted that the embodiments and features of the embodiments of the present invention may be arbitrarily combined with each other without conflict.

The service route discovery method of the present invention will be described in detail below, and in order to make the method of the embodiment of the present invention clearer, a description will be first made of several concepts involved in the implementation of the present invention:

connection Termination Point (CTP): is an abstract expression of the Connection reference Point of the information transfer entity, unlike the Connection reference Point (CP) in g.805, the CTP of the end-to-end system has the following properties in addition to the properties of the Connection reference Point: support is provided for functions of mapping from client layer service to service layer, multiplexing and demultiplexing, resource allocation (available time slot) and the like; to support multiple layers of transport traffic, CTPs are also layered and may have a parent-child relationship, for example, an ODU2 carries 8 ODU0 by multiplexing and demultiplexing, and then the 8 ODU0 CTPs are child CTPs corresponding to ODU2 CTPs; each CTP also has attribute information indicating whether it is terminated itself. A CTP is terminated if it multiplexes/demultiplexes a signal or if it is itself a node on the way up and down the signal.

Node (Node): nodes are logic units, and a Node is composed of one or more single boards, and the nodes can be divided into different types according to the service logic realized by the nodes, such as terminal nodes, relay nodes, uplink and downlink nodes, and the like. The Node is independent of the specific networking mode, and any effective networking mode can be split into a plurality of nodes. After the Node recognizes, the routing information inside the Node is fixed, and the Node may have multiple routes inside. A Node contains two types of resource information: one is routing information inside the Node, and the other is CTP information contained in the Node, where the CTP information includes its attribute information, e.g., whether CTP is terminated, parent-child relationship, etc. For example: a, B, C, D, E, F six single boards form a Node to complete a specific function, for the discovery algorithm, the Node is a whole, and the internal routing information of the Node is determined when the Node is identified. For example, a Node contains two routes, CTP1- > CTP2 of single plate a (CTP1 is the first CTP of this route, CTP2 is the last CTP of this route) and CTP1- > CTP3 of single plate F (CTP1 is the first CTP of this route, CTP3 is the last CTP of this route). Then when the discovery algorithm calculates the forward route, if the node of the current hop is CTP1 of board 1, the CTPs of the next hop are CTP2 and CTP 3. When the discovery algorithm calculates the reverse route, if the current node is CTP2, then the next hop is CTP 1; if the current node is CTP3, the next hop is CTP 1. Here, one point is explained: in other examples, when a route is formed for more CTPs, the head CTP and the tail CTP of the route are similarly determined according to the routing order, and the detailed routing information inside the Node can be determined according to the resource information contained in the Node.

Connecting: i.e. a fiber optic connection.

As shown in fig. 1, a service route discovery method according to the present invention is applied to a network element for implementing end-to-end service transmission, and the method includes the following steps:

step 101: determining a valid initial connection;

in this embodiment, the determining the valid initial connection includes: if the service type of the top-layer connection end point CTP included in the source port and the sink port of the inter-network-element connection is the same and the service type belongs to an effective initial service type (for example, an OTS type), determining that the inter-network-element connection is the effective initial connection, specifically:

if the source port and the destination port of the inter-network-element connection contain only one connection terminal point CTP respectively, and the CTP has the same service type and the service type belongs to an effective initial service type (such as an OTS type), determining that the inter-network-element connection is the effective initial connection; or,

if there are multiple CTPs on the source port and the sink port of the inter-network-element connection, and the service types of the uppermost CTPs included in the source port and the sink port are the same and the service type belongs to an effective initial service type (for example, an OTS type), determining that the inter-network-element connection is the effective initial connection.

Further, the service type of CTP included in each network element port in this step is obtained from CTP information, and further before determining that the connection is effectively initiated, the method further includes:

It should be noted here that the CTP information determination process included in each network element port may be completed before determining the valid initial connection, may be when the valid initial connection needs to be determined, may also be when system networking is completed, or in other scenarios, and is not limited in this context.

It should be noted that, the method for identifying nodes included in all network elements in the present invention may be determined according to the functions implemented by each board, the connection relationship between each board, and the configuration information of each board when actually networking, and in the process of service discovery, the present invention may use the result of node identification, but the present invention only explains the service discovery algorithm, and does not specifically explain how to identify nodes; the type of specific function that the node can perform is preset, which can be implemented by a person skilled in the art in any way in the prior art with reference to a specific application scenario, and the present invention is not limited in any way.

It should be further noted that all boards of a Node are located in the same network element. A service has to go through at least two network elements (a service within a network element has no practical meaning). Thus, an efficient traffic route passes through at least one inter-cell connection and two nodes. The inter-network element connection is taken as the starting connection for the search.

Step 102: discovering and creating the uppermost layer service from the source port and the sink port which are effectively connected initially; if no top layer service exists, go to step 106; if the service of the uppermost layer exists, turning to step 103;

it should be noted that the top-layer service is a service that cannot be aggregated any more and is carried by other services, such as an Optical Transmission Section (OTS) service.

In this embodiment, the discovering and creating the uppermost layer service from the source port and the sink port that are effectively connected to each other includes:

respectively taking the uppermost CTP contained in the effective initial connection source port and the effective initial connection sink port as the current CTP, searching the routing information of the next hop, when the routing information of the next hop is searched, setting branch numbers according to all routing information numbers meeting the conditions, updating the current CTP on each branch according to the routing information of the next hop, and repeating the searching process until the route discovery of each branch is finished;

the combined routing information is merged.

In this step, the searching for the routing information of the next hop includes: backward and forward searches for the uppermost CTP contained in the active originating connection source and sink ports. The backward search described herein refers to: starting the backward search from the uppermost CTP contained in the sink port that effectively initiates the connection, the forward search described herein refers to: the forward search begins with the uppermost CTP contained in the source port of the active originating connection.

As shown in fig. 2, wherein: the backward search specifically comprises:

step A: when the first backward search is carried out, taking the uppermost CTP contained in the sink port of the effective initial connection as the current CTP;

and B: judging whether the current CTP is terminated, if so, turning to the step X; if the current CTP is not terminated, turning to step C;

and C: judging whether the current CTP is the first CTP of the routing information in the identified node, if not, turning to the step Y; if the first CTP of the routing information in the identified node is the first CTP, turning to the step D;

step D: dividing the branch into a plurality of branches for processing, setting the branch number according to the number of all routing information meeting the conditions, wherein the branch number can be set to be 1 or more according to the conditions, the next hop of each branch is the tail CTP of one routing information meeting the conditions, updating the next hop of each branch to be the current CTP, and respectively calculating the next hop of each branch in the step E; (Only one branch of the process is shown in FIG. 2)

It should be noted that, the routing information inside the identified node is already acquired in the process of identifying the node, and in the process of route discovery, the tail CTP is directly determined as the next hop without calculating the routing information inside the identified node, so that the hop count of route search is reduced, and the calculation speed is increased. The branch number is set according to the number of all routing information meeting the condition, wherein the condition is a predefined service condition, for example, the service condition is defined according to configuration information such as wavelength, time slot and the like.

Step E: judging whether the current CTP is terminated, if so, turning to the step X; if the current CTP is not terminated, turning to step F;

step F: judging whether the current CTP is the CTP on the source port of the inter-node connection or the inter-network element connection, if not, turning to the step Y; if the CTP is on the source port of the internode connection or the internetwork connection, turning to the step G;

step G: updating the next hop to the CTP matched with the next hop on the internode connection or the internode connection host port, updating the next hop to the current CTP, and turning to the step B;

step X: the second half of the route discovery is successful, and the route information is recorded;

step Y: the branch discovery is complete and there is no valid routing information.

Similarly, the forward search specifically includes:

step A1: when the first forward search is carried out, taking the uppermost CTP contained in the source port of the effective initial connection as the current CTP;

step B1: judging whether the current CTP is terminated, if so, going to step X1; if the current CTP is not terminated, go to step C1;

step C1: judging whether the current CTP is the tail CTP of the routing information in the identified node, if not, turning to the step Y1; if the identified node is the tail CTP of the routing information inside the identified node, go to step D1;

step D1: setting branch number according to all routing information numbers meeting the conditions, wherein the branch number is divided into a plurality of branches for processing, the branch number can be set to be 1 or more according to the conditions, the next hop of each branch is the first CTP of routing information meeting the conditions, the next hop of each branch is updated to be the current CTP, and the calculation is respectively carried out on each branch by going to the step E1;

step E1: judging whether the current CTP is terminated, if so, going to step X1; if the current CTP is not terminated, go to step F1;

step F1: judging whether the current CTP is the CTP on the node connection or the network element connection host port, if not, turning to the step Y1; if the CTP is the CTP on the connection destination port between the nodes or the network elements, go to step G1;

step G1: updating the next hop to the CTP paired with the source port of the inter-node connection or the inter-network element connection, updating the next hop to the current CTP, and going to step B1;

step X1: the first half of the route is found successfully, and the route information is recorded;

step Y1: the branch discovery is complete and there is no valid routing information.

In this embodiment, forward search and backward search are performed on the routing information contained in the uppermost CTP of each valid source and sink connection port to perform parameter matching, so as to combine the routing information into complete routing information, and combine the combined routing information.

In this embodiment, when merging the combined routing information, the method includes:

the routing information with the same source and destination is merged in the same service;

two unidirectional services with completely opposite sources and destinations are combined into a bidirectional service.

Step 103: setting the top layer service as the current parent layer service;

step 104: detecting whether the current parent layer service bears the sub-layer service of a lower layer, if not, turning to step 106; if the sub-layer service carrying the lower layer exists, go to step 105;

in this embodiment, the detecting whether the current parent layer service carries a lower sub-layer service includes:

otherwise, respectively taking the CTPs at the two ends of each pair of paired combinations as the current CTP, searching the routing information of the next hop, when the routing information of the next hop is searched, setting the branch number according to all the routing information numbers meeting the conditions, updating the current CTP on each branch according to the routing information of the next hop, and repeating the searching process until the route discovery of each branch is finished;

the combined routing information is merged.

When the sub CTPs included in the source CTP and the sink CTP are paired, the pairing is performed based on the wavelength information, the time slot information, and the like of each sub CTP. For example, assuming that the service created is an Optical Multiplex Section (OMS) service, and the source and destination OMS CTPs all contain sub-CTPs of multiple Optical Channels (OCH), OCH sub-CTPs of the same wavelength constitute a combination. Reference is also made to this principle for pairing combinations of CTPs on the connected source and sink ports.

In this step, the routing information of the next hop is searched, i.e. the forward and backward search for each pair of paired combined CTPs is completed. The backward search described herein refers to: starting a backward search from the sink CTP of the pairing combination, the forward search herein refers to: the forward search is started from the source CTP of the pair combination.

As shown in fig. 3, when performing the backward search, the method specifically includes:

step A2: when the first backward search is carried out, the host CTP of the pairing combination is taken as the current CTP;

step B2: judging whether the current CTP is terminated, if so, going to step X2; if the current CTP is not terminated, go to step C2;

step C2: judging whether the current CTP is the first CTP of the routing information in the identified node, if not, turning to step H2; if the first CTP of the routing information inside the identified node is the CTP, go to step D2;

step D2: dividing the branch into a plurality of branches, setting the branch number according to the number of all routing information meeting the condition, wherein the branch number can be set to be 1 or more according to the condition, the next hop of each branch is the tail CTP of one routing information meeting the condition, updating the next hop of each branch to be the current CTP, and respectively switching to the step E2 for calculation; (Only one branch of the process is shown in FIG. 3.)

Step E2: judging whether the current CTP is terminated, if so, going to step X2; if the current CTP is not terminated, go to step F2;

step F2: judging whether the current CTP is the CTP on the source port of the inter-network element connection or the inter-node connection, if not, going to step H2; if the CTP is the CTP on the source port of the inter-network element connection or the inter-node connection, turning to step G2;

step G2: updating the next hop to be the CTP matched with the next hop on the host port connected between the network elements or the nodes, updating the next hop to be the current CTP, and going to step B2;

step H2: taking a parent CTP of the current CTP, and if the parent CTP is the first CTP of the routing information of the existing service, searching a child CTP node of the tail CTP of the routing information;

step I2: detecting whether a CTP matched with the current CTP parameter exists in the child CTP nodes, if so, updating the CTP matched with the current CTP parameter to be a next hop, updating the next hop to be the current CTP, and going to step B2; if there is no CTP matching the current CTP parameters, go to step Y2;

step X2: the second half of the route discovery is successful, and the route information is recorded;

step Y2: the branch discovery is complete and there is no valid routing information.

Similarly, when performing the forward search, the method specifically includes:

step A3: when the first forward search is carried out, taking the source end CTP of the pairing combination as the current CTP;

step B3: judging whether the current CTP is terminated, if so, going to step X3; if the current CTP is not terminated, go to step C3;

step C3: judging whether the current CTP is the tail CTP of the routing information in the identified node, if not, turning to step H3; if the identified node is the tail CTP of the routing information inside the identified node, go to step D3;

step D3: dividing the branch into a plurality of branches, setting the branch number according to the number of all routing information meeting the condition, wherein the branch number can be set to be 1 or more according to the condition, the next hop of each branch is the first CTP of one routing information meeting the condition, updating the next hop of each branch to be the current CTP, and respectively switching to the step E3 for each branch to calculate;

step E3: judging whether the current CTP is terminated, if so, going to step X3; if the current CTP is not terminated, go to step F3;

step F3: judging whether the current CTP is the CTP on the sink port of the inter-network element connection or the inter-node connection, if not, going to step H3; if the CTP is the CTP on the source port of the inter-network element connection or the inter-node connection, turning to step G3;

step G3: updating the next hop to be the CTP paired with the source port of the inter-network element connection or the inter-node connection, updating the next hop to be the current CTP, and going to step B3;

step H3: taking a parent CTP of the current CTP, and if the parent CTP is a tail CTP of routing information of an existing service, searching a child CTP node of a first CTP of the routing information;

step I3: detecting whether a CTP matched with the current CTP parameter exists in the child CTP nodes, if so, updating the CTP matched with the current CTP parameter to be a next hop, updating the next hop to be the current CTP, and going to step B3; if there is no CTP matching the current CTP parameters, go to step Y3;

step X3: the first half of the route is found successfully, and the route information is recorded;

step Y3: the branch discovery is complete and there is no valid routing information.

Step 105: setting the newly found sub-layer service as the current parent-layer service, and continuing to execute in step 104;

it should be noted that, if the newly found sub-layer service information is not null, the newly found sub-layer service is set as the current parent layer service, step 104 is executed again, and the sub-layer service is continuously found.

Step 106: the discovery process ends.

As shown in fig. 4, a method for discovering a service route according to the present invention includes the following steps:

step 401: node logical resource identification

The invention uses the Node resource identification result, but the invention only expounds the service discovery algorithm. How Node resource identification is performed is not specifically described.

Step 402: discovering and creating the top layer service;

the top layer service can not be converged any more, and then the services are carried by other services. Such as OTS traffic. If the top layer service is generated, setting the top layer service as a parent layer service, and going to step 403; if no top level traffic is generated, completion is found.

Step 403: discovering sub-layer services borne by the parent layer services on the basis of the parent layer services;

if sub-layer service is generated, setting the sub-layer service as the current parent-layer service, and going to step 403; if no sub-layer traffic is generated, then the discovery is complete.

As shown in fig. 5, an embodiment of the present invention further provides a service route discovery apparatus, which is applied to a network element that implements end-to-end service transmission, where the apparatus includes an uppermost layer search module 501 and a lower layer search module 502, where:

a top layer searching module 501, configured to determine an effective initial connection, discover and create a top layer service from a source port and a sink port of the effective initial connection, respectively, and if there is no top layer service, end the discovery process; if the top layer service exists, the top layer service is set as the current parent layer service, and the low layer searching module 502 is notified;

a lower layer searching module 502, configured to receive the notification from the uppermost layer searching module 501, detect whether the current parent layer service carries a lower sub-layer service, and if the current parent layer service does not carry the lower sub-layer service, end the discovery process; if the sub-layer service bearing the lower layer exists, setting the newly found sub-layer service as the current parent layer service, and circularly detecting whether the current parent layer service bears the sub-layer service of the lower layer or not.

In this embodiment, as shown in fig. 6, the service route discovery apparatus further includes a node discovery module 503, where:

a node discovery module 503, configured to identify nodes included in all network elements, where a node is a combination of one or more boards that belong to the same network element and can perform a certain type of specific function; all CTPs and information thereof inside the identified nodes are acquired, and routing information of each node is acquired.

It should be noted that the method for identifying nodes included in all network elements by the node discovery module 503 in the present invention may be determined according to the functions implemented by each board, the connection relationship between each board, and the configuration information of each board when actually networking is performed, and in the process of service discovery, the present invention uses the result of node identification, but the present invention only explains the service discovery algorithm, and does not specifically describe how to perform node identification; the type of specific function that the node can perform is preset, which can be implemented by a person skilled in the art in any way in the prior art with reference to a specific application scenario, and the present invention is not limited in any way.

The uppermost layer service refers to a service that cannot be aggregated any more and is carried by other services, for example, an OTS service.

In this embodiment, the determining the valid initial connection by the uppermost layer searching module 501 includes: if the service type of the top layer connection terminal point CTP contained in the source port and the destination port of the inter-network element connection is the same and the service type belongs to an effective initial service type (for example, an OTS type), determining that the inter-network element connection is the effective initial connection.

Specifically, the determining of the valid initial connection by the uppermost searching module 501 includes:

It should be noted that all boards of a Node are in the same network element. A service has to go through at least two network elements (a service within a network element has no practical meaning). Thus, an active traffic path is via at least one inter-cell connection and two nodes. The inter-network element connection is taken as the starting connection for the search.

In this embodiment, the discovering and creating the uppermost layer service from two ends of the effective initial connection by the uppermost layer searching module 501 respectively includes:

the combined routing information is merged.

The search process of the uppermost search module 501 is described in detail below.

In this embodiment, searching for the routing information of the next hop includes: backward and forward searches for the uppermost CTP contained in the active originating connection source and sink ports. The backward search described herein refers to: starting the backward search from the uppermost CTP contained in the sink port that effectively initiates the connection, the forward search described herein refers to: the forward search begins with the uppermost CTP contained in the source port of the active originating connection. When performing backward search, the backward search process of the uppermost layer search module 501 specifically includes:

step D: dividing the branch into a plurality of branches for processing, setting the branch number according to the number of all routing information meeting the conditions, wherein the branch number can be set to be 1 or more according to the conditions, the next hop of each branch is the tail CTP of one routing information meeting the conditions, updating the next hop of each branch to be the current CTP, and respectively calculating the next hop of each branch in the step E;

step F: judging whether the current CTP is the CTP on the source port of the inter-node connection or the inter-network element connection, if not, turning to the step Y; if the CTP is the CTP on the source port of the connection between the nodes or the connection between the network elements, turning to step G;

step G: updating the next hop to the CTP matched with the next hop on the host port of the inter-node connection or the inter-network element connection, updating the next hop to the current CTP, and turning to the step B;

In this embodiment, when performing the forward search, the forward search process of the uppermost search module 501 specifically includes:

step A1: when the first forward search is carried out, taking the uppermost CTP of the source port which is effectively connected with the start as the current CTP;

step F1: judging whether the current CTP is the CTP on the sink port of the inter-node connection or the inter-network element connection, if not, going to step Y1; if the CTP is the CTP on the sink port of the connection between the nodes or the connection between the network elements, go to step G1;

In this embodiment, when merging the combined routing information, the top-level search module 501 merges the routing information having the same source and destination in the same service; two unidirectional services with completely opposite sources and destinations are combined into a bidirectional service.

In this embodiment, the detecting, by the low-level search module 502, whether the current parent-level service carries a lower-level sub-level service includes:

the combined routing information is merged.

When the sub CTPs included in the source CTP and the sink CTP are paired, the pairing is performed based on the wavelength information, the time slot information, and the like of each sub CTP. For example, assuming that the created service is OMS service, and the source and destination OMS CTPs all contain multiple OCH sub-CTPs, then the OCH sub-CTPs of the same wavelength constitute one combination. Pairing CTPs on connected source and sink ports is also referred to this principle.

The search process of the low-level search module 502 is described in detail below. Here, the routing information of the next hop is searched, that is, the forward and backward search for each pair of paired combined CTPs is completed. The backward search described herein refers to: starting a backward search from the sink CTP of the pairing combination, the forward search herein refers to: the forward search is started from the source CTP of the pair combination.

In this embodiment, when starting the backward search from the sink CTP of the pairing combination, the backward search process of the lower search module 502 specifically includes:

step C2: judging whether the current CTP is the first CTP of the routing information in the identified node, if not, turning to step H2; if it is the first CTP of the routing information inside the identified node, go to step D2:

step D2: dividing the branch into a plurality of branches, setting the branch number according to the number of all routing information meeting the condition, wherein the branch number can be set to be 1 or more according to the condition, the next hop of each branch is the tail CTP of one routing information meeting the condition, updating the next hop of each branch to be the current CTP, and respectively switching to the step E2 for calculation;

step G2: updating the next hop to be the CTP corresponding to the next hop on the host port of the inter-network element connection or the inter-node connection, updating the next hop to be the current CTP, and going to step B2;

In this embodiment, when starting the forward search from the paired and combined sink CTP, the forward search process of the lower search module 502 specifically includes:

step F3: judging whether the current CTP is the CTP on the sink port of the inter-network element connection or the inter-node connection, if so, going to step H3; if the CTP is the CTP on the source port of the inter-network element connection or the inter-node connection, turning to step G3;

It should be noted that, if the newly found sub-layer service information is not null, the low-layer search module 502 sets the newly found sub-layer service as the parent layer service, and continues to find the sub-layer service.

The invention has the following advantages:

(1) high speed

The invention only needs to use complex configuration information such as cross, service mapping and the like on the single board when the Node is identified. The service discovery algorithm does not involve iterative computation of configuration information. After Node identification, the routing information inside the Node is generated, and the discovery algorithm is very fast related to the routing calculation in the Node during calculation. The number of hops for route searching is reduced.

(2) High stability

The algorithm is simple and does not relate to specific networking information. After a new networking model appears, the new networking model only needs to be split, and nonexistent Node model identification processing is added.

It will be understood by those skilled in the art that all or part of the steps of the above methods may be implemented by instructing the relevant hardware through a program, and the program may be stored in a computer readable storage medium, such as a read-only memory, a magnetic or optical disk, and the like. Alternatively, all or part of the steps of the foregoing embodiments may also be implemented by using one or more integrated circuits, and accordingly, each module/unit in the foregoing embodiments may be implemented in the form of hardware, and may also be implemented in the form of a software functional module. The present invention is not limited to any specific form of combination of hardware and software.

The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A service route discovery method is applied to a network element for realizing end-to-end service transmission, and the method comprises the following steps:

determining effective initial connection, finding and creating the uppermost layer service from the source port and the sink port of the effective initial connection respectively, and if no uppermost layer service exists, ending the finding process; if the top layer service exists, setting the top layer service as the current parent layer service; the determining a valid starting connection comprises: if the service types of the CTPs of the uppermost layer connection terminal points contained in the source port and the destination port of the connection between the network elements are the same and the service types belong to effective initial service types, determining the connection between the network elements as the effective initial connection;

2. The method of claim 1, wherein when the traffic type of CTP included in each network element port is obtained from CTP information, prior to said determining a valid originating connection, said method further comprises:

3. The method of claim 1, wherein discovering and creating top-level traffic from source and sink ports, respectively, of active originating connections comprises:

respectively taking the uppermost CTP contained in the effective initial connection source port and the effective initial connection destination port as the current CTP, searching the routing information of the next hop, when the routing information of the next hop is searched, setting branch numbers according to the routing information number meeting the conditions, updating the current CTP on each branch according to the routing information of the next hop, and repeating the searching process until the route discovery of each branch is finished;

the combined routing information is merged.

4. The method of claim 3, wherein the searching for routing information for a next hop comprises: starting a backward search from the uppermost CTP contained in the sink port of the active initial connection, specifically including:

5. The method of claim 3, wherein the searching for routing information for a next hop comprises: starting a forward search from the uppermost CTP contained in the source port of the active originating connection, specifically including:

if the current CTP is terminated, the first half route discovery is successful;

6. The method of claim 1, wherein the detecting whether the current parent layer service carries the sub-layer service of a lower layer comprises:

the combined routing information is merged.

7. The method according to claim 6, wherein said searching for routing information of a next hop includes searching backward from a sink CTP of each pair of paired combinations, specifically including:

if the current CTP is not terminated and is the first CTP of the routing information in the identified node, setting branch numbers according to all routing information numbers meeting conditions, wherein the next hop of each branch is the tail CTP of the routing information meeting the conditions, updating the next hop of each branch to be the current CTP, and when the current CTP is judged to be the CTP on the source port of the inter-network element connection or the inter-node connection, updating the next hop to be the CTP matched with the current CTP on the sink port of the inter-network element connection or the inter-node connection, and updating the current CTP according to the next hop;

and when the first backward search is carried out, taking the host CTP of the pairing combination as the current CTP.

8. The method of claim 6, wherein searching for routing information of a next hop includes starting a forward search from a source CTP of each pair of pairing combination, and specifically includes:

if the current CTP is terminated, the first half route discovery is successful;

9. A computer-readable storage medium, having one or more programs stored thereon, the one or more programs being executable by one or more processors to perform the steps of the traffic route discovery method according to any of claims 1 to 8.

10. A traffic route discovery apparatus, comprising a processor and a memory, wherein:

the processor is configured to execute a traffic route discovery program stored in the memory to implement the steps of the traffic route discovery method according to any one of claims 1 to 8.

11. A service route discovery device is applied to a network element for realizing end-to-end service transmission, and comprises an uppermost layer search module and a lower layer search module, wherein:

the uppermost layer searching module is used for determining effective initial connection, discovering and creating uppermost layer services from a source port and a sink port of the effective initial connection respectively, and ending the discovering process if no uppermost layer service exists; if the top layer service exists, setting the top layer service as the current parent layer service, and informing a low-layer searching module; the determining a valid starting connection comprises: if the service types of the CTPs of the uppermost layer connection terminal points contained in the source port and the destination port of the connection between the network elements are the same and the service types belong to effective initial service types, determining the connection between the network elements as the effective initial connection;