CN115412784A

CN115412784A - Low-order service bearing method and device

Info

Publication number: CN115412784A
Application number: CN202211044717.7A
Authority: CN
Inventors: 肖灯辉; 程运娟; 何文浩; 万路
Original assignee: Fiberhome Telecommunication Technologies Co Ltd; Wuhan Fiberhome Technical Services Co Ltd
Current assignee: Fiberhome Telecommunication Technologies Co Ltd; Wuhan Fiberhome Technical Services Co Ltd
Priority date: 2022-08-30
Filing date: 2022-08-30
Publication date: 2022-11-29
Anticipated expiration: 2042-08-30
Also published as: CN115412784B

Abstract

The invention relates to the technical field of optical networks, and provides a method and a device for bearing a low-order service. Wherein the method comprises: calculating the route of the low-order service according to the source node and the destination node of the low-order service; when a high-order virtual channel exists on the route, a low-order service channel is formed by splicing the high-order virtual channel and a physical link on the route so as to bear the low-order service. The invention bears the low-order service by splicing the physical link and the high-order virtual channel, so that the low-order service can be still borne when the high-order interface resources of partial nodes are in shortage.

Description

Low-order service bearing method and device

Technical Field

The present invention relates to the field of optical network technologies, and in particular, to a method and an apparatus for carrying a low-order service.

Background

The SDH network control plane function takes three protocols of GMPLS (RSVP-TE/OSPF-TE/LMP) as a framework, and is matched with a management plane and a transmission plane to realize the ASON function of automatic optical network switching.

Currently, there are two main ways for SDH low-order service bearer: establishing VC12 low-order service node by node in a first mode; the second mode is that a high-order virtual link is established between source and destination nodes to carry low-order service, when the low-order service is established, only the source and destination nodes or the source and destination nodes of the relevant virtual link carrying the low-order service need to issue low-order cross resources, and the intermediate nodes through which the virtual link passes are forwarded through high-order cross, so that the utilization rate of the low-order cross resources of the intermediate nodes is finally improved. The mode of establishing VC12 low-order service node by node can occupy a large amount of network low-order cross resources at the intermediate node, and influence the low-order service of the intermediate node as a source node; the mode of establishing the high-order virtual link can effectively bear the low-order service, and solve the problem that the intermediate node occupies a large amount of network low-order cross resources, but the following problems still exist: when the high-order interface resource of a certain node in the middle of the source and the sink is insufficient, the source and sink direct-connection virtual link cannot be established; only can respond to the fault of the optical fiber link, the high-order cross fault of the intermediate node of the virtual link cannot be automatically detected, and the fast rerouting and the route recovery cannot be realized.

In view of the above, overcoming the drawbacks of the prior art is an urgent problem in the art.

Disclosure of Invention

The invention aims to solve the technical problems that the existing low-order service bearing mode has the problem that intermediate nodes occupy a large amount of low-order service resources, or the problem that the high-order virtual channel cannot be established when the high-order resources are in shortage so that the low-order service cannot be borne.

In a first aspect, the present invention provides a method for carrying a low-order service, including:

calculating the route of the low-order service according to the source node and the destination node of the low-order service;

and when a high-order virtual channel exists on the route, a low-order service channel is formed in a mode of splicing the high-order virtual channel and a physical link on the route so as to bear the low-order service.

Preferably, the calculating a route of the low-order service according to the source node and the sink node of the low-order service specifically includes:

and calculating the routing path according to a constrained shortest path first algorithm, wherein the maximum ratio of the high-order virtual channel in the complete path is used as one of constraint conditions during calculation, and specifically, the path with the maximum ratio of the high-order virtual channel in the complete path is preferentially selected as the routing path of the low-order service in the paths with equal link cost.

Preferably, the forming a low-order service path by means of splicing the high-order virtual path and the physical link on the route specifically includes:

finding one or more combinations of high-order virtual channels with non-overlapping paths among all the high-order virtual channels on the route;

and taking the combination with the highest high-order virtual channel ratio in the complete routing path in all the combinations found on the route as a first combination, and splicing all the high-order virtual channels in the first combination with corresponding physical links to form the low-order service channel.

Preferably, the splicing all the higher-order virtual channels in the first combination with the corresponding physical links to form the lower-order service channel specifically includes:

and issuing high-order intersection at the middle node of the high-order virtual channel, issuing low-order intersection at the nodes at two ends of the high-order virtual channel, and issuing low-order intersection to other nodes of the route, thereby forming the low-order service channel.

Preferably, the method further comprises:

when the number of the low-order service channels between the source node and the destination node of the route exceeds a preset number, establishing a high-order virtual channel between the source node and the destination node of the route;

if the high-order virtual channel is successfully established, the high-order virtual channel is used for bearing the low-order service between the source node and the host node; otherwise, the original low-order service channel is still used for bearing the low-order service between the source node and the sink node.

Preferably, when the higher-order virtual channel is successfully established, the method further includes:

judging whether the low-order service channel passes through the route and issues low-order intersection between the source node and the destination node of the route;

if the low-order service channel issues low-order cross at the source node and the destination node of the route, replacing part of the channels positioned in the route in the low-order service channel with the high-order virtual channel.

Preferably, the method further comprises:

monitoring whether a high-order cross fault occurs in an intermediate node in the high-order virtual channel through a transmission message between a source node and a sink node of the high-order virtual channel;

and when a high-order cross fault occurs in the intermediate node in the high-order virtual channel, rerouting the low-order service.

Preferably, the method further comprises:

and monitoring whether the high-order cross fault of the intermediate node in the high-order virtual channel is recovered, and deleting a low-order service channel on a rerouting path and recovering the low-order service to an original routing path when the high-order cross fault of the intermediate node in the high-order virtual channel is monitored to be recovered.

Preferably, the method further comprises:

and when the low-order service loaded on the corresponding high-order virtual channel is emptied, deleting the high-order virtual channel and releasing high-order interface resources in each node of the high-order virtual channel.

In a second aspect, the present invention further provides a low-order service bearer apparatus, configured to implement the low-order service bearer method in the first aspect, where the apparatus includes:

at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor for performing the low-order traffic bearer method of the first aspect.

In a third aspect, the present invention further provides a non-volatile computer storage medium, where the computer storage medium stores computer-executable instructions, and the computer-executable instructions are executed by one or more processors, and are configured to perform the low-order service bearer method according to the first aspect.

The invention bears the low-order service by splicing the physical link and the high-order virtual channel, so that the low-order service can be still borne when the high-order interface resources of partial nodes are in shortage.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required to be used in the embodiments of the present invention will be briefly described below. It is obvious that the drawings described below are only some embodiments of the invention, and that for a person skilled in the art, other drawings can be derived from them without inventive effort.

Fig. 1 is a flowchart illustrating a low-level service bearer method according to an embodiment of the present invention;

fig. 2 is a flowchart illustrating a low-level service bearer method according to an embodiment of the present invention;

fig. 3 is a flowchart illustrating a low-level service bearer method according to an embodiment of the present invention;

fig. 4 is a flowchart illustrating a low-level service bearer method according to an embodiment of the present invention;

fig. 5 is a schematic view of an application scenario of a low-level service bearer method according to an embodiment of the present invention;

fig. 6 is a flowchart illustrating a low-level service bearer method according to an embodiment of the present invention;

fig. 7 is a schematic view of an application scenario of a low-level service bearer method according to an embodiment of the present invention;

fig. 8 is a schematic application scenario diagram of a low-level service bearer method according to an embodiment of the present invention;

fig. 9 is a schematic application scenario diagram of a low-level service bearer method according to an embodiment of the present invention;

fig. 10 is a schematic application scenario diagram of a low-level service bearer method according to an embodiment of the present invention;

fig. 11 is a flowchart illustrating a low-level service bearer method according to an embodiment of the present invention;

fig. 12 is a flowchart illustrating a low-level service bearer method according to an embodiment of the present invention;

fig. 13 is a schematic structural diagram of a low-level service bearer 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, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

In the description of the present invention, the terms "inner", "outer", "longitudinal", "lateral", "upper", "lower", "top", "bottom", and the like indicate orientations or positional relationships based on those shown in the drawings, and are for convenience only to describe the present invention without requiring the present invention to be necessarily constructed and operated in a specific orientation, and thus should not be construed as limiting the present invention.

In addition, the technical features involved in the respective embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.

Example 1:

embodiment 1 of the present invention provides a low-order service bearer method, as shown in fig. 1, including:

in step 201, a route of a low-order service is calculated according to a source node and a sink node of the low-order service.

In step 202, when a higher-order virtual channel exists on the route, a lower-order service channel is formed by splicing the higher-order virtual channel and a physical link on the route, so as to carry the lower-order service.

When the nodes at two ends of the high-order virtual channel are just the source node and the destination node of the route, the high-order virtual channel is directly used for bearing the low-order service.

The physical link is specifically a link on the route except for the high-order virtual channel.

And when the high-order virtual channel does not exist on the route, using a physical link to carry the low-order service.

The splicing mode of the physical link and the high-order virtual channel specifically comprises the following steps: and issuing high-order intersection at the intermediate node of the high-order virtual channel, and issuing low-order intersection at two ends of the high-order virtual channel and nodes except the high-order virtual channel. Namely, the part of the path except the high-order virtual channel carries the low-order service in a physical link mode.

When a plurality of high-order virtual channels exist on the route and the plurality of high-order virtual channels are connected end to end, the high-order virtual channels can be directly spliced with one another to form a low-order service channel.

By the method, the low-order cross resources can be reserved at the intermediate node of the high-order virtual channel, the low-order cross resource occupation is reduced, and the bearing of the low-order service can be realized under the condition of reducing the low-order cross resource occupation as much as possible.

