CN115499357A

CN115499357A - Path scheduling method, device and system

Info

Publication number: CN115499357A
Application number: CN202110608715.5A
Authority: CN
Inventors: 刘志华; 卢泉; 辛梓焜; 贾曼; 黄卓君
Original assignee: China Telecom Corp Ltd
Current assignee: China Telecom Corp Ltd
Priority date: 2021-06-01
Filing date: 2021-06-01
Publication date: 2022-12-20

Abstract

The disclosure relates to a method, a device and a system for scheduling paths, and relates to the technical field of communication. The scheduling method comprises the following steps: acquiring the link degradation rate of a path between adjacent nodes corresponding to a router advertised by the router; and informing the acquired link degradation rate to an upper-layer controller so that the controller calculates and issues a path scheduling strategy according to the link degradation rate.

Description

Path scheduling method, device and system

Technical Field

The present disclosure relates to the field of communications technologies, and in particular, to a path scheduling method, a path scheduling apparatus, a path scheduling system, and a non-volatile computer-readable storage medium.

Background

Today, the "application" of TE (Traffic Engineering) can implement a proper set of functions to enable ISP (Internet Service Provider) to precisely control the distribution of Traffic within its routing domain.

In the related art, the TE may transfer the traffic flow from the shortest path selected by IGP (Interior Gateway Protocol) to another potential, better quality physical path within the ISP network.

Disclosure of Invention

The inventors of the present disclosure found that the following problems exist in the above-described related art: the scheduling of the path is based on singleness, resulting in a degradation of the quality of the path scheduling.

In view of this, the present disclosure provides a technical solution for path scheduling, which can improve the quality of path scheduling.

According to some embodiments of the present disclosure, there is provided a method for scheduling a path, including: acquiring the link degradation rate of a path between adjacent nodes corresponding to a router advertised by the router; and informing the acquired link degradation rate to an upper-layer controller so that the controller calculates and issues a path scheduling strategy according to the link degradation rate.

In some embodiments, obtaining the link degradation rate of the path between the corresponding neighboring nodes of the router advertisement includes: the information of IS-IS (Intermediate System-to-Intermediate System) receiving router advertisement, after the TLV (Type Length Value) parameter of IS-IS information IS extended, the information includes link degradation rate.

In some embodiments, the type field of the TLV parameter identifies that IS-IS information IS used to advertise a link degradation rate, the value field of the TLV parameter identifies whether the IS-IS information carries the link degradation rate, and in the case of carrying the link degradation rate, identifies a specific numerical value of the link degradation rate; a length field of TLV parameters, identifying the length of the value field.

In some embodiments, obtaining the link degradation rate of the path between the corresponding neighboring nodes of the router advertisement includes: a BGP-LS (Border Gateway Protocol Link-state) characteristic is deployed at each peer of a BGP (Border Gateway Protocol); and acquiring the link degradation rate through BGP-LS characteristics.

In some embodiments, notifying the acquired link degradation rate to the controller of the upper layer includes: summarizing the link degradation rate of each path in IGP (Interior Gateway Protocol) topology through BGP; and informing the aggregated link degradation rate to a controller of an upper layer.

In some embodiments, aggregating, by BGP, the link degradation rates for the paths in the IGP topology includes: the link degradation rate of each process or each AS (Autonomous System) is summarized by BGP.

In some embodiments, notifying the acquired link degradation rate to a controller of an upper layer includes: establishing a Route RR (Route Reflector) of a controller and BGP as a BGP-LS neighbor; and informing the acquired link degradation rate to the controller through the BGP-LS neighbor.

In some embodiments, the link degradation rate is determined according to the number of link degradation errors and the number of data packets received by the link within a preset time, and the link degradation rate is positively correlated with the number of link degradation errors and negatively correlated with the number of data packets received by the link.

According to other embodiments of the present disclosure, there is provided a path scheduling apparatus including: an obtaining unit, configured to obtain a link degradation rate of a path between neighboring nodes corresponding to a router advertised by the router; and the notification unit is used for notifying the acquired link degradation rate to an upper-layer controller so that the controller can calculate and issue a path scheduling strategy according to the link degradation rate.

According to still further embodiments of the present disclosure, there is provided a scheduling system of a path, including: a scheduling apparatus, configured to perform the scheduling method in any of the embodiments; a router for advertising a link degradation rate of a path between neighboring nodes; and the controller is used for calculating and issuing a path scheduling strategy according to the link degradation rate.

