WO2022199377A1

WO2022199377A1 - Information transmission method and device, network node, controller, and storage medium

Info

Publication number: WO2022199377A1
Application number: PCT/CN2022/079731
Authority: WO
Inventors: 陈然; 彭少富; 肖敏
Original assignee: 中兴通讯股份有限公司
Priority date: 2021-03-26
Filing date: 2022-03-08
Publication date: 2022-09-29
Also published as: CN115209482A; US20240179573A1

Abstract

The present application provides an information transmission method and device, network node, a controller, and a storage medium. The method is applied to the network node. The method comprises: obtaining slice-related resource information of each link in a network; and transmitting the resource information.

Description

Information transmission method, device, network node, controller and storage medium

technical field

The present application relates to the field of communication technologies, for example, to an information transmission method, an apparatus, a network node, a controller, and a storage medium.

Background technique

The 5th Generation mobile communication technology (5G) poses challenges to bearer networks for low latency, flexible scheduling, and massive connections, and slicing is one of the key technologies. Through the slicing technology, 5G network resources can be flexibly segmented, virtual networks that meet the differentiated needs of customers can be quickly customized, and network resources can be fully shared to achieve on-demand customization and dynamic balance of network construction costs.

With the continuous research on network slicing technology, slicing schemes based on Internet Protocol (IP)/Multi-Protocol Label Switching (MPLS) include: Interior Gateway Protocol (IGP) ) flexible algorithms (ie Flex-algo), slice aggregation schemes, etc. IGP Flex-algo can be used as a method to create a virtual topology (or a logical network, also known as a Flex-algo plane) in a physical network, that is, by running multiple IGP algorithms in the same physical topology to create multiple nodes containing different nodes As with the Flex-algo plane of link resources, overlay service traffic can be carried on different Flex-Algo planes (ie, different overlay networks). Each Flex-Algo plane is identified by its corresponding algorithm value, and each FA plane (Flex-Algo plane) can correspond to a slice. The slice aggregation scheme proposes to create slices on the basis of Flex-algo virtual topology, and proposes to use slice aggregate identifier (SA-ID) to identify slices. If the scale of slices to be created in the network is large, such as If the maximum number (such as 128) that can be represented by the IGP Flex-algo algorithm is exceeded, a new slice identifier (such as slice aggregation identifier) must be introduced into the network (including the control plane and forwarding plane) to distinguish different slices resource management and packet forwarding policies.

However, the topology information collected in the related art is link-based topology information, including link delay, bandwidth, packet loss rate, etc., and it is inconvenient to manage and control each slice in the network based on the existing topology information.

SUMMARY OF THE INVENTION

The present application provides an information transmission method, device, network node, controller, and storage medium, which facilitate the management and control of each slice in the network.

The embodiment of the present application provides an information transmission method, which is applied to a network node, and the method includes:

Obtain resource information related to slices for each link in the network;

The resource information is transmitted.

The embodiment of the present application provides an information transmission method, which is applied to a controller, and the method includes:

Obtain resource information related to slices for each link in the network;

The resource information is stored.

An embodiment of the present application provides an information transmission device, which is configured on a network node, and the device includes:

The acquisition module is set to acquire the resource information related to the slice of each link in the network;

A transmission module, configured to transmit the resource information.

An embodiment of the present application provides an information transmission device, which is configured in a controller, and the device includes:

A storage module, configured to store the resource information.

The embodiments of the present application provide a network node, including one or more processors;

a storage device for storing one or more programs;

When the one or more programs are executed by the one or more processors, the one or more processors implement the method as described in any of the embodiments of the present application.

Embodiments of the present application provide a controller, including: at least one processor;

a storage device for storing one or more programs;

The embodiments of the present application provide a storage medium, where a computer program is stored on the storage medium, and when the computer program is executed by a processor, any one of the methods in the embodiments of the present application is implemented.

With regard to the above embodiments and other aspects of the present application, as well as implementations thereof, further explanation is provided in the Brief Description of the Drawings, the Detailed Description and the Claims.

Description of drawings

1 is a schematic flowchart of an information transmission method provided by an embodiment of the present application;

FIG. 2 is a schematic structural diagram of a system provided by an embodiment of the present application;

3 is a schematic flowchart of another information transmission method provided by an embodiment of the present application;

3a is a schematic diagram of a maximum reserved link bandwidth type length value (Type Length Value, TLV) provided by an embodiment of the present application;