In practical cases, in order to enable the established high-order virtual channel to carry low-order traffic as much as possible and reduce the occupation of low-order cross resources, the method may further include controlling a carrying route of the low-order traffic so that a route having a longer high-order virtual channel carries the low-order traffic, and when performing routing path calculation, the high-order virtual channel may be included in a constraint condition of the routing path calculation, and in combination with the above embodiment, there is also a preferred embodiment that the determining of the route between the source node and the sink node specifically includes:

and calculating the routing path according to a constrained shortest path first algorithm, wherein the maximum ratio of the high-order virtual channel in the complete path is used as one of constraint conditions during calculation, and specifically, the path with the maximum ratio of the high-order virtual channel in the complete path is preferentially selected as the routing path of the low-order service in a plurality of paths with equal link cost.

For the above embodiment, a specific implementation manner is also provided, that is, a route between the source node and the sink node is determined according to a CSPF (Constrained Shortest Path First) algorithm; the minimum link cost is taken as a first constraint condition, the priority of a virtual link (namely a high-order virtual channel) and a splicing link is taken as a second constraint condition, and the minimum number of routing nodes is taken as a third constraint condition, so that the constraint calculation of the routing path is carried out. And when the cost of the virtual link and the cost of the physical link are the same, preferentially selecting the virtual link. And when the cost of the spliced link is the same as that of the physical link, preferentially selecting the spliced link and selecting the routing path of which the virtual link accounts for the maximum on the path. The first constraint, the second constraint and the third constraint herein represent constraint priorities of the constraints, wherein the first constraint has the highest constraint priority and the third constraint has the lowest constraint priority.

In an actual situation, there may be multiple high-order virtual channels on one routing path, and there may be path overlapping between multiple high-order virtual channels, for this situation, in order to enable a low-order service to multiplex the high-order virtual channels to the maximum extent and reduce low-order cross resource occupation, in combination with the above-mentioned embodiment, there is a preferred implementation manner that the low-order service channel is formed by means of splicing the high-order virtual channel and a physical link on the route, as shown in fig. 2, specifically including:

in step 301, a combination of one or more high-order virtual channels whose paths do not overlap with each other is found out from all the high-order virtual channels on the route.

In step 302, a combination with the highest proportion of the higher-order virtual channels in the complete routing path among all combinations found on the route is used as a first combination, and all the higher-order virtual channels in the first combination are spliced with corresponding physical links to form the lower-order service channel.

When only one high-order virtual channel a exists on the route, only one combination exists, namely only the high-order virtual channel a is contained.

When a plurality of high-order virtual channels exist on the path and no path overlap exists among the plurality of high-order virtual channels, the combination found on the route is a permutation combination of all the high-order virtual channels, for example, three high-order virtual channels a, b and c exist, the corresponding combinations are { a }, { b }, { c }, { a, b }, { b, c }, { a, b and c }, respectively, and the three high-order virtual channels do not overlap, so that the combination in which the ratio of the high-order virtual channels in the complete routing path is the largest is necessarily the { a, b and c } combination, and the ratio of the high-order virtual channels in the corresponding combination in the complete routing path can be represented by using the ratio between the number of the sublinks occupied by all the high-order virtual channels in the combination and the number of the sublinks in the complete routing path; the sub-link is a link formed between every two adjacent nodes.

When a plurality of high-order virtual channels exist on the path and path overlap exists between at least two high-order virtual channels, an optional implementation manner exists: the method comprises the steps of finding various permutation combinations of all high-order virtual channels, removing the combinations of the high-order virtual channels simultaneously containing path overlapping, calculating the sum of the number of sub-links in each high-order virtual channel contained in each combination in the rest combinations, wherein the combination containing the largest number of the sub-links is the combination with the largest ratio of the high-order virtual channels in the complete routing path.

The splicing of all the high-order virtual channels in the first combination with the corresponding physical links to form the low-order service channel specifically includes: if links exist between the adjacent high-order virtual channels in the first combination on the route, between the high-order virtual channel closest to the source node in the first combination and the source node, and between the high-order virtual channel closest to the sink node in the first combination and the sink node, the high-order virtual channels bear the low-order service in the form of physical links. The expression is performed by each node view as follows:

The other nodes are nodes on the route that do not belong to any high-order virtual channel in the first combination.

By the implementation mode, the low-order service channel can multiplex a high-order virtual channel as much as possible, and low-order resource occupation is reduced.

Based on the same concept as the embodiment, when calculating the route of the low-order service, the ratio of the high-order virtual channel in the complete path also needs to be calculated, and with the embodiment, the method specifically includes:

and finding one or more combinations of high-order virtual channels with non-overlapping paths among all the high-order virtual channels on the route.

And taking the combination with the highest proportion of the high-order virtual channels in the complete routing path in all the combinations found on the route as a first combination, and calculating the proportion of the number of the sublinks in all the high-order virtual channels in the first combination in all the sublinks of the routing path as the proportion of the high-order virtual channels in the complete routing path.

In practical applications, when there is no higher-order virtual path on a route, a physical link is required to carry a lower-order service, so as to occupy a lower-order cross resource, and when the lower-order service is carried in a splicing manner, a lower-order cross resource of a node located outside the higher-order virtual path is still occupied, so as to further reduce the occupation of the lower-order resource, in combination with the above embodiments, there are the following preferred embodiments:

and when the number of the low-order service channels between the source node and the destination node of the route exceeds the preset number, establishing a high-order virtual channel between the source node and the destination node of the route.

If the high-order virtual channel is successfully established, the high-order virtual channel is used for bearing the low-order service between the source node and the host node; otherwise, the original low-order service channel is still used for bearing the low-order service between the source node and the destination node.

The lower-order service channel between the source node and the destination node of the route specifically refers to a lower-order service channel in which nodes at two ends are just located at the source node and the destination node of the route. In this embodiment, a lower-order service path on a route represents a lower-order service path of any node of which two end nodes are located on the route, and there is a special case that the two end nodes coincide with a source/destination node of the route, which is expressed by a lower-order service path between the source node and the destination node of the route in this embodiment. Similarly, a high-order virtual channel of any node of the route with nodes at two ends is expressed as a high-order virtual channel on the route, and a high-order virtual channel of which the nodes at two ends are superposed with a source node and a destination node of the route is expressed as a high-order virtual channel between the source node and the destination node of the route.

The preset number is obtained by analyzing the carrying capacity of the low-order service of each node in the network by the technicians in the field. When the establishment of the high-order virtual channel fails, it is indicated that at least one node on the route has high-order resource tension, and the high-order virtual channel from the source node to the sink node cannot be established.

The process of establishing the high-order virtual channel is the prior art, and is not described herein again.

By combining this embodiment with the above embodiments, a more systematic implementation method is obtained:

after determining a routing path for carrying low-order services, judging whether the number of the low-order services of the routing path exceeds a preset number, and if so, trying to establish a high-order virtual channel.

If the high-order virtual channel is successfully established, the high-order virtual channel is used for bearing the low-order service.

And if the establishment of the high-order virtual channel fails and the high-order virtual channel exists on the routing path, carrying the low-order service in a mode of splicing the high-order virtual channel and the physical link.

If the establishment of the high-order virtual channel fails and the high-order virtual channel does not exist on the routing path, the physical link is used for bearing the low-order service.

As a preferred implementation manner, when a route successfully establishes a higher-order virtual channel, the higher-order virtual channel may be reused in another lower-order service channel, that is, when the higher-order virtual channel is successfully established, the method further includes:

when the higher-order virtual channel of the route is successfully established, the method for recalculating the route path and reestablishing the low-order service channel for all the low-order services in which the route path participates in the calculation is similar to the above embodiment, and the method is not described herein again. All the low-order services of which the routing path participates in calculation comprise: the source node and the sink node are consistent with the source and the sink nodes of the route, and at least one link exists in the calculated optional links to pass through the low-order traffic of the route path.

Although this method can ensure that the high-order virtual channel is multiplexed to the maximum extent, under the condition that the network topology is complicated and the number of nodes is large, recalculating the route and the low-order service channel consumes a large amount of resources, for this reason, there is a compromise implementation method, that is, saving the calculation resources, and also implementing multiplexing of the high-order virtual channel as much as possible, as shown in fig. 3, specifically including:

in step 401, for the low-order service path passing through the route, it is determined whether the low-order service path issues low-order intersection between the source node and the destination node of the route.

In step 402, if the low-order service path issues low-order intersection between the source node and the sink node of the route, replacing part of the path located in the route in the low-order service path with the high-order virtual path.

The low order service channel sends low order cross under the source node and the host node of the route, one of which is the low order service channel bearing the low order service by the physical link in the route part, the other one is the low order service channel occupying the high order virtual channel in the route part, but the occupied high order virtual channel is located in the route, and the new established high order virtual channel is used for channel replacement without influencing the partial channel of the low order service channel outside the route. When the low-order service channel originally only consists of the physical link, the low-order service channel is switched to bear the low-order service in a mode of splicing the high-order virtual channel and the physical link. When the high-order virtual channel is used for replacement, resources which are used for bearing low-order service on the route are released.

In an actual implementation process, an intermediate node of a corresponding high-order virtual channel may have a fault, and for this scenario, whether the intermediate node has the fault or not may be monitored, and when the fault occurs, a low-order service via the high-order virtual channel is rerouted, wherein monitoring is performed by using a central controller to monitor and manage each node in the high-order virtual channel, and an implementation manner that does not need the central controller also exists:

and monitoring whether a high-order cross fault occurs in an intermediate node in the high-order virtual channel or not through a transmission message between a source node and a sink node of the high-order virtual channel.

The method for rerouting the low-order service is based on the same concept as the method for calculating the route of the low-order service in the foregoing embodiment.

The embodiment further provides a specific implementation method for monitoring a fault of an intermediate node through a packet, and as shown in fig. 4, the specific implementation method specifically includes:

in step 501, a packet is transmitted between a source node and a sink node of the high-order virtual channel.