According to still other embodiments of the present disclosure, there is provided a path scheduling apparatus including: a memory; and a processor coupled to the memory, the processor configured to perform the method of scheduling paths in any of the above embodiments based on instructions stored in the memory device.

According to still further embodiments of the present disclosure, there is provided a non-transitory computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements a method of scheduling paths in any of the above embodiments.

In the embodiment, the link quality information is added as the basis of the path scheduling, and the calculation dimension index of the path scheduling is perfected, so that the quality of the path scheduling is improved.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description, serve to explain the principles of the disclosure.

The present disclosure may be more clearly understood from the following detailed description, taken with reference to the accompanying drawings, in which:

fig. 1 illustrates a flow diagram of some embodiments of a method of scheduling paths of the present disclosure;

FIG. 2 illustrates a flow diagram of some embodiments of step 120 in FIG. 1;

fig. 3 shows a schematic diagram of some embodiments of a scheduling method of paths of the present disclosure;

fig. 4 illustrates a block diagram of some embodiments of a scheduling apparatus of a path of the present disclosure;

FIG. 5 shows a block diagram of further embodiments of a scheduling apparatus of paths of the present disclosure;

fig. 6 shows a block diagram of further embodiments of a scheduling apparatus of paths of the present disclosure;

fig. 7 illustrates a block diagram of some embodiments of a scheduling system for paths of the present disclosure.

Detailed Description

Various exemplary embodiments of the present disclosure will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, the numerical expressions, and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless specifically stated otherwise.

Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the convenience of description.

The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses.

Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail, but are intended to be part of the specification where appropriate.

In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values.

It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.

As previously mentioned, TE lacks the path computation dimension based on link quality, resulting in a degradation of the quality of the path scheduling. The technical scheme of the disclosure adds an extended attribute of the IS-IS protocol for encapsulating the link degradation rate; and informing the information of the link degradation rate to a controller of an upper layer through BGP-LS, thereby realizing the scheduling of a high-quality path. For example, the technical solution of the present disclosure can be realized by the following embodiments.

Fig. 1 illustrates a flow diagram of some embodiments of a method of scheduling paths of the present disclosure.

As shown in fig. 1, in step 110, the link degradation rate of the path between the neighboring nodes corresponding to the router advertised by the router is obtained.

In some embodiments, the IS-IS information advertised by the router IS received, and the TLV parameters of the IS-IS information are extended to include a link degradation rate.

For example, a Type (Type) field of TLV parameter, identifying IS-IS information for advertising a link degradation rate; a Value (Value) field of the TLV parameter, which identifies whether the IS-IS information carries a link degradation rate, and identifies a specific numerical Value of the link degradation rate in the case of carrying the link degradation rate; a Length field (Length) of the TLV parameter, identifying the Length of the value field.

For example, the Type field may occupy 1 byte for indicating the Type number of the IS-IS information attribute. The Type field may be set to 0010, decimal 40, to identify a new attribute of the extension for advertising the link degradation rate.

For example, the Length field may take 1 byte, indicating the Length of the Value attribute (e.g., may be set to 0001 0000, i.e., 16 decimal).

For example, the Value field identifies the attribute Value, and may take the last 10 bits of 2 bytes to represent the degradation rate Value. If the bit 6 represents whether the IS-IS information carries the link degradation rate information (e.g. 0 represents no carrying, 1 represents carrying), and if the link degradation rate information IS carried, the bits 7 to 16 represent specific values of the link degradation rate, e.g. 0000 0100 0000 0000 to 0000 0111 1110 1000 represents 0% to 1000% of the link degradation rate.

In some embodiments, the router calculates a link degradation indicator (e.g., a link degradation rate) and defines an extended IS-IS information attribute based on the link degradation indicator.

For example, a router may communicate a path degradation rate when advertising routing information.

In some embodiments, BGP-LS features are deployed at each peer of BGP; and acquiring the link degradation rate through BGP-LS characteristics.

For example, a BGP-LS feature may be deployed at all peers within the RR and AS of BGP, and the IS-IS link degradation rate may be obtained through the BGP-LS feature.

In some embodiments, the link degradation rate is determined according to the number of link degradation errors and the number of data packets received by the link within a preset time. The link degradation rate is positively correlated to the number of link degradation errors and negatively correlated to the number of packets received by the link.