3b is a schematic diagram of another maximum reserved link bandwidth TLV provided by an embodiment of the present application;

3c is a schematic diagram of a used bandwidth information TLV provided by an embodiment of the present application;

3d is a schematic diagram of an available link bandwidth TLV provided by an embodiment of the present application;

FIG. 3e is a schematic diagram of resource allocation provided by an embodiment of the present application;

FIG. 4 is a schematic structural diagram of an information transmission apparatus provided by an embodiment of the present application;

FIG. 5 is a schematic structural diagram of another information transmission apparatus provided by an embodiment of the present application;

FIG. 6 is a schematic structural diagram of a network node according to an embodiment of the present application;

FIG. 7 is a schematic structural diagram of a controller according to an embodiment of the present application.

Detailed ways

Hereinafter, the embodiments of the present application will be described with reference to the accompanying drawings. The steps shown in the flowcharts of the figures may be performed in a computer system, such as a set of computer-executable instructions. Also, although a logical order is shown in the flowcharts, in some cases the steps shown or described may be performed in an order different from that herein.

In an exemplary implementation, FIG. 1 is a schematic flowchart of an information transmission method provided by an embodiment of the present application. This method can be applied to improve the convenience of slice management and control in the network. The method can be performed by the information transmission apparatus provided in the present application, the apparatus can be implemented by software and/or hardware, and integrated on a network node, and the network node can be a communication node in the network. FIG. 2 is a schematic diagram of a system structure provided by an embodiment of the present application. Referring to FIG. 2, a network node may notify the controller through a Border Gateway Protocol (Border Gateway Protocol, BGP) link state (Link State, LS), that is, BGP-LS Resource information related to slices for each link. Each network node in the network can obtain resource information related to slices by means of IGP flooding.

As shown in Figure 1, an information transmission method provided by this application includes the following steps:

S110. Acquire resource information related to slices of each link in the network.

In order to facilitate the management and control of slices in the network, network nodes can obtain resource information related to slices of each link in the network, so as to facilitate unified management by the controller. The network node can be any node in the network.

This embodiment of the present application does not limit the manner in which the network node acquires the resource information, for example, the resource information related to the slice on the link may be acquired in the manner of IGP flooding. The resource information can be considered as slice-related information, for example, the resource information can be slice-related link information. Link information can be considered as information representing link status.

In one embodiment, the resource information includes at least one of the following: maximum reserved link bandwidth; available bandwidth; used bandwidth; average link delay; link packet loss rate; maximum link delay; minimum link time delay.

The maximum reserved link bandwidth can be considered as the maximum link bandwidth reserved for a corresponding slice for a link. The available bandwidth can be considered as the available bandwidth for a link corresponding to a slice. The used bandwidth can be considered as a link, corresponding to the used bandwidth of the slice. The average link delay can be considered as the average link delay on a slice corresponding to a link. The maximum link delay can be considered as the maximum link delay on a slice corresponding to a link. The minimum link delay can be considered as the minimum link delay on a slice corresponding to a link. The link packet loss rate can be considered as a link, corresponding to the packet loss rate of the link on the slice.

S120. Transmit the resource information.

After the resource information is acquired, the resource information can be transmitted to other nodes, such as to other network nodes in the network or notified to the controller, so that the controller can manage and control the slice based on the resource information.

In one embodiment, this step may transmit the resource information through BGP-LS, that is, notify the controller of the resource information.

An information transmission method provided by the present application is to acquire resource information related to slices of each link in the network; to transmit the resource information, the method uses the acquired resource information of each link in the network related to slices in the network. The notification is sent to the controller, so that the controller can manage and control the slice.

On the basis of the above-mentioned embodiment, a modified embodiment of the above-mentioned embodiment is proposed. It should be noted here that, in order to simplify the description, only the difference from the above-mentioned embodiment is described in the modified embodiment.

In one embodiment, the resource information includes at least one of the following: maximum reserved link bandwidth; available bandwidth; used bandwidth; average link delay; link packet loss rate; maximum link delay; minimum link delay.

In one embodiment, the resource information is associated with slice information.

In this embodiment, the slice corresponding to the resource information can be represented by associating the resource information with the slice information. The slice information can be considered as slice-related information, such as slice identification information.

In one embodiment, the slice information includes at least one of the following: slice aggregation identifier, algorithm identifier, multi-topology identifier and virtual network identifier.

In one embodiment, the resource information and the slice information are carried in a link attribute TLV extended by the Network Layer Reachability Information (NLRI) of the link.