In step 502, the intermediate node of the high-order virtual channel performs message transparent transmission according to the corresponding service cross identifier, and the source node and the sink node of the high-order virtual channel perform message termination according to the corresponding service cross identifier; the service cross identification is issued to each node when a high-order virtual channel is established.

In step 503, it is monitored whether a high-order cross fault occurs in the intermediate node of the high-order virtual channel according to the packet.

When the node receives the message, the control plane IP and the virtual interface index carried in the message are compared with the sending end control plane IP and the virtual interface index stored in the node, and message verification is carried out.

The service cross state identifier comprises a high-order logic interface identifier (termination) and a high-order logic interface identifier (transparent transmission), and when the corresponding node receives the message, the termination or the transparent transmission is carried out according to the high-order logic interface identifier of the corresponding node.

The terminating specifically refers to reporting the message to a master control, the master control checks the message and judges whether a high-order cross fault exists in an intermediate node of a high-order virtual channel, and the transparent transmission finger forwards the message to the next node.

And the service cross identification is issued to each node single disk and stored in the node single disk when a high-order virtual channel is established. When the single disk receives the message, the single disk judges the mark of the single disk and forwards the message to the next node or sends the message to the main control module for fault monitoring.

The monitoring, according to the packet, whether a high-order cross fault occurs in an intermediate node of the high-order virtual channel includes, as shown in fig. 5:

in step 601, the source node and the sink node send a packet to each other every a first preset time interval.

In step 602, when the source node or the sink node sends a packet to the other side, a preset increment is added to the corresponding count value.

In step 603, when the source node or the sink node receives a message from the other side, the corresponding count value is restored to a preset value; and the source node and the sink node respectively correspond to a count value.

In step 604, when the count value of the source node and/or the count value of the sink node is greater than or equal to a count threshold, an intermediate node in the high-order virtual channel has a high-order cross fault; wherein the preset value is less than the count threshold.

The first preset time, the preset increment, the preset value and the counting threshold value are obtained by common analysis of technical personnel in the field according to the transmission speed of the message in the network and the fault monitoring requirement of the high-order cross node.

In an actual application process, after a node fails, failure recovery may also occur, and in view of this situation, with reference to the embodiment of the present invention, the method further includes:

and when the count value of the source node and/or the count value of the sink node are/is restored to a preset value and lasts for a second preset time, monitoring to obtain the high-order cross fault restoration of the intermediate node of the high-order virtual channel.

Wherein the second preset time is obtained by analyzing according to the stability requirement of the network by a person skilled in the art.

With reference to the foregoing embodiments, a specific implementation method for monitoring a failure of an intermediate node by using a packet transmission on a high-order virtual channel between a node a and a node B is provided, specifically:

after the high-order virtual channel between the node A and the node B is successfully established, a high-order logic port mark is issued to the node A and the node B and is 0 (indicating that the message needs to be terminated, namely the received message is sent to the master control), and a high-order logic port mark is issued to an intermediate node of the high-order virtual channel and is 1 (indicating that the message needs to be transmitted through, namely the message is transmitted to the next node).

After the high-order virtual channel is successfully established, starting high-order cross fault detection, wherein a source end of the high-order virtual channel sends a JX _ HELLO periodic message to a sink end, and the JX _ HELLO periodic message comprises an A-end control plane IP and a virtual interface index; after sending the message, the A end adds 1 to the JX _ HELLO _ TIMES value of the A end.

When the intermediate node of the high-order virtual channel receives the JX _ HELLO message, the message is transmitted in a transparent mode according to the high-order logic port mark of the intermediate node (the high-order logic port mark value of the intermediate node is 1); when the node B receives the message, the message is terminated and sent to the master control according to the high-order logic port mark (the value is 0); and sending a response JX _ HELLO _ ACK message to the A end, wherein the JX _ HELLO _ ACK message comprises a B end control plane IP and a virtual interface index.

After receiving the JX _ HELLO _ ACK message, the A end checks the JX _ HELLO _ ACK message, namely compares the B-end control plane IP and the virtual interface index stored in the A end with the B-end control plane IP and the virtual interface index carried in the message, and restores the JX _ HELLO _ TIMES of the A end to 0 if the B-end control plane IP and the virtual interface index are consistent with the B-end control plane IP and the virtual interface index carried in the message.

The A terminal judges whether JX _ HELLO _ TIMES reaches a maximum limit value, for example, the maximum limit value is 3; if the maximum limit value is reached, judging a high-order cross fault of the intermediate node of the virtual link; the LMP sets the high-order virtual channel to be DOWN and floods the high-order virtual channel out through OSPF; and restarting the LMP neighbor discovery process, namely performing rerouting.

And monitoring whether the high-order cross fault of the intermediate node in the high-order virtual channel is recovered, and deleting a low-order service channel on the rerouting path and recovering the service to the original routing path when the high-order cross fault of the intermediate node in the high-order virtual channel is monitored to be recovered.

The method further comprises the following steps:

and when the low-order service carried on the corresponding high-order virtual channel is emptied, deleting the high-order virtual channel and releasing high-order interface resources in each node of the high-order virtual channel.