For example, the link quality degradation information includes various link degradation Error information, such as at least one of CRC (Cyclic Redundancy Check) Error information, ECC (Error Correcting Code) Error information, and Overflow Error information, which are present during reception of the data packet.

For example, various error information may be accumulated, and the number of link degradation errors in a preset time may be calculated. For example, the link degradation rate is the ratio of the number of link degradation errors to the number of packets received by the link over a time interval.

In step 120, the obtained link degradation rate is notified to the upper layer controller, so that the controller calculates and issues a path scheduling policy according to the link degradation rate.

In some embodiments, the controller may calculate, according to the summarized link degradation rate, a path with the lowest total link degradation rate between the Source node (Source) and the Destination node (Destination) as a path to be scheduled, thereby implementing selection of a high-quality path.

Step 120 may be implemented, for example, by the embodiment in fig. 2.

Fig. 2 illustrates a flow diagram of some embodiments of step 120 in fig. 1.

As shown in fig. 2, in step 1210, the link degradation rates of the paths in the IGP topology are summarized by BGP.

In some embodiments, the link degradation rates for processes or ases are aggregated via BGP.

In step 1220, the aggregated link degradation rate is notified to the upper layer controller.

In some embodiments, the routing RRs of the controller and BGP are established as BGP-LS neighbors; and informing the acquired link degradation rate to the controller through the BGP-LS neighbor.

For example, the RR and controller of BGP establish BGP-LS neighbors; RR summarizes the link degradation rate of each path in the IGP topology; and informing the summarized link degradation rate to a controller of an upper layer.

In some embodiments, by improving the IS-IS protocol, a new TLV parameter expanding the IS-IS IS defined for announcing the average link degradation rate of the links between the neighbor nodes; BGP can acquire and summarize the link degradation rate information from IGP and announce the link degradation rate information to an upper controller through BGP-LS; and the controller issues a routing strategy and selects a high-quality path.

For example, the technical solution of the present disclosure may be implemented by the embodiment in fig. 3.

Fig. 3 shows a schematic diagram of some embodiments of a scheduling method of paths of the present disclosure.

As shown in fig. 3, the router calculates a link degradation indicator (e.g., a link degradation rate) and defines an extended IS-IS information attribute according to the link degradation indicator. For example, a router may communicate a path degradation rate when advertising routing information.

For example, the link quality degradation information includes various link degradation error information, such as at least one of CRC error information, ECC error information, overflow error information, which exists during reception of the packet.

Various error information can be accumulated, and the number of link degradation errors in a preset time can be calculated. For example, the link degradation rate is a ratio of the number of link degradation errors to the number of packets received by the link over a time interval.

The IS-IS extension attribute may be defined, for example, as follows.

The Type field may occupy 1 byte to represent a Type number of the IS-IS information attribute. The Type field may be set to 0010, i.e., decimal number 40, identifying a new attribute for the extension to advertise the link degradation rate.

The Length field may take 1 byte and represents the Length of the Value attribute (e.g., may be set to 0001 0000, i.e., 16 decimal).

The Value field identifies the attribute Value and may take the last 10 bits of 2 bytes to represent the degradation rate Value. If the bit 6 represents whether the IS-IS information carries the link degradation rate information (e.g. 0 represents no carrying, 1 represents carrying), and if the link degradation rate information IS carried, the bits 7 to 16 represent specific values of the link degradation rate, e.g. 0000 0100 0000 0000 to 0000 0111 1110 1000 represents 0% to 1000% of the link degradation rate.

BGP-LS characteristics can be deployed at all peers in RR and AS of BGP, and IS-IS link degradation rate IS obtained through the BGP-LS characteristics.

An RR of BGP and a controller (controller) establish a BGP-LS neighbor; RR summarizes the link degradation rate of each path in the IGP topology; and informing the summarized link degradation rate to a controller of an upper layer.

The controller calculates and issues a routing strategy to realize the selection of a high-quality path. For example, the controller may calculate a path with the lowest total link degradation rate between the Source node (Source) and the Destination node (Destination) according to the summarized link degradation rate, and use the path as a path to be scheduled, thereby implementing selection of a high-quality path.