In this embodiment, a new link attribute TLV can be extended on the link NLRI to carry resource information and slice information.

In one embodiment, the slice information is carried in a link attribute TLV extended by the NLRI of the link network layer reachability information, and the resource information is carried in a child of the link attribute TLV extended by the NLRI of the link network layer reachability information. in TLV.

In this embodiment, a new link attribute TLV may be extended on the link NLRI, the slice information may be carried by the extended link attribute TLV, and the resource information may be carried by the sub-TLV of the extended link attribute TLV.

In one embodiment, the method further includes: when the network topology information changes, acquiring the changed resource information, and transmitting the changed resource information.

The manner of learning the network topology information change is not limited here. When the network topology information changes, the changed resource information can be acquired by means of IGP flooding, and then the changed resource information is transmitted. When the changed resource information is transmitted, the unchanged resource information may also be transmitted together with the changed resource information.

In an exemplary embodiment, the present application also provides an information transmission method, and FIG. 3 is a schematic flowchart of another information transmission method provided by an embodiment of the application, and the method can be applied to improve the convenience of slice management and control in the network sexual situation. The method can be executed by the information transmission device provided in the present application, and the device can be implemented by software and/or hardware and inherited in the controller.

As shown in Figure 3, the information transmission method provided by this application includes the following steps:

S310. Acquire resource information related to slices of each link in the network.

In this step, the resource information transmitted by the network node can be acquired, that is, the resource information transmitted by the network node is collected, and the acquisition means is not limited here, for example, the resource information is acquired through the BGP-LS protocol.

S320. Store the resource information.

After acquiring the resource information, the controller can store the resource information to facilitate the management and control of slices in the network, such as facilitating subsequent querying of resource information, or resource allocation based on resource information.

Reference may be made to the above-mentioned embodiments for the content that is not yet detailed in this embodiment, which will not be repeated here.

In an information transmission method provided by the present application, resource information related to slices of each link in the network is obtained; the resource information is stored, and the slices in the network can be effectively managed and controlled through the obtained resource information.

In one embodiment, the method further includes: acquiring changed resource information; and updating existing resource information according to the changed resource information.

After acquiring the changed resource information, the existing resource information can be updated. In the case where the changed resource information is transmitted together with the unaltered resource information, the received resource information can be directly replaced with the existing resource information.

In one embodiment, the method further includes: acquiring a query request; and searching for resource information corresponding to the query request.

Exemplarily, the application module sends a query request to the controller, the controller searches for resource information corresponding to the query request, and after the control module queries the resource information corresponding to the query request, it can transmit the queried resource information to the application. module.

A query request can be considered as a request for querying resource information.

In one embodiment, the method further includes: acquiring a deployment request; searching for resource information corresponding to the deployment request; and completing resource allocation based on the found resource information.

A deployment request can be thought of as a request to deploy a resource in the network.

After finding the corresponding resource information based on the deployment request, the controller may complete resource allocation, such as path deployment, based on the found resource information.

In one embodiment, the resource information includes at least one of the following: maximum reserved link bandwidth; available bandwidth; used bandwidth; link delay; link packet loss rate; maximum link delay; road delay.

In one embodiment, the resource information is associated with a slice identifier.

In one embodiment, the slice identifier includes at least one of the following: slice aggregation identifier, algorithm identifier, multi-topology identifier and virtual network identifier.

In one embodiment, the resource information and the slice information are carried in the link attribute TLV of the link network layer reachability information NLRI extension.

The present application is exemplarily described as follows:

The personalized demands of users and enterprises for communication networks have grown rapidly, and virtual networks with a variety of differentiated Service-Level Agreements (SLAs) need to be customized. Network slicing is thus born.

It can meet the needs of users to customize a variety of differentiated SLA virtual networks. Through the slicing technology, 5G network resources can be flexibly segmented, and virtual networks that meet the differentiated needs of customers can be quickly customized. At the same time, network resources are fully shared to achieve on-demand Dynamic balance of customization and network construction costs. Network slicing is an inevitable choice for the differentiated needs of 5G, and it is also the basis for the transformation of business models in the 5G era.