When a certain low-order service is deleted, the TE management module judges whether the low-order service is borne in a high-order virtual channel, and if so, judges whether the high-order virtual channel bears other low-order services; if no other low-order service is carried, deleting the high-order virtual channel after deleting the current low-order service, and releasing the high-order interface resource of each node.

The terms "first," "second," and "third" in the present embodiment have no special limiting meanings, and are used for descriptive purposes only for convenience of describing different individuals among the objects, and should not be interpreted as having special limiting meanings in order or otherwise.

In the present invention, expressions like "a and/or B" have a practical meaning that the implementation manner may be implemented by using a as an object, or B as an object, or an object in which a and B are combined, and a and B may also be replaced by specific subject name objects according to the requirements of the specific description scenario.

Example 2:

based on the method described in embodiment 1, the invention combines with a specific application scenario and uses technical expressions in a related scenario to describe an implementation process in a characteristic scenario.

Fig. 5 shows a scenario of carrying SDH low-level services in an MSTP (Multi Service Transport Platform) network, where a low-level Service is carried between a node R1 and a node R3, and the number of low-level Service channels between the two nodes is 5, and both are carried by physical links.

The method steps of the low-order service bearer will be further described below, and as shown in fig. 6, the method specifically includes:

in step 601, when a new low-order service request exists between a source node and a sink node, the source node calculates and determines a route through a CSPF algorithm; step 602 is entered.

In step 602, the TE management module searches for the number of low-order service channels of the route by querying the resource management module; step 603 is entered.

In step 603, if the number of the low-order service channels of the route reaches a preset number, trying to establish a high-order virtual channel; step 604 is entered; if the number of the low-order service channels of the route does not reach the preset number, the low-order service is borne through a physical link, or the low-order service is borne through a mode of splicing a high-order virtual channel and the physical link; step 605 is entered.

In step 604, if the higher-order virtual channel is successfully established, the higher-order virtual channel is used to carry the lower-order service; if the high-order interface resources of the nodes on the route are insufficient, the high-order virtual channel is failed to be established, and the low-order service is borne in a physical link or a mode of splicing the high-order virtual channel and the physical link; step 605 is entered.

In step 605, when a routed high-order virtual channel exists on the route, carrying is performed in a manner of splicing the high-order virtual channel and a physical link; and when the opened high-order virtual channel does not exist on the route, directly using a physical link for carrying.

The preset number is set to 5 by a person skilled in the art. Performing low-order service bearer in the scenario shown in fig. 6 according to the low-order service bearer method specifically includes:

when a low-order service request from R1 to R5 occurs, the source node R1 calculates a corresponding route as R1-R2-R3-R4-R5 through a CSPF algorithm. The TE management module queries that the number of low-order traffic channels between two nodes of the resource management module reaches 5, and if the traffic of the two nodes is considered to be frequent, the high-order virtual channels from R1 to R5 are opened, and because the high-order interface resource of the route is sufficient, the establishment is successful, a virtual TE link is generated, the original low-order traffic channel is deleted, and the original low-order traffic request is processed, and the virtual TE link is switched to a high-order virtual link for carrying, as shown in fig. 7, wherein the virtual line part represents the high-order virtual channel, which is also called a virtual TE link. When the routing path is calculated, the minimum link cost is taken as a first constraint condition, the priority of the virtual link and the spliced link is taken as a second constraint condition, and the minimum number of routing nodes is taken as a third constraint condition, so that the constraint calculation of the routing path is carried out. When the costs of the virtual link and the physical link are the same, preferentially selecting the virtual link; and when the cost of the spliced link is the same as that of the physical link, preferentially selecting the spliced link and selecting the routing path of which the virtual link accounts for the maximum on the path. As shown in fig. 9, if there is another routing path R1-R4-R5, and there exists a high-order virtual channel of R1-R4-R5 on the routing path, when performing routing calculation, the calculated R1-R2-R3-R4-R5 route has the same link cost as the R1-R4-R5 route, and the R1-R4-R5 route having the high-order virtual channel is preferentially selected.

Meanwhile, when calculating the routing path, all the high-order virtual channels on the corresponding path are obtained, and the high-order virtual channels are combined with each other to find the proportion of the high-order virtual channels in the routing path. As shown in fig. 8, when there is a high-order virtual channel between R1-R2, a high-order virtual channel between R1-R3, and a high-order virtual channel between R5-R6, the combination of high-order virtual channels found on the R1-R2-R3-R4-R5-R6 routing paths is { R1-R2}, { R1-R3}, { R5-R6}, { R1-R2, R1-R3}, { R1-R2, R5-R6}, { R1-R3, R5-R6}, { R1-R2, R1-R3, R5-R6}, since there is an overlap between the high-order virtual channels of R1-R2 and the R1-R3 virtual channels, the combination of one or more virtual channels of the high-order paths found on the routing path with each other on the R1-R2 routing path with the R1-R3 routing paths is calculated by using the combination of high-order virtual channels { R1-R3} and R5-R6, if the combination of the virtual channels of the high-R1-R6 paths in the R1-R2 routing paths is calculated by using the combination of the virtual channels, R1-R5-R6 routing paths, and the virtual channels, R5-R3, the virtual channels, R6 paths.

As shown in fig. 5, when R1 to R3 have a new low-order service request, the source node R1 calculates a route as R1-R2-R3 through the CSPF algorithm. The TE management module finds that the number of low-order service channels on the route reaches 5 by inquiring the resource management module, if the service of two nodes is more frequent, the high-order virtual channels from R1 to R3 are opened, because the high-order interface resource of the route is sufficient, the establishment is successful, a virtual TE link (namely the high-order virtual channel) is generated, the original low-order service channel is deleted, and the original low-order service is switched to the high-order virtual link to bear when being processed; finally, a low-order cross is issued at the source node R1 and the sink node R3, and a high-order cross is issued at the intermediate node R2, as shown in fig. 10, a dotted line between the connections R1 and R3 represents a high-order virtual channel established for the low-order service. If a low-order service channel of R7-R1-R2-R3 exists before a high-order virtual channel is established, the low-order service channel carries low-order service by a physical link, and after the high-order virtual channel between R1 and R3 is established, the low-order service channel of R7-R1-R2-R3 is changed into the high-order virtual channel between R1 and R3 and the physical link between R7 and R1 is spliced to carry the low-order service.

When the low-level service demands of R1 to R4 occur, the source node R1 calculates the routes of R1-R2-R3-R4 preferentially through CSPF, wherein the routes of the low-level service of the high-level virtual links of R1 to R3 and the physical links between R3 and R4 are included. When the number of the low-order service channels from R1 to R4 is less than 5, the route includes a high-order virtual link, so that the low-order service reaches the virtual link destination node R3 via the high-order virtual link and then reaches the service destination node R4 via the physical link. And finally, sending low-order cross at the nodes R1, R3 and R4, sending high-order cross at the node R2, and carrying low-order service by splicing a high-order virtual link and a physical link. When the TE management module inquires that the number of low-order service channels between two nodes of the resource management module reaches 5 and the channels comprise physical links, trying to open high-order virtual channels from R1 to R4; when the high-order interface resources of any node from R1 to R4 are in shortage, the high-order virtual channel is failed to be established, and the subsequent low-order services from R1 to R4 are still carried in a splicing mode.

When there is a low-order service requirement from R2 to R6, the source node R2 calculates the route of R2-R3-R5 preferentially through CSPF, when the number of low-order service channels on the route is less than 5, no high-order virtual channel is established, because there is no high-order virtual channel with both ends on the route, the low-order service is carried through a physical link, and low-order intersection is issued at the R2, R3 and R5 nodes.

When there is a low-order service requirement from R7 to R6, a route of R7-R1-R2-R3-R5-R6 is calculated preferentially on a source node R7 through CSPF, the route comprises a high-order virtual channel of R1-R2-R3 and a high-order virtual channel of R1-R2-R3-R5, when the number of the low-order service channels on the route is less than 5, the low-order service is carried through a high-order virtual channel and physical link splicing mode, because the path of the high-order virtual channel of R1-R2-R3-R5 is the longest on the path, the high-order virtual channel is selected for splicing, finally, the low-order intersection is issued on the R7 and R1 nodes, the high-order intersection is issued on the R2 and R3, and the low-order intersection is issued on the R5 and R6.

After a low-order service channel is formed for each low-order service in a physical link or a high-order virtual channel or a splicing mode of the low-order service and the high-order virtual channel, monitoring a fault of an intermediate node in each high-order virtual channel, taking the high-order virtual channel of R1-R2-R3 as an example, the method specifically comprises the following steps:

the service crossing state identifier sent on R1 and R3 is a high-order logic port identifier (end), and it should be noted that, in the message, the service crossing state identifier may be represented by a high-order logic port state. The subsequent content of the embodiment of the invention also directly takes a high-order logic port as a representative form of service cross state identifier description, and the high-order virtual channel is also presented in a virtual link form. The high-order logic port mark is issued as a high-order logic port mark (transparent transmission) on the R2. Periodically sending JX detection messages to an opposite end through a control plane protocol LMP on virtual link source and destination nodes R1 and R3, judging whether the JX detection messages pass through a middle node R2 or not, if the JX detection messages pass through a virtual channel and are marked as 1, transmitting the JX detection messages through, namely, forwarding the JX detection messages to a next node; if the packet receiving judgment mark on the virtual link source node R1 and the virtual link source node R3 is 0, the message is terminated, namely the message is sent to the master control; specifically, as shown in fig. 11, the virtual link source-destination sends a JX periodic packet:

in step 701, nodes at two ends of the virtual TE link send JX _ HELLO messages to each other at regular time with a time interval of 1 second; and nodes at two ends of the virtual TE link receive the JX _ HELLO message from the opposite end, and when the JX periodic message at the opposite end is received, the JX packet sending count JX _ HELLO _ TIMES at the local end is cleared.