In some embodiments, different industry services have the same requirements for network quality of service. Some services, such as VOIP (Voice over Internet Protocol, voice over IP) services, are sensitive to delay and jitter, but can tolerate a small amount of packet discard; some services only need to ensure a certain bandwidth and are not sensitive to delay and jitter; some services, such as financial services, have relatively strict requirements on network degradation indicators and packet loss conditions.

By using the technical scheme in any one of the embodiments, adaptive high-quality path selection can be realized according to different service scenes, and higher-quality user experience is provided.

In the embodiment, a new IS-IS expansion attribute IS defined, a new path judgment index IS defined, and a dimension of basis for calculation of the degradation rate IS increased.

Therefore, the calculation index of path selection can be improved, and better user experience is provided; the BGP-LS gathers the link state and informs the controller, so that the requirement on the computing capability of an upper layer controller is reduced, and the requirement on the IGP capability of the controller is avoided; the BGP protocol summarizes link quality of each process or each AS, and directly sends complete information to the controller, which is beneficial to path selection and calculation.

Fig. 4 illustrates a block diagram of some embodiments of a scheduling apparatus of a path of the present disclosure.

As shown in fig. 4, the scheduling apparatus 4 of the path includes an obtaining unit 41 and an announcing unit 42.

The acquisition unit 41 acquires a link degradation rate of a path between neighboring nodes corresponding to a router advertised by the router.

In some embodiments, the obtaining unit 41 receives IS-IS information advertised by the router, and the TLV parameter of the IS-IS information IS extended to include a link degradation rate.

In some embodiments, retrieval unit 41 deploys BGP-LS properties at each peer of BGP; and acquiring the link degradation rate through BGP-LS characteristics.

The notification unit 42 notifies the acquired link degradation rate to an upper controller, so that the controller calculates and issues a path scheduling policy according to the link degradation rate.

In some embodiments, the advertising unit 42 aggregates the link degradation rate of each path in the IGP topology through BGP; and informing the aggregated link degradation rate to a controller of an upper layer.

In some embodiments, the advertising unit 42 aggregates the link degradation rates of the processes or the ases by BGP.

In some embodiments, the advertising unit 42 establishes the routing RR of the controller and BGP as BGP-LS neighbors; and informing the acquired link degradation rate to the controller through the BGP-LS neighbor.

Fig. 5 shows a block diagram of further embodiments of a scheduling apparatus of a path of the present disclosure.

As shown in fig. 5, the scheduling apparatus 5 of the path of the embodiment includes: a memory 51 and a processor 52 coupled to the memory 51, the processor 52 being configured to execute the scheduling method of the path in any one embodiment of the present disclosure based on instructions stored in the memory 51.

The memory 51 may include, for example, a system memory, a fixed nonvolatile storage medium, and the like. The system memory stores, for example, an operating system, an application program, a Boot Loader, a database, and other programs.

Fig. 6 illustrates a block diagram of still further embodiments of a scheduling apparatus of a path of the present disclosure.

As shown in fig. 6, the scheduling device 6 of the path of this embodiment includes: a memory 610 and a processor 620 coupled to the memory 610, the processor 620 being configured to execute the method of scheduling paths in any of the foregoing embodiments based on instructions stored in the memory 610.

The memory 610 may include, for example, system memory, fixed non-volatile storage media, and the like. The system memory stores, for example, an operating system, an application program, a Boot Loader, and other programs.

The scheduling means 6 of the path may further comprise an input output interface 630, a network interface 640, a storage interface 650, etc. These

interfaces

630, 640, 650 and the connections between the memory 610 and the processor 620 may be, for example, via a bus 660. The input/output interface 630 provides a connection interface for input/output devices such as a display, a mouse, a keyboard, a touch screen, a microphone, and a sound box. The network interface 640 provides a connection interface for various networking devices. The storage interface 650 provides a connection interface for external storage devices such as an SD card and a usb disk.

Fig. 7 illustrates a block diagram of some embodiments of a scheduling system of paths of the present disclosure.

As shown in fig. 7, the scheduling system 7 of the path includes: a scheduling device 71, used in the scheduling method in any of the above embodiments; a router 72 for advertising a link degradation rate of a path between neighboring nodes; and the controller 73 is used for calculating and issuing a path scheduling strategy according to the link degradation rate.

As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable non-transitory storage media having computer-usable program code embodied therein, including but not limited to disk storage, CD-ROM, optical storage, and the like.