The slicing technologies related to slicing are mainly developed by Cisco's draft-ietf-lsr-flex-algo (IGP Flex-algo for short) and juniper's draft-bestbar-teas-ns-packet (Slice aggregate for short). IGP Flex-algo proposes to adopt The IGP flexible algorithm generates different Flex-algo virtual topologies (or called FA planes). The shortest path forwarding behavior in the FA plane is always forwarded along the path with the smallest IGP-metric compared to the traditional physical topology or multi-topology technology, which adds richer constraints: supports other metric types, such as Traffic Engineering-Metric metric, TE-metric), Delay-metric; in addition, each FA plane can customize its own topology elements, including only specific nodes and links. These constraints are contained in the Flexible Algorithm Definition (FAD). draft-bonica-lsr-ip-flexalgo-01 goes on to discuss how to apply IGP Flex-algo to pure Internet Protocol (IP) networks without deploying Segment Routing (SR), making it possible to compute to common Flexible algorithmic path for Internet Protocol version 4 (IPv4) or Internet Protocol version 6 (IPv6) addresses.

draft-ietf-idr-bgp-ls-flex-algo extends the BGP-LS protocol for the controller to collect the topology information that carries the FAD per algorithm. The collected information includes the link affinity color included and excluded from the specified path calculation and the prefix metric of the local node, namely the prefix metric attribute.

Slice aggregation proposes to create slices on the basis of Flex-algo virtual topology. If the scale of slices to be created in the network is large, for example, it exceeds the maximum number (128) that can be represented by the algorithm of IGP Flex-algo, then it must be A new slice identifier (slice aggregate identifier, or Slice aggregate ID) needs to be introduced into the network (including the control plane and forwarding plane) to distinguish resource management and packet forwarding policies of different slices. In theory, after introducing a new slice identifier, different slice sub-topologies can be divided directly based on the physical topology, and resources of different slice sub-topologies can be maintained.

In order to comprehensively optimize the path of the service traffic running in each slice in the network and avoid unnecessary traffic congestion, the controller also needs to manage and maintain the corresponding bandwidth resource reservation and consumption information for each slice, and use this information. The Traffic Engineering (TE) path used for slicing selects corresponding link resources.

Example 1

A node, that is, a network node, advertises the maximum reservable link bandwidth related to a specific slice of each link in the network to the controller through the BGP-LS protocol, such as the maximum reservable link bandwidth related to a slice of each link in the network Link bandwidth, that is, the maximum reserved link bandwidth. A specific slice is not limited here, and the specific slice may be all the slices in the network, and may also be a part of the slices. The division of partial slices is not limited. A new link attribute type length value, namely Link Attribute TLVs, is defined in the Link Network Layer Reachability Information (NLRI), which is used to carry the maximum reservable link bandwidth of a specific slice.

FIG. 3a is a schematic diagram of a maximum reserved link bandwidth TLV according to an embodiment of the present application. As shown in Figure 3a, resource information is associated with slice information in the extended link attribute TLV, and slice information, such as slice identification (Identity, ID), can be slice aggregation ID, algorithm ID, multi-topology ID and virtual network ID etc., it can also be an application-related identifier. Maximum reserved link bandwidth is the maximum reserved link bandwidth: Indicates the maximum reserved link bandwidth for a specific slice.

FIG. 3b is a schematic diagram of another maximum reserved link bandwidth TLV provided by an embodiment of the application. Referring to FIG. 3b, slice information is carried in the extended link attribute TLV, and resource information is carried in the extended link In the sub-TLV of the attribute TLV, the sub-TLV carries the maximum reserved link bandwidth TLV, the advertisement carries the sub-TLV format, and associates the slice with the maximum reserved link bandwidth.

The above are two ways of carrying the maximum reservable link bandwidth of a specific slice, and are not limited to the above two ways.

Before the node notifies the controller of the maximum reservable link bandwidth related to a specific slice/application of each link in the network through the BGP-LS protocol, it needs to obtain the maximum reservable link bandwidth related to a specific slice/application of each link in the network. Link bandwidth can be reserved. Obtaining method: Each node in the IGP (Interior Gateway Protocol) domain can advertise its local links to other neighbor nodes (referring to those local links that activate the maximum reservable link bandwidth configuration per slice) The maximum reservable link bandwidth per slice is stored locally, and the maximum reservable link bandwidth per slice of other remote links received from neighbor nodes is stored locally and then continues to be flooded to other neighbor nodes. In this way, the link-state database maintained by each node in the IGP domain will have the maximum reservable link bandwidth per slice of all links in the entire network.

Embodiment 2

The node announces the used bandwidth information related to a specific slice of each link in the network to the controller through the BGP-LS protocol, such as the used bandwidth, also known as the used link bandwidth.

