[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

WO2023082815A1 - 确定性路由的构建方法、装置和存储介质 - Google Patents

确定性路由的构建方法、装置和存储介质 Download PDF

Info

Publication number
WO2023082815A1
WO2023082815A1 PCT/CN2022/117869 CN2022117869W WO2023082815A1 WO 2023082815 A1 WO2023082815 A1 WO 2023082815A1 CN 2022117869 W CN2022117869 W CN 2022117869W WO 2023082815 A1 WO2023082815 A1 WO 2023082815A1
Authority
WO
WIPO (PCT)
Prior art keywords
deterministic
resources
capabilities
topology
routing
Prior art date
Application number
PCT/CN2022/117869
Other languages
English (en)
French (fr)
Inventor
熊泉
刘爱华
彭少富
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to EP22891620.1A priority Critical patent/EP4432622A1/en
Publication of WO2023082815A1 publication Critical patent/WO2023082815A1/zh

Links

Images

Classifications

    • 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
    • H04L41/122—Discovery or management of network topologies of virtualised topologies, e.g. software-defined networks [SDN] or network function virtualisation [NFV]
    • 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
    • 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/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources

Definitions

  • Embodiments of the present disclosure relate to the communication field, and in particular, relate to a method, device, and storage medium for constructing a deterministic route.
  • DetNet Deterministic Networking Technology
  • RFC Resource For Comments
  • QoS Quality of Service
  • Deterministic networks use resource reservation, explicit routing, and service protection to provide deterministic QoS.
  • Resource reservation is to meet resource deterministic requirements, involving resource allocation and reservation.
  • Explicit routing is to meet the requirement of path determinism, which means that the network path of deterministic service flow needs to be selected in advance to ensure the stability of routing at least during the service residence period.
  • the routing of the deterministic network adopts the deterministic path technology, and the routing path does not change with the real-time changes of the network topology. This technology ensures that the transmission path of deterministic streams is relatively fixed, providing a basic guarantee for resource reservation technology. At the same time, the fixed path also provides the possibility of accurate calculation of delay, which is an important technical support to ensure limited delay and jitter.
  • Embodiments of the present disclosure provide a method, device, and storage medium for constructing deterministic routes, so as to at least solve the deterministic transmission requirements for services in related technologies.
  • Complex resource evaluation and calculations are often required to construct deterministic routes that meet deterministic routing requirements.
  • a method for constructing a deterministic route including: determining a virtual topology with a deterministic capability, wherein the virtual topology is formed based on a resource set, and the resource set includes the physical topology of the network One or more resources with the same deterministic capability; constructing a deterministic route on the virtual topology with the deterministic capability.
  • an apparatus for constructing a deterministic route including: a determination module configured to determine a virtual topology with deterministic capabilities, wherein the virtual topology is formed based on a resource set, and the resource set Including one or more resources with the same deterministic capability in the physical topology of the network; a routing construction module configured to construct a deterministic route on the virtual topology with the deterministic capability.
  • a computer-readable storage medium where a computer program is stored in the computer-readable storage medium, wherein the computer program is configured to execute any one of the above method embodiments when running in the steps.
  • an electronic device including a memory and a processor, wherein a computer program is stored in the memory, and the processor is configured to run the computer program to perform any one of the above method implementations. steps in the example.
  • FIG. 1 is a block diagram of a hardware structure of a node or a controller for implementing a deterministic routing construction method according to an embodiment of the present disclosure
  • FIG. 2 is a flowchart of a method for constructing a deterministic route according to an embodiment of the present disclosure
  • Fig. 3 is a structural block diagram of an apparatus for constructing a deterministic route according to an embodiment of the present disclosure
  • FIG. 4 is a detailed flowchart of a method for constructing a deterministic route according to an embodiment of the present disclosure
  • Fig. 5 is a network structure diagram based on deterministic routing according to an embodiment of the present disclosure.
  • Network Topology structure refers to the physical layout of various devices interconnected by transmission media, and refers to the specific physical or real or logical or virtual arrangement among members of the network.
  • Routing refers to the process of determining the network scope of the end-to-end path from the source to the destination of the packet message in the network topology. Routing works on the third layer of the OSI reference model, the network layer, and routers are data packet forwarding devices at the network layer. Routing refers to the process in which a router receives a data packet from one interface, directs it according to the destination address of the data packet, and forwards it to another interface.
  • Routing metric is the measurement standard used by routing algorithm to determine the best path to the destination.
  • the routing algorithm initializes and maintains a routing table containing path information, which varies according to the routing algorithm and metric used. Routing is divided into static routing and dynamic routing. Static routing is a fixed routing manually configured by the administrator on the router. Dynamic routing is that routers in the network communicate with each other to transmit routing information according to real-time network topology changes, and use the received routing information to calculate and update the routing protocol. Routing table process. Common dynamic routing protocols such as link state routing protocols include Open Shortest Path First (OSPF for short), Intermediate System to Intermediate System (ISIS for short), etc. Users create routes in the network topology according to requirements and select the best route to complete packet forwarding. Route generation includes centralized controller configuration and distributed protocol generation.
  • OSPF Open Shortest Path First
  • ISIS Intermediate System to Intermediate System
  • Deterministic Network Technology (DetNet), in which RFC8655 defines the technical architecture of DetNet, providing deterministic services for Layer 2 bridges and Layer 3 routing networks.
  • QoS requirements include deterministic delay upper limit, low packet loss rate, reduced jitter and high reliability, etc.
  • Deterministic networks use resource reservation, explicit routing, and service protection to provide deterministic QoS.
  • Resource reservation is to meet resource deterministic requirements, involving resource allocation and reservation, including link bandwidth, delay queue resources, etc.
  • Explicit routing is to meet the requirement of path determinism, which means that the network path of deterministic service flow needs to be selected in advance to ensure the stability of routing at least during the service residence period.
  • the routing of the deterministic network adopts the deterministic path technology, and the routing path does not change with the real-time changes of the network topology. This technology ensures that the transmission path of deterministic streams is relatively fixed, providing the most basic guarantee for resource reservation technology. At the same time, the fixed path also provides the possibility for accurate calculation of delay, which is an important technical support to ensure limited delay and jitter.
  • the bearer requirements of deterministic services in multiple scenarios of current industry users are multi-dimensional, and there are different levels of deterministic quality indicators in different dimensions.
  • Deterministic routing with multiple capabilities. For example, it is necessary to further provide pre-routing with Service Level Agreement (SLA) capabilities to generate endogenous deterministic routing with its own deterministic capabilities.
  • SLA Service Level Agreement
  • the routing also has path forwarding and QoS guarantee functions, etc., but currently there is no relevant technology in the network that can flexibly build deterministic routes that meet service bearer requirements.
  • the embodiments of the present disclosure provide a deterministic routing construction method, device, and storage medium to at least solve the deterministic transmission requirements for services in related technologies, which often require complex resource evaluation and calculations to construct The problem of deterministic routing that satisfies the need for deterministic transport.
  • the deterministic routing construction solutions provided in some exemplary embodiments can further provide deterministic routing that meets multi-dimensional service bearing requirements.
  • FIG. 1 is a block diagram of a hardware structure of a node or a controller for implementing a method for constructing a deterministic route according to an embodiment of the present disclosure.
  • a node or a controller may include one or more (only one is shown in FIG.
  • processor 102 may include but not limited to a microprocessor (Micro Controller Unit, MCU for short) or A programmable logic device (Field Programmable Gate Arry, abbreviated as a processing device such as FPGA) and a memory 104 for storing data, wherein the above-mentioned nodes or controllers may also include transmission equipment 106 and input and output equipment for communication functions 108.
  • a node or controller may also include more or fewer components than shown in FIG. 1 , or have a different configuration than that shown in FIG. 1 .
  • the memory 104 can be used to store computer programs, for example, software programs and modules of application software, such as the computer programs corresponding to the method for constructing deterministic routes in the embodiments of the present disclosure, and the processor 102 runs the computer programs stored in the memory 104, Thereby executing various functional applications and data processing, that is, realizing the above-mentioned method.
  • the memory 104 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory.
  • the memory 104 may further include memory located remotely from the processor 102, and these remote memories may be connected to the nodes through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
  • the transmission device 106 is used to receive or transmit data via a network.
  • FIG. 2 is a flowchart of a method for constructing a deterministic route according to an embodiment of the present disclosure. As shown in FIG. 2 , the process Including the following steps:
  • Step S202 determining a virtual topology with deterministic capability, wherein the virtual topology is formed based on a resource set, and the resource set includes one or more resources with the same deterministic capability in the physical topology of the network.
  • the resources may include at least one of the following: physical forwarding nodes, virtual forwarding nodes, links, computing power, storage nodes, bandwidth, and queues, wherein the physical forwarding nodes and the virtual forwarding nodes include at least one of the following: In-node ports, queues, scheduling, service processing, and cross-switching matrix.
  • the resources of the physical topology in the network may form multiple resource sets, and a resource set includes resources with the same deterministic capability.
  • Resources of the same deterministic capability may form one or more resource sets, and one or more virtual topologies may be formed based on the one or more resource sets.
  • the resources included in multiple resource sets corresponding to the same deterministic capability may be identical or partly identical.
  • different virtual topologies composed of multiple resource sets based on the same deterministic capability may share resources or partially share resources .
  • the virtual topology can also monopolize resources, or share some resources and monopolize some resources.
  • Virtual topologies can be aggregated. For example, multiple resource sets corresponding to the same deterministic capability can be used to form multiple virtual topologies, and these multiple virtual topologies can be aggregated to form a larger virtual topology. For another example, if the bearer requirements of deterministic services correspond to deterministic capabilities within a certain range, such as [a, b], or [a, max], where a and b represent the values or levels of specific deterministic capabilities, and max Indicates the maximum number or level supported by the system, then multiple virtual topologies corresponding to deterministic capabilities within this range can be aggregated to obtain a virtual topology whose corresponding deterministic capabilities can meet the bearer requirements of deterministic services.
  • a certain range such as [a, b], or [a, max]
  • step S202 may determine a virtual topology with deterministic capabilities in the following manner:
  • the resources with the same classification are divided into the same resource set, and the virtual topology is formed based on the resource set.
  • ultra-low delay resources include L1 layer cutthrough channels, etc.
  • low-latency resources include exclusive bandwidth, etc.
  • ultra-low-latency jitter resources include L1 layer Flexible Ethernet (Flexible Ethernet, referred to as FlexE) pipes, etc.
  • Delay jitter resources include periodic queue-based scheduling, resources scheduled based on time nodes (Deadline), etc.
  • the method may further include: classifying resources with the same classification according to their deterministic capabilities The value of the capability is graded; dividing the resources with the same classification into the same resource set includes: dividing the resources with the same classification and the same rating into the same resource set.
  • classifying the resources according to their deterministic capabilities may include: based on preset dimensions, classifying the resources Classify according to the deterministic capability, wherein the preset dimension includes at least one of the following: deterministic resource usage mode, deterministic network function, deterministic network service quality and performance.
  • the deterministic resource usage manner includes at least one of the following: exclusive usage, shared usage, and virtual exclusive usage.
  • the deterministic network function includes a deterministic function that the network can provide or a function that the network can guarantee.
  • the deterministic network function may include at least one of the following: forwarding, encryption, encapsulation, routing, and quality of service.
  • the deterministic network quality of service and performance includes at least one of the following: deterministic service level agreement, deterministic service quality capability.
  • the deterministic quality of service capability may include at least one of delay, jitter, and packet loss capabilities, and various resources (for example, bandwidth resources, delay resources, computing instance resources, and storage resources) mainly A resource that provides or affects certainty capabilities.
  • Step S204 constructing a deterministic route on the virtual topology having the deterministic capability.
  • deterministic routing is built on a virtual topology with deterministic capabilities, the attributes of resources themselves can ensure the deterministic routing, which belongs to endogenous deterministic routing.
  • the virtual topology is formed based on a resource set, and the resource set includes one or more of the physical topology of the network with the same deterministic capability resources; then build deterministic routes on the virtual topology with the deterministic capability, through this solution, only need to build routes on the virtual topology, it can ensure that all the routes constructed have corresponding deterministic Performance capabilities, so as to solve the deterministic transmission requirements of related technologies in the face of business, often requires complex resource evaluation and calculations to build deterministic routes that meet deterministic transmission requirements.
  • This solution can reasonably, quickly and accurately Build deterministic routes that meet business needs, and support deterministic networks to provide deterministic services.
  • step S202 may include: the controller receives the resource information reported by the node, wherein the resource information carries the deterministic capability of the resource; step S204 includes: the controller in Constructing a deterministic route on the virtual topology with the deterministic capability, and configuring the deterministic route to the node.
  • the time node for the node to report the resource information may include the reporting when the node is established and the reporting when the resource is updated.
  • step S202 may include: the node receives resource information flooded by other nodes, wherein the resource information carries the deterministic capability of the resource;
  • step S204 may include: The controller constructs a deterministic route on the virtual topology having the deterministic capability.
  • the time node when the node floods the resource information may include the flooding when the node is established and the flooding when the resource is updated.
  • the resources involved in the scheme of the embodiment of the present disclosure include various types of resources, and their respective deterministic attributes participate in the classification and thus constitute a virtual topology.
  • the deterministic routing thus formed is equivalent to considering both
  • the delay of the link also includes the link delay, that is to say, the influence of the measurement in the node is supplemented, and the measurement type that enhances the deterministic capability is introduced. This measurement can be called the deterministic delay metric (Deterministic Delay Metric), It includes both the delay within the node and the link delay.
  • the technical solution of the present disclosure can be embodied in the form of a software product in essence or the part that contributes to the related technology, and the computer software product is stored in a storage medium (such as a read-only memory (Read-Only Memory) , referred to as ROM), random access memory (Random Access Memory, referred to as RAM), magnetic disk, optical disk), including a number of instructions to make a terminal device (which can be a mobile phone, computer, server, or network equipment, etc.) ) to perform the methods described in various embodiments of the present disclosure.
  • a storage medium such as a read-only memory (Read-Only Memory) , referred to as ROM), random access memory (Random Access Memory, referred to as RAM), magnetic disk, optical disk
  • a terminal device which can be a mobile phone, computer, server, or network equipment, etc.
  • a device for constructing a deterministic route is also provided, and the device is used to implement the above embodiments and preferred implementation manners, and what has been explained will not be repeated here.
  • the term "module” may be a combination of software and/or hardware that realizes a predetermined function.
  • the devices described in the following embodiments are preferably implemented in software, implementations in hardware, or a combination of software and hardware are also possible and contemplated.
  • Fig. 3 is a structural block diagram of a device for constructing a deterministic route according to an embodiment of the present disclosure. As shown in Fig. 3 , the device for constructing a deterministic route includes:
  • the determination module 32 is configured to determine a virtual topology with deterministic capabilities, wherein the virtual topology is formed based on a resource set, and the resource set includes one or more resources with the same deterministic capability in the physical topology of the network;
  • the route construction module 34 is configured to construct a deterministic route on the virtual topology having the deterministic capability.
  • the determination module 32 is configured to: obtain the deterministic capabilities of the resources in the physical topology; classify the resources in the physical topology according to the deterministic capabilities they have; The resources with the same classification are divided into the same resource set, and the virtual topology is formed based on the resource set.
  • the determination module 32 is further configured to: classify the resources with the same classification according to the value of the deterministic capability they have; divide the resources with the same classification and the same classification into same collection of resources.
  • the current device for constructing a deterministic route is used to implement the method for constructing a deterministic route described in the foregoing embodiments, and details that have been described in the foregoing embodiments will not be repeated here.
  • the above-mentioned modules can be realized by software or hardware. For the latter, it can be realized by the following methods, but not limited to this: the above-mentioned modules are all located in the same processor; or, the above-mentioned modules can be combined in any combination The forms of are located in different processors.
  • Embodiments of the present disclosure also provide a computer-readable storage medium, in which a computer program is stored, wherein the computer program is set to execute the steps in any one of the above method embodiments when running.
  • the above-mentioned computer-readable storage medium may include, but is not limited to: various media capable of storing computer programs, such as a USB flash drive, ROM, RAM, removable hard disk, magnetic disk, or optical disk.
  • Embodiments of the present disclosure also provide an electronic device, including a memory and a processor, where a computer program is stored in the memory, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.
  • the electronic device may further include a transmission device and an input and output device, wherein the transmission device is connected to the processor, and the input and output device is connected to the processor.
  • the embodiments of the present disclosure propose a method for constructing deterministic routes.
  • the route provides pre-routing with SLA capabilities, which is The endogenous deterministic routing with its own deterministic capabilities, as well as path forwarding and QoS guarantee functions, supports deterministic networks to provide deterministic services.
  • SLA capabilities which is The endogenous deterministic routing with its own deterministic capabilities, as well as path forwarding and QoS guarantee functions, supports deterministic networks to provide deterministic services.
  • the implementation process of the method for constructing the deterministic route is described in detail below.
  • FIG. 4 is a detailed flowchart of a method for constructing a deterministic route according to an embodiment of the present disclosure. As shown in FIG. 4 , the method includes the following steps:
  • Step S402 classifying and grading network physical resources according to deterministic capabilities.
  • the physical topology of the network consists of various resources, including physical or virtual forwarding nodes (including ports in nodes, queues, scheduling, business processing, and cross-switching matrix), links, computing power, storage nodes, links, bandwidth, queue etc.
  • physical or virtual forwarding nodes including ports in nodes, queues, scheduling, business processing, and cross-switching matrix
  • links including computing power, storage nodes, links, bandwidth, queue etc.
  • Deterministic capabilities are classified according to the dimensions of deterministic resource usage, deterministic network functions, and deterministic network service quality and performance. Resource usage can be classified as exclusive, shared, virtual exclusive or combined.
  • Deterministic network functions are deterministic or guaranteed functions, including forwarding, encryption, encapsulation, routing, and QoS.
  • Deterministic network service quality and performance including deterministic SLA, and deterministic QoS capabilities, including bandwidth resources, delay resources, computing power resources, storage resources, or further expansion of new categories in the future.
  • ultra-low delay resources include L1-layer cutthrough channels, etc.
  • low-latency resources include exclusive bandwidth, etc.
  • ultra-low-latency jitter resources include L1-layer FlexE pipes, etc.
  • low-latency jitter resources include periodic queue scheduling. Resources scheduled based on Deadline, etc.
  • Step S404 dividing the classified physical resources into virtual topologies with deterministic capabilities according to a predetermined policy.
  • Topology is a relatively complex attribute, such as multiple deterministic attributes sharing topology, exclusive topology or topology aggregation.
  • Step S406 construct an endogenous deterministic route on the virtual topology with deterministic capability.
  • deterministic routing can use Interior Gateway Protocol (IGP) (such as OSPF or IS-IS) protocol (intra-domain routing) and BGP (Border Gateway Protocol) (inter-domain routing) protocol dynamically generated.
  • IGP Interior Gateway Protocol
  • nodes in the virtual topology with deterministic capabilities flood resource information with deterministic capabilities to all nodes in the domain, calculate the best deterministic route through routing algorithms such as the SPF algorithm, and generate routing tables in the nodes.
  • routing algorithms such as the SPF algorithm
  • Routing algorithms can calculate deterministic routes based on specific types of deterministic metrics.
  • this embodiment additionally considers the impact of metrics in nodes, so it introduces metric types that enhance deterministic capabilities, such as Deterministic Delay Metric includes both the delay within the node and the link delay.
  • deterministic routing can be configured centrally by the controller, and the controller collects virtual topology information with deterministic capabilities, including the Deterministic Metric attribute of deterministic capabilities.
  • the controller calculates the deterministic path through the path algorithm and configures it to the node side through the southbound interface between the controller and the node side, such as Network Configuration Protocol (Network Configuration Protocol, netconf) (yang), Path Computation Element (Path Computation Element Protocol, referred to as PCEP), BGP, OpenFlow protocol, etc.
  • the following uses an exemplary embodiment to describe the process of creating a deterministic route in a distributed manner.
  • FIG. 5 is a network structure diagram based on deterministic routing according to an embodiment of the present disclosure. As shown in FIG. Provides pre-routing with SLA capability, which is an endogenous deterministic routing with its own deterministic capabilities. It uses distributed methods to create deterministic routing, and uses IGP protocol to build deterministic routing of the network in a distributed manner. Specific steps are as follows:
  • resources with deterministic capabilities are divided according to the Flexible Algorithm (Flex-algo) strategy of the IGP protocol in the slice, and the resources are classified and graded.
  • Flexible Algorithm Flexible Algorithm
  • the second step is to construct a virtual topology with different deterministic capabilities through the IGP protocol Flex-algo strategy in the slice.
  • the third step is to use the deterministic path calculation capability of the IGP protocol Flex-algo strategy in the slice, select the deterministic calculation type, add deterministic delay constraints, and calculate and generate deterministic routes.
  • the following uses an exemplary embodiment to describe the process of creating a deterministic route in a centralized manner.
  • Fig. 5 is a network structure diagram based on deterministic routing according to an embodiment of the present disclosure. As shown in Fig. 5, the network structure diagram based on deterministic routing is proposed in this exemplary embodiment.
  • the pre-routing with SLA capability is an endogenous deterministic routing with its own deterministic capabilities. It uses a centralized method to create deterministic routing, and configures the routing table through the controller. Specific steps are as follows:
  • the node reports the physical network topology resources to the controller through the southbound node protocol, such as Netconf (yang), OpenFlow protocol, etc.;
  • the southbound node protocol such as Netconf (yang), OpenFlow protocol, etc.
  • the controller manages topology resources, divides resources with deterministic capabilities, and classifies resources.
  • the controller uses resources with different deterministic capabilities to construct virtual topologies with different deterministic capabilities.
  • the controller calculates the deterministic route through the path algorithm according to the metric of the deterministic capability, and configures it to the node side through the southbound interface between the controller and the node side, such as netconf (yang), PCEP, OpenFlow protocol, etc. .
  • each module or each step of the above-mentioned disclosure can be realized by a general-purpose computing device, and they can be concentrated on a single computing device, or distributed in a network composed of multiple computing devices In fact, they can be implemented in program code executable by a computing device, and thus, they can be stored in a storage device to be executed by a computing device, and in some cases, can be executed in an order different from that shown here. Or described steps, or they are fabricated into individual integrated circuit modules, or multiple modules or steps among them are fabricated into a single integrated circuit module for implementation. As such, the present disclosure is not limited to any specific combination of hardware and software.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本公开实施例提供了一种确定性路由的构建方法、装置和存储介质。该方法包括：确定具有确定性能力的虚拟拓扑，其中，所述虚拟拓扑基于资源集合构成，所述资源集合包括网络的物理拓扑中一个或多个具有相同的确定性能力的资源；在具有所述确定性能力的所述虚拟拓扑上，构建确定性路由。通过本公开，解决了相关技术中面对业务的确定性传输需求，往往需要进行复杂的资源评估和计算，才能构建满足确定性传输需求的确定性路由的问题，该方案能够合理、快速且准确地构建满足业务需求的确定性路由，支持确定性网络提供确定性服务。