So far, the scheduling method of a path, the scheduling apparatus of a path, the scheduling system of a path, and the nonvolatile computer readable storage medium according to the present disclosure have been described in detail. Some details that are well known in the art have not been described in order to avoid obscuring the concepts of the present disclosure. Those skilled in the art can now fully appreciate how to implement the teachings disclosed herein, in view of the foregoing description.

The method and system of the present disclosure may be implemented in a number of ways. For example, the methods and systems of the present disclosure may be implemented by software, hardware, firmware, or any combination of software, hardware, and firmware. The above-described order for the steps of the method is for illustration only, and the steps of the method of the present disclosure are not limited to the order specifically described above unless specifically stated otherwise. Further, in some embodiments, the present disclosure may also be embodied as programs recorded in a recording medium, the programs including machine-readable instructions for implementing the methods according to the present disclosure. Thus, the present disclosure also covers a recording medium storing a program for executing the method according to the present disclosure.

Although some specific embodiments of the present disclosure have been described in detail by way of example, it should be understood by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the present disclosure. It will be appreciated by those skilled in the art that modifications may be made to the above embodiments without departing from the scope and spirit of the present disclosure. The scope of the present disclosure is defined by the appended claims.

Claims

1. A method of scheduling paths, comprising:

acquiring a link degradation rate of a path between neighboring nodes corresponding to a router advertised by the router;

and announcing the obtained link degradation rate to an upper-layer controller so that the controller can calculate and issue a path scheduling strategy according to the link degradation rate.

2. The scheduling method of claim 1, wherein the obtaining of the link degradation rate of the inter-router-corresponding neighbor path advertised by the router comprises:

receiving intermediate system to intermediate system IS-IS information advertised by the router, wherein the type length value TLV parameter of the IS-IS information IS extended to include the link degradation rate.

3. The scheduling method of claim 2,

a type field of the TLV parameter identifying that the IS-IS information IS used to advertise the link degradation rate,

a value field of the TLV parameter identifying whether the IS-IS information carries the link degradation rate and, in the case of carrying the link degradation rate, a specific numerical value of the link degradation rate,

a length field of the TLV parameter identifying a length of the value field.

4. The scheduling method of claim 1, wherein the obtaining of the link degradation rate of the inter-router-corresponding neighbor path advertised by the router comprises:

deploying BGP-LS characteristics at each peer of BGP;

and acquiring the link degradation rate through the BGP-LS characteristics.

5. The scheduling method of claim 1, wherein the notifying the acquired link degradation rate to a controller of an upper layer comprises:

summarizing the link degradation rate of each path in the IGP topology through BGP;

and informing the aggregated link degradation rate to a controller of an upper layer.

6. The scheduling method of claim 5, wherein the aggregating, by BGP, the link degradation rates for the paths in an Interior Gateway Protocol (IGP) topology comprises:

and summarizing the link degradation rate of each process or each system AS through BGP.

7. The scheduling method according to claim 1, wherein the notifying the acquired link degradation rate to a controller of an upper layer comprises:

establishing the controller and a route reflector RR of BGP as BGP-LS neighbors;

and notifying the acquired link degradation rate to the controller through the BGP-LS neighbor.

8. The scheduling method of any one of claims 1-7,

the link degradation rate is determined according to the number of link degradation errors in a preset time and the number of data packets received by the link,

the link degradation rate is positively correlated with the number of link degradation errors and negatively correlated with the number of packets received by the link.

9. A scheduling apparatus of a path, comprising:

an obtaining unit, configured to obtain a link degradation rate of a path between neighboring nodes corresponding to a router advertised by the router;

and the notification unit is used for notifying the acquired link degradation rate to an upper-layer controller so that the controller can calculate and issue a path scheduling strategy according to the link degradation rate.

10. A system for scheduling paths, comprising:

scheduling means for performing the scheduling method of any one of claims 1-8;

a router for advertising a link degradation rate of a path between neighboring nodes;

and the controller is used for calculating and issuing a path scheduling strategy according to the link degradation rate.

11. A scheduling apparatus of a path, comprising:

a memory; and

a processor coupled to the memory, the processor configured to perform the method of scheduling of paths of any of claims 1-8 based on instructions stored in the memory.

12. A non-transitory computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the method of scheduling of paths of any of claims 1-8.