New Link Attribute TLVs are defined in Link NLRI to carry the used bandwidth associated with a specific slice/application.

FIG. 3c is a schematic diagram of a used bandwidth information TLV provided by an embodiment of the present application. Referring to FIG. 3c, a slice ID may be a slice aggregation ID, an algorithm ID, a multi-topology ID, a virtual network ID, etc., or an application-related identifier. . Used Link Bandwidth: Indicates the used link bandwidth for a specific slice.

Referring to Fig. 3b, the used bandwidth information TLV provided by the embodiment of the present application is shown in Fig. 3b, the sub-TLV carries the used link bandwidth, the advertisement carries the sub-TLV format, and associates the slice with the used link bandwidth.

The above are two ways of carrying the used link bandwidth of a specific slice, and are not limited to the above two ways.

The node notifies the controller of the used bandwidth information related to a specific slice/application of each link in the network through the BGP-LS protocol. Related used bandwidth information. Obtaining method: Each node in the network can perform statistics and measurements on the traffic that is forwarded to each link belonging to a specific slice, calculate the used bandwidth related to a specific slice, and notify other neighbor nodes about the traffic on the local link. Collect the used bandwidth information, and save the used bandwidth information of other remote links received from the neighbor node locally, and then continue to flood to other neighbor nodes. In this way, the link-state database maintained by each node in the IGP domain will contain information on the used bandwidth of all links in the entire network.

Embodiment 3

The node announces the available bandwidth information related to a specific slice of each link in the network to the controller through the BGP-LS protocol, such as the available bandwidth, also known as the available link bandwidth.

New Link Attribute TLVs are defined in Link NLRI to carry information about available bandwidth related to a specific slice/application.

FIG. 3d is a schematic diagram of an available link bandwidth TLV provided by an embodiment of the present application. Referring to Fig. 3d, the slice ID can be slice aggregation ID, algorithm ID, multi-topology ID and virtual network ID, etc. It can also be an application-related identifier. Available Link Bandwidth: Indicates the available link bandwidth for a specific slice.

Referring to FIG. 3b, an available link bandwidth TLV provided by an embodiment of the present application is shown in FIG. 3b, in which the available link bandwidth is carried in the sub-TLV, the advertisement carries the sub-TLV format, and the slice is associated with the available link bandwidth.

The above are two ways of carrying the available link bandwidth of a specific slice, and are not limited to the above two ways.

Before a node communicates the available link bandwidth related to a specific slice of each link in the controller network through the BGP-LS protocol, it needs to obtain the available link bandwidth related to a specific slice/application of each link in the network. Obtaining method: each node in the IGP domain calculates the available bandwidth information related to a specific slice of the link for each local link, and advertises this information in the network.

The method for calculating the available bandwidth information related to a specific slice of the link on each node in the IGP domain for each local link is: the maximum reserved link bandwidth per slice/application minus the used link per slice/application. road bandwidth.

Embodiment 4

The node announces the average link delay, link packet loss rate, maximum link delay information and link minimum delay information of each link in the network related to a specific slice to the controller through the BGP-LS protocol.

New Link Attribute TLVs are defined in the link NLRI to carry the average link delay, link packet loss rate, maximum link delay information and link minimum delay information related to a specific slice/application.

Embodiment 5

After receiving the resource information meeting related to a specific slice/application of each link in the network, the controller maintains the resource information of each specific slice/application link. The resource information includes: Maximum reserved link bandwidth, available bandwidth of a specific slice/application-related link, used bandwidth of a specific slice/application-related link, average link delay related to a specific slice/application, specific slice/application-related link delay Link packet loss rate, maximum/minimum link delay associated with a specific slice/application. And when the network topology information changes, including the used bandwidth and available bandwidth of each link, the controller will update the resource information according to the collected information.

When you need to check the link resource information of each slice/application in the network, the query function can be supported.

When a new TE path (referred to as TE2) needs to be deployed for slice 1, a specific example will be described below.

FIG. 3e is a schematic diagram of resource allocation provided by an embodiment of the present application. Referring to FIG. 3e, two slices 1 (solid line in the figure) and 2 (dotted line in the figure) are created. The nodes included in slice 1 are: S, A, B, D and the bidirectional links connecting these nodes. Slice 2 contains nodes S, B, C, D and the bidirectional links connecting these nodes. Slice 1 shares link 1 and link 2 with slice 2. Assuming that the physical bandwidth of link 1 is 100G, the maximum reserved bandwidth allocated to slice 1 is 70G, the maximum reserved bandwidth allocated to slice 2 is 30G, and slice 1 already has TE path 1 from S to D (reserved). Bandwidth 10G), now a new TE path 2 from S to D needs to be created in slice 1, and 20G needs to be reserved for this path.