In step 702, it is determined whether the local JX _ HELLO _ TIMES reaches a maximum limit value, which is 3.

In step 703, if the maximum limit value is not reached, sending a JX _ HELLO packet, and adding 1 to the JX _ HELLO _ TIMES value; re-entering the next timing transmission period.

In step 704, if the maximum limit has been reached, determining a high-order cross fault of the intermediate node of the virtual link; the LMP DOWN the virtual TE link and floods out through OSPF.

In step 705, after receiving the virtual link failure message, LSCM (label switching control management) notifies RSVP of the low-level service failure using the virtual link.

In step 706, RSVP notifies the TE management module of the low-level service failure, and after receiving the failure notification, the TE management module executes a rerouting operation to establish a rerouting channel.

When the intermediate node of the virtual link fails, the nodes at the two ends of the virtual link still send JX _ HELLO packets at regular time intervals, so as to monitor the recovery of the virtual link failure, and when the virtual link failure recovers, as shown in fig. 12, the method specifically includes:

in step 801, LMP probes for high-order cross failure recovery of intermediate nodes, and the virtual TE link is set to UP and floods link information through OSPF.

In step 802, at the source node, LSCM (label switching control management) receives the virtual link failure recovery message and informs RSVP of the low-level service failure recovery using the virtual link.

In step 803, RSVP notifies the TE management module of the recovery of the failure of the relevant low-order service, performs a return action, returns to the original path, and finally deletes the rerouting channel and returns the service to the original path.

The method further comprises the following steps: when the low-order service loaded on the corresponding virtual link is empty, the TE management module automatically deletes the high-order virtual link and releases high-order interface resources.

Example 3:

fig. 13 is a schematic structural diagram of a low-level service bearer according to an embodiment of the present invention. The low order traffic carrying means of the present embodiment comprises one or more processors 21 and a memory 22. In fig. 13, one processor 21 is taken as an example.

The processor 21 and the memory 22 may be connected by a bus or other means, and the bus connection is exemplified in fig. 13.

The memory 22, which is a non-volatile computer-readable storage medium, may be used to store non-volatile software programs and non-volatile computer-executable programs, such as the low-level service bearer method in embodiment 1. The processor 21 performs the low-order traffic-bearing method by executing non-volatile software programs and instructions stored in the memory 22.

The memory 22 may include high speed random access memory and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some embodiments, the memory 22 may optionally include memory located remotely from the processor 21, and these remote memories may be connected to the processor 21 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The program instructions/modules are stored in the memory 22 and, when executed by the one or more processors 21, perform the low-order traffic bearer methods of embodiments 1 and 2 described above, for example, perform the respective steps shown in fig. 1-4, 6, 11 and 12 described above.

It should be noted that, for the information interaction, execution process and other contents between the modules and units in the apparatus and system, the specific contents may refer to the description in the embodiment of the method of the present invention because the same concept is used as the embodiment of the processing method of the present invention, and are not described herein again.

Those of ordinary skill in the art will appreciate that all or part of the steps of the various methods of the embodiments may be performed by associated hardware as instructed by a program, which may be stored on a computer-readable storage medium, which may include: read Only Memory (ROM), random Access Memory (RAM), magnetic or optical disks, and the like.

The above description is intended to be illustrative of the preferred embodiment of the present invention and should not be taken as limiting the invention, but rather, the intention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the invention.

Claims

1. A low-order service bearing method is characterized by comprising the following steps:

2. The method for carrying a low-order service according to claim 1, wherein the calculating the route of the low-order service according to the source node and the sink node of the low-order service specifically comprises:

3. The method for carrying a low-order service according to claim 1, wherein the forming a low-order service path by splicing the high-order virtual path and the physical link on the route specifically includes:

4. The low-order service bearer method according to claim 3, wherein the splicing all the high-order virtual channels in the first combination with corresponding physical links to form the low-order service channel specifically comprises:

5. The method for low order traffic bearer according to claim 1, wherein the method further comprises:

if the high-order virtual channel is successfully established, the high-order virtual channel is used for bearing low-order service between the source node and the host node; otherwise, the original low-order service channel is still used for bearing the low-order service between the source node and the destination node.

6. The method for carrying a low order service according to claim 5, wherein when the high order virtual channel is successfully established, the method further comprises:

and if the low-order service channel issues low-order intersection at the source node and the destination node of the route, replacing part of channels positioned in the route in the low-order service channel with the high-order virtual channel.

7. The low order traffic carrying method according to claim 1, wherein the method further comprises:

8. The method for low order traffic bearer according to claim 7, wherein the method further comprises:

and monitoring whether the high-order cross fault of the intermediate node in the high-order virtual channel is recovered, and deleting a low-order service channel on a rerouting path and recovering the low-order service to an original routing path when monitoring that the high-order cross fault of the intermediate node in the high-order virtual channel is recovered.

9. The low order service bearer method according to any one of claims 1 to 8, wherein the method further comprises:

10. A low-order service bearer apparatus, comprising:

at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor for performing the low order traffic bearer method of any of claims 1 to 9.