Description

确定性路由的构建方法、装置和存储介质
相关申请的交叉引用
本公开基于2021年11月09日提交的发明名称为“确定性路由的构建方法、装置和存储介质”的中国专利申请CN20211321831.5，并且要求该专利申请的优先权，通过引用将其所公开的内容全部并入本公开。
技术领域
本公开实施例涉及通信领域，具体而言，涉及一种确定性路由的构建方法、装置和存储介质。
背景技术
为了满足确定性服务等的业务需求，为了在Layer 3(简称为L3)层实现确定性技术，国际互联网工程任务组(Internet Engineering Task Force，简称为IETF)标准组织提出确定性网络技术(Deterministic Networking，简称为DetNet)，其中征求意见稿(Request For Comments，简称为RFC)8655定义DetNet相关技术架构，为二层桥和三层路由网络提供确定性服务，服务等级(Quality of Service，简称为QoS)要求包括确定性时延上限，低丢包率，降低抖动和高可靠性等。
确定性网络采用资源预留、显式路由、业务保护来提供确定性QoS。资源预留是为了满足资源确定性需求，涉及资源分配及预留等。显式路由是为了满足路径确定性需求，是指需要提前选定确定性业务流的网络路径，确保至少在业务驻留期间路由的稳定性。确定性网络的路由采用确定路径技术，路由路径不随网络拓扑的实时变化而发生改变。这一技术确保了确定性流的传输路径相对固定，为资源预留技术提供基础的保障，同时路径的固定也为时延的精确计算提供可能，是保证有限延迟和抖动的重要技术支持。
在当前的行业应用中，面对业务的确定性传输需求，往往需要进行复杂的资源评估和计算，才能构建满足确定性传输需求的确定性路由，如何快速且准确地构建满足业务需求的确定性路由，是亟待解决的问题。
发明内容
本公开实施例提供了一种确定性路由的构建方法、装置和存储介质，以至少解决相关技术中面对业务的确定性传输需求，往往需要进行复杂的资源评估和计算，才能构建满足确定性传输需求的确定性路由的问题。
根据本公开的实施例，提供了一种确定性路由的构建方法，包括：确定具有确定性能力的虚拟拓扑，其中，所述虚拟拓扑基于资源集合构成，所述资源集合包括网络的物理拓扑中一个或多个具有相同的确定性能力的资源；在具有所述确定性能力的所述虚拟拓扑上，构建确定性路由。
根据本公开的实施例，还提供了一种确定性路由的构建装置，包括：确定模块，设置为 确定具有确定性能力的虚拟拓扑，其中，所述虚拟拓扑基于资源集合构成，所述资源集合包括网络的物理拓扑中一个或多个具有相同的确定性能力的资源；路由构建模块，设置为在具有所述确定性能力的所述虚拟拓扑上，构建确定性路由。
根据本公开的实施例，还提供了一种计算机可读存储介质，所述计算机可读存储介质中存储有计算机程序，其中，所述计算机程序被设置为运行时执行上述任一项方法实施例中的步骤。
根据本公开的实施例，还提供了一种电子装置，包括存储器和处理器，所述存储器中存储有计算机程序，所述处理器被设置为运行所述计算机程序以执行上述任一项方法实施例中的步骤。
附图说明
图1是本公开实施例的一种用于实现确定性路由的构建方法的节点或控制器的硬件结构框图；
图2是根据本公开实施例的确定性路由的构建方法的流程图；
图3是根据本公开实施例的确定性路由的构建装置的结构框图；
图4是根据本公开实施例的确定性路由的构建方法的详细流程图；
图5是根据本公开实施例的基于确定性路由的网络结构图。
具体实施方式
网络拓扑(Network Topology)结构是指用传输介质互连各种设备的物理布局，指构成网络的成员间特定的物理的即真实的、或者逻辑的即虚拟的排列方式。
路由(Routing)则是指在网络拓扑中的分组报文从源到目的，决定端到端路径的网络范围的进程。路由工作在0SI参考模型第三层即网络层，路由器是网络层数据包转发设备。路由是指路由器从一个接口上收到数据包，根据数据包的目的地址进行定向并转发到另一个接口的过程。
路由度量(routing metric)是路由算法用以确定到达目的地的最佳路径的计量标准。为了帮助选路，路由算法初始化并维护包含路径信息的路由表，路径信息根据使用的路由算法及metric而不同。路由分为静态路由(static routing)和动态路由(dynamic routing)等。静态路由是由管理员在路由器进行手工配置的固定的路由，动态路由是网络中的路由器之间根据实时网络拓扑变化，相互通信传递路由信息，利用收到的路由信息通过路由选择协议计算，更新路由表的过程。常见的动态路由协议如链路状态路由协议包括开放最短路由优先协议(0pen Shortest Path First，简称为OSPF)，中间系统到中间系统(Intermediate System to Intermediate System，简称为ISIS)等。用户按照需求通过在网络拓扑中创建路由，选择最佳路由来完成报文转发。路由的生成包括集中式控制器配置及分布式协议生成两种。
为了满足确定性服务等的业务需求，为了在L3层实现确定性技术，IETF标准组织提出确定性网络技术(DetNet)，其中RFC8655定义DetNet相关技术架构，为二层桥和三层路由网络提供确定性服务，QoS要求包括确定性时延上限，低丢包率，降低抖动和高可靠性等。
确定性网络采用资源预留、显式路由、业务保护来提供确定性QoS。资源预留是为了满足资源确定性需求，涉及资源分配及预留等，包括链路带宽，时延队列资源等。显式路由是 为了满足路径确定性需求，是指需要提前选定确定性业务流的网络路径，确保至少在业务驻留期间路由的稳定性。确定性网络的路由采用确定路径技术，路由路径不随网络拓扑的实时变化而发生改变。这一技术确保了确定性流的传输路径相对固定，为资源预留技术提供最基础的保障，同时路径的固定也为时延的精确计算提供可能，是保证有限延迟和抖动的重要技术支持。
在当前的行业应用中，面对业务的确定性传输需求，往往需要进行复杂的资源评估和计算，才能构建满足确定性传输需求的确定性路由，如何快速且准确地构建满足业务需求的确定性路由，是亟待解决的问题。
进一步地，当前行业用户多场景下确定性业务的承载需求是多维的，且不同维度的确定性质量指标存在不同的级别，为了实现各种业务多样化的确定性传输需求，需要在网络中提供多种能力的确定性路由，例如，需要进一步提供携带服务等级协议(Service Level Agreement，简称为SLA)能力的预路由，生成自身具有确定性能力的内生确定性路由，该路由同时具备路径转发及QoS保障功能等，但目前网络中没有相关技术能够灵活地构建满足业务承载需求的确定性路由。
为此，本公开实施例提供了一种确定性路由的构建方法、装置和存储介质，以至少解决相关技术中面对业务的确定性传输需求，往往需要进行复杂的资源评估和计算，才能构建满足确定性传输需求的确定性路由的问题。此外，一些示例性实施例中提供的确定性路由的构建方案，还能够进一步提供满足多维的业务承载需求的确定性路由。
下文中将参考附图并结合实施例来详细说明本公开的实施例。
需要说明的是，本公开的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
本申请实施例中所提供的方法实施例可以在网络中的节点或者控制器中执行。图1是本公开实施例的一种用于实现确定性路由的构建方法的节点或控制器的硬件结构框图。如图1所示，节点或控制器可以包括一个或多个(图1中仅示出一个)处理器102(处理器102可以包括但不限于微处理器(Micro Controller Unit，简称为MCU)或可编程逻辑器件(Field Programmable Gate Arry，简称为FPGA)等的处理装置)和用于存储数据的存储器104，其中，上述节点或控制器还可以包括用于通信功能的传输设备106以及输入输出设备108。本领域普通技术人员可以理解，图1所示的结构仅为示意，其并不对上述节点或控制器的结构造成限定。例如，节点或控制器还可包括比图1中所示更多或者更少的组件，或者具有与图1所示不同的配置。
存储器104可用于存储计算机程序，例如，应用软件的软件程序以及模块，如本公开实施例中的确定性路由的构建方法对应的计算机程序，处理器102通过运行存储在存储器104内的计算机程序，从而执行各种功能应用以及数据处理，即实现上述的方法。存储器104可包括高速随机存储器，还可包括非易失性存储器，如一个或者多个磁性存储装置、闪存、或者其他非易失性固态存储器。在一些实例中，存储器104可进一步包括相对于处理器102远程设置的存储器，这些远程存储器可以通过网络连接至节点。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
传输装置106用于经由一个网络接收或者发送数据。
在本实施例中提供了一种运行于节点或控制器的确定性路由的构建方法，图2是根据本公开实施例的确定性路由的构建方法的流程图，如图2所示，该流程包括如下步骤：
步骤S202，确定具有确定性能力的虚拟拓扑，其中，所述虚拟拓扑基于资源集合构成，所述资源集合包括网络的物理拓扑中一个或多个具有相同的确定性能力的资源。
所述资源可以包括以下至少之一：物理转发节点、虚拟转发节点、链路、算力、存储节点、带宽和队列，其中，所述物理转发节点和所述虚拟转发节点包括以下至少之一：节点内端口、队列、调度、业务处理、交叉交换矩阵。
网络的物理拓扑中有大量的资源，而不同的资源可能具有相同的确定性能力，也可能具有不同的确定性能力。因此，网络中的物理拓扑的资源可能形成多个资源集合，而一个资源集合包括的是具有相同的确定性能力的资源。相同的确定性能力的资源可以构成一个或多个资源集合，基于这一个或多个资源集合可以构成一个或多个虚拟拓扑。对应于相同的确定性能力的多个资源集合所包括的资源可以相同或部分相同，此时，基于相同的确定性能力的多个资源集合所构成的不同的虚拟拓扑可以共享资源或部分共享资源。虚拟拓扑也可以独占资源，或者，还可以部分资源共享、部分资源独占。
虚拟拓扑之间是可以聚合的。例如，对应于相同的确定性能力的多个资源集合，可以用来构成多个虚拟拓扑，而这多个虚拟拓扑可以通过聚合构成一个更大的虚拟拓扑。再例如，如果确定性业务的承载需求对应着一定范围内的确定性能力，比如[a，b]，或[a，max]，其中a和b表示具体的确定性能力的数值或等级，max表示系统支持的最大数值或最大等级，那么可以对该范围内的确定性能力对应的多个虚拟拓扑进行聚合，以得到对应的确定性能力能够满足确定性业务的承载需求的虚拟拓扑。
在至少一个示例性实施例中，步骤S202可以通过以下方式确定具有确定性能力的虚拟拓扑：
获取所述物理拓扑中的资源所具有的确定性能力；
对所述物理拓扑中的资源按照所具有的确定性能力进行分类；
将具有相同分类的资源划分到相同的资源集合，并基于所述资源集合构成所述虚拟拓扑。
通过对资源按照所具有的确定性能力进行分类，可以得到一系列具有属于相同分类的资源，并将其划入相同的资源集合。
对于某些资源，在相同的分类下还可以进一步划分有不同的级别，例如，针对时延类资源可分级为：超低时延资源，低时延资源，低抖动资源等，以体现不同的时延精度(如10ms，20ms等)或时延抖动精度(如10us，20us等)。一般的，超低时延的资源包括L1层cutthrough通道等，低时延资源包括独享带宽等；超低时延抖动资源包括L1层灵活以太网(Flexible Ethernet，简称为FlexE)管道等，低时延抖动资源包括基于周期队列调度，基于时间节点(Deadline)调度的资源等。因此，在至少一个示例性实施例中，在对所述物理拓扑中的资源按照所具有的确定性能力进行分类之后，所述方法还可以包括：对具有相同分类的资源按照所具有的确定性能力的取值大小进行分级；将具有相同分类的资源划分到相同的资源集合包括：将具有相同分类且具有相同分级的资源划分到相同的资源集合。
通过该方式，可以保证相同分类且相同分级的资源被划分到相同的资源集合，从而保证基于资源集合构成的虚拟拓扑能够提供相应的确定性能力。
当前行业用户多场景下确定性业务的承载需求是多维的，且不同维度的确定性质量指标 存在不同的级别，为了实现各种业务多样化的确定性传输需求，需要在网络中提供多种能力的确定性路由，所以，为了适应于承载需求的多维化，在至少一个示例性实施例中，对所述资源按照所具有的确定性能力进行分类可以包括：基于预设维度，对所述资源按照所具有的确定性能力进行分类，其中，所述预设维度包括以下至少之一：确定性资源使用方式、确定性网络功能、确定性网络服务质量和性能。
在至少一个示例性实施例中，所述确定性资源使用方式包括以下至少之一：独占使用、共享使用、虚拟独占使用。
在至少一个示例性实施例中，所述确定性网络功能包括网络能够提供的确定性的功能或网络能够保障的功能。所述确定性网络功能可以包括以下至少之一：转发、加密、封装、路由、服务质量。
在至少一个示例性实施例中，所述确定性网络服务质量和性能包括以下至少之一：确定性服务等级协议、确定性服务质量能力。所述确定性服务质量能力可以包括时延，抖动和丢包等能力中的至少之一，而各类资源(例如，带宽类资源、时延类资源、算例类资源、存储类资源)主要是能提供或影响确定性能力的资源。
步骤S204，在具有所述确定性能力的所述虚拟拓扑上，构建确定性路由。
鉴于确定性路由是在具有确定性能力的虚拟拓扑上构建的，因此资源所具有的属性本身能够保证路由的确定性，属于内生确定性路由。
通过本公开实施例的方案，首先确定具有确定性能力的虚拟拓扑，所述虚拟拓扑是基于资源集合构成，且所述资源集合包括网络的物理拓扑中一个或多个具有相同的确定性能力的资源；之后在具有所述确定性能力的所述虚拟拓扑上，构建确定性路由，通过该方案，只需要在所述虚拟拓扑上构建路由，就能够保证所构建的所有路由都具有相应的确定性能力，从而解决相关技术中面对业务的确定性传输需求，往往需要进行复杂的资源评估和计算，才能构建满足确定性传输需求的确定性路由的问题，该方案能够合理、快速且准确地构建满足业务需求的确定性路由，支持确定性网络提供确定性服务。
在实际应用中，路由生成方式可以采用分布式或集中式两种方式，以下分别进行说明。
对于集中式的路由生成方案，由控制器接收节点上报的资源信息，并基于上报进行虚拟拓扑的确定，并构建确定性路由以及将确定性路由配置到节点。因此，在至少一个实施例中，步骤S202可以包括：控制器接收节点上报的资源信息，其中，所述资源信息中携带所述资源所具有的确定性能力；步骤S204包括：所述控制器在具有所述确定性能力的所述虚拟拓扑上，构建确定性路由，并将所述确定性路由配置到所述节点。节点上报资源信息的时间节点可以包括节点建立时的上报以及资源更新时的上报。
对于分布式的路由生成方案，由节点在网络内洪泛资源信息，并基于接收到的资源信息进行虚拟拓扑的确定，并构建确定性路由。因此，在至少一个示例性实施例中，步骤S202可以包括：节点接收其他节点洪泛的资源信息，其中，所述资源信息中携带所述资源所具有的确定性能力；步骤S204可以包括：所述控制器在具有所述确定性能力的所述虚拟拓扑上，构建确定性路由。节点洪泛资源信息的时间节点可以包括节点建立时的洪泛以及资源更新时的洪泛。
有别于相关技术中仅考虑链路的度量属性(如内部网关协议度量(Interior Gateway Protocol metric，简称为IGP metric)、流量工程度量(Traffic Engineering metric，简 称为TE metric)、时延度量(delay metric)等)，本公开实施例的方案所涉及的资源包括各类型资源，而它们各自的确定性属性都参与分类进而构成了虚拟拓扑，这样所构成的确定性路由相当于既考虑了节点内的时延也包含了链路时延，也就是说补充考虑了节点内的度量影响，引入增强了确定性能力的度量类型，这种度量可以称为确定性时延度量(Deterministic Delay Metric)，既包含了节点内的时延也包含了链路时延。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本公开的技术方案本质上或者说对相关技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如只读存储器(Read-Only Memory，简称为ROM)、随机存取存储器(Random Access Memory，简称为RAM)、磁碟、光盘)中，包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本公开各个实施例所述的方法。
在本实施例中还提供了一种确定性路由的构建装置，该装置用于实现上述实施例及优选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。
图3是根据本公开实施例的确定性路由的构建装置的结构框图，如图3所示，该确定性路由的构建装置包括：
确定模块32，设置为确定具有确定性能力的虚拟拓扑，其中，所述虚拟拓扑基于资源集合构成，所述资源集合包括网络的物理拓扑中一个或多个具有相同的确定性能力的资源；
路由构建模块34，设置为在具有所述确定性能力的所述虚拟拓扑上，构建确定性路由。
在至少一个示例性实施例中，所述确定模块32设置为：获取所述物理拓扑中的资源所具有的确定性能力；对所述物理拓扑中的资源按照所具有的确定性能力进行分类；将具有相同分类的资源划分到相同的资源集合，并基于所述资源集合构成所述虚拟拓扑。
在至少一个示例性实施例中，所述确定模块32还设置为：对具有相同分类的资源按照所具有的确定性能力的取值大小进行分级；将具有相同分类且具有相同分级的资源划分到相同的资源集合。
当前的确定性路由的构建装置用于实现前述实施例中描述的确定性路由的构建方法，对于已经在前述实施例中描述的内容，在此不再赘述。
需要说明的是，上述各个模块是可以通过软件或硬件来实现的，对于后者，可以通过以下方式实现，但不限于此：上述模块均位于同一处理器中；或者，上述各个模块以任意组合的形式分别位于不同的处理器中。
本公开的实施例还提供了一种计算机可读存储介质，该计算机可读存储介质中存储有计算机程序，其中，该计算机程序被设置为运行时执行上述任一项方法实施例中的步骤。
在一个示例性实施例中，上述计算机可读存储介质可以包括但不限于：U盘、ROM、RAM、移动硬盘、磁碟或者光盘等各种可以存储计算机程序的介质。
本公开的实施例还提供了一种电子装置，包括存储器和处理器，该存储器中存储有计算机程序，该处理器被设置为运行计算机程序以执行上述任一项方法实施例中的步骤。
在一个示例性实施例中，上述电子装置还可以包括传输设备以及输入输出设备，其中，该传输设备和上述处理器连接，该输入输出设备和上述处理器连接。
本实施例中的具体示例可以参考上述实施例及示例性实施方式中所描述的示例，本实施例在此不再赘述。
为了实现各种业务多样化的确定性传输需求，在网络中构建多种能力的确定性路由，本公开实施例提出一种确定性路由的构建方法，该路由提供携带SLA能力的预路由，是自身具有确定性能力的内生确定性路由，同时具备路径转发及QoS保障功能，支持确定性网络提供确定性服务。以下详细说明该确定性路由的构建方法的实施过程。
图4是根据本公开实施例的确定性路由的构建方法的详细流程图，如图4所示，该方法包括以下步骤：
步骤S402，对网络物理资源按照确定性能力进行分类分级。
网络的物理拓扑由各种资源组成，包括物理或虚拟的转发节点(含节点内的端口，队列，调度，业务处理，交叉交换矩阵)、链路、算力、存储节点、链路、带宽、队列等。
首先，为了满足多种确定性业务需求，需要对物理拓扑中的资源进行分类，不同类别的资源具有不同的确定性能力。确定性能力按照确定性资源使用、确定性网络功能和确定性网络服务质量与性能几个维度进行分类。资源的使用可以分为独占，共享，虚拟独占或组合。确定性网络功能是确定性的功能或者可保障的功能，包括转发、加密、封装、路由和QoS等。确定性网络服务质量与性能，包括确定性SLA，以及具备的确定性QoS能力，包括带宽类资源、时延类资源、算力类资源、存储类资源，或在未来进一步扩展新的类别。
进一步的，可针对特定类别的资源进行分级，比如，针对时延类资源，可分级为：超低时延资源，低时延资源，低抖动资源等，以体现不同的时延精度(如10ms，20ms等)或时延抖动精度(如10us，20us等)。一般的，超低时延的资源包括L1层cutthrough通道等，低时延资源包括独享带宽等；超低时延抖动资源包括L1层FlexE管道等，低时延抖动资源包括基于周期队列调度，基于Deadline调度的资源等。
步骤S404，按照预定策略将分级分类后的物理资源划分到具有确定性能力的虚拟拓扑。
按照确定性能力进行资源的分类分级后，将特定类型/级别的资源划分到一个资源池或资源组，构成具有确定性能力的虚拟拓扑(或称为逻辑拓扑)。拓扑是相对比较复杂的属性，比如多个确定性属性共享拓扑，独占拓扑或拓扑聚合。
步骤S406，在具有确定性能力的虚拟拓扑上，构建内生确定性路由。
在构建了具有确定性能力的虚拟拓扑后，需要进一步提供具有确定性能力的路由，该路由同时具备路径转发及QoS保障功能，路由生成方式可以采用分布式或集中式两种方式。
在分布式路由方式中，确定性路由可以利用内部网关协议(Interior Gateway Protocol，简称为IGP)(例如OSPF或IS-IS)协议(域内路由)和BGP(Border Gateway Protocol)(域间路由)协议动态生成。通过IGP协议，具有确定性能力的虚拟拓扑中的节点向本域中所有节点洪泛具有确定性能力的资源信息，通过路由算法例如SPF算法计算最佳确定性路由，在节点中生成路由表。当某个节点的具有确定性能力的资源发生变化时，需向域内所有其它节 点洪泛信息，对于某些确定性资源而言，可结合基于特定阈值的震荡抑制以避免泛洪风暴。路由算法在计算确定性路由时，可基于特定类型的确定性度量(Deterministic Metric)进行计算。有别于相关技术中仅考虑链路的度量属性(如IGP metric、TE metric、delay metric等)，本实施例补充考虑节点内的度量影响，因此引入增强了确定性能力的度量类型，如Deterministic Delay Metric，既包含了节点内的时延也包含了链路时延。
在集中式路由方式中，确定性路由可以利用控制器集中配置，控制器收集具有确定性能力的虚拟拓扑信息，其中包括确定性能力的度量(Deterministic Metric)属性。控制器通过路径算法计算确定性路径并通过控制器与节点侧之间的南向接口配置到节点侧，例如网路配置协议(Network Configuration Protocol，netconf)(yang)，路径计算协议(Path Computation Element Protocol，简称为PCEP)，BGP，OpenFlow协议等。
以下通过一示例性实施例，描述分布式方式创建确定性路由的过程。
图5是根据本公开实施例的基于确定性路由的网络结构图，如图5所示，基于确定性路由的网络结构图，本示例性实施例提出一种确定性路由的构建方法，该路由提供携带SLA能力的预路由，是自身具有确定性能力的内生确定性路由，利用分布式方式创建确定性路由，通过IGP协议分布式构建网络的确定性路由。具体步骤如下：
第一步骤，通过切片中IGP协议灵活算法(Flexible Algorithm，Flex-algo)策略划分具有确定性能力的资源，对资源进行分类分级。
第二步骤，通过切片中IGP协议Flex-algo策略构建具有不同确定性能力的虚拟拓扑。
第三步骤，通过切片中IGP协议Flex-algo策略的确定性路径计算能力，选择确定性计算类型，添加确定性时延约束条件，计算并生成确定性路由。
以下通过一示例性实施例，描述集中式方式创建确定性路由的过程。
图5是根据本公开实施例的基于确定性路由的网络结构图，如图5所示基于确定性路由的网络结构图，本示例性实施例提出一种确定性路由的构建方法，该路由提供携带SLA能力的预路由，是自身具有确定性能力的内生确定性路由，利用集中式方式创建确定性路由，通过控制器配置路由表。具体步骤如下：
第一步骤，节点通过南向节点协议上报物理网络拓扑资源到控制器，如Netconf(yang)，OpenFlow协议等；
第二步骤，控制器管理拓扑资源，划分具有确定性能力的资源，对资源进行分类分级。
第三步骤，控制器利用不同确定性能力的资源，构建具有不同确定性能力的虚拟拓扑。
第四步骤，控制器根据确定性能力的度量标准，通过路径算法计算确定性路由并通过控制器与节点侧之间的南向接口配置到节点侧，例如netconf(yang)，PCEP，OpenFlow协议等。
显然，本领域的技术人员应该明白，上述的本公开的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路 模块来实现。这样，本公开不限制于任何特定的硬件和软件结合。
以上所述仅为本公开的优选实施例而已，并不用于限制本公开，对于本领域的技术人员来说，本公开可以有各种更改和变化。凡在本公开的原则之内，所作的任何修改、等同替换、改进等，均应包含在本公开的保护范围之内。

Claims (14)

  1. 一种确定性路由的构建方法，包括：
    确定具有确定性能力的虚拟拓扑，其中，所述虚拟拓扑基于资源集合构成，所述资源集合包括网络的物理拓扑中一个或多个具有相同的确定性能力的资源；
    在具有所述确定性能力的所述虚拟拓扑上，构建确定性路由。
  2. 根据权利要求1所述的方法，其中，确定具有确定性能力的虚拟拓扑包括：
    获取所述物理拓扑中的资源所具有的确定性能力；
    对所述物理拓扑中的资源按照所具有的确定性能力进行分类；
    将具有相同分类的资源划分到相同的资源集合，并基于所述资源集合构成所述虚拟拓扑。
  3. 根据权利要求2所述的方法，其中，
    在对所述物理拓扑中的资源按照所具有的确定性能力进行分类之后，还包括：
    对具有相同分类的资源按照所具有的确定性能力的取值大小进行分级；
    将具有相同分类的资源划分到相同的资源集合包括：
    将具有相同分类且具有相同分级的资源划分到相同的资源集合。
  4. 根据权利要求2或3所述的方法，其中，对所述资源按照所具有的确定性能力进行分类包括：
    基于预设维度，对所述资源按照所具有的确定性能力进行分类，其中，所述预设维度包括以下至少之一：确定性资源使用方式、确定性网络功能、确定性网络服务质量和性能。
  5. 根据权利要求4所述的方法，其中，所述确定性资源使用方式包括以下至少之一：
    独占使用、共享使用、虚拟独占使用。
  6. 根据权利要求4所述的方法，其中，所述确定性网络功能包括网络能够提供的确定性的功能或网络能够保障的功能。
  7. 根据权利要求4所述的方法，其中，所述确定性网络服务质量和性能包括以下至少之一：确定性服务等级协议、确定性服务质量能力。
  8. 根据权利要求2-7中任一项所述的方法，其中，
    获取所述物理拓扑中的资源所具有的确定性能力包括：控制器接收节点上报的资源信息，其中，所述资源信息中携带所述资源所具有的确定性能力；
    在具有所述确定性能力的所述虚拟拓扑上，构建确定性路由包括：所述控制器在具有所述确定性能力的所述虚拟拓扑上，构建确定性路由，并将所述确定性路由配置到所述节点。
  9. 根据权利要求2-7中任一项所述的方法，其中，
    获取所述物理拓扑中的资源所具有的确定性能力包括：节点接收其他节点洪泛的资源信 息，其中，所述资源信息中携带所述资源所具有的确定性能力；
    在具有所述确定性能力的所述虚拟拓扑上，构建确定性路由包括：所述节点在具有所述确定性能力的所述虚拟拓扑上，构建确定性路由。
  10. 一种确定性路由的构建装置，包括：
    确定模块，设置为确定具有确定性能力的虚拟拓扑，其中，所述虚拟拓扑基于资源集合构成，所述资源集合包括网络的物理拓扑中一个或多个具有相同的确定性能力的资源；
    路由构建模块，设置为在具有所述确定性能力的所述虚拟拓扑上，构建确定性路由。
  11. 根据权利要求10所述的装置，其中，所述确定模块设置为：
    获取所述物理拓扑中的资源所具有的确定性能力；
    对所述物理拓扑中的资源按照所具有的确定性能力进行分类；
    将具有相同分类的资源划分到相同的资源集合，并基于所述资源集合构成所述虚拟拓扑。
  12. 根据权利要求11所述的装置，其中，所述确定模块还设置为：
    对具有相同分类的资源按照所具有的确定性能力的取值大小进行分级；
    将具有相同分类且具有相同分级的资源划分到相同的资源集合。
  13. 一种计算机可读存储介质，所述计算机可读存储介质中存储有计算机程序，其中，所述计算机程序被处理器执行时实现所述权利要求1至9任一项中所述的方法的步骤。
  14. 一种电子装置，包括存储器、处理器以及存储在所述存储器上并可在所述处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现所述权利要求1至9任一项中所述的方法的步骤。
PCT/CN2022/117869 2021-11-09 2022-09-08 确定性路由的构建方法、装置和存储介质 WO2023082815A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP22891620.1A EP4432622A1 (en) 2021-11-09 2022-09-08 Method and apparatus for constructing deterministic routing, and storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111321831.5 2021-11-09
CN202111321831.5A CN116112371A (zh) 2021-11-09 2021-11-09 确定性路由的构建方法、装置和存储介质

Publications (1)

Publication Number Publication Date
WO2023082815A1 true WO2023082815A1 (zh) 2023-05-19

Family

ID=86262491

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/117869 WO2023082815A1 (zh) 2021-11-09 2022-09-08 确定性路由的构建方法、装置和存储介质

Country Status (3)

Country Link
EP (1) EP4432622A1 (zh)
CN (1) CN116112371A (zh)
WO (1) WO2023082815A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117376081A (zh) * 2023-11-16 2024-01-09 湖北邮电规划设计有限公司 一种基于确定性网络的网络维持方法

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117295088B (zh) * 2023-09-15 2024-09-24 重庆数智融合创新科技有限公司 5g内生确定性车间网的实现方法及系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190097884A1 (en) * 2017-09-25 2019-03-28 Cisco Technology, Inc. Deterministic stitching of deterministic segments across distinct deterministic domains
US20190132253A1 (en) * 2017-10-30 2019-05-02 Cisco Technology, Inc. Jitter elimination and latency compensation at detnet transport egress
US20200244576A1 (en) * 2019-01-29 2020-07-30 Cisco Technology, Inc. Supporting asynchronous packet operations in a deterministic network
CN113329053A (zh) * 2021-04-26 2021-08-31 国网浙江省电力有限公司嘉兴供电公司 一种基于电力业务特征的5g网络虚拟映射方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190097884A1 (en) * 2017-09-25 2019-03-28 Cisco Technology, Inc. Deterministic stitching of deterministic segments across distinct deterministic domains
US20190132253A1 (en) * 2017-10-30 2019-05-02 Cisco Technology, Inc. Jitter elimination and latency compensation at detnet transport egress
US20200244576A1 (en) * 2019-01-29 2020-07-30 Cisco Technology, Inc. Supporting asynchronous packet operations in a deterministic network
CN113329053A (zh) * 2021-04-26 2021-08-31 国网浙江省电力有限公司嘉兴供电公司 一种基于电力业务特征的5g网络虚拟映射方法及装置

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117376081A (zh) * 2023-11-16 2024-01-09 湖北邮电规划设计有限公司 一种基于确定性网络的网络维持方法

Also Published As

Publication number Publication date
EP4432622A1 (en) 2024-09-18
CN116112371A (zh) 2023-05-12

Similar Documents

Publication Publication Date Title
CN107547393B (zh) 一种计算转发路径的方法及网络设备
Guck et al. DetServ: Network models for real-time QoS provisioning in SDN-based industrial environments
US8493869B2 (en) Distributed constraints-based inter-domain network traffic management
US10153964B2 (en) Network routing using dynamic virtual paths in an overlay network
WO2023082815A1 (zh) 确定性路由的构建方法、装置和存储介质
Chen et al. Deterministic quality of service guarantee for dynamic service chaining in software defined networking
Farrugia et al. A globally optimised multipath routing algorithm using SDN
Froes et al. ProgLab: Programmable labels for QoS provisioning on software defined networks
Feamster et al. Network-wide BGP route prediction for traffic engineering
Akin et al. Routing algorithm for multiple unsplittable flows between two cloud sites with QoS guarantees
Tomovic et al. Bandwidth-delay constrained routing algorithms for backbone SDN networks
CN117478577A (zh) 保障网络切片确定性时延的方法、装置、存储介质及产品
Moravejosharieh et al. Bandwidth reservation approach to improve quality of service in software-defined networking: A performance analysis
Zhao et al. Hybrid routing by joint optimization of per-flow routing and tag-based routing in software-defined networks
Babu et al. Delay Constrained Communications in a Disaster Site using SDN Framework
Sharma et al. Performance Analysis of IEEE 802.3 using IGRP and EIGRP Routing Protocols
WO2024230244A1 (zh) 一种确定性链路构建方法及装置
Subedi et al. SDN‐based fault‐tolerant on‐demand and in‐advance bandwidth reservation in data center interconnects
Geleji et al. QoS routing across multiple autonomous systems using the path computation element architecture
Huang et al. Nonuniform bandwidth reservation for tunnels in MPLS network using meter tables of OpenFlow
Miserez Routing protocols for real-time applications in
Akin et al. Comparison of routing algorithms with static and dynamic link cost in SDN-extended version
Mousheng et al. Controllable network architecture based on SDN
Kim et al. Bio‐inspired Load Balancing Routing for Delay‐Guaranteed Services in Ever‐Changing Networks
Ghuman et al. QoS Estimation of IEEE 802.3 under the Influence of Intra-Domain Routing Protocols

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22891620

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2022891620

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2022891620

Country of ref document: EP

Effective date: 20240610