The controller needs to select a link after comprehensive analysis. One of the key conditions for selection is that the available bandwidth of slice 1 of the link is greater than or equal to the reserved bandwidth requirement of TE2. After comprehensive analysis, the controller decides to let TE2 pass through link 1, and when TE2 of slice 1 starts to carry traffic, Table 1 is the controller maintenance information table provided by this embodiment of the application. Referring to Table 1, the controller maintains slice 1 and slice 1. 2 resource information.

Table 1 Controller maintenance information table in the embodiment of the present application

In this application, the node announces the resource information related to the specific slice of each link in the network to the controller through the BGP-LS protocol.

The resource information is at least one of the following: the maximum reserved link bandwidth of the link related to the specific slice, the available bandwidth of the link related to the specific slice/application, the used bandwidth of the link related to the specific slice, the specific slice/ Application-related average link delay, specific slice/application-related link packet loss rate, and specific slice/application-related maximum/minimum link delay.

New Link Attribute TLVs are defined in link NLRI to carry resource information related to specific slices.

Before the node notifies the controller of the resource information related to the specific slice of each link in the network through the BGP-LS protocol, it needs to obtain the resource information related to the specific slice/application of each link in the network.

After receiving the resource information session related to the specific slice/application of each link in the network, the controller maintains the resource information of each specific slice/application link.

Resource information includes: the maximum reserved link bandwidth of a specific slice/application-related link, the available bandwidth of a specific slice/application-related link, the used bandwidth of a specific slice/application-related link, and the average slice/application-related average bandwidth. Link delay, link packet loss rate related to a specific slice, maximum/minimum link delay related to a specific slice/application.

When the network topology information changes, including the used bandwidth and available bandwidth of each link, the controller will update the information maintained by the controller according to the collected information.

In an exemplary embodiment, the present application provides an information transmission apparatus, and FIG. 4 is a schematic structural diagram of an information transmission apparatus provided by an embodiment of the application. The apparatus can be configured in a network node. As shown in FIG. 4 , the apparatus includes: an acquisition module 41, configured to acquire resource information related to each link in the network and a slice; a transmission module 42, configured to transmit the resource information .

The information transmission apparatus provided in this embodiment is used to implement the information transmission method shown in FIG. 1 . The implementation principle and technical effect of the information transmission apparatus provided in this embodiment are similar to the information transmission method shown in FIG. 1 , and will not be repeated here.

In one embodiment, the apparatus further includes: a retransmission module configured to acquire the changed resource information and transmit the changed resource information when the network topology information changes.

In an exemplary embodiment, the present application provides an information transmission apparatus, and FIG. 5 is a schematic structural diagram of another information transmission apparatus provided by an embodiment of the application. The device can be configured in a controller, as shown in FIG. 5 , the device includes: an acquisition module 51, configured to acquire resource information related to each link in the network and a slice; a storage module 52, configured to store the resource information .

The information transmission apparatus provided in this embodiment is used to implement the information transmission method shown in FIG. 3 . The implementation principle and technical effect of the information transmission apparatus provided in this embodiment are similar to the information transmission method shown in FIG. 3 , and will not be repeated here.

In one embodiment, the apparatus further includes: an update module configured to: acquire the changed resource information; and update the existing resource information according to the changed resource information.

In one embodiment, the apparatus further includes: a first search module, configured to: obtain a query request; and search for resource information corresponding to the query request.

In one embodiment, the apparatus further includes: a second search module configured to: obtain a deployment request; search for resource information corresponding to the deployment request; and complete resource allocation based on the found resource information.

In an exemplary implementation, this embodiment further provides a network node. FIG. 6 is a schematic structural diagram of a network node provided by an embodiment of the present application. As shown in FIG. 6 , the network node provided by the present application includes a or multiple processors 61 and a storage device 62; the number of processors 61 in the network node may be one or more, and one processor 61 is taken as an example in FIG. 6; the storage device 62 is used to store one or more programs; The one or more programs are executed by the one or more processors 61, so that the one or more processors 61 implement the information transmission method described in the embodiments of the present application.

The network node also includes: a communication device 63 , an input device 64 and an output device 65 .

The processor 61 , the storage device 62 , the communication device 63 , the input device 64 and the output device 65 in the network node may be connected by a bus or in other ways, and the connection by a bus is taken as an example in FIG. 6 .

The input device 64 may be used to receive input numerical or character information, and to generate key signal input related to user settings and function control of the network node. The output device 65 may include a display device such as a display screen.

The communication device 63 may include a receiver and a transmitter. The communication device 63 is configured to transmit and receive information according to the control of the processor 61 . Information includes, but is not limited to, resource information.

As a computer-readable storage medium, the storage device 62 can be configured to store software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the information transmission method described in FIG. The acquisition module 41 and the transmission module 42 in ). The storage device 62 may include a stored program area and a stored data area, wherein the stored program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of network nodes, and the like. Additionally, storage device 62 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 examples, storage device 62 may further include memory located remotely relative to processor 61, which remote memory may be connected to a network node through a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

In an exemplary implementation, this embodiment further provides a controller, and FIG. 7 is a schematic structural diagram of a controller provided by an embodiment of the present application. As shown in FIG. 7 , the controller provided by the present application includes one or more processors 71 and a storage device 72; the number of processors 71 in the controller may be one or more, and one processor 71 is taken as an example in FIG. 7 ; the storage device 72 is used to store one or more programs; the one or more programs are executed by the one or more processors 71, so that the one or more processors 71 realize the implementation as described in the embodiments of the present application the information transmission method described.

The controller also includes: a communication device 73 , an input device 74 and an output device 75 .

The processor 71 , the storage device 72 , the communication device 73 , the input device 74 , and the output device 75 in the controller may be connected by a bus or in other ways, and the connection by a bus is taken as an example in FIG. 7 .

The input device 74 may be used to receive input numerical or character information, and to generate key signal input related to user settings and function control of the controller. The output device 75 may include a display device such as a display screen.

The communication device 73 may include a receiver and a transmitter. The communication device 73 is configured to transmit and receive information according to the control of the processor 71 . Information includes, but is not limited to, resource information.

As a computer-readable storage medium, the storage device 72 can be configured to store software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the information transmission method described in FIG. The acquisition module 51 and the storage module 52 in the . The storage device 72 may include a stored program area and a stored data area, wherein the stored program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the controller, and the like. Additionally, storage device 72 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 examples, storage device 72 may further include memory located remotely from processor 71, which may be connected to the controller through a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

An embodiment of the present application further provides a storage medium, where a computer program is stored on the storage medium, and when the computer program is executed by a processor, any one of the methods described in the present application is implemented, and the storage medium stores a computer program, and the computer program is stored in the storage medium. When the computer program is executed by the processor, the information transmission method described in any of the embodiments of the present application is implemented. Such as the information transmission method applied to the network node and the information transmission method applied to the controller.

Wherein, the information transmission applied to the network node: acquiring resource information related to each link and slice in the network; transmitting the resource information.

The information transmission method applied to the controller includes: acquiring resource information related to slices of each link in the network; and storing the resource information.

The computer storage medium of the embodiments of the present application may adopt any combination of one or more computer-readable media. The computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus or device, or a combination of any of the above. More specific examples (non-exhaustive list) of computer readable storage media include: electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read only memory (Read Only Memory, ROM), Erasable Programmable Read Only Memory (EPROM), Flash Memory, Optical Fiber, Portable Disc Read-Only Memory (Compact Disc Read-Only Memory, CD-ROM), Optical Memory devices, magnetic memory devices, or any suitable combination of the foregoing. A computer-readable storage medium can be any tangible medium that contains or stores a program that can be used by or in connection with an instruction execution system, apparatus, or device.

A computer-readable signal medium may include a propagated data signal in baseband or as part of a carrier wave, with computer-readable program code embodied thereon. Such propagated data signals may take a variety of forms including, but not limited to, electromagnetic signals, optical signals, or any suitable combination of the foregoing. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device .

Program code embodied on a computer-readable medium may be transmitted using any suitable medium, including but not limited to: wireless, wire, optical fiber cable, radio frequency (RF), etc., or any suitable combination of the foregoing.

Computer program code for performing the operations of the present application may be written in one or more programming languages, including object-oriented programming languages—such as Java, Smalltalk, C++, but also conventional Procedural programming language - such as the "C" language or similar programming language. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer, or entirely on the remote computer or server. In the case of a remote computer, the remote computer can be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or it can be connected to an external computer (eg using an internet service provider to connect via the internet).

The above descriptions are merely exemplary embodiments of the present application, and are not intended to limit the protection scope of the present application.

In general, the various embodiments of the present application may be implemented in hardware or special purpose circuits, software, logic, or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software that may be executed by a controller, microprocessor or other computing device, although the application is not limited thereto.

Embodiments of the present application may be implemented by the execution of computer program instructions by a data processor of a mobile device, eg in a processor entity, or by hardware, or by a combination of software and hardware. Computer program instructions may be assembly instructions, Instruction Set Architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or written in any combination of one or more programming languages source or object code.

The block diagrams of any logic flow in the figures of the present application may represent program steps, or may represent interconnected logic circuits, modules and functions, or may represent a combination of program steps and logic circuits, modules and functions. Computer programs can be stored on memory. The memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, ROM, RAM, optical memory devices and systems (Digital Video Disc, DVD) or optical disk ( Compact Disk, CD) etc. Computer readable media may include non-transitory storage media. Data processors may be of any type suitable for the local technical environment, such as but not limited to general purpose computers, special purpose computers, microprocessors, digital signal processing Digital Signal Processing (DSP), Application Specific Integrated Circuit (ASIC), Programmable Logic Device (Field-Programmable Gate Array, FPGA) and processors based on multi-core processor architecture.

Claims

An information transmission method, applied to a network node, the method comprising:

Obtain resource information related to slices for each link in the network;

The resource information is transmitted.
The method according to claim 1, wherein the resource information includes at least one of the following:

Maximum reserved link bandwidth; available bandwidth; used bandwidth; average link delay; link packet loss rate; maximum link delay; minimum link delay.
The method of claim 1, wherein the resource information is associated with slice information.
The method of claim 3, wherein the slice information includes at least one of the following:

Slice aggregation identification, algorithm identification, multi-topology identification and virtual network identification.
The method according to claim 3, wherein the resource information and the slice information are carried in the link attribute type length value TLV of the link network layer reachability information NLRI extension.
The method according to claim 3, wherein the slice information is carried in a link attribute TLV extended by NLRI of link network layer reachability information, and the resource information is carried in a child of the link attribute TLV extended by the link NLRI in TLV.
The method of claim 1, further comprising:

When the network topology information changes, the changed resource information is acquired and the changed resource information is transmitted.
An information transmission method, applied to a controller, the method comprising:

Obtain resource information related to slices for each link in the network;

The resource information is stored.
The method of claim 8, further comprising:

Obtain the changed resource information;

The stored resource information is updated according to the changed resource information.
The method of claim 8 or 9, further comprising:

Get query request;

Find resource information corresponding to the query request.
The method of claim 8, further comprising:

get deployment request;

Find resource information corresponding to the deployment request;

Complete resource allocation based on the found resource information.
The method according to claim 8, wherein the resource information includes at least one of the following:

Maximum reserved link bandwidth; available bandwidth; used bandwidth; link delay; link packet loss rate; maximum link delay; minimum link delay.
The method of claim 8, wherein the resource information is associated with a slice identifier.
The method according to claim 13, wherein the slice identification comprises at least one of the following:

Slice aggregation identification, algorithm identification, multi-topology identification and virtual network identification.
The method according to claim 13, wherein the resource information and the slice information are carried in the link attribute type length value TLV of the link network layer reachability information NLRI extension.
The method according to claim 13, wherein the slice information is carried in a link attribute TLV extended by NLRI of link network layer reachability information, and the resource information is carried in a child of the link attribute TLV extended by the link NLRI in TLV.
An information transmission device, configured on a network node, the device comprising:

The acquisition module is set to acquire resource information related to each link and slice in the network;

A transmission module, configured to transmit the resource information.
An information transmission device, configured in a controller, the device comprising:

The acquisition module is set to acquire the resource information related to the slice of each link in the network;

A storage module, configured to store the resource information.
A network node including:

at least one processor;

a storage device configured to store at least one program;

The at least one program, when executed by the at least one processor, causes the at least one processor to implement the method of any one of claims 1-7.
A controller comprising:

at least one processor;

a storage device configured to store at least one program;

The at least one program, when executed by the at least one processor, causes the at least one processor to implement the method of any of claims 8-16.
A storage medium storing a computer program, which implements the method of any one of claims 1-16 when the computer program is executed by a processor.