CN115051944B - End-to-end slice creation method, device, equipment and storage medium - Google Patents
End-to-end slice creation method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN115051944B CN115051944B CN202210837699.1A CN202210837699A CN115051944B CN 115051944 B CN115051944 B CN 115051944B CN 202210837699 A CN202210837699 A CN 202210837699A CN 115051944 B CN115051944 B CN 115051944B
- Authority
- CN
- China
- Prior art keywords
- bandwidth
- flexe
- node
- flex
- algo
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/34—Source routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention provides an end-to-end slice creation method, an end-to-end slice creation device, end-to-end slice creation equipment and a storage medium, wherein the method comprises the following steps: defining a Flex-Algo algorithm by adopting a Sub-TLV in a protocol message, wherein the Sub-TLV comprises a bandwidth constraint type value, a constrained FlexE bandwidth and a field length of the constrained FlexE bandwidth; setting a bandwidth flag for a local FlexE interface, wherein the bandwidth flag indicates the physical bandwidth size of the FlexE interface; according to the definition Flex-Algo algorithm of each node, updating the node topology; calculating a path from a source node to a destination node according to the updated node topology; a FlexE slice is created from the source node to the destination node according to the calculated path. According to the invention, the end-to-end FlexE slice is automatically created at the equipment node, the intervention of a management and control system is not needed, and the original intelligent capability of the network equipment is improved.
Description
Technical Field
The present invention relates to the field of network slicing, and in particular, to an end-to-end slice creation method, apparatus, device, and storage medium.
Background
FlexE (Flexible Ethernet ) is an interface technology for implementing service isolation and network slicing by a carrier network, aiming at decoupling service rate and physical channel rate, and guaranteeing bandwidth and delay requirements of network slicing by independent hardware resources. But the control plane of the IP network protocol does not sense the FlexE channel of the transport layer, and the FlexE slice automatically creates multi-layer coordination (such as coordination of a controller, a network manager, a resource management platform and a device layer) of an IT system, so that the coupling and the complexity caused by the mutual call between multiple systems are unfavorable for the automatic deployment of the FlexE slice.
Therefore, how to automatically create end-to-end FlexE slices at the device nodes without intervention of a management and control system and improve the original intelligent capability of the network device is a technical problem to be solved urgently by those skilled in the art.
It should be noted that the information disclosed in the foregoing background section is only for enhancement of understanding of the background of the invention and thus may include information that does not form the prior art that is already known to those of ordinary skill in the art.
Disclosure of Invention
Aiming at the problems in the prior art, the invention aims to provide an end-to-end slice creation method, an end-to-end slice creation device and a storage medium, which overcome the difficulty in the prior art, automatically create an end-to-end FlexE slice at a device node, do not need intervention of a management and control system, and promote the original intelligent capability of network equipment.
The embodiment of the invention provides an end-to-end slice creation method, which comprises the following steps:
defining a Flex-Algo algorithm by adopting a Sub-TLV in a protocol message, wherein the Sub-TLV comprises a bandwidth constraint type value, a constrained FlexE bandwidth and a field length of the constrained FlexE bandwidth;
setting a bandwidth flag for a local FlexE interface, wherein the bandwidth flag indicates the physical bandwidth size of the FlexE interface;
according to the definition Flex-Algo algorithm of each node, updating the node topology;
calculating a path from a source node to a destination node according to the updated node topology;
a FlexE slice is created from the source node to the destination node according to the calculated path.
In some embodiments of the present application, the updating the node topology according to the Flex-Algo algorithm defined by each node includes:
nodes with the same Flex-Algo algorithm as the source node are reserved.
In some embodiments of the present application, the updating the node topology according to the Flex-Algo algorithm defined by each node further includes:
the reserved bandwidth marks the same link as the FlexE bandwidth constrained by the Flex-Algo algorithm.
In some embodiments of the present application, the custom Flex-Algo algorithm employs integer labels that are greater than or equal to 128 and less than or equal to 255.
In some embodiments of the present application, the calculating the path from the source node to the destination node according to the updated node topology includes:
and calculating the path from the source node to the destination node by adopting a shortest path first algorithm.
In some embodiments of the present application, the data length of the bandwidth constraint type value is 1 byte; the data length of the field length of the constrained FlexE bandwidth is 1 byte.
In some embodiments of the present application, the step of setting a bandwidth flag for the local FlexE interface is performed by the local chip.
According to still another aspect of the present application, there is also provided an end-to-end slice creation apparatus, including:
the definition module is configured to define a Flex-Algo algorithm by adopting a Sub-TLV in the protocol message, wherein the Sub-TLV comprises a bandwidth constraint type value, a constrained FlexE bandwidth and a field length of the constrained FlexE bandwidth;
a marking module configured to set a bandwidth marking for a local FlexE interface, the bandwidth marking indicating a physical bandwidth size of the FlexE interface;
the updating module is configured to update the node topology according to the Flex-Algo algorithm defined by each node;
the path calculation module is configured to calculate a path from a source node to a destination node according to the updated node topology;
and a slice module configured to create a FlexE slice from the source node to the destination node according to the calculated path.
According to still another aspect of the present invention, there is also provided an end-to-end slice creation processing apparatus including:
a processor;
a memory having stored therein executable instructions of the processor;
wherein the processor is configured to perform the steps of the end-to-end slice creation method described above via execution of the executable instructions.
Embodiments of the present invention also provide a computer-readable storage medium storing a program that, when executed, implements the steps of the above-described end-to-end slice creation method.
Compared with the prior art, the invention aims at:
according to the method and the device, the Sub-TLV attribute of the Flex-Algo algorithm is expanded, a new Sub-TLV is defined to represent FlexE bandwidth constraint, mapping is formed between the Sub-TLV and the FlexE interface bandwidth of the device, end-to-end FlexE slicing can be automatically built at the device node by utilizing the path calculation process of Flex-Algo, intervention of a management and control system is not needed, and the original intelligent capability of the network device is improved.
Drawings
Other features, objects and advantages of the present invention will become more apparent upon reading of the detailed description of non-limiting embodiments, made with reference to the following drawings.
FIG. 1 is a flow chart of one embodiment of an end-to-end slice creation method of the present invention.
Fig. 2 is a flow chart of one particular embodiment of an end-to-end slice creation method of the present invention.
Fig. 3 is a schematic diagram of a protocol message according to the present invention.
Fig. 4 is a schematic diagram of Sub-TLV type of the present invention.
Fig. 5 is a schematic diagram of Sub-TLVs defining the Flex-Algo algorithm of the present invention.
Fig. 6 is a schematic diagram of an original node topology of an embodiment of the present invention.
Fig. 7 is a schematic diagram of an update node topology of an embodiment of the invention.
Fig. 8 is a block diagram of one embodiment of an end-to-end slice creation apparatus of the present invention.
Fig. 9 is a block diagram of a specific embodiment of an end-to-end slice creation apparatus of the present invention.
Fig. 10 is a schematic diagram of the structure of the end-to-end slice creation apparatus of the present invention.
Fig. 11 is a schematic structural view of a computer-readable storage medium according to an embodiment of the present invention.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. However, the example embodiments may be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art. The same reference numerals in the drawings denote the same or similar structures, and thus a repetitive description thereof will be omitted.
Referring to fig. 1, fig. 1 is a flow chart of one embodiment of an end-to-end slice creation method of the present invention. The embodiment of the invention provides an end-to-end slice creation method, which comprises the following steps of:
step S110: the Flex-Algo algorithm is defined using a Sub-TLV in the protocol message, which includes a bandwidth constraint type value, a constrained FlexE bandwidth, and a field length of the constrained FlexE bandwidth.
Specifically, the IS-IS uses a protocol message carrying an IS-IS FAD Sub-TLV to define the Flex-Algo algorithm in step S110. The meaning of FAD IS flexible algorithm definition (Flexible Algorithm Definition), and the format 300 of IS-IS FAD Sub-TLV IS shown in FIG. 3. The IS-IS FAD Sub-TLVs may be extended in length after the IS-IS FAD Sub-TLVs to define some constraints. As shown in fig. 5, types 1 to 5 are defined constraint conditions, and a Sub-TLV with a new Type value of 6 (bandwidth constraint Type value) is now extended to define a FlexE bandwidth constraint, and the format is shown in fig. 6, where:
bandwidth constraint Type value (Type): 1 byte. The type, value may be 6, indicating that the TLV is FlexE bandwidth;
field Length (Length) of constrained FlexE bandwidth: 1 byte. Length, which indicates the Length after removing the Type and Length fields;
constrained FlexE Bandwidth (FlexE-Bandwidth): specific values, length is variable. The FlexE bandwidth size representing a specific constraint.
Step S120: a bandwidth flag is set for the local FlexE interface, said bandwidth flag indicating the physical bandwidth size of the FlexE interface.
Specifically, a locally existing FlexE interface may be marked with a Bandwidth flag (FlexE-Bandwidth flag) by the local chip to identify the physical Bandwidth size of the FlexE interface.
Step S130: and updating the node topology according to the Flex-Algo algorithm defined by each node.
Step S140: and calculating the path from the source node to the destination node according to the updated node topology.
Step S150: a FlexE slice is created from the source node to the destination node according to the calculated path.
Therefore, by expanding the Sub-TLV attribute of the Flex-Algo algorithm, a new Sub-TLV is defined to represent FlexE bandwidth constraint, mapping is formed between the Sub-TLV and the FlexE interface bandwidth of the equipment, and the end-to-end FlexE slice can be automatically created at the equipment node by utilizing the path calculation process of Flex-Algo without intervention of a management and control system, so that the original intelligent capability of the network equipment is improved.
Referring now to fig. 2, fig. 2 is a system diagram of an end-to-end slice creation method of the present invention.
Step S210: the Flex-Algo algorithm is defined using a Sub-TLV in the protocol message, which includes a bandwidth constraint type value, a constrained FlexE bandwidth, and a field length of the constrained FlexE bandwidth.
Step S220: a bandwidth flag is set for the local FlexE interface, said bandwidth flag indicating the physical bandwidth size of the FlexE interface.
Step S231: in the node topology, nodes with the same Flex-Algo algorithm as the source node are reserved.
Specifically, flex-Algo (0) -Flex-Algo (127) are reserved as standard algorithms by IETF/IANA, and the user-customizable algorithm range is Flex-Algo (128) -Flex-Algo (255), i.e. the value of the custom algorithm k can be 128-255.
Step S232: in the node topology, the reserved bandwidth marks the same link as the FlexE bandwidth constrained by the Flex-Algo algorithm.
The original node topology may be illustrated in fig. 6, and for convenience of illustration, a Flex-Algo (128) carrying a FlexE-Bandwidth constraint is defined herein, where the FlexE-Bandwidth specific constraint value is 10G; the nodes participating in the FlexE-Algo (128) algorithm are R1, R2, R4, R5, R6 and F-10G, which indicate that the port is a 10G FlexE interface, and the device chip marks the interface with FlexE-Bandwidth. F-5G is the same. The rest interfaces are common physical interfaces, and the cost values of all links are the same.
Retaining nodes participating in Flex-Algo (128) in a logical topology contained in Flex-Algo (128); and because the constraint of FlexE-bandwidth=10g is defined in Flex-Algo (128), links that do not meet this constraint are also excluded by the Flex-Algo (128) topology. The updated node topology is shown in fig. 7.
Step S240: and calculating the path from the source node to the destination node by adopting a shortest path first algorithm according to the updated node topology.
In the foregoing embodiment, on the basis of the Flex-Algo (128) logic topology, the Flex-Algo (128) will perform path computation using a shortest path first algorithm, taking the path of R1 (source node) - > R6 (destination node) as an example, and the path computation result is R1- > R5- > R6 (dashed line in fig. 7).
Step S250: a FlexE slice is created from the source node to the destination node according to the calculated path.
In the previous embodiment, flexE slices with end-to-end bandwidth of 10G were formed according to paths R1- > R5- > R6.
The foregoing is merely illustrative of specific embodiments of the present invention, and the present invention is not limited thereto, and the splitting, merging, performing sequence change, module splitting, merging, and information transmission change of the steps are all within the scope of the present invention.
Fig. 8 is a block diagram of one embodiment of an end-to-end slice creation apparatus of the present invention. The end-to-end slice creation apparatus 400 of the present invention, as shown in fig. 4, includes, but is not limited to: definition module 410, marking module 420, update module 430, path computation module 440, and slicing module 450.
The definition module 410 is configured to define a Flex-Algo algorithm using a Sub-TLV in the protocol message, the Sub-TLV including a bandwidth constraint type value, a constrained FlexE bandwidth, and a field length of the constrained FlexE bandwidth;
the marking module 420 is configured to set a bandwidth marking for the local FlexE interface, said bandwidth marking indicating the physical bandwidth size of the FlexE interface;
the update module 430 is configured to update the node topology according to a Flex-Algo algorithm defined by each node;
the path computation module 440 is configured to compute a path from the source node to the destination node based on the updated node topology;
the slicing module 450 is configured to create FlexE slices of source node to destination node from the calculated paths.
Fig. 9 is a block diagram of another embodiment of an end-to-end slice creation apparatus of the present invention. The end-to-end slice creation apparatus 700 of the present invention includes, but is not limited to: a definition module 510, a labeling module 520, a first update module 531, a second update module 532, a shortest path computation module 540, and a slicing module 550.
The definition module 510 is configured to define a Flex-Algo algorithm with a Sub-TLV in the protocol message, the Sub-TLV including a bandwidth constraint type value, a constrained FlexE bandwidth, and a field length of the constrained FlexE bandwidth;
the marking module 520 is configured to set a bandwidth marking for the local FlexE interface, said bandwidth marking indicating the physical bandwidth size of the FlexE interface;
the first update module 531 is configured to keep nodes with the same Flex-Algo algorithm as the source node;
the second update module 532 is configured to reserve a link with a bandwidth flag that is the same as the FlexE bandwidth of the constraint of the Flex-Algo algorithm.
The shortest path computation module 540 is configured to compute a path from the source node to the destination node using a shortest path first algorithm according to the updated node topology;
the slicing module 550 is configured to create FlexE slices of source node to destination node from the calculated paths.
The implementation principle of the above module is referred to in the related description of the end-to-end slice creation method, and will not be repeated here.
The end-to-end slice creation device of the invention defines a new Sub-TLV to represent FlexE bandwidth constraint by expanding the Sub-TLV attribute of the Flex-Algo algorithm, forms a mapping with the FlexE interface bandwidth of the equipment, can automatically create the end-to-end FlexE slice at the equipment node by utilizing the path calculation process of Flex-Algo, does not need intervention of a management and control system, and improves the original intelligent capability of the network equipment.
Fig. 8 and 9 are only schematic illustrations of the end-to-end slice creation apparatuses 400 and 500, respectively, provided by the present invention, and the splitting, merging, and adding of modules are all within the scope of the present invention without departing from the inventive concept. The end-to-end slice creation devices 400 and 500 provided by the present invention may be implemented by software, hardware, firmware, plug-ins, and any combination thereof, and the present invention is not limited thereto.
The embodiment of the invention also provides end-to-end slice creation processing equipment, which comprises a processor. A memory having stored therein executable instructions of a processor. Wherein the processor is configured to execute the steps of the end-to-end slice creation method via execution of the executable instructions.
As shown above, in the end-to-end slice creation processing device of the embodiment, a new Sub-TLV representing FlexE bandwidth constraint is defined by expanding Sub-TLV attribute of the Flex-Algo algorithm, mapping is formed between the Sub-TLV representing FlexE bandwidth constraint and FlexE interface bandwidth of the device, and the end-to-end FlexE slice can be automatically created at the device node by using the path calculation process of Flex-Algo, so that intervention of a management and control system is not needed, and the original intelligent capability of the network device is improved.
Those skilled in the art will appreciate that the various aspects of the invention may be implemented as a system, method, or program product. Accordingly, aspects of the invention may be embodied in the following forms, namely: an entirely hardware embodiment, an entirely software embodiment (including firmware, micro-code, etc.) or an embodiment combining hardware and software aspects may be referred to herein as a "circuit," module "or" platform.
Fig. 10 is a schematic diagram of the structure of the end-to-end slice creation processing apparatus of the present invention. An electronic device 700 according to this embodiment of the present invention is described below with reference to fig. 10. The electronic device 800 shown in fig. 10 is merely an example and should not be construed as limiting the functionality and scope of use of embodiments of the present invention.
As shown in fig. 10, the electronic device 800 is embodied in the form of a general purpose computing device. Components of electronic device 800 may include, but are not limited to: at least one processing unit 810, at least one storage unit 820, a bus 830 that connects the different platform components (including storage unit 820 and processing unit 810), a display unit 840, and the like.
Wherein the storage unit stores program code that is executable by the processing unit 810 such that the processing unit 810 performs the steps according to various exemplary embodiments of the invention described in the end-to-end slice creation method section of the present specification. For example, the processing unit 810 may perform the steps as shown in fig. 1.
The storage unit 820 may include readable media in the form of volatile storage units, such as Random Access Memory (RAM) 8201 and/or cache memory 8202, and may further include Read Only Memory (ROM) 8203.
Storage unit 820 may also include a program/utility 8204 having a set (at least one) of program modules 8205, such program modules 8205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment.
Bus 830 may be one or more of several types of bus structures including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
The electronic device 800 may also communicate with one or more external devices 8001 (e.g., keyboard, pointing device, bluetooth device, etc.), one or more devices that enable a user to interact with the electronic device 800, and/or any device (e.g., router, modem, etc.) that enables the electronic device 800 to communicate with one or more other computing devices. Such communication may occur through an input/output (I/O) interface 850. Also, electronic device 800 may communicate with one or more networks such as a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the Internet, through network adapter 860. Network adapter 860 may communicate with other modules of electronic device 800 via bus 830. It should be appreciated that although not shown, other hardware and/or software modules may be used in connection with electronic device 800, including, but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, data backup storage platforms, and the like.
The embodiment of the invention also provides a computer readable storage medium for storing a program, and the program is executed to implement the steps of the end-to-end slice creation method. In some possible embodiments, the various aspects of the invention may also be implemented in the form of a program product comprising program code for causing a terminal device to carry out the steps according to the various exemplary embodiments of the invention as described in the end-to-end slice creation method section of this specification, when the program product is run on the terminal device.
As shown above, the computer readable storage medium for executing end-to-end slice creation in this embodiment defines a new Sub-TLV to represent FlexE bandwidth constraint by expanding Sub-TLV attribute of the Flex-Algo algorithm, and forms a mapping with FlexE interface bandwidth of the device, and the end-to-end FlexE slice can be automatically created at the device node by using the path computation process of Flex-Algo, without intervention of a management and control system, thereby improving the native intelligent capability of the network device.
Fig. 11 is a schematic structural view of a computer-readable storage medium of the present invention. Referring to fig. 11, a program product 900 for implementing the above-described method according to an embodiment of the present invention is described, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The computer readable storage medium may include a data signal propagated in baseband or as part of a carrier wave, with readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A readable storage medium may also be any readable medium that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of remote computing devices, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., connected via the Internet using an Internet service provider).
In summary, by expanding Sub-TLV attribute of Flex-Algo algorithm, the method defines a new Sub-TLV to represent FlexE bandwidth constraint, forms mapping with FlexE interface bandwidth of the device, and can automatically create end-to-end FlexE slice at the device node by utilizing the path calculation process of Flex-Algo without intervention of a management and control system, thereby improving the original intelligent capability of the network device.
The foregoing is a further detailed description of the invention in connection with the preferred embodiments, and it is not intended that the invention be limited to the specific embodiments described. It will be apparent to those skilled in the art that several simple deductions or substitutions may be made without departing from the spirit of the invention, and these should be considered to be within the scope of the invention.
Claims (8)
1. An end-to-end slice creation method, comprising:
defining a Flex-Algo algorithm by adopting a Sub-TLV in a protocol message, wherein the Sub-TLV comprises a bandwidth constraint type value, a constrained FlexE bandwidth and a field length of the constrained FlexE bandwidth;
setting a bandwidth flag for a local FlexE interface, wherein the bandwidth flag indicates the physical bandwidth size of the FlexE interface;
according to the definition Flex-Algo algorithm of each node, updating the node topology;
calculating a path from a source node to a destination node according to the updated node topology;
creating a FlexE slice from the source node to the destination node according to the calculated path;
the updating node topology according to the Flex-Algo algorithm defined by each node comprises the following steps:
reserving nodes with the same Flex-Algo algorithm as the source node;
the reserved bandwidth marks the same link as the FlexE bandwidth constrained by the Flex-Algo algorithm.
2. The end-to-end slice creation method of claim 1, wherein the custom Flex-Algo algorithm uses integer labels of 128 or more and 255 or less.
3. The end-to-end slice creation method of claim 1, wherein calculating a path from a source node to a destination node based on the updated node topology comprises:
and calculating the path from the source node to the destination node by adopting a shortest path first algorithm.
4. The end-to-end slice creation method according to claim 1, wherein the data length of the bandwidth constraint type value is 1 byte; the data length of the field length of the constrained FlexE bandwidth is 1 byte.
5. The end-to-end slice creation method according to claim 1, wherein the step of setting a bandwidth flag for a local FlexE interface is performed by a local chip.
6. An end-to-end slice creation apparatus, comprising:
the definition module is configured to define a Flex-Algo algorithm by adopting a Sub-TLV in the protocol message, wherein the Sub-TLV comprises a bandwidth constraint type value, a constrained FlexE bandwidth and a field length of the constrained FlexE bandwidth;
a marking module configured to set a bandwidth marking for a local FlexE interface, the bandwidth marking indicating a physical bandwidth size of the FlexE interface;
the updating module is configured to update the node topology according to the Flex-Algo algorithm defined by each node;
the path calculation module is configured to calculate a path from a source node to a destination node according to the updated node topology;
a slice module configured to create a FlexE slice from the source node to the destination node according to the calculated path;
the update module is further configured to: nodes with the same Flex-Algo algorithm as the source node are reserved, and links with the same bandwidth as the FlexE bandwidth constrained by the Flex-Algo algorithm are reserved.
7. An end-to-end slice creation processing apparatus, comprising:
a processor;
a memory having stored therein executable instructions of the processor;
wherein the processor is configured to execute via execution of the executable instructions:
the end-to-end slice creation method of any one of claims 1 to 5.
8. A computer-readable storage medium storing a program, the program realizing when executed:
the end-to-end slice creation method of any one of claims 1 to 5.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210837699.1A CN115051944B (en) | 2022-07-15 | 2022-07-15 | End-to-end slice creation method, device, equipment and storage medium |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210837699.1A CN115051944B (en) | 2022-07-15 | 2022-07-15 | End-to-end slice creation method, device, equipment and storage medium |
Publications (2)
Publication Number | Publication Date |
---|---|
CN115051944A CN115051944A (en) | 2022-09-13 |
CN115051944B true CN115051944B (en) | 2023-07-21 |
Family
ID=83167644
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202210837699.1A Active CN115051944B (en) | 2022-07-15 | 2022-07-15 | End-to-end slice creation method, device, equipment and storage medium |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN115051944B (en) |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108770016A (en) * | 2018-06-04 | 2018-11-06 | 北京邮电大学 | 5G end to end network slice generation method based on template and device |
WO2021031986A1 (en) * | 2019-08-21 | 2021-02-25 | 烽火通信科技股份有限公司 | Method for fast slicing of carrier network |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110661636B (en) * | 2018-06-30 | 2022-04-12 | 华为技术有限公司 | Method, device and system for acquiring network slice |
CN110944357B (en) * | 2018-09-25 | 2023-08-29 | 中兴通讯股份有限公司 | Network slicing method and device |
CN112825502A (en) * | 2019-11-20 | 2021-05-21 | 中兴通讯股份有限公司 | Network slice creation method, basic network controller, system, and storage medium |
CN112911420A (en) * | 2019-12-03 | 2021-06-04 | 中兴通讯股份有限公司 | Rerouting method based on Flexe network, electronic device and readable storage medium |
CN113037527B (en) * | 2019-12-25 | 2024-04-09 | 中兴通讯股份有限公司 | Network slice creation method, message forwarding method and device thereof |
WO2022110535A1 (en) * | 2020-11-27 | 2022-06-02 | 华为技术有限公司 | Packet sending method, device, and system |
-
2022
- 2022-07-15 CN CN202210837699.1A patent/CN115051944B/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108770016A (en) * | 2018-06-04 | 2018-11-06 | 北京邮电大学 | 5G end to end network slice generation method based on template and device |
WO2021031986A1 (en) * | 2019-08-21 | 2021-02-25 | 烽火通信科技股份有限公司 | Method for fast slicing of carrier network |
Also Published As
Publication number | Publication date |
---|---|
CN115051944A (en) | 2022-09-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11082262B2 (en) | Flow entry generating method and apparatus | |
CN110708393B (en) | Method, device and system for transmitting data | |
KR102273413B1 (en) | Dynamic scheduling of network updates | |
CN107979409B (en) | Inter-orbit satellite communication routing method and device | |
US20180219772A1 (en) | Router based maximum transmission unit and data frame optimization for virtualized environments | |
US20170078207A1 (en) | Network prioritization based on node-level attributes | |
US10044770B2 (en) | Method and apparatus for managing a plurality of sessions in a multi-path routing based network | |
US9495417B2 (en) | Dynamic rules to optimize common information model queries | |
WO2020062959A1 (en) | Data configuration method and apparatus | |
CN104065553B (en) | Virtual network moving method and relevant device | |
US10642802B2 (en) | Identifying an entity associated with an online communication | |
US20190173784A1 (en) | Establishing virtual network routes in a computer network | |
CN115514696B (en) | Method, device and equipment for transmitting computing power resource information | |
CN116886496A (en) | DPU-based data processing method, device, equipment and readable storage medium | |
CN107181689B (en) | Message interaction method and device between routers | |
CN114461247A (en) | Hot update method, device, electronic equipment and computer readable medium | |
CN115051944B (en) | End-to-end slice creation method, device, equipment and storage medium | |
US11362928B2 (en) | Method, electronic device and computer program product for generating network topology | |
CN108494597A (en) | Intelligent Optical Network analogue system and method | |
CN111510384B (en) | Method, electronic device and computer-readable medium for processing data generated by a service | |
CN116599839A (en) | Cloud gateway system, data processing method, device and storage medium | |
CN114567665A (en) | Method, device, equipment and medium for communication between nodes and automatic driving vehicle | |
US20150171967A1 (en) | Regenerator placement using a polynomial-time algorithm | |
CN116418726A (en) | Source route encoding method, data packet routing method, device, equipment and medium | |
CN115314448B (en) | Method and device for accessing cloud network, electronic equipment and computer medium |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |