WO2024103842A1 - 确定性资源调度方法及装置 - Google Patents

确定性资源调度方法及装置 Download PDF

Info

Publication number
WO2024103842A1
WO2024103842A1 PCT/CN2023/110330 CN2023110330W WO2024103842A1 WO 2024103842 A1 WO2024103842 A1 WO 2024103842A1 CN 2023110330 W CN2023110330 W CN 2023110330W WO 2024103842 A1 WO2024103842 A1 WO 2024103842A1
Authority
WO
WIPO (PCT)
Prior art keywords
deterministic
delay
sub
resource
class
Prior art date
Application number
PCT/CN2023/110330
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 中兴通讯股份有限公司
Publication of WO2024103842A1 publication Critical patent/WO2024103842A1/zh

Links

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/08—Configuration management of networks or network elements
    • H04L41/0894—Policy-based network configuration management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/76—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
    • H04L47/762—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions triggered by the network

Definitions

  • the present disclosure relates to the field of communications, and in particular to a deterministic resource scheduling method and device.
  • Deterministic network refers to the forwarding capability that can provide deterministic service service level agreement (SLA) guarantee in the network.
  • SLA service service level agreement
  • the main goal at the current stage is to support deterministic low packet loss rate, deterministic forwarding delay boundary and deterministic jitter upper limit.
  • the IETF standard organization proposed deterministic network technology (Deterministic Networking, DetNet), in which RFC8655 defines the DetNet related technical architecture to provide deterministic services for Layer 2 bridges and Layer 3 routing networks.
  • the DetNet service quality (Quality of Service, QoS) requirements include deterministic delay upper limit, low packet loss rate, reduced jitter and high reliability.
  • Deterministic network uses resource reservation, explicit routing and service protection to provide deterministic QoS.
  • the embodiments of the present disclosure provide a deterministic resource scheduling method and device to at least solve the problem in the related art that reasonable deterministic resource scheduling cannot be performed and various types of deterministic business requirements cannot be met.
  • a deterministic resource scheduling method including: dividing deterministic delay resource classes according to a deterministic delay constraint strategy; flooding the deterministic delay constraint information to construct a deterministic resource pool based on the deterministic resource class; constructing a scheduling path for the deterministic delay resource according to the deterministic resource pool, and allocating resources.
  • a computer-readable storage medium in which a computer program is stored, wherein the computer program is configured to execute the steps of any one of the above method embodiments when running.
  • an electronic device including a memory and a processor, wherein the memory stores a computer program, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.
  • FIG1 is a hardware structure block diagram of a computer terminal of a deterministic resource scheduling method according to an embodiment of the present disclosure
  • FIG2 is a flow chart of deterministic resource scheduling according to an embodiment of the present disclosure
  • FIG3 is a structural block diagram of a deterministic resource scheduling device according to an embodiment of the present disclosure.
  • FIG4 is a structural block diagram of a resource classification module according to an embodiment of the present disclosure.
  • FIG5 is a flowchart of deterministic resource scheduling according to an embodiment of the present disclosure scenario
  • FIG6 is a schematic diagram of an IGP protocol extension principle according to an embodiment of the present disclosure.
  • FIG7 is a schematic diagram of a deterministic delay constraint sub-sub-TLV according to an embodiment of the present disclosure
  • FIG8 is a schematic diagram of a deterministic jitter constraint sub-sub-TLV according to an embodiment of the present disclosure
  • FIG9 is a schematic diagram showing the principle of determining the type of an object according to an embodiment of a scenario of the present disclosure
  • FIG10 is a schematic diagram of a deterministic network technology control principle according to an embodiment of the present disclosure.
  • FIG11 is a schematic diagram of a deterministic network technology control principle according to an embodiment of the present disclosure.
  • FIG. 12 is a diagram showing a control principle of a deterministic network technology according to an embodiment of the disclosed scenario.
  • FIG. 1 is a hardware structure block diagram of a computer terminal of a deterministic resource scheduling method of an embodiment of the present disclosure.
  • the computer terminal may include one or more (only one is shown in FIG. 1 ) processors 102 (the processor 102 may include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA) and a memory 104 for storing data, wherein the above-mentioned computer terminal may also include a transmission device 106 and an input and output device 108 for communication functions.
  • processors 102 may include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA
  • a memory 104 for storing data
  • the above-mentioned computer terminal may also include a transmission device 106 and an input and output device 108 for communication functions.
  • FIG. 1 is only for illustration, and it does not limit the structure of the above-mentioned computer terminal.
  • the computer terminal may also include more or fewer components than those shown in FIG. 1 , or have a configuration different from 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 program corresponding to the deterministic resource scheduling method in the embodiment of the present disclosure.
  • the processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, that is, implements the above method.
  • the memory 104 may include a high-speed random access memory, and may also include a 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 a memory remotely located relative to the processor 102, and these remote memories may be connected to the mobile terminal via a network. Examples of the above-mentioned network include but are not limited to Applicable to the Internet, corporate intranet, local area network, mobile communication network and their combination.
  • the transmission device 106 is used to receive or send data via a network.
  • the specific example of the above network may include a wireless network provided by a communication provider of a computer terminal.
  • the transmission device 106 includes a network adapter (Network Interface Controller, NIC), which can be connected to other network devices through a base station so as to communicate with the Internet.
  • the transmission device 106 can be a radio frequency (Radio Frequency, RF) module, which is used to communicate with the Internet wirelessly.
  • RF Radio Frequency
  • the Multiprotocol Label Switching Differentiated Services proposed by RFC4214 adds category-based resource management on the basis of the original Traffic Engineering for Multiprotocol Label Switching (MPLS-TE). It collects the resource usage of each category through the Internal Gateway Protocol (IGP), establishes a Traffic Engineering Database (TED), and establishes a Label Switching Path (LSP) by carrying categories through the signaling protocol.
  • IGP Internal Gateway Protocol
  • TED Traffic Engineering Database
  • LSP Label Switching Path
  • DS-TE Differentiated Services Traffic Engineering
  • FIG. 2 is a flowchart of deterministic resource scheduling according to an embodiment of the present disclosure. As shown in FIG. 2 , the process includes the following steps:
  • Step S202 dividing deterministic delay resource classes according to the deterministic delay constraint strategy
  • Step S204 flooding the deterministic delay constraint information to build a deterministic resource pool based on the deterministic resource class
  • Step S206 construct a scheduling path for deterministic delay resources according to the deterministic resource pool, and allocate resources.
  • the deterministic delay resource class is divided according to the deterministic delay constraint strategy; the deterministic delay constraint information is flooded to build a deterministic resource pool based on the deterministic resource class; the scheduling path of the deterministic delay resource is built according to the deterministic resource pool, and the resources are allocated.
  • the execution subject of the above steps may be a base station, a terminal, etc., but is not limited thereto.
  • the deterministic delay constraint strategy includes at least one of the following: an end-to-end jitter strategy; Point delay strategy; packet loss strategy.
  • deterministic delay resource classes are divided, including: according to the deterministic delay constraint strategy, first-level categories of the deterministic delay resource classes are divided, wherein the first-level categories include at least one of the following: deterministic jitter class (Deterministic Jitter class-Type, DJT); deterministic low latency jitter class (Deterministic Latency and Jitter class-Type, DLJT); deterministic low latency class (Deterministic Latency class-Type, DLT); bounded latency class (Bounded Latency class-Type, BLT); one or more deterministic delay constraint strategies are configured for each first-level category to divide each first-level category into multiple second-level categories.
  • deterministic delay constraint information is flooded to construct a deterministic resource pool based on deterministic resource classes, including: flooding each type of deterministic delay resource using an internal gateway protocol IGP, and collecting usage of each type of deterministic delay resource to construct a deterministic resource pool.
  • each type of deterministic delay resource is flooded using an IGP protocol, including: extending the IGP protocol of deterministic delay constraint information, carrying one or more deterministic delay constraint (Deterministic Latency Constraint, DLC) sub-TLVs for indicating a deterministic delay constraint strategy in the IGP protocol, wherein the information carried in the DLC sub-TLV includes at least one of the following: a deterministic delay constraint model number with a byte length of 8 bits; a deterministic network bandwidth (DetNet Bandwidth, DetNet BW) with a byte length of 32 bits.
  • DLC deterministic Latency Constraint
  • a deterministic delay constraint (DLC) type length value tag (Type Length Value sub, sub-TLV) carries one or more type length value sub-tags sub-sub-TLVs, wherein the sub-sub-TLV includes: a deterministic delay constraint (DDC) sub-sub-TLV, wherein the information carried in the DDC sub-sub-TLV includes at least one of the following: a sub-sub-TLV number with a byte length of 8 bits; a node maximum delay with a byte length of 32 bits; a node minimum delay with a byte length of 32 bits.
  • DLC deterministic delay constraint
  • DDC deterministic delay constraint
  • a deterministic delay constraint DLC sub-TLV carries one or more sub-sub-TLVs, wherein the sub-sub-TLV includes: a deterministic jitter constraint (DJC) sub-sub-TLV, wherein the information carried in the DJC sub-sub-TLV includes at least one of the following: a sub-sub-TL number with a byte length of 8 bits; an end-to-end maximum jitter with a byte length of 32 bits; an end-to-end minimum jitter with a byte length of 32 bits.
  • DJC deterministic jitter constraint
  • deterministic delay constraint information is flooded to build a deterministic resource pool based on deterministic resource classes, including: in the presence of a controller, by extending the Border Gateway Protocol Link State (BGP-LS), carrying the deterministic delay constraint DLC sub-TLV in the node attribute Type Length Value (TLV) of the BGP-LS protocol, so as to report the information of each type of deterministic resource class to the controller through the BGP-LS protocol, thereby building a deterministic resource pool.
  • Border Gateway Protocol Link State BGP-LS
  • TLV Type Length Value
  • a scheduling path for deterministic delay resources is constructed based on a deterministic resource pool, and resources are allocated, including: extending the Path Computation Element Communication Protocol (PCEP) or the Resource Reservation Protocol (RSVP), carrying a deterministic class identifier represented by a deterministic type object in the PCEP protocol or the RSVP protocol, constructing a scheduling path for deterministic delay resources based on the deterministic type object, and allocating resources.
  • PCEP Path Computation Element Communication Protocol
  • RSVP Resource Reservation Protocol
  • the information carried by the deterministic type object includes at least one of the following: a deterministic type DT with a byte length of 3 bits; a deterministic subtype with a byte length of 3 bits.
  • the technical solution of the embodiment of the present disclosure is essentially or the part that contributes to the prior art can be embodied in the form of a software product, which is stored in a storage medium (such as ROM/RAM, a disk, or an optical disk), and includes a number of instructions for a terminal device (which can be a mobile phone, a computer, a server, or a network device, etc.) to execute the methods described in each embodiment of the embodiment of the present disclosure.
  • a storage medium such as ROM/RAM, a disk, or an optical disk
  • a deterministic resource scheduling device is also provided, which is used to implement the above-mentioned embodiments and preferred implementation modes, and the descriptions that have been made will not be repeated.
  • the term "module” can implement a combination of software and/or hardware of a predetermined function.
  • the devices described in the following embodiments are preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceivable.
  • Figure 3 is a structural block diagram of a deterministic resource scheduling device according to an embodiment of the present disclosure.
  • the deterministic resource scheduling device 30 includes: a resource classification module 310, which is configured to divide deterministic delay resource classes according to a deterministic delay constraint strategy; a flooding module 320, which is configured to flood deterministic delay constraint information and build a deterministic resource pool based on deterministic resource classes; a resource scheduling module 330, which is configured to build a scheduling path for deterministic delay resources according to the deterministic resource pool and allocate resources.
  • Figure 4 is a structural block diagram of a resource classification module according to an embodiment of the present disclosure.
  • the resource classification module 310 includes: a first-level classification unit 410, which is configured to divide the first-level categories of deterministic delay resource classes according to deterministic delay constraint strategies, wherein the first-level categories include at least one of the following: deterministic jitter class DJT; deterministic low delay jitter class DLJT; deterministic low delay class DLT; bounded delay class BLT; a second-level classification unit 420, which is configured to configure one or more deterministic delay constraint strategies for each first-level category to divide each first-level category into multiple second-level categories.
  • the above modules can be implemented by software or hardware. For the latter, it can be implemented in the following ways, but not limited to: the above modules are all located in the same processor; or the above modules are located in different processors in any combination.
  • the embodiments of the present disclosure further provide a computer-readable storage medium, in which a computer program is stored, wherein the computer program is configured to execute the steps of any one of the above method embodiments when running.
  • the computer-readable storage medium may include, but is not limited to, various media that can store computer programs, such as a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk.
  • ROM read-only memory
  • RAM random access memory
  • mobile hard disk a magnetic disk or an optical disk.
  • An embodiment of the present disclosure further provides 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 execute the steps in any one of the above method embodiments.
  • the electronic device may further include a transmission device and an input/output device, wherein the transmission device is connected to the processor, and the input/output device is connected to the processor.
  • modules or steps of the above-mentioned embodiments of the present disclosure can be implemented by a general-purpose computing device, they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices, they can be implemented by program codes executable by the computing device, so that they can be stored in a storage device and executed by the computing device, and in some cases, the steps shown or described can be executed in a different order than that shown here.
  • the steps can be implemented by manufacturing the integrated circuit modules or making the integrated circuit modules into a single integrated circuit module.
  • the embodiments of the present disclosure are not limited to any specific combination of hardware and software.
  • the class-based deterministic resource management and scheduling method proposed in the embodiment of the present disclosure through the deterministic delay constraint strategy, divides the deterministic delay resource classes, publicizes and announces the deterministic delay resources of each class, builds a class-based deterministic resource pool, establishes a path based on the deterministic class and allocates resources, realizes class-based deterministic resource management and scheduling, and meets the differentiated deterministic business classification and grading requirements.
  • FIG5 is a flow chart of deterministic resource scheduling according to an embodiment of the present disclosure. As shown in FIG5 , the flow includes the following steps:
  • Step S502 dividing deterministic delay resource classes based on the deterministic delay constraint strategy
  • the extended DLC sub-TLV is used to carry the deterministic delay constraint strategy, and the extended deterministic class type (DT) object is used to indicate the traffic class based on the deterministic delay constraint conditions and divide the deterministic delay resources.
  • DT extended deterministic class type
  • Deterministic delay resources include bandwidth, delay, and delay variation (i.e., jitter).
  • Deterministic delay constraint strategies are used to divide deterministic delay resources. This strategy can be implemented in a variety of ways, including but not limited to end-to-end jitter strategy, node delay strategy, packet loss strategy, etc.
  • the network can be divided into one or more major categories based on different deterministic delay constraint strategies, and each major category can be further divided into one or more minor categories.
  • the specific extensions are as follows:
  • FIG6 is a schematic diagram of the IGP protocol extension principle according to an embodiment of the disclosed scenario.
  • the extended IGP protocol carries (deterministic delay constraint data type) DLC sub-TLV to indicate the deterministic delay constraint strategy.
  • the extended IGP protocol may include Open Shortest Path First (OSPF) or Intermediate System to Intermediate System (IS-IS).
  • OSPF Open Shortest Path First
  • IS-IS Intermediate System to Intermediate System
  • the DLC sub-TLV may be carried in the Node Attribute TLV
  • the DLC sub-TLV may be carried in the IS-IS Router CAPABILITY TLV.
  • DLC Model Id 8 bits, is used to indicate different deterministic delay constraint models, such as a deterministic resource scheduling model based on time priority, etc.
  • Deterministic network technology bandwidth 32 bits, indicating that the data link layer controls the deterministic network bandwidth of the DLC, that is, the node export bandwidth or link bandwidth.
  • the above sub-TLV may carry one or more sub-sub-TLVs.
  • This scenario embodiment proposes two sub-sub-TLV formats, which are used to carry bandwidth and deterministic delay or jitter strategy, etc., respectively.
  • the formats are as follows.
  • FIG7 is a schematic diagram of the principle of the deterministic delay constraint sub-sub-TLV according to the embodiment of the disclosed scenario.
  • Number 8 bits, used to indicate the number of the sub-sub-TLV.
  • Maximum DetNet Delay 32 bits, indicating the maximum deterministic delay upper limit of the data link layer control DLC, that is, the maximum node delay.
  • Minimum DetNet Delay 32 bits, indicating the minimum deterministic delay lower limit of the DLC, that is, the minimum node delay.
  • FIG8 is a schematic diagram of the principle of the deterministic jitter constraint sub-sub-TLV according to the embodiment of the disclosed scenario.
  • Number 8 bits, used to indicate the number of the sub-sub-TLV.
  • Maximum DetNet Jitter 32 bits, indicating the maximum deterministic jitter upper limit of the DLC, that is, the end-to-end maximum jitter.
  • Minimum DetNet Jitter 32 bits, indicating the minimum deterministic jitter lower limit of the DLC, that is, the end-to-end minimum jitter.
  • Extended DT indicates the cross-node traffic class based on deterministic delay constraints, which is used for deterministic delay resource allocation, constraint-based routing and admission control.
  • deterministic delay constraints which is used for deterministic delay resource allocation, constraint-based routing and admission control.
  • DT types which are as follows:
  • DJT Used to indicate the low jitter guarantee class.
  • DLJT Used to indicate the low latency and low jitter guarantee class.
  • DLT used to indicate the low latency guarantee class.
  • BLT used to indicate the bounded delay upper limit class.
  • Each DT class can be further divided into multiple subclasses, with a maximum number of N subclasses, which can be configured, such as DJT-O, DJT-1, DJT-d, etc., where d ⁇ N.
  • Step S504 flood and announce each category of deterministic delay resources to build a class-based deterministic resource pool.
  • IGP ISIS or OSPF protocol
  • the class-based deterministic resource information can also be reported to the controller through the BGP-LS protocol, and the DLC sub-TLV can also be carried as a TLV in the Node Attribute TLV of the BGP-LS protocol.
  • Step S506 Establish a path based on the deterministic class and allocate resources.
  • a hybrid scenario may utilize PCE to calculate a path based on a deterministic class
  • a distributed scenario may utilize RSVP signaling protocol to establish a logical signal processor LSP based on a deterministic class
  • a centralized scenario may establish a LSP based on a deterministic class through a controller.
  • FIG. 9 is a schematic diagram of the principle of the determination type object according to the embodiment of the scenario of the present disclosure.
  • DT 3 bits, used to indicate the deterministic class, of which four types have been defined, BLT-1, DLT-2, DJT-3, and DLJT-4.
  • d 3 bits, used to indicate the deterministic subclass, the range of d is ⁇ 0 ⁇ N-1>, and the maximum number of subclasses N can be configured.
  • the controller uses a centralized approach to perform deterministic resource scheduling control.
  • Figure 10 is a control schematic diagram of deterministic network technology according to an embodiment of the disclosed scenario.
  • devices within the DetNet domain communicate via the IGP protocol
  • the controller interacts with the DetNet network via the netconf/yang protocol
  • nodes within the DetNet domain communicate via the IGP protocol to communicate node information, build resource TEDs, and centrally establish LSPs through the controller.
  • the deterministic resource scheduling in this scenario embodiment includes the following steps:
  • deterministic delay resource classes are divided.
  • the extended DLCsub-TLV is used to carry the deterministic delay constraint policy
  • the extended DT is used to indicate the traffic class based on the deterministic delay constraint condition
  • the deterministic delay resources are divided.
  • the deterministic resource DT is divided into the deterministic jitter DJT class, which is further divided into four subclasses as follows:
  • DJT-1DJC is 10G, 0us ⁇ 10us
  • DJT-2DJC 10G, 10us ⁇ 20us
  • DJT-3DJC 10G, 20us ⁇ 30us
  • DJT-4DJC 10G, 30us ⁇ 50us
  • the controller builds deterministic class-based paths and allocates resources through centralized protocols such as netconf/yang, for example, establishing LSPs of the DJT-1 subclass.
  • the controller uses a distributed approach to perform deterministic resource scheduling.
  • FIG11 is a control schematic diagram of a deterministic network technology according to an embodiment of the disclosed scenario.
  • devices within the DetNet domain communicate via the IGP protocol.
  • nodes within the DetNet domain communicate via the IGP protocol to spread node information, construct resource TEDs, calculate paths via node distribution, and establish LSPs via RSVP signaling.
  • the deterministic resource scheduling in this scenario embodiment includes the following steps:
  • deterministic delay resource classes are divided.
  • the extended DLC sub-TLV is used to carry the deterministic delay constraint policy
  • the extended DT is used to indicate the traffic class based on the deterministic delay constraint condition
  • the deterministic delay resources are divided.
  • the deterministic resource DT is divided into the deterministic low jitter DJT class and the deterministic low delay class DLT, and then divided into two subclasses, as follows:
  • DJT-1 DJC 1G, 0us ⁇ 10us
  • DJT-2 DJC is 2G, 10us ⁇ 20us
  • DLT-1 DLC is 3G, 0us ⁇ 30us
  • DLT-4 DLC is 4G, 30us ⁇ 50us
  • the node calculates a deterministic class-based path through IGP and establishes an LSP and allocates resources through the RSVP protocol.
  • the BLT-1 subclass LSP is established by carrying the DETERMINISTIC-TYPE object in the RSVP protocol path message and the corresponding resources are allocated.
  • the controller adopts a hybrid approach to perform deterministic resource scheduling.
  • Figure 12 is a control schematic diagram of deterministic network technology according to an embodiment of the disclosed scenario.
  • devices within the DetNet domain use the IGP protocol to spread information.
  • nodes within the DetNet domain use the IGP protocol to spread node information, build resource TEDs, calculate paths through PCE, and establish LSPs in a distributed manner through RSVP signaling.
  • the deterministic resource scheduling in this scenario embodiment includes the following steps:
  • deterministic latency resources are divided.
  • the extended deterministic latency constraint data label (Deterministic Latency Constraint sub-TLV, DLC sub-TLV) is used to carry the deterministic latency constraint strategy, and the extended DT is used to indicate the traffic class based on the deterministic latency constraint condition, and the deterministic latency resources are divided.
  • the deterministic resource DT is divided into the bounded latency BLT class, and then divided into four subclasses, as follows:
  • BLT-1 BLC is 1G, 0us ⁇ 10us
  • BLT-2 BLC is 2G, 0us ⁇ 20us
  • BLT-3 BLC is 3G, 0us ⁇ 30us
  • BLT-4 BLC is 4G, 0us ⁇ 50us
  • the node calculates the deterministic class-based path through PCE and establishes LSP and allocates resources through RSVP protocol.
  • the deterministic class path calculation information interaction between devices and controllers such as Processing and Control Elements (PCE) is realized, the path of BLT-1 subclass is calculated, and the LSP of BLT-1 subclass is established by carrying DETERMINISTIC-TYPE object in the PATH message of RSVP protocol, and the corresponding resources are allocated.
  • PCE Processing and Control Elements
  • the deterministic resource scheduling method and device divides deterministic delay resource classes based on the deterministic delay constraint strategy, floods and announces the deterministic delay resources of each class, builds a class-based deterministic resource pool, establishes a path based on the deterministic class and allocates resources, realizes class-based deterministic resource management and scheduling, and meets the differentiated deterministic service classification and grading requirements.
  • Deterministic delay resource classes are first divided based on the deterministic delay constraint strategy.
  • the extended DLC sub-TLV is used to carry the deterministic delay constraint strategy, and the extended DT is used to indicate the traffic class based on the deterministic delay constraint condition, and the deterministic delay resources are divided; then the deterministic delay resources of each class are flooded and announced to build a class-based deterministic resource pool. Finally, a path based on the deterministic class is constructed and resources are allocated.
  • the DETERMINISTIC-TYPE object is extended to carry the DT class to identify the deterministic class of the LSP.

Landscapes

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

Abstract

一种确定性资源调度方法及装置，通过根据确定性时延约束策略，划分确定性时延资源类；对确定性时延约束信息进行洪泛，构建基于确定性资源类的确定性资源池；根据确定性资源池构建确定性时延资源的调度路径，并分配资源。

Description

确定性资源调度方法及装置
相关申请的交叉引用
本公开基于2022年11月14日提交的发明名称为“确定性资源调度方法及装置”的中国专利申请CN202211431156.6，并且要求该专利申请的优先权，通过引用将其所公开的内容全部并入本公开。
技术领域
本公开实施例涉及通信领域，具体而言，涉及一种确定性资源调度方法及装置。
背景技术
确定性网络是指在网络中可提供确定性业务服务级别协议(Service-Level Agreement，SLA)保障的转发能力，当前阶段的主要目标是支持确定性低丢包率、确定性转发时延边界和确定性抖动上限。为了满足确定性服务等的业务需求，为了在L3层实现确定性技术，IETF标准组织提出确定性网络技术(Deterministic Networking，DetNet)，其中RFC8655定义DetNet相关技术架构，为二层桥和三层路由网络提供确定性服务，DetNet服务质量(Quality of Service，QoS)要求包括确定性时延上限，低丢包率，降低抖动和高可靠性等。确定性网络采用资源预留、显式路由、业务保护来提供确定性QoS。
但大规模组网中，Detnet QoS基于流或基于聚合流的QoS保障无法满足扩展性需求，同时，当前行业多用户场景的确定性业务的承载需求是多维的，且不同维度的确定性质量指标存在不同的级别，导致确定性网络需要满足差异化的DetNet QoS需求。所以基于上述两个原因，需要对确定性业务进行分类，对网络中确定性QoS进行分级，明确不同等级的SLA指标，那相应的，确定性网络需要按照业务的确定性服务等级保障不同业务的确定性转发。
在满足差异化的确定性业务需求的同时，IP网络还需要考虑网络资源利用率。为了有效利用网络资源，提高网络性能，需要构建差异化的确定性资源管理及调度机制。当前标准及现有技术都没有考虑基于类的确定性资源调度与管理，更未考虑基于类的确定性资源的协议扩展，无法满足差异化的业务承载需求。
发明内容
本公开实施例提供了一种确定性资源调度方法及装置，以至少解决相关技术中无法进行合理的确定性资源调度，不能满足多种类型的确定性业务需求的问题。
根据本公开的一个实施例，提供了一种确定性资源调度方法，包括：根据确定性时延约束策略，划分确定性时延资源类；对所述确定性时延约束信息进行洪泛，构建基于所述确定性资源类的确定性资源池；根据所述确定性资源池构建所述确定性时延资源的调度路径，并分配资源。
根据本公开的另一个实施例，提供了一种确定性资源调度装置，包括：资源分类模块，设置为根据确定性时延约束策略，划分确定性时延资源类；洪泛模块，设置为对所述确定性时延约束信息进行洪泛，构建基于所述确定性资源类的确定性资源池；资源调度模块，设置 为根据所述确定性资源池构建所述确定性时延资源的调度路径，并分配资源。
根据本公开的又一个实施例，还提供了一种计算机可读存储介质，所述计算机可读存储介质中存储有计算机程序，其中，所述计算机程序被设置为运行时执行上述任一项方法实施例中的步骤。
根据本公开的又一个实施例，还提供了一种电子装置，包括存储器和处理器，所述存储器中存储有计算机程序，所述处理器被设置为运行所述计算机程序以执行上述任一项方法实施例中的步骤。
附图说明
图1是本公开实施例的一种确定性资源调度方法的计算机终端的硬件结构框图；
图2是根据本公开实施例的确定性资源调度的流程图；
图3是根据本公开实施例的确定性资源调度装置的结构框图；
图4是根据本公开实施例的资源分类模块的结构框图；
图5是根据本公开场景实施例的确定性资源调度的流程图；
图6是根据本公开场景实施例的IGP协议扩展原理示意图；
图7是根据本公开场景实施例的确定性时延约束sub-sub-TLV的原理示意图；
图8是根据本公开场景实施例的确定性抖动约束sub-sub-TLV的原理示意图；
图9是根据本公开场景实施例的确定类型对象的原理示意图；
图10是根据本公开场景实施例的确定性网络技术控制原理图；
图11是根据本公开场景实施例的确定性网络技术控制原理图；
图12是根据本公开场景实施例的确定性网络技术控制原理图。
具体实施方式
下文中将参考附图并结合实施例来详细说明本公开实施例。
需要说明的是，本公开实施例的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
本申请实施例中所提供的方法实施例可以在移动终端、计算机终端或者类似的运算装置中执行。以运行在计算机终端上为例，图1是本公开实施例的一种确定性资源调度方法的计算机终端的硬件结构框图。如图1所示，计算机终端可以包括一个或多个(图1中仅示出一个)处理器102(处理器102可以包括但不限于微处理器MCU或可编程逻辑器件FPGA等的处理装置)和用于存储数据的存储器104，其中，上述计算机终端还可以包括用于通信功能的传输设备106以及输入输出设备108。本领域普通技术人员可以理解，图1所示的结构仅为示意，其并不对上述计算机终端的结构造成限定。例如，计算机终端还可包括比图1中所示更多或者更少的组件，或者具有与图1所示不同的配置。
存储器104可用于存储计算机程序，例如，应用软件的软件程序以及模块，如本公开实施例中的确定性资源调度方法对应的计算机程序，处理器102通过运行存储在存储器104内的计算机程序，从而执行各种功能应用以及数据处理，即实现上述的方法。存储器104可包括高速随机存储器，还可包括非易失性存储器，如一个或者多个磁性存储装置、闪存、或者其他非易失性固态存储器。在一些实例中，存储器104可进一步包括相对于处理器102远程设置的存储器，这些远程存储器可以通过网络连接至移动终端。上述网络的实例包括但不限 于互联网、企业内部网、局域网、移动通信网及其组合。
传输设备106用于经由一个网络接收或者发送数据。上述的网络具体实例可包括计算机终端的通信供应商提供的无线网络。在一个实例中，传输设备106包括一个网络适配器(Network Interface Controller，NIC)，其可通过基站与其他网络设备相连从而可与互联网进行通讯。在一个实例中，传输设备106可以为射频(Radio Frequency，RF)模块，其用于通过无线方式与互联网进行通讯。
为了有效利用网络资源，提高网络性能，需要构建差异化的确定性资源管理及调度机制。包括，准入控制和协商：即根据网络中资源的使用情况，允许用户进入网络进行信息传输并协商其QoS。资源预约：为了给用户提供满意的QoS，必须对端系统、路由器以及传输带宽等相应的资源进行预约，以确保这些资源不被其他应用所强用。资源调度与管理：对资源进行预约之后，是否能得到这些资源，还依赖于相应的资源调度与管理系统。配置了QoS的网络环境，增加了网络性能的可预知性，并能够有效地分配网络带宽，更加合理地利用网络资源。
目前标准中已存在的资源调度和管理的方法中，RFC8655提出的IETF DetNet技术只考虑了带宽资源的预留，但仅预留带宽无法保证确定性时延和抖动，且未考虑多种业务及多种类型的确定性资源保障。RFC4214提出的多协议标签交换区分服务感知(Multiprotocol Label Switching Differentiated Services，MPLS DiffServ-Aware)在原来多协议标签交换流量工程(Traffic Engineering for Multiprotocol Label Switching，MPLS-TE)的基础上，增加了基于类别的资源管理，通过内部网关协议(Internal Gateway Protocol，IGP)对每个类别的资源使用情况进行收集、分别建立流量工程数据库(Traffic Engineering Database，TED)，通过信令协议携带类别建立标签交换路径(Label Switching Path，LSP)。差异化服务流量工程(Differentiated Services Traffic Engineering，DS-TE)充分利用了DiffServ的可扩展性以及MPLS的显式路由能力，是解决骨干网QoS的有效技术，网络资源可根据用户的需求得到最优的利用。但目前DS-TE是通过IGP扩展基于带宽约束条件的跨链路的流量类(Class-Type)，调度的是带宽资源，满足的是Diffserv各类业务需求，但仅对带宽进行分类资源调度，未考虑保证确定性的时延抖动等资源的管理和调度，无法满足多种类型的确定性业务需求。当前标准及现有技术都没有考虑基于类的确定性资源调度与管理，更未考虑基于类的确定性资源的协议扩展，无法满足差异化的业务承载需求。
在本实施例中提供了一种运行于上述计算机终端或网络架构的确定性资源调度方法，图2是根据本公开实施例的确定性资源调度的流程图，如图2所示，该流程包括如下步骤：
步骤S202，根据确定性时延约束策略，划分确定性时延资源类；
步骤S204，对确定性时延约束信息进行洪泛，构建基于确定性资源类的确定性资源池；
步骤S206，根据确定性资源池构建确定性时延资源的调度路径，并分配资源。
通过上述步骤，通过根据确定性时延约束策略，划分确定性时延资源类；对确定性时延约束信息进行洪泛，构建基于确定性资源类的确定性资源池；根据确定性资源池构建所确定性时延资源的调度路径，并分配资源。解决了相关技术中无法进行合理的确定性资源调度，不能满足多种类型的确定性业务需求的问题，达到了对确定性资源进行合理调度，满足不同类型的确定性业务需求的效果。
其中，上述步骤的执行主体可以为基站、终端等，但不限于此。
在一个示例性实施例中，确定性时延约束策略至少包括以下之一：端到端抖动策略；节 点时延策略；丢包策略。
在一个示例性实施例中，根据确定性时延约束策略，划分确定性时延资源类，包括：根据确定性时延约束策略，划分确定性时延资源类的第一级类别，其中，第一级类别至少包括以下之一：确定性抖动类(Deterministic Jitter class-Type，DJT)；确定性低时延抖动类(Deterministic Latency and Jitter class-Type，DLJT)；确定性低时延类(Deterministic Latency class-Type，DLT)；有界性时延类(Bounded Latency class-Type，BLT)；为每个第一级类别配置一个或者多个确定性时延约束策略，以对每个第一级类别划分出多个第二级类别。
在一个示例性实施例中，对确定性时延约束信息进行洪泛，构建基于确定性资源类的的确定性资源池，包括：利用内部网关协议IGP对每类确定性时延资源进行洪泛，并收集每类确定性时延资源的使用情况，以构建确定性资源池。
在一个示例性实施例中，利用IGP协议对每类确定性时延资源进行洪泛，包括：扩展确定性时延约束信息的IGP协议，在IGP协议中携带一个或者多个用于指示确定性时延约束策略的确定性时延约束(Deterministic Latency Constraint，DLC)sub-TLV，其中，DLC sub-TLV中的携带信息至少包括以下之一：字节长度为8比特的确定性时延约束模型编号；字节长度为32比特的确定性网络带宽(DetNet Bandwidth，DetNet BW)。
在一个示例性实施例中，确定性时延约束(Deterministic Latency Constraint，DLC)的类型长度值标签(Type Length Value sub，sub-TLV)中携带一个或者多个类型长度值子标签sub-sub-TLV，其中，sub-sub-TLV包括：确定性时延约束，(Deterministic Delay Constraint，DDC)sub-sub-TLV，其中，DDC sub-sub-TLV中的携带信息至少包括以下之一：字节长度为8比特的sub-sub-TLV编号；字节长度为32比特的节点最大时延；字节长度为32比特的节点最小时延。
在一个示例性实施例中，确定性时延约束DLC sub-TLV中携带一个或者多个sub-sub-TLV，其中，sub-sub-TLV包括：确定性抖动约束(Deterministic Jitter Constraint，DJC)sub-sub-TLV，其中，DJC sub-sub-TLV中的携带信息至少包括以下之一：字节长度为8比特的sub-sub-TL编号；字节长度为32比特的端到端最大抖动；字节长度为32比特的端到端最小抖动。
在一个示例性实施例中，对确定性时延约束信息进行洪泛，构建基于确定性资源类的确定性资源池，包括：在有控制器的情况下，通过扩展边界网关协议链路状态(Border Gateway Protocol Link State，BGP-LS)，在BGP-LS协议的节点属性类型长度值(Type Length Value，TLV)中携带确定性时延约束DLC sub-TLV，以通过BGP-LS协议上报每类确定性资源类的信息到控制器，构建确定性资源池。
在一个示例性实施例中，根据确定性资源池构建确定性时延资源的调度路径，并分配资源，包括：扩展路径计算单元协议(Path Computation Element Communication Protocol，PCEP)或者资源预留协议(Resouroe Reservation Protocol，RSVP)，在PCEP协议或者RSVP协议携带确定类型对象表征确定性类标识，根据确定类型对象构建确定性时延资源的调度路径，并分配资源。
在一个示例性实施例中，确定类型对象的携带信息至少包括以下之一：字节长度为3比特的确定性类型DT；字节长度为3比特的确定性子类型。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本公开实施例的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光盘)中，包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本公开实施例的各个实施例所述的方法。
在本实施例中还提供了一种确定性资源调度装置，该装置用于实现上述实施例及优选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。
图3是根据本公开实施例的确定性资源调度装置的结构框图，如图3所示，该确定性资源调度装置30包括：资源分类模块310，设置为根据确定性时延约束策略，划分确定性时延资源类；洪泛模块320，设置为对确定性时延约束信息进行洪泛，构建基于确定性资源类的确定性资源池；资源调度模块330，设置为根据确定性资源池构建确定性时延资源的调度路径，并分配资源。
在一个示例性实施例中，图4是根据本公开实施例的资源分类模块的结构框图，如图4所示，资源分类模块310包括：第一级分类单元410，设置为根据确定性时延约束策略，划分确定性时延资源类的第一级类别，其中，第一级类别至少包括以下之一：确定性抖动类DJT；确定性低时延抖动类DLJT；确定性低时延类DLT；有界性时延类BLT；第二级分类单元420，设置为为每个第一级类别配置一个或者多个确定性时延约束策略，以对每个第一级类别划分出多个第二级类别。
需要说明的是，上述各个模块是可以通过软件或硬件来实现的，对于后者，可以通过以下方式实现，但不限于此：上述模块均位于同一处理器中；或者，上述各个模块以任意组合的形式分别位于不同的处理器中。
本公开实施例还提供了一种计算机可读存储介质，该计算机可读存储介质中存储有计算机程序，其中，该计算机程序被设置为运行时执行上述任一项方法实施例中的步骤。
在一个示例性实施例中，上述计算机可读存储介质可以包括但不限于：U盘、只读存储器(Read-Only Memory，ROM)、随机存取存储器(Random Access Memory，RAM)、移动硬盘、磁碟或者光盘等各种可以存储计算机程序的介质。
本公开实施例还提供了一种电子装置，包括存储器和处理器，该存储器中存储有计算机程序，该处理器被设置为运行计算机程序以执行上述任一项方法实施例中的步骤。
在一个示例性实施例中，上述电子装置还可以包括传输设备以及输入输出设备，其中，该传输设备和上述处理器连接，该输入输出设备和上述处理器连接。
本实施例中的具体示例可以参考上述实施例及示例性实施方式中所描述的示例，本实施例在此不再赘述。
显然，本领域的技术人员应该明白，上述的本公开实施例的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步 骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本公开实施例不限制于任何特定的硬件和软件结合。
为了使得本领域的技术人员更好地理解本公开实施例的技术方案，下卖弄结合具体的场景实施例进行阐述。
场景实施例一
本公开实施例提出的基于类的确定性资源管理和调度的方法，通过出确定性时延约束策略，划分确定性时延资源类，对每个类别的确定性时延资源进行洪范及通告，构建基于类的确定性资源池，建立基于确定性类的路径并分配资源，实现基于类的确定性资源管理和调度，满足差异化的确定性业务分类分级需求。
图5是根据本公开场景实施例的确定性资源调度的流程图，如图5所示，该流程包括如下步骤：
步骤S502，基于确定性时延约束策略，划分确定性时延资源类；
扩展DLC sub-TLV用于携带确定性时延约束策略，扩展确定类型对象(Deterministic Class Type，DT)用于指示基于确定性时延约束条件的流量类，划分确定性时延资源。
确定性时延资源包括带宽，时延及时延变化(即抖动)等资源。确定性时延约束策略，用于划分确定性时延资源，该策略可以有多种方式，包括但不限于端到端抖动策略，节点时延策略，丢包策略等。网络可根据不同的确定性时延约束策略划分出一到多个大类，每个大类下可继续划分出一到多个小类。具体扩展如下：
(1)图6是根据本公开场景实施例的IGP协议扩展原理示意图，如图6所示，扩展IGP协议携带(确定性延迟约束数据类型)DLC sub-TLV用于指示确定性时延约束策略。其中，扩展IGP协议可以包括开放最短路径优先协议(Open Shortest Path First，OSPF)或者中间系统路由交换协议(Intermediate System to Intermediate System，IS-IS)，其中，在OSPF协议中，可以在Node Attribute TLV中携带DLC sub-TLV，在ISIS协议中，可以在IS-IS Router CAPABILITY TLV中携带DLC sub-TLV。
如图6所示，其中，DLC Model Id，8比特，用于指示不同的确定性时延约束的模型，如基于时间优先的确定性资源调度模型等。确定性网络技术带宽：32比特，表明该数据链路层控制DLC的确定性网络带宽，即节点出口带宽或链路带宽。
在上述sub-TLV可以携带一个或者多个sub-sub-TLV，本场景实施例提出两种sub-sub-TLV格式，用于分别携带带宽及确定性时延或抖动策略等，格式如下。
图7是根据本公开场景实施例的确定性时延约束sub-sub-TLV的原理示意图，如图7所示，Number：8比特，用于指示sub-sub-TLV的编号。Maximum DetNet Delay：32比特，表明该数据链路层控制DLC的最大确定性时延上限，即节点最大时延。Minimum DetNet Delay：32比特，表明该DLC的最小确定性时延下限，即节点最小时延。
图8是根据本公开场景实施例的确定性抖动约束sub-sub-TLV的原理示意图，如图8所示，Number：8比特，用于指示sub-sub-TLV的编号。Maximum DetNet Jitter：32比特，表明该DLC的最大确定性抖动上限，即端到端最大抖动。Minimum DetNet Jitter：32比特，表明该DLC的最小确定性抖动下限，即端到端最小抖动。
(2)扩展DT(Deterministic Class Type)指示基于确定性时延约束条件的跨节点的流量类，用于确定性时延资源分配，基于约束条件的路由及准入控制。本公开实施例提出4 种DT类，分别如下：
DJT：用于指示低抖动保证类。
DLJT：用于指示低时延低抖动保证类。
DLT：用于指示低时延保证类。
BLT：用于指示有界时延上限类。
每一种DT类可以进一步划分为多个子类，最大子类数目为N，N可以配置。例如DJT-O，DJT-1，DJT-d等，d＜N。
步骤S504，对每个类别的确定性时延资源进行洪范及通告，构建基于类的确定性资源池。
在一示例性实施例中，利用IGP(ISIS或OSPF协议)洪范及收集各种DT类资源的使用情况，构建基于类的确定性资源TED。在集中式场景中，也可以通过BGP-LS协议上报基于类的确定性资源信息到控制器，DLC sub-TLV也可以作为TLV携带于BGP-LS协议的Node Attribute TLV中。
步骤S506，建立基于确定性类的路径并分配资源。
在一示例性实施例中，混合式场景可利用PCE计算基于确定性类的路径，分布式场景可利用RSVP信令协议建立基于确定性类的逻辑信号处理程式LSP，集中式场景可通过控制器建立基于确定性类的LSP。
通过扩展确定类型对象(Deterministic-Type)，用于携带DT类标识LSP的确定性类，该对象可以携带于PCEP消息中用于指示PCC向PCE请求的确定性类所属路径，也可以携带于RSVP的path消息中用于建立基于确定性类的LSP。图9是根据本公开场景实施例的确定类型对象的原理示意图，如图9所示，DT：3比特，用于指示确定性类，其中已定义四种类型，BLT-1，DLT-2，DJT-3，DLJT-4。d：3比特，用于指示确定性子类，d的范围是<0～N-1>，最大子类数目N可配。
场景实施例二
在本场景实施例中控制器采用集中式方式进行确定性资源调度控制。
图10是根据本公开场景实施例的确定性网络技术控制原理图，如图10所示，DetNet域内设备通过IGP协议洪范，控制器通过netconf/yang协议与DetNet网络进行交互，DetNet域内节点通过IGP协议洪范节点信息，构建资源TED，通过控制器集中式建立LSP。
根据图10所示的确定性网络技术控制原理，本场景实施例中的确定性资源调度包括如下步骤：
(1)基于确定性时延约束策略，如端到端抖动策略，划分确定性时延资源类。通过IGP协议，扩展DLCsub-TLV用于携带确定性时延约束策略，扩展DT用于指示基于确定性时延约束条件的流量类，划分确定性时延资源，例如将确定性资源DT，划分为确定性抖动DJT类，再划分为4个子类，如下：
DJT-1DJC为10G，0us～10us
DJT-2DJC为10G，10us～20us
DJT-3DJC为10G，20us～30us
DJT-4DJC为10G，30us～50us
(2)对每个类别的确定性时延资源进行洪范和通告，构建基于类的确定性TED。通过IGP协议在DetNet域内洪范确定性时延资源类，通过BGP-LS携带DLC sub-TLV上报确定性时延 资源类信息到控制器。
(3)控制器通过netconf/yang等集中式协议构建基于确定性类的路径并分配资源，例如建立DJT-1子类的LSP。
场景实施例三
在本场景实施例中控制器采用分布式方式进行确定性资源调度。
图11是根据本公开场景实施例的确定性网络技术控制原理图，如图11所示，DetNet域内设备通过IGP协议洪范，全分布式场景中，DetNet域内节点通过IGP协议洪范节点信息，构建资源TED，通过节点分布式计算路径，通过RSVP信令分布式建立LSP。
根据图11所示的确定性网络技术控制原理，本场景实施例中的确定性资源调度包括如下步骤：
(1)基于确定性时延约策略，如端到端抖动策略，划分确定性时延资源类。通过IGP协议，扩展DLC sub-TLV用于携带确定性时延约束策略，扩展DT用于指示基于确定性时延约束条件的流量类，划分确定性时延资源，例如将确定性资源DT，划分为确定性低抖动DJT类和确定性低时延类DLT，再分别划分为2个子类，如下：
DJT-1 DJC为1G，0us～10us
DJT-2 DJC为2G，10us～20us
DLT-1 DLC为3G，0us～30us
DLT-4 DLC为4G，30us～50us
(2)对每个类别的确定性时延资源进行洪范和通告，构建基于类的确定性TED。通过I GP协议在DetNet域内洪范确定性时延资源类。
(3)节点通过IGP计算基于确定性类的路径并通过RSVP协议建立LSP并分配资源，通过在RSVP协议的路径消息中携带DETERMINISTIC-TYPE对象建立BLT-1子类的LSP，并分配相应资源。
场景实施例四
在本场景实施例中控制器采用混合式方式进行确定性资源调度。
图12是根据本公开场景实施例的确定性网络技术控制原理图，如图12所示，DetNet域内设备通过IGP协议洪范，混合式场景中，DetNet域内节点通过IGP协议洪范节点信息，构建资源TED，通过PCE计算路径，通过RSVP信令分布式建立LSP。
根据图12所示的确定性网络技术控制原理，本场景实施例中的确定性资源调度包括如下步骤：
(1)基于确定性时延约束策略，如节点时延策略，划分确定性时延资源。通过IGP协议，扩展确定性时延约束数据标签(Deterministic Latency Constraint sub-TLV，DLC sub-TLV)用于携带确定性时延约束策略，扩展DT用于指示基于确定性时延约束条件的流量类，划分确定性时延资源，例如将确定性资源DT，划分为有界时延BLT类，再划分为4个子类，如下：
BLT-1 BLC为1G，0us～10us
BLT-2 BLC为2G，0us～20us
BLT-3 BLC为3G，0us～30us
BLT-4 BLC为4G，0us～50us
(2)对每个类别的确定性时延资源进行洪范和通告，构建基于类的确定性TED。通过IGP 协议在DetNet域内及PCE洪范确定性时延资源类。
(3)节点通过PCE计算基于确定性类的路径并通过RSVP协议建立LSP并分配资源，通过扩展PCEP协议的DETERMINISTIC-TYPE对象，实现设备与控制器比如处理与控制元件(Processing and Control Elements，PCE)之间的确定性类的路径计算信息交互，计算BLT-1子类的路径，通过在RSVP协议的PATH消息中携带DETERMINISTIC-TYPE对象建立BLT-1子类的LSP，并分配相应资源。
综上，本公开实施例提供的确定性资源调度方法及装置，基于确定性时延约束策略，划分确定性时延资源类，对每个类别的确定性时延资源进行洪范及通告，构建基于类的确定性资源池，建立基于确定性类的路径并分配资源，实现基于类的确定性资源管理和调度，满足差异化的确定性业务分类分级需求。通过先基于确定性时延约束策略，划分确定性时延资源类。扩展DLC sub-TLV用于携带确定性时延约束策略，扩展DT用于指示基于确定性时延约束条件的流量类，划分确定性时延资源；再对每个类别的确定性时延资源进行洪范和通告，构建基于类的确定性资源池。最后，构建基于确定性类的路径并分配资源。扩展DETERMINISTIC-TYPE对象，用于携带DT类来标识LSP的确定性类。
以上所述仅为本公开实施例的优选实施例而已，并不用于限制本公开实施例，对于本领域的技术人员来说，本公开实施例可以有各种更改和变化。凡在本公开实施例的原则之内，所作的任何修改、等同替换、改进等，均应包含在本公开实施例的保护范围之内。

Claims (14)

  1. 一种确定性资源调度方法，包括：
    根据确定性时延约束策略，划分确定性时延资源类；
    对所述确定性时延约束信息进行洪泛，构建基于所述确定性资源类的确定性资源池；
    根据所述确定性资源池构建所述确定性时延资源的调度路径，并分配资源。
  2. 根据权利要求1所述的方法，其中，所述确定性时延约束策略至少包括以下之一：
    端到端抖动策略；
    节点时延策略；
    丢包策略。
  3. 根据权利要求1所述的方法，其中，所述根据确定性时延约束策略，划分确定性时延资源类，包括：
    根据所述确定性时延约束策略，划分确定性时延资源类的第一级类别，其中，所述第一级类别至少包括以下之一：确定性抖动类DJT；确定性低时延抖动类DLJT；确定性低时延类DLT；有界性时延类BLT；
    为每个所述第一级类别配置一个或者多个所述确定性时延约束策略，以对每个所述第一级类别划分出多个第二级类别。
  4. 根据权利要求1所述的方法，其中，对所述确定性时延约束信息进行洪泛，构建基于所述确定性资源类的的确定性资源池，包括：
    利用内部网关协议IGP对每类所述确定性时延资源进行洪泛，并收集每类所述确定性时延资源的使用情况，以构建所述确定性资源池。
  5. 根据权利要求4所述的方法，其中，所述利用IGP协议对每类所述确定性时延资源进行洪泛，包括：
    扩展所述确定性时延约束信息的IGP协议，在所述IGP协议中携带一个或者多个用于指示所述确定性时延约束策略的确定性时延约束DLC sub-TLV，其中，所述DLC sub-TLV中的携带信息至少包括以下之一：字节长度为8比特的确定性时延约束模型编号；字节长度为32比特的确定性网络带宽。
  6. 根据权利要求5所述的方法，其中，
    所述确定性时延约束DLC sub-TLV中携带一个或者多个sub-sub-TLV，其中，所述sub-sub-TLV包括：确定性时延约束DDC sub-sub-TLV，
    其中，所述DDC sub-sub-TLV中的携带信息至少包括以下之一：字节长度为8比特的sub-sub-TLV编号；字节长度为32比特的节点最大时延；字节长度为32比特的节点最小时延。
  7. 根据权利要求5所述的方法，其中，
    所述确定性时延约束DLC sub-TLV中携带一个或者多个sub-sub-TLV，其中，所述sub-sub-TLV包括：确定性抖动约束DJC sub-sub-TLV，
    其中，所述DJC sub-sub-TLV中的携带信息至少包括以下之一：字节长度为8比特的sub-sub-TL编号；字节长度为32比特的端到端最大抖动；字节长度为32比特的端到端最小抖动。
  8. 根据权利要求1所述的方法，其中，对所述确定性时延约束信息进行洪泛，构建基于所述确定性资源类的确定性资源池，包括：
    在有控制器的情况下，通过扩展边界网关协议链路状态BGP-LS，在所述BGP-LS协议的节点属性TLV中携带确定性时延约束DLC sub-TLV，以通过BGP-LS协议上报每类所述确定性资源类的信息到控制器，构建所述确定性资源池。
  9. 根据权利要求1所述的方法，其中，所述根据所述确定性资源池构建所述确定性时延资源的调度路径，并分配资源，包括：
    扩展路径计算单元协议PCEP或者资源预留协议RSVP，在所述PCEP协议或者RSVP协议携带确定类型对象表征确定性类标识，根据所述确定类型对象构建所述确定性时延资源的调度路径，并分配资源。
  10. 根据权利要求9所述的方法，其中，所述确定类型对象的携带信息至少包括以下之一：字节长度为3比特的确定性类型DT；字节长度为3比特的确定性子类型。
  11. 一种确定性资源调度装置，包括：
    资源分类模块，设置为根据确定性时延约束策略，划分确定性时延资源类；
    洪泛模块，设置为对所述确定性时延约束信息进行洪泛，构建基于所述确定性资源类的确定性资源池；
    资源调度模块，设置为根据所述确定性资源池构建所述确定性时延资源的调度路径，并分配资源。
  12. 根据权利要求11所述的装置，其中，所述资源分类模块，包括：
    第一级分类单元，设置为根据所述确定性时延约束策略，划分确定性时延资源类的第一级类别，其中，所述第一级类别至少包括以下之一：确定性抖动类DJT；确定性低时延抖动类DLJT；确定性低时延类DLT；有界性时延类BLT；
    第二级分类单元，设置为为每个所述第一级类别配置一个或者多个所述确定性时延约束策略，以对每个所述第一级类别划分出多个第二级类别。
  13. 一种计算机可读存储介质，所述计算机可读存储介质中存储有计算机程序，其中，所述计算机程序被处理器执行时实现所述权利要求1至10任一项中所述的方法。
  14. 一种电子装置，包括存储器、处理器以及存储在所述存储器上并可在所述处理器上 运行的计算机程序，所述处理器执行所述计算机程序时实现所述权利要求1至10任一项中所述的方法。
PCT/CN2023/110330 2022-11-14 2023-07-31 确定性资源调度方法及装置 WO2024103842A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202211431156.6A CN118041878A (zh) 2022-11-14 2022-11-14 确定性资源调度方法及装置
CN202211431156.6 2022-11-14

Publications (1)

Publication Number Publication Date
WO2024103842A1 true WO2024103842A1 (zh) 2024-05-23

Family

ID=90982850

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/110330 WO2024103842A1 (zh) 2022-11-14 2023-07-31 确定性资源调度方法及装置

Country Status (2)

Country Link
CN (1) CN118041878A (zh)
WO (1) WO2024103842A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105659531A (zh) * 2013-07-18 2016-06-08 思科技术公司 确定性无线网络的有效网络探测
US20190097884A1 (en) * 2017-09-25 2019-03-28 Cisco Technology, Inc. Deterministic stitching of deterministic segments across distinct deterministic domains
CN113839868A (zh) * 2020-06-24 2021-12-24 中国电信股份有限公司 SRv6策略信息控制方法、系统和控制器
CN114363182A (zh) * 2020-09-29 2022-04-15 中国移动通信有限公司研究院 确定性网络系统及确定性业务的传输方法
CN115150305A (zh) * 2022-06-28 2022-10-04 中国联合网络通信集团有限公司 承载网时延链路确定系统、方法、电子设备及存储介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105659531A (zh) * 2013-07-18 2016-06-08 思科技术公司 确定性无线网络的有效网络探测
US20190097884A1 (en) * 2017-09-25 2019-03-28 Cisco Technology, Inc. Deterministic stitching of deterministic segments across distinct deterministic domains
CN113839868A (zh) * 2020-06-24 2021-12-24 中国电信股份有限公司 SRv6策略信息控制方法、系统和控制器
CN114363182A (zh) * 2020-09-29 2022-04-15 中国移动通信有限公司研究院 确定性网络系统及确定性业务的传输方法
CN115150305A (zh) * 2022-06-28 2022-10-04 中国联合网络通信集团有限公司 承载网时延链路确定系统、方法、电子设备及存储介质

Also Published As

Publication number Publication date
CN118041878A (zh) 2024-05-14

Similar Documents

Publication Publication Date Title
Hong et al. Achieving high utilization with software-driven WAN
US7636781B2 (en) System and method for realizing the resource distribution in the communication network
Awduche et al. Overview and principles of Internet traffic engineering
CN104994033A (zh) 一种资源动态管理的SDN网络QoS保障方法
WO2012065466A1 (zh) 一种包交换网络中聚合链路带宽的分配方法及装置
Tomovic et al. Toward a scalable, robust, and QoS-aware virtual-link provisioning in SDN-based ISP networks
Alnuweiri et al. Performance of new link state advertisement mechanisms in routing protocols with traffic engineering extensions
WO2012068834A1 (zh) 聚合链路的管理方法及系统
WO2024103842A1 (zh) 确定性资源调度方法及装置
WO2023082815A1 (zh) 确定性路由的构建方法、装置和存储介质
Flavius et al. Internet service delivery models: evolution and current issues
Hu et al. Sdn over ip: Enabling internet to provide better qos guarantee
Lin et al. A QoS model of Next Generation Network based on MPLS
Georgoulas et al. An integrated bandwidth allocation and admission control framework for the support of heterogeneous real-time traffic in class-based IP networks
Lima et al. Self-adaptive distributed management of QoS and SLSs in multiservice networks
WO2023065756A1 (zh) 确定性路由的计算方法、装置、存储介质和电子设备
Kowalik et al. ALCFRA–A robust routing algorithm which can tolerate imprecise network state information
WO2023279818A1 (zh) 确定性流的转发方法及装置、存储介质及电子装置
WO2023143369A1 (zh) 确定路由的方法、电子设备、计算机可读存储介质
WO2022237860A1 (zh) 报文处理方法、资源分配方法以及相关设备
Rahaman RSVP AND LDP: PROTOCOLS FOR TRAFFIC ENGINEERING
Kim et al. Constraint-based LSP setup by message reversing of CR-LDP
Huang et al. Nonuniform bandwidth reservation for tunnels in MPLS network using meter tables of OpenFlow
Farrel RFC 9522: Overview and Principles of Internet Traffic Engineering
Elbasheer et al. Video Streaming Adaptive QoS Routing with Resource Reservation (VQoSRR) Model for SDN Networks. Electronics 2022, 11, 1252