CN114039936A - Time-sensitive communication service flow scheduling method and device for virtual power plant - Google Patents
Time-sensitive communication service flow scheduling method and device for virtual power plantDownload PDFInfo
- Publication number
- CN114039936A CN114039936ACN202111234647.7ACN202111234647ACN114039936ACN 114039936 ACN114039936 ACN 114039936ACN 202111234647 ACN202111234647 ACN 202111234647ACN 114039936 ACN114039936 ACN 114039936A
- Authority
- CN
- China
- Prior art keywords
- scheduling
- time
- flow
- timetable
- adjusted
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
- 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/80—Actions related to the user profile or the type of traffic
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J13/00—Circuit arrangements for providing remote indication of network conditions, e.g. an instantaneous record of the open or closed condition of each circuitbreaker in the network; Circuit arrangements for providing remote control of switching means in a power distribution network, e.g. switching in and out of current consumers by using a pulse code signal carried by the network
- H02J13/00004—Circuit arrangements for providing remote indication of network conditions, e.g. an instantaneous record of the open or closed condition of each circuitbreaker in the network; Circuit arrangements for providing remote control of switching means in a power distribution network, e.g. switching in and out of current consumers by using a pulse code signal carried by the network characterised by the power network being locally controlled
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Power Engineering (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Translated fromChinese技术领域technical field
本申请属于电厂通信技术领域，尤其涉及一种基于时间敏感的虚拟电厂通信业务流量调度方法及装置。The present application belongs to the technical field of power plant communication, and in particular, relates to a time-sensitive virtual power plant communication service flow scheduling method and device.
背景技术Background technique
信息通信技术是虚拟电厂系统中关键技术之一，通过信息通信技术，使虚拟电厂作为一个特殊电厂参与电力市场和电网运行的电源协调管理系统，聚合分布式能源(Distributed Energy Resource，简称为DER)，进而参与电力市场和辅助市场运行，为配电网和输电网提供管理和辅助服务。Information and communication technology is one of the key technologies in the virtual power plant system. Through information and communication technology, the virtual power plant can be used as a special power plant to participate in the power supply coordination management system of the power market and power grid operation, and aggregate distributed energy resources (Distributed Energy Resource, referred to as DER). , and then participate in the operation of the power market and auxiliary market, and provide management and auxiliary services for the distribution network and transmission network.
由于虚拟电厂需要能够接收各个分布式灵活资源当前的状态信息，且需要向控制目标发送控制信号，因此需要应用基于互联网的通信技术向系统提供高可靠性和高确定性的无线服务，保证对时间的高度敏感。即，需要保证调度任务在一定的时延内可以完成传输、处理和响应等操作，从而实现调度控制中周期性数据和非周期性数据在同一网络中的传输需求。TSN技术的引入，解决了分布式资源异构接入的时延问题，为时间触发流量提供了确定性的保障措施，保证了调度过程中有界时延的确定性。Since the virtual power plant needs to be able to receive the current status information of each distributed flexible resource, and needs to send control signals to the control target, it is necessary to apply the Internet-based communication technology to provide high reliability and high deterministic wireless services to the system to ensure accurate time highly sensitive. That is, it is necessary to ensure that the scheduling task can complete operations such as transmission, processing and response within a certain delay, so as to meet the transmission requirements of periodic data and aperiodic data in the same network in scheduling control. The introduction of TSN technology solves the delay problem of heterogeneous access of distributed resources, provides deterministic guarantee measures for time-triggered traffic, and ensures the certainty of bounded delay in the scheduling process.
然而，现有的调度速度和开销的优化，没有考虑网络更新过程中的确定性传输。在网络更新的过程中，旧的流帧可能会被转发到错误的目的地，因为这两个时间表的混合使用和新的流帧可能会碰撞旧的流帧，如果它们的出发时间在特定的设备上是相同的，那么无法保证网络传输的一致性。However, existing optimizations for scheduling speed and overhead do not consider deterministic transmission during network updates. During the network update process, old flow frames may be forwarded to the wrong destination because of the mixed use of these two schedules and new flow frames may collide with old flow frames if their departure times are within a particular are the same on different devices, so the consistency of network transmission cannot be guaranteed.
针对如何在流量调度基本的更新机制下，在保证网络更新时不丢失帧的同时不引入额外的更新开销，目前尚未提出有效的解决方案。There is no effective solution for how to ensure that frames are not lost during network update without introducing additional update overhead under the basic update mechanism of traffic scheduling.
发明内容SUMMARY OF THE INVENTION
本申请目的在于提供一种基于时间敏感的虚拟电厂通信业务流量调度方法及装置，可以为网络生成可行的调度计划表，以确保网络更新过程中保证不丢失帧，同时不引入额外的更新时间。The purpose of the present application is to provide a time-sensitive virtual power plant communication service traffic scheduling method and device, which can generate a feasible scheduling schedule for the network to ensure that frames are not lost during the network update process, and additional update time is not introduced.
一方面，提供了一种基于时间敏感的虚拟电厂通信业务流量调度方法，所述方法包括：In one aspect, a time-sensitive virtual power plant communication service flow scheduling method is provided, the method comprising:
初始化目标网络的网络拓扑结构和所述目标网络的流源宿节点信息；Initialize the network topology structure of the target network and the flow source and sink node information of the target network;
根据初始化后的网络拓扑结构和流源宿节点信息，生成第一调度时刻表；generating a first scheduling timetable according to the initialized network topology and flow source and sink node information;
按照流的周期大小升序为第一调度时刻表进行排序，得到第二调度时刻表；Sort the first scheduling timetable in ascending order according to the cycle size of the stream to obtain the second scheduling timetable;
对第二调度时刻表进行调整，直至任意两个流之间不存在冲突；Adjust the second scheduling timetable until there is no conflict between any two streams;
根据调整后的第二调度时刻表，确定每一个流在其数据链路上每个设备的发送时间和在接收节点上的接收时间。According to the adjusted second scheduling schedule, the sending time of each device on its data link and the receiving time on the receiving node of each flow are determined.
在一个实施方式中，在生成第一调度时刻表之后，还包括：In one embodiment, after generating the first scheduling timetable, the method further includes:
向所述目标网络中的设备发送第一调度时刻表，以按照所述第一调度时刻表进行部署；sending a first scheduling schedule to devices in the target network for deployment according to the first scheduling schedule;
在得到调整后的第二调度时刻表之后，还包括：After obtaining the adjusted second scheduling timetable, the method further includes:
向所述目标网络中的设备发送调整后的第二调度时刻表，以按照所述调整后的第二调度时刻表进行部署；sending the adjusted second scheduling timetable to the device in the target network for deployment according to the adjusted second scheduling timetable;
其中，所述第一调度时刻表和调整后的第二调度时刻表同时存放在内存空间，通过版本号对第一调度时刻表和调整后的第二调度时刻表进行区分。Wherein, the first scheduling timetable and the adjusted second scheduling timetable are simultaneously stored in the memory space, and the first scheduling timetable and the adjusted second scheduling timetable are distinguished by the version number.
在一个实施方式中，对第二调度时刻表进行调整，直至任意两个流之间不存在冲突，包括：In one embodiment, the second scheduling schedule is adjusted until there is no conflict between any two streams, including:
按照如下约束规则进行对第二调度时刻表进行调整：每个流的源的发送时间小于其周期、每个流的所有帧都必须在规定的端到端延迟要求内及时到达其目的地、帧在路径的接收方处的发送时间必须大于在该路径的发送方处的发送时间、任意两个流在公共路径上的发送时间没有任何重叠。The second scheduling schedule is adjusted according to the following constraints: the source of each flow has a sending time less than its period, and all frames of each flow must arrive at their destination in time within the specified end-to-end delay requirement, frame The send time at the receiver of the path must be greater than the send time at the sender of the path without any overlap in the send times of any two streams on the common path.
在一个实施方式中，每一个流在其数据链路上每个设备的发送时间和在接收节点上的接收时间表示为：In one embodiment, the transmit time for each device on its data link and the receive time on the receiving node for each flow are expressed as:
其中，
在一个实施方式中，对第二调度时刻表进行调整，直至任意两个流之间不存在冲突，包括：In one embodiment, the second scheduling schedule is adjusted until there is no conflict between any two streams, including:
声明第一变量等于0，表示当前已完成流调度的数量，第一变量的最大值为新流数量；Declare that the first variable is equal to 0, indicating the number of currently completed stream scheduling, and the maximum value of the first variable is the number of new streams;
将第一变量赋值给第二变量，通过第二变量标识当前数据流集合的范围；Assign the first variable to the second variable, and identify the scope of the current data stream set by the second variable;
确定当前数据流集合是否满足预定冲突约束条件，如果不满足，则回溯至上一个新流，并构建满足预定冲突约束条件的调度方案，直至完成所有新流的冲突判断。Determine whether the current set of data streams satisfies the predetermined conflict constraints, if not, back to the previous new stream, and construct a scheduling scheme that satisfies the predetermined conflict constraints, until the conflict judgment of all new streams is completed.
另一方面，提供了一种基于时间敏感的虚拟电厂通信业务流量调度装置，包括：On the other hand, there is provided a time-sensitive virtual power plant communication service flow scheduling device, comprising:
初始化模块，用于初始化目标网络的网络拓扑结构和所述目标网络的流源宿节点信息；an initialization module, used to initialize the network topology structure of the target network and the flow source and sink node information of the target network;
生成模块，用于根据初始化后的网络拓扑结构和流源宿节点信息，生成第一调度时刻表；A generating module, configured to generate a first scheduling timetable according to the initialized network topology and flow source-sink node information;
排序模块，用于按照流的周期大小升序为第一调度时刻表进行排序，得到第二调度时刻表；a sorting module, configured to sort the first scheduling timetable in ascending order according to the period size of the stream to obtain the second scheduling timetable;
调整模块，用于对第二调度时刻表进行调整，直至任意两个流之间不存在冲突；an adjustment module, configured to adjust the second scheduling timetable until there is no conflict between any two streams;
确定模块，用于根据调整后的第二调度时刻表，确定每一个流在其数据链路上每个设备的发送时间和在接收节点上的接收时间。The determining module is configured to determine, according to the adjusted second scheduling timetable, the sending time of each stream on its data link and the receiving time of each device on the receiving node.
在一个实施方式中，上述装置还包括：In one embodiment, the above-mentioned device further comprises:
第一部署模块，用于在生成第一调度时刻表之后，向所述目标网络中的设备发送第一调度时刻表，以按照所述第一调度时刻表进行部署；a first deployment module, configured to send the first scheduling timetable to devices in the target network after generating the first scheduling timetable, so as to deploy according to the first scheduling timetable;
第二部署模块，用于在得到调整后的第二调度时刻表之后，向所述目标网络中的设备发送调整后的第二调度时刻表，以按照所述调整后的第二调度时刻表进行部署；The second deployment module is configured to send the adjusted second scheduling timetable to the device in the target network after obtaining the adjusted second scheduling timetable, so as to carry out the process according to the adjusted second scheduling timetable deploy;
其中，所述第一调度时刻表和调整后的第二调度时刻表同时存放在内存空间，通过版本号对第一调度时刻表和调整后的第二调度时刻表进行区分。Wherein, the first scheduling timetable and the adjusted second scheduling timetable are simultaneously stored in the memory space, and the first scheduling timetable and the adjusted second scheduling timetable are distinguished by the version number.
在一个实施方式中，所述调整模块具体用于按照如下约束规则进行对第二调度时刻表进行调整：每个流的源的发送时间小于其周期、每个流的所有帧都必须在规定的端到端延迟要求内及时到达其目的地、帧在路径的接收方处的发送时间必须大于在该路径的发送方处的发送时间、任意两个流在公共路径上的发送时间没有任何重叠。In one embodiment, the adjustment module is specifically configured to adjust the second scheduling timetable according to the following constraint rules: the sending time of the source of each stream is less than its period, and all frames of each stream must be within the specified timetable. To reach its destination in time within the end-to-end latency requirement, the frame must be sent at the receiver of the path in a greater time than at the sender of the path, and the sending times of any two streams on a common path must not overlap in any way.
又一方面，提供了一种电子设备，包括处理器以及用于存储处理器可执行指令的存储器，所述处理器执行所述指令时实现上述方法的步骤。In yet another aspect, an electronic device is provided, including a processor and a memory for storing instructions executable by the processor, the processor implementing the steps of the above method when the instructions are executed.
又一方面，提供了一种计算机可读存储介质，其上存储有计算机指令，所述指令被执行时实现上述方法的步骤。In yet another aspect, there is provided a computer-readable storage medium having computer instructions stored thereon that, when executed, implement the steps of the above method.
本申请提供的了一种基于时间敏感的虚拟电厂通信业务流量调度方法，通过初始化后的网络拓扑结构和流源宿节点信息，生成第一调度时刻表；通过按照流的周期大小升序为调度时刻表进行排序，得到第二调度时刻表，对第二调度时刻表进行调整，直至任意两个流之间不存在冲突，根据调整后的第二调度时刻表，确定每一个流在其数据链路上每个设备的发送时间和在接收节点上的接收时间。即，在进行流量调度的过程中，生成了两个调度时刻表，先通过第一时刻表进行调度，再通过第二时刻表进行调度，使得可以最快时间响应流量调度需求，以确保网络更新过程中保证不丢失帧，同时不引入额外的更新时间。进一步的，第二调度时刻表是以无冲突为约束检测的，因此，可以保证调度表的正确性和流间无冲突，较合理地对冲突流进行调整，同时也保证了网络能动态配置。The present application provides a time-sensitive virtual power plant communication service traffic scheduling method, which generates a first scheduling timetable according to the initialized network topology and flow source and sink node information; Sort the table to obtain a second scheduling timetable, adjust the second scheduling timetable until there is no conflict between any two flows, and determine that each flow is on its data link according to the adjusted second scheduling timetable send time on each device and receive time on the receiving node. That is, in the process of traffic scheduling, two scheduling timetables are generated, the first timetable is used for scheduling, and then the second timetable is used for scheduling, so that the traffic scheduling requirements can be responded to in the fastest time to ensure network updates. It is guaranteed that no frames are lost during the process, and no additional update time is introduced. Further, the second scheduling timetable is detected with no conflict as a constraint. Therefore, the correctness of the scheduling table and no conflict between flows can be ensured, the conflicting flows can be adjusted reasonably, and the network can be dynamically configured.
附图说明Description of drawings
为了更清楚地说明本申请实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本申请中记载的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动性的前提下，还可以根据这些附图获得其他的附图。In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the following briefly introduces the accompanying drawings required for the description of the embodiments or the prior art. Obviously, the drawings in the following description are only These are some embodiments described in this application. For those of ordinary skill in the art, other drawings can also be obtained based on these drawings without any creative effort.
图1是本申请提供的基于时间敏感的虚拟电厂通信业务流量调度方法一种实施例的方法流程图；1 is a method flow chart of an embodiment of a time-sensitive virtual power plant communication service traffic scheduling method provided by the present application;
图2是本申请提供的基于时间敏感的虚拟电厂通信业务流量调度装置一种实施例的模块结构示意图。FIG. 2 is a schematic structural diagram of a module according to an embodiment of a time-sensitive virtual power plant communication service traffic scheduling device provided by the present application.
具体实施方式Detailed ways
为了使本技术领域的人员更好地理解本申请中的技术方案，下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本申请一部分实施例，而不是全部的实施例。基于本申请中的实施例，本领域普通技术人员在没有作出创造性劳动前提下所获得的所有其他实施例，都应当属于本申请保护的范围。In order to make those skilled in the art better understand the technical solutions in the present application, the technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described The embodiments are only a part of the embodiments of the present application, but not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the scope of protection of this application.
图1是本申请提供的基于时间敏感的虚拟电厂通信业务流量调度方法一种实施例的方法流程图。虽然本申请提供了如下述实施例或附图所示的方法操作步骤或装置结构，但基于常规或者无需创造性的劳动在所述方法或装置中可以包括更多或者更少的操作步骤或模块单元。在逻辑性上不存在必要因果关系的步骤或结构中，这些步骤的执行顺序或装置的模块结构不限于本申请实施例描述及附图所示的执行顺序或模块结构。所述的方法或模块结构的在实际中的装置或终端产品应用时，可以按照实施例或者附图所示的方法或模块结构连接进行顺序执行或者并行执行(例如并行处理器或者多线程处理的环境，甚至分布式处理环境)。FIG. 1 is a method flowchart of an embodiment of a time-sensitive virtual power plant communication service traffic scheduling method provided by the present application. Although the present application provides method operation steps or device structures as shown in the following embodiments or drawings, more or less operation steps or module units may be included in the method or device based on routine or without creative work. . In the steps or structures that logically do not have necessary causal relationship, the execution sequence of these steps or the module structure of the device are not limited to the execution sequence or module structure described in the embodiments of the present application and shown in the accompanying drawings. When the described method or module structure is applied in an actual device or terminal product, it can be executed sequentially or in parallel (for example, a parallel processor or multi-threaded processing method) according to the connection of the method or module structure shown in the embodiments or the accompanying drawings. environments, even distributed processing environments).
具体的，如图1所示，上述的基于时间敏感的虚拟电厂通信业务流量调度方法可以包括如下步骤：Specifically, as shown in FIG. 1 , the above-mentioned time-sensitive virtual power plant communication service traffic scheduling method may include the following steps:
步骤101：初始化目标网络的网络拓扑结构和所述目标网络的流源宿节点信息；Step 101: Initialize the network topology structure of the target network and the flow source and sink node information of the target network;
步骤102：根据初始化后的网络拓扑结构和流源宿节点信息，生成第一调度时刻表；Step 102: generate a first scheduling timetable according to the initialized network topology and flow source and sink node information;
步骤103：按照流的周期大小升序为调度时刻表进行排序，得到第二调度时刻表；Step 103: Sort the scheduling timetable in ascending order of the period size of the stream to obtain a second scheduling timetable;
步骤104：对第二调度时刻表进行调整，直至任意两个流之间不存在冲突；Step 104: Adjust the second scheduling timetable until there is no conflict between any two streams;
步骤105：根据调整后的第二调度时刻表，确定每一个流在其数据链路上每个设备的发送时间和在接收节点上的接收时间。Step 105: According to the adjusted second scheduling timetable, determine the sending time of each device on its data link and the receiving time of each stream on the receiving node.
在上例中，通过初始化后的网络拓扑结构和流源宿节点信息，生成第一调度时刻表；通过按照流的周期大小升序为调度时刻表进行排序，得到第二调度时刻表，对第二调度时刻表进行调整，直至任意两个流之间不存在冲突，根据调整后的第二调度时刻表，确定每一个流在其数据链路上每个设备的发送时间和在接收节点上的接收时间。即，在进行流量调度的过程中，生成了两个调度时刻表，先通过第一时刻表进行调度，再通过第二时刻表进行调度，使得可以最快时间响应流量调度需求，以确保网络更新过程中保证不丢失帧，同时不引入额外的更新时间。进一步的，第二调度时刻表是以无冲突为约束检测的，因此，可以保证调度表的正确性和流间无冲突，较合理地对冲突流进行调整，同时也保证了网络能动态配置。In the above example, the first scheduling timetable is generated based on the initialized network topology and flow source and sink node information; the second scheduling timetable is obtained by sorting the scheduling timetable in ascending order according to the period size of the flow. The scheduling timetable is adjusted until there is no conflict between any two streams, and according to the adjusted second scheduling timetable, the sending time of each device on its data link and the receiving time of each stream on the receiving node are determined. time. That is, in the process of traffic scheduling, two scheduling timetables are generated, the first timetable is used for scheduling, and then the second timetable is used for scheduling, so that the traffic scheduling requirements can be responded to in the fastest time to ensure network updates. It is guaranteed that no frames are lost during the process, and no additional update time is introduced. Further, the second scheduling timetable is detected with no conflict as a constraint. Therefore, the correctness of the scheduling table and no conflict between flows can be ensured, the conflicting flows can be adjusted reasonably, and the network can be dynamically configured.
在本例中采用了两阶段更新方式的流量调度算法，第一阶段向所有设备部署新调度，第二阶段开始发送带新版本号标记的数据流。进一步的，将新旧流表同时存放在内存空间，保证了网络能动态配置，从而使得工业控制网络在不增加更新开销的情况下实现传输一致性，且确保了所有数据在一个流量计划下完成，以及网络流量的灵活控制。具体的，可以在生成第一调度时刻表之后，向所述目标网络中的设备发送第一调度时刻表，以按照所述第一调度时刻表进行部署；然后，在得到调整后的第二调度时刻表之后，向所述目标网络中的设备发送调整后的第二调度时刻表，再按照所述调整后的第二调度时刻表进行部署；其中，所述第一调度时刻表和调整后的第二调度时刻表同时存放在内存空间，通过版本号对第一调度时刻表和调整后的第二调度时刻表进行区分。In this example, a two-stage update flow scheduling algorithm is used. The first stage deploys the new schedule to all devices, and the second stage starts to send data streams marked with the new version number. Further, the new and old flow tables are stored in the memory space at the same time to ensure that the network can be dynamically configured, so that the industrial control network can achieve transmission consistency without increasing the update overhead, and ensure that all data are completed under one flow plan, And flexible control of network traffic. Specifically, after the first scheduling timetable is generated, the first scheduling timetable may be sent to the device in the target network for deployment according to the first scheduling timetable; then, after obtaining the adjusted second scheduling timetable After the timetable, send the adjusted second scheduling timetable to the device in the target network, and then deploy according to the adjusted second scheduling timetable; wherein, the first scheduling timetable and the adjusted The second scheduling timetable is simultaneously stored in the memory space, and the first scheduling timetable and the adjusted second scheduling timetable are distinguished by the version number.
在实际进行调度时刻表调整的时候，可以按照如下约束规则进行对第二调度时刻表进行调整：每个流的源的发送时间小于其周期、每个流的所有帧都必须在规定的端到端延迟要求内及时到达其目的地、帧在路径的接收方处的发送时间必须大于在该路径的发送方处的发送时间、任意两个流在公共路径上的发送时间没有任何重叠。When actually adjusting the scheduling timetable, the second scheduling timetable can be adjusted according to the following constraint rules: the sending time of the source of each stream is less than its period, and all frames of each stream must arrive at the specified end. To reach its destination in time within the end-to-end delay requirement, the frame must be sent at the receiver of the path in a greater time than at the sender of the path, and the sending times of any two streams on the common path must not overlap in any way.
具体的是，可以是进行如下四个约束检测：Specifically, the following four constraint detections can be performed:
1)流周期约束：1) Stream cycle constraints:
对于每个流，源的发送时间应当小于其周期。注意，如果流在源上的帧生成时间与其离开的时间不同，则一帧的生成时间为发送时间。For each stream, the source's sending time should be less than its period. Note that a frame's generation time is the send time if the stream's frame generation time on the source is different from the time it left.
2)端到端延迟约束：2) End-to-end delay constraints:
对每个流而言，其所有帧都必须在规定的端到端延迟要求内及时到达其目的地。For each flow, all of its frames must arrive at its destination in time within the specified end-to-end latency requirements.
3)发送顺序约束：3) Send order constraints:
一个帧在路径[vk,vl]上能够进行传输的前提是该帧已经到达vk，因此，帧在vl处的发送时间必须大于在vk的发送时间。A frame can be transmitted on the path [vk , vl ] only if the frame has reached vk , therefore, the transmission time of the frame at vl must be greater than the transmission time at vk .
4)无发送时间重叠约束：4) No transmission time overlap constraint:
为了避免任何拥塞发生，任意两个流在公共路径上的发送时间不应该有任何重叠。如果有发送时间重叠，则发生流冲突，造成帧的丢失。因此该约束对于基本约束来说最关键。To avoid any congestion, there should not be any overlap in the sending times of any two flows on the common path. If there is an overlapping transmission time, a stream collision occurs, resulting in frame loss. So this constraint is the most critical to the base constraint.
Xi,j*∈{0,1}Xi,j* ∈{0,1}
其中M满足
上述的每一个流在其数据链路上每个设备的发送时间和在接收节点上的接收时间可以表示为：The sending time of each device on its data link and the receiving time on the receiving node of each flow above can be expressed as:
其中，
在进行约束判断的时候，可以采用回溯的策略进行，例如，可以声明第一变量等于0，表示当前已完成流调度的数量，第一变量的最大值为新流数量；将第一变量赋值给第二变量，通过第二变量标识当前数据流集合的范围；确定当前数据流集合是否满足预定冲突约束条件，如果不满足，则回溯至上一个新流，并构建满足预定冲突约束条件的调度方案，直至完成所有新流的冲突判断。When making constraint judgment, you can use the backtracking strategy. For example, you can declare that the first variable is equal to 0, indicating the number of currently completed flow scheduling, and the maximum value of the first variable is the number of new flows; assign the first variable to The second variable identifies the scope of the current data stream set by the second variable; determines whether the current data stream set satisfies the predetermined conflict constraint, if not, backtracks to the previous new stream, and constructs a scheduling scheme that satisfies the predetermined conflict constraint, Until the conflict judgment of all new streams is completed.
下面结合一个具体实施例对上述方法进行说明，然而，值得注意的是，该具体实施例仅是为了更好地说明本申请，并不构成对本申请的不当限定。The above method will be described below with reference to a specific embodiment. However, it should be noted that the specific embodiment is only for better illustrating the present application, and does not constitute an improper limitation of the present application.
考虑到网络更新和流量调度算法在TSN工作组设定的IEEE 802.1Qbv标准下通过计算特定时间下交换机中数据流的传输时间，保证了虚拟电厂的聚合资源调度业务过程中的时间敏感流在TSN中的确定传输，从而为网络提供了实时传输功能和网络灵活性，确保了数字化优势的发挥。Considering that the network update and traffic scheduling algorithm is based on the IEEE 802.1Qbv standard set by the TSN working group, by calculating the transmission time of the data flow in the switch at a specific time, it ensures that the time-sensitive flow in the process of the aggregated resource scheduling service of the virtual power plant is guaranteed in the TSN. It provides the network with real-time transmission function and network flexibility to ensure the full play of digital advantages.
首先，考虑到需要保证设计算法的高可调度性，高可调度性指的是算法无法找到任何可接受的调度计划的情况基本不会发生或较少发生，而时间触发系统中的流量调度问题与系统设计中许多其他问题一样，可以被表述为约束系统的解，不同类型问题的约束具有不同的特点，因此，可以针对不同类型问题开发有不同的专门求解器，以提高算法的可调度性。目前已经提出过不同的调度方法，例如：基于可满足模理论(SMT)，基于混合整数线性规划(MILP)和混合临界调度等。此外，调度路由方案，即，在确定每个数据流的路径的同时考虑调度时间，从而有效减少对调度时间的计算，这也可以提高可调度性，例如：KSP路由算法。First of all, considering the need to ensure the high schedulability of the design algorithm, high schedulability means that the situation that the algorithm cannot find any acceptable scheduling plan basically does not occur or rarely occurs, while the traffic scheduling problem in the time-triggered system Like many other problems in system design, it can be expressed as the solution of a constraint system. The constraints of different types of problems have different characteristics. Therefore, different specialized solvers can be developed for different types of problems to improve the schedulability of the algorithm. . Different scheduling methods have been proposed, such as: based on satisfiable modular theory (SMT), based on mixed integer linear programming (MILP) and mixed critical scheduling. In addition, the scheduling routing scheme, that is, considering the scheduling time while determining the path of each data flow, thereby effectively reducing the calculation of the scheduling time, which can also improve the schedulability, such as the KSP routing algorithm.
其次，需要保证虚拟电厂网络设置频繁变化下的动态配置。调度算法的时间计算往往需要动态配置，且网络设置会频繁变化。动态应用程序的出现，例如，实时物联网(RT-IoT)和列车通信网络，工业网络提出了新的挑战，也就是说，调度网络必须能够适应频繁的变化，例如：网络拓扑发生变化(例如链接失败)、设备插入和删除以及时间触发流的添加和删除。Secondly, it is necessary to ensure dynamic configuration under frequent changes of virtual power plant network settings. Time calculations for scheduling algorithms often require dynamic configuration, and network settings change frequently. Emergence of dynamic applications, such as real-time Internet of Things (RT-IoT) and train communication networks, industrial networks present new challenges, that is, dispatch networks must be able to adapt to frequent changes, such as: changes in network topology (e.g. link failure), device insertion and removal, and time-triggered stream additions and removals.
最后，是网络更新机制。网络更新机制直接影响着流量调度算法的执行过程和结果，主要分为以下三类：1)两阶段更新：整个更新过程分为两个阶段。在不可观察阶段，控制器在不启用设备的情况下向其部署新的调度，然后在一键式阶段，控制器初始化入口设备以发送带有新版本号的数据流，缺点是会引入额外的流表空间，也会造成数据流冲突。2)有序更新：在每一轮，控制器等待直到所有交换机完成更新，然后才调用下一轮。这个方法不需要额外的流表空间，但同样会造成错误转发等传输不一致情况。3)定时更新：将时间触发机制融合前两种更新方式，但这种方式无法处理死锁情况。Finally, there is the network update mechanism. The network update mechanism directly affects the execution process and results of the traffic scheduling algorithm, and is mainly divided into the following three categories: 1) Two-stage update: The entire update process is divided into two stages. In the unobservable phase, the controller deploys a new schedule to the device without enabling it, then in the one-click phase, the controller initializes the ingress device to send a stream of data with the new version number, with the disadvantage of introducing additional The flow table space will also cause data flow conflicts. 2) Ordered update: In each round, the controller waits until all switches have finished updating before calling the next round. This method does not require additional flow table space, but it will also cause transmission inconsistencies such as error forwarding. 3) Timed update: The time-triggered mechanism is combined with the first two update methods, but this method cannot handle the deadlock situation.
在本例中，提出了一种基于时间敏感的虚拟电厂通信调度方法。首先，为了避免可调度性的损失，即避免算法无法找到任何可接受的调度计划情况发生，在本例中采用贪心算法和回溯策略的思想，确保在最坏的情况下能保持与最简单的一一列举判断约束的方法一致的可调度性能。其次，为了避免在实际工业应用中对数百万变量约束调度需要数小时的时间花费，以及对内存的大量占用，在本例中采用两阶段更新方式的流量调度算法，第一阶段向所有设备部署新调度，第二阶段开始发送带新版本号标记的数据流。进一步的，将新旧流表同时存放在内存空间，保证了网络能动态配置，从而使得工业控制网络在不增加更新开销的情况下实现传输一致性，且确保了所有数据在一个流量计划下完成，以及网络流量的灵活控制。In this example, a time-sensitive communication scheduling method for virtual power plants is proposed. First of all, in order to avoid the loss of schedulability, that is, to avoid the situation that the algorithm cannot find any acceptable scheduling plan, in this example, the idea of the greedy algorithm and backtracking strategy is adopted to ensure that in the worst case, it can maintain the same One by one, the methods for judging constraints are consistent with the schedulable performance. Secondly, in order to avoid the time consumption of millions of variables constraint scheduling in practical industrial applications, as well as a large amount of memory occupation, a two-stage update method is used in this example. The new schedule is deployed, and the second phase starts sending data streams tagged with the new version number. Further, the new and old flow tables are stored in the memory space at the same time to ensure that the network can be dynamically configured, so that the industrial control network can achieve transmission consistency without increasing the update overhead, and ensure that all data are completed under one flow plan, And flexible control of network traffic.
例如，虚拟电厂通信网络的物理拓扑形式化地被建模为一个无向图G(V,E)，其中，V是所有交换机和主机的集合，E是所有被连接设备间全双工数据链路的集合。两个顶点之间的物理链接定义了其两个定向数据流链接，可以表示为E＝{(v1,v2)|v1,v2∈V}。数据流链接的集合用L表示，即
网络中传输的所有数据流构成了集合F，单个流fi∈F从一个源节点发送至一个目的节点，也称发送方至接收方路径上的单个数据流链路构成的集合为虚拟链路，用fi.vl表示。一时间触发流fi可以被表示为：fi＝{fi.prd,fi.len,fi.ddl,fi.src,fi.dst,fi.vl}，其中，fi.prd表示流的周期，fi.len表示流经过的节点数，fi.ddl表示流的端到端延迟，fi.src表示流的源节点，fi.dst表示流的接收节点，fi.vl表示流的链路集合。fi.vl作为调度算法的输入，不考虑调度时的节点路由选择问题。此外，
算法结果如下的调度S表示：The algorithm results in the following schedule S representation:
流fi在第n个周期，设备vk上的帧发送时间为
最后，流fi在节点vl的确切接收时间为：
对于时间触发流的流量调度问题而言，最关键的是找到满足约束的可行解决方案，仅需要找到一组设备时间可以保证传输一致性和时间敏感特性即可，这要求在网络更新时尽快为网络拓扑找到一组可行的解，而不需要找到端到端延迟最小的最优解。因此为了提高算法性能，可以将目标函数设为0，即不需要进行优化操作。For the traffic scheduling problem of time-triggered flows, the most important thing is to find a feasible solution that satisfies the constraints. It is only necessary to find a set of device times that can ensure transmission consistency and time-sensitive characteristics. This requires that the network update as soon as possible. The network topology finds a set of feasible solutions without finding the optimal solution with the smallest end-to-end delay. Therefore, in order to improve the performance of the algorithm, the objective function can be set to 0, that is, no optimization operation is required.
为了求解满足需求的调度方案，可以对生成的调度计划表进行约束条件检查，在约束条件不合格时进行修改，再继续进行判断是否满足约束：In order to solve the scheduling scheme that meets the requirements, you can check the constraints on the generated scheduling plan, modify when the constraints are unqualified, and then continue to judge whether the constraints are met:
1)流周期约束：1) Stream cycle constraints:
对于每个流，源的发送时间应当小于其周期。注意，如果流在源上的帧生成时间与其离开的时间不同，则一帧的生成时间为发送时间。For each stream, the source's sending time should be less than its period. Note that a frame's generation time is the send time if the stream's frame generation time on the source is different from the time it left.
2)端到端延迟约束：2) End-to-end delay constraints:
对每个流而言，其所有帧都必须在规定的端到端延迟要求内及时到达其目的地。For each flow, all of its frames must arrive at its destination in time within the specified end-to-end latency requirements.
3)发送顺序约束：3) Send order constraints:
一个帧在路径[vk,vl]上能够进行传输的前提是该帧已经到达vk，因此，帧在vl处的发送时间必须大于在vl的发送时间。The premise that a frame can be transmitted on the path [vk , vl ] is that the frame has reached vk , therefore, the transmission time of the frame at vl must be greater than the transmission time at vl .
4)无发送时间重叠约束：4) No transmission time overlap constraint:
为了避免任何拥塞发生，任意两个流在公共路径上的发送时间不应该有任何重叠。如果有发送时间重叠，则发生流冲突，造成帧的丢失。因此该约束对于基本约束来说最关键。To avoid any congestion, there should not be any overlap in the sending times of any two flows on the common path. If there is an overlapping transmission time, a stream collision occurs, resulting in frame loss. So this constraint is the most critical to the base constraint.
Xi,j*∈{0,1}Xi,j* ∈{0,1}
其中M满足
在本例中，提供了一种基于时间敏感的电力无线专网回传网流量调度方法(即，基于贪心和回溯策略的流量调度算法)，可以包括按照如下算法实现：In this example, a time-sensitive power wireless private network backhaul network traffic scheduling method (that is, a traffic scheduling algorithm based on greedy and backtracking strategies) is provided, which can be implemented according to the following algorithms:
输入：G*(V*,E*)、F、F*Input: G* (V* ,E* ), F, F*
输出：
计时结束，监测运行时间。When the timer expires, monitor the running time.
即，该流量调度算法可以包括如下步骤：That is, the traffic scheduling algorithm may include the following steps:
S1：开始计时，计算算法运行时间，以便在规定时间内得到流量调度表(对应上述算法的第1行)。S1: Start timing, calculate the running time of the algorithm, so as to obtain the traffic schedule table within the specified time (corresponding to the first line of the above algorithm).
S2：初始化网络拓扑和流源宿节点信息，随机生成调度时刻表(对应上述算法的第2行)。S2: Initialize the network topology and flow source and sink node information, and randomly generate a scheduling timetable (corresponding to the second line of the above algorithm).
S3：按流的周期大小升序给新流集合进行排序(对应上述算法的第3行)。S3: Sort the new flow set in ascending order of the period size of the flow (corresponding to the third line of the above algorithm).
S4：将新流的调度时刻表进行调整，使得任意两个新流之间没有冲突，即符合约束条件的规定(对应上述算法的第4-9行)。S4: Adjust the scheduling timetable of the new flow so that there is no conflict between any two new flows, that is, the constraint conditions are met (corresponding to lines 4-9 of the above algorithm).
S5：如果初始化问题是否可解标志solved为false(对应上述算法的第10行)，则进入主循环，声明i＝0表示目前已完成流调度的数量，最大值为新流数量(对应上述算法的第11行)。声明j＝i，标识当前工作流集合Fs的范围(对应上述算法的第12-13行)。判断Fs是否满足约束(对应上述算法的第14-24行)。若当前Fs不可解，则开始回溯上一个新流，并构建同时满足的调度方案(对应上述算法的第25-26行)。输出解(对应上述算法的第27-30行)。输出运行时间(对应上述算法的第31行)。S5: If the initialization problem is solvable flag solved is false (corresponding to the 10th line of the above algorithm), enter the main loop, declare i=0 to indicate the number of completed stream scheduling, and the maximum value is the number of new streams (corresponding to the above algorithm) line 11). The statement j=i identifies the range of the current workflow set Fs (corresponding to lines 12-13 of the above algorithm). Determine whether Fs satisfies the constraints (corresponding to lines 14-24 of the above algorithm). If the current Fs is unsolvable, start backtracking to the last new flow, and construct a scheduling scheme that satisfies at the same time (corresponding to lines 25-26 of the above algorithm). Output the solution (corresponding to lines 27-30 of the above algorithm). Output the running time (corresponding to line 31 of the above algorithm).
在上例中，为基于时间敏感的虚拟电厂业务设计了适合的网络更新和流量调度算法，为网络生成可行的调度计划表，确保网络更新过程中保证不丢失帧，同时不引入额外的更新时间。针对算法设计思想，巧妙的运用了贪心算法和回溯的策略，较大程度上降低了内存和运行时间的花费，且提出了完善的约束检测算法流程，保证了调度表的正确性和流间无冲突，从而可以较合理地对冲突流进行调整，同时也保证了网络能动态配置。In the above example, a suitable network update and traffic scheduling algorithm is designed for the time-sensitive virtual power plant business, and a feasible scheduling schedule is generated for the network to ensure that no frames are lost during the network update process, and additional update time is not introduced. . Aiming at the algorithm design idea, the greedy algorithm and backtracking strategy are cleverly used, which greatly reduces the cost of memory and running time, and proposes a perfect constraint detection algorithm process to ensure the correctness of the schedule table and the invariance between flows. Therefore, the conflict flow can be adjusted reasonably, and the network can be dynamically configured at the same time.
基于同一发明构思，本申请实施例中还提供了一种基于时间敏感的虚拟电厂通信业务流量调度装置，如下面的实施例所述。由于基于时间敏感的虚拟电厂通信业务流量调度装置解决问题的原理与基于时间敏感的虚拟电厂通信业务流量调度方法相似，因此基于时间敏感的虚拟电厂通信业务流量调度装置的实施可以参见基于时间敏感的虚拟电厂通信业务流量调度方法的实施，重复之处不再赘述。以下所使用的，术语“单元”或者“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。图2是本申请实施例的基于时间敏感的虚拟电厂通信业务流量调度装置的一种结构框图，如图2所示，可以包括：初始化模块201、生成模块202、排序模块203、调整模块204和确定模块205，下面对该结构进行说明。Based on the same inventive concept, an embodiment of the present application also provides a time-sensitive communication service flow scheduling device in a virtual power plant, as described in the following embodiments. Since the principle of solving the problem based on the time-sensitive virtual power plant communication service flow scheduling device is similar to the time-sensitive virtual power plant communication service flow scheduling method, the implementation of the time-sensitive virtual power plant communication service flow scheduling device can refer to the time-sensitive virtual power plant communication service flow scheduling device. The implementation of the method for scheduling communication service traffic in the virtual power plant will not be repeated here. As used below, the term "unit" or "module" may be a combination of software and/or hardware that implements a predetermined function. Although the apparatus described in the following embodiments is preferably implemented in software, implementations in hardware, or a combination of software and hardware, are also possible and contemplated. FIG. 2 is a structural block diagram of a time-sensitive virtual power plant communication service flow scheduling device according to an embodiment of the present application. As shown in FIG. 2, it may include: an
初始化模块201，用于初始化目标网络的网络拓扑结构和所述目标网络的流源宿节点信息；The
生成模块202，用于根据初始化后的网络拓扑结构和流源宿节点信息，生成第一调度时刻表；A
排序模块203，按照流的周期大小升序为第一调度时刻表进行排序，得到第二调度时刻表；The
调整模块204，用于对第二调度时刻表进行调整，直至任意两个流之间不存在冲突；an
确定模块205，用于根据调整后的第二调度时刻表，确定每一个流在其数据链路上每个设备的发送时间和在接收节点上的接收时间。The determining
在一个实施方式中，上述装置还包括：第一部署模块，用于在生成第一调度时刻表之后，向所述目标网络中的设备发送第一调度时刻表，以按照所述第一调度时刻表进行部署；第二部署模块，用于在得到调整后的第二调度时刻表之后，向所述目标网络中的设备发送调整后的第二调度时刻表，以按照所述调整后的第二调度时刻表进行部署；其中，所述第一调度时刻表和调整后的第二调度时刻表同时存放在内存空间，通过版本号对第一调度时刻表和调整后的第二调度时刻表进行区分。In one embodiment, the above-mentioned apparatus further includes: a first deployment module, configured to send the first scheduling timetable to the device in the target network after generating the first scheduling timetable, so as to follow the first scheduling timetable The second deployment module is configured to send the adjusted second scheduling timetable to the device in the target network after obtaining the adjusted second scheduling timetable, so as to follow the adjusted second scheduling timetable. The scheduling timetable is deployed; wherein, the first scheduling timetable and the adjusted second scheduling timetable are stored in the memory space at the same time, and the first scheduling timetable and the adjusted second scheduling timetable are distinguished by the version number .
在一个实施方式中，上述调整模块204具体可以用于按照如下约束规则进行对第二调度时刻表进行调整：每个流的源的发送时间小于其周期、每个流的所有帧都必须在规定的端到端延迟要求内及时到达其目的地、帧在路径的接收方处的发送时间必须大于在该路径的发送方处的发送时间、任意两个流在公共路径上的发送时间没有任何重叠。In one embodiment, the above-mentioned
在一个实施方式中，每一个流在其数据链路上每个设备的发送时间和在接收节点上的接收时间表示为：In one embodiment, the transmit time for each device on its data link and the receive time on the receiving node for each flow are expressed as:
其中，
在一个实施方式中，对第二调度时刻表进行调整，直至任意两个流之间不存在冲突，可以包括：声明第一变量等于0，表示当前已完成流调度的数量，第一变量的最大值为新流数量；将第一变量赋值给第二变量，通过第二变量标识当前数据流集合的范围；确定当前数据流集合是否满足预定冲突约束条件，如果不满足，则回溯至上一个新流，并构建满足预定冲突约束条件的调度方案，直至完成所有新流的冲突判断。In one embodiment, adjusting the second scheduling timetable until there is no conflict between any two streams may include: declaring that the first variable is equal to 0, indicating the number of currently completed stream scheduling, and the maximum value of the first variable. The value is the number of new streams; the first variable is assigned to the second variable, and the range of the current data stream set is identified by the second variable; it is determined whether the current data stream set satisfies the predetermined conflict constraint, and if not, backtracking to the previous new stream , and construct a scheduling scheme that satisfies the predetermined conflict constraints until the conflict judgment of all new flows is completed.
本申请的实施例还提供能够实现上述实施例中的基于时间敏感的虚拟电厂通信业务流量调度方法中全部步骤的一种电子设备的具体实施方式，所述电子设备具体包括如下内容：处理器(processor)、存储器(memory)、通信接口(Communications Interface)和总线；其中，所述处理器、存储器、通信接口通过所述总线完成相互间的通信；所述处理器用于调用所述存储器中的计算机程序，所述处理器执行所述计算机程序时实现上述实施例中的基于时间敏感的虚拟电厂通信业务流量调度方法中的全部步骤，例如，所述处理器执行所述计算机程序时实现下述步骤：Embodiments of the present application also provide specific implementations of an electronic device capable of implementing all the steps in the time-sensitive virtual power plant communication service traffic scheduling method in the foregoing embodiments, the electronic device specifically includes the following content: a processor ( processor), memory (memory), communication interface (Communications Interface) and bus; wherein, the processor, memory, communication interface complete the communication with each other through the bus; the processor is used to call the computer in the memory A program, when the processor executes the computer program, it implements all the steps in the time-sensitive virtual power plant communication traffic scheduling method in the foregoing embodiment, for example, the processor implements the following steps when executing the computer program :
步骤1：初始化目标网络的网络拓扑结构和所述目标网络的流源宿节点信息；Step 1: initialize the network topology structure of the target network and the flow source and sink node information of the target network;
步骤2：根据初始化后的网络拓扑结构和流源宿节点信息，生成第一调度时刻表；Step 2: generate a first scheduling timetable according to the initialized network topology and flow source and sink node information;
步骤3：按照流的周期大小升序为调度时刻表进行排序，得到第二调度时刻表；Step 3: Sort the scheduling timetable in ascending order of the period size of the stream to obtain the second scheduling timetable;
步骤4：对第二调度时刻表进行调整，直至任意两个流之间不存在冲突；Step 4: Adjust the second scheduling timetable until there is no conflict between any two streams;
步骤5：根据调整后的第二调度时刻表，确定每一个流在其数据链路上每个设备的发送时间和在接收节点上的接收时间。Step 5: According to the adjusted second scheduling timetable, determine the sending time of each device on its data link and the receiving time of each stream on the receiving node.
从上述描述可知，本申请实施例通过初始化后的网络拓扑结构和流源宿节点信息，生成第一调度时刻表；通过按照流的周期大小升序为调度时刻表进行排序，得到第二调度时刻表，对第二调度时刻表进行调整，直至任意两个流之间不存在冲突，根据调整后的第二调度时刻表，确定每一个流在其数据链路上每个设备的发送时间和在接收节点上的接收时间。即，在进行流量调度的过程中，生成了两个调度时刻表，先通过第一时刻表进行调度，再通过第二时刻表进行调度，使得可以最快时间响应流量调度需求，以确保网络更新过程中保证不丢失帧，同时不引入额外的更新时间。进一步的，第二调度时刻表是以无冲突为约束检测的，因此，可以保证调度表的正确性和流间无冲突，较合理地对冲突流进行调整，同时也保证了网络能动态配置。It can be seen from the above description that in this embodiment of the present application, the first scheduling schedule is generated by using the initialized network topology structure and flow source and sink node information; , adjust the second scheduling schedule until there is no conflict between any two streams, and determine the sending time and receiving time of each stream on its data link and each device according to the adjusted second scheduling schedule Receive time on the node. That is, in the process of traffic scheduling, two scheduling timetables are generated, the first timetable is used for scheduling, and then the second timetable is used for scheduling, so that the traffic scheduling requirements can be responded to in the fastest time to ensure network updates. It is guaranteed that no frames are lost during the process, and no additional update time is introduced. Further, the second scheduling timetable is detected with no conflict as a constraint. Therefore, the correctness of the scheduling table and no conflict between flows can be ensured, the conflicting flows can be adjusted reasonably, and the network can be dynamically configured.
本申请的实施例还提供能够实现上述实施例中的基于时间敏感的虚拟电厂通信业务流量调度方法中全部步骤的一种计算机可读存储介质，所述计算机可读存储介质上存储有计算机程序，该计算机程序被处理器执行时实现上述实施例中的基于时间敏感的虚拟电厂通信业务流量调度方法的全部步骤，例如，所述处理器执行所述计算机程序时实现下述步骤：The embodiments of the present application also provide a computer-readable storage medium capable of implementing all the steps in the time-sensitive virtual power plant communication service flow scheduling method in the foregoing embodiments, where a computer program is stored on the computer-readable storage medium, When the computer program is executed by the processor, all steps of the time-sensitive virtual power plant communication traffic scheduling method in the above-mentioned embodiment are implemented. For example, when the processor executes the computer program, the following steps are implemented:
步骤1：初始化目标网络的网络拓扑结构和所述目标网络的流源宿节点信息；Step 1: initialize the network topology structure of the target network and the flow source and sink node information of the target network;
步骤2：根据初始化后的网络拓扑结构和流源宿节点信息，生成第一调度时刻表；Step 2: generate a first scheduling timetable according to the initialized network topology and flow source and sink node information;
步骤3：按照流的周期大小升序为调度时刻表进行排序，得到第二调度时刻表；Step 3: Sort the scheduling timetable in ascending order of the period size of the stream to obtain the second scheduling timetable;
步骤4：对第二调度时刻表进行调整，直至任意两个流之间不存在冲突；Step 4: Adjust the second scheduling timetable until there is no conflict between any two streams;
步骤5：根据调整后的第二调度时刻表，确定每一个流在其数据链路上每个设备的发送时间和在接收节点上的接收时间。Step 5: According to the adjusted second scheduling timetable, determine the sending time of each device on its data link and the receiving time of each stream on the receiving node.
从上述描述可知，本申请实施例通过初始化后的网络拓扑结构和流源宿节点信息，生成第一调度时刻表；通过按照流的周期大小升序为调度时刻表进行排序，得到第二调度时刻表，对第二调度时刻表进行调整，直至任意两个流之间不存在冲突，根据调整后的第二调度时刻表，确定每一个流在其数据链路上每个设备的发送时间和在接收节点上的接收时间。即，在进行流量调度的过程中，生成了两个调度时刻表，先通过第一时刻表进行调度，再通过第二时刻表进行调度，使得可以最快时间响应流量调度需求，以确保网络更新过程中保证不丢失帧，同时不引入额外的更新时间。进一步的，第二调度时刻表是以无冲突为约束检测的，因此，可以保证调度表的正确性和流间无冲突，较合理地对冲突流进行调整，同时也保证了网络能动态配置。It can be seen from the above description that in this embodiment of the present application, the first scheduling schedule is generated by using the initialized network topology structure and flow source and sink node information; , adjust the second scheduling schedule until there is no conflict between any two streams, and determine the sending time and receiving time of each stream on its data link and each device according to the adjusted second scheduling schedule Receive time on the node. That is, in the process of traffic scheduling, two scheduling timetables are generated, the first timetable is used for scheduling, and then the second timetable is used for scheduling, so that the traffic scheduling requirements can be responded to in the fastest time to ensure network updates. It is guaranteed that no frames are lost during the process, and no additional update time is introduced. Further, the second scheduling timetable is detected with no conflict as a constraint. Therefore, the correctness of the scheduling table and no conflict between flows can be ensured, the conflicting flows can be adjusted reasonably, and the network can be dynamically configured.
本说明书中的各个实施例均采用递进的方式描述，各个实施例之间相同相似的部分互相参见即可，每个实施例重点说明的都是与其他实施例的不同之处。尤其，对于硬件+程序类实施例而言，由于其基本相似于方法实施例，所以描述的比较简单，相关之处参见方法实施例的部分说明即可。Each embodiment in this specification is described in a progressive manner, and the same and similar parts between the various embodiments may be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the hardware+program embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and for related parts, please refer to the partial description of the method embodiment.
上述对本说明书特定实施例进行了描述。其它实施例在所附权利要求书的范围内。在一些情况下，在权利要求书中记载的动作或步骤可以按照不同于实施例中的顺序来执行并且仍然可以实现期望的结果。另外，在附图中描绘的过程不一定要求示出的特定顺序或者连续顺序才能实现期望的结果。在某些实施方式中，多任务处理和并行处理也是可以的或者可能是有利的。The foregoing describes specific embodiments of the present specification. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recited in the claims can be performed in an order different from that in the embodiments and still achieve desirable results. Additionally, the processes depicted in the figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
虽然本申请提供了如实施例或流程图所述的方法操作步骤，但基于常规或者无创造性的劳动可以包括更多或者更少的操作步骤。实施例中列举的步骤顺序仅仅为众多步骤执行顺序中的一种方式，不代表唯一的执行顺序。在实际中的装置或客户端产品执行时，可以按照实施例或者附图所示的方法顺序执行或者并行执行(例如并行处理器或者多线程处理的环境)。Although the present application provides method operation steps as described in the embodiments or flow charts, more or less operation steps may be included based on routine or non-creative work. The sequence of steps enumerated in the embodiments is only one of the execution sequences of many steps, and does not represent the only execution sequence. When an actual device or client product is executed, the methods shown in the embodiments or the accompanying drawings may be executed sequentially or in parallel (for example, a parallel processor or a multi-threaded processing environment).
上述实施例阐明的系统、装置、模块或单元，具体可以由计算机芯片或实体实现，或者由具有某种功能的产品来实现。一种典型的实现设备为计算机。具体的，计算机例如可以为个人计算机、膝上型计算机、车载人机交互设备、蜂窝电话、相机电话、智能电话、个人数字助理、媒体播放器、导航设备、电子邮件设备、游戏控制台、平板计算机、可穿戴设备或者这些设备中的任何设备的组合。The systems, devices, modules or units described in the above embodiments may be specifically implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer. Specifically, the computer can be, for example, a personal computer, a laptop computer, an in-vehicle human-computer interaction device, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet A computer, wearable device, or a combination of any of these devices.
虽然本说明书实施例提供了如实施例或流程图所述的方法操作步骤，但基于常规或者无创造性的手段可以包括更多或者更少的操作步骤。实施例中列举的步骤顺序仅仅为众多步骤执行顺序中的一种方式，不代表唯一的执行顺序。在实际中的装置或终端产品执行时，可以按照实施例或者附图所示的方法顺序执行或者并行执行(例如并行处理器或者多线程处理的环境，甚至为分布式数据处理环境)。术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含，从而使得包括一系列要素的过程、方法、产品或者设备不仅包括那些要素，而且还包括没有明确列出的其他要素，或者是还包括为这种过程、方法、产品或者设备所固有的要素。在没有更多限制的情况下，并不排除在包括所述要素的过程、方法、产品或者设备中还存在另外的相同或等同要素。Although the embodiments of the present specification provide method operation steps as described in the embodiments or flow charts, more or less operation steps may be included based on conventional or non-creative means. The sequence of steps enumerated in the embodiments is only one of the execution sequences of many steps, and does not represent the only execution sequence. When an actual device or terminal product is executed, it can be executed sequentially or in parallel according to the methods shown in the embodiments or the drawings (eg, a parallel processor or multi-threaded processing environment, or even a distributed data processing environment). The terms "comprising", "comprising" or any other variation thereof are intended to encompass a non-exclusive inclusion such that a process, method, product or device comprising a list of elements includes not only those elements, but also others not expressly listed elements, or also include elements inherent to such a process, method, product or device. Without further limitation, it does not preclude the presence of additional identical or equivalent elements in a process, method, product or apparatus comprising the stated elements.
为了描述的方便，描述以上装置时以功能分为各种模块分别描述。当然，在实施本说明书实施例时可以把各模块的功能在同一个或多个软件和/或硬件中实现，也可以将实现同一功能的模块由多个子模块或子单元的组合实现等。以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。For the convenience of description, when describing the above device, the functions are divided into various modules and described respectively. Of course, when implementing the embodiments of this specification, the functions of each module may be implemented in the same one or more software and/or hardware, and the modules implementing the same function may be implemented by a combination of multiple sub-modules or sub-units. The apparatus embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated. to another system, or some features can be ignored, or not implemented. On the other hand, the shown or discussed mutual coupling or direct coupling or communication connection may be through some interfaces, indirect coupling or communication connection of devices or units, and may be in electrical, mechanical or other forms.
本领域技术人员也知道，除了以纯计算机可读程序代码方式实现控制器以外，完全可以通过将方法步骤进行逻辑编程来使得控制器以逻辑门、开关、专用集成电路、可编程逻辑控制器和嵌入微控制器等的形式来实现相同功能。因此这种控制器可以被认为是一种硬件部件，而对其内部包括的用于实现各种功能的装置也可以视为硬件部件内的结构。或者甚至，可以将用于实现各种功能的装置视为既可以是实现方法的软件模块又可以是硬件部件内的结构。Those skilled in the art also know that, in addition to implementing the controller in the form of pure computer-readable program code, the controller can be implemented as logic gates, switches, application-specific integrated circuits, programmable logic controllers and embedded devices by logically programming the method steps. The same function can be realized in the form of a microcontroller, etc. Therefore, such a controller can be regarded as a hardware component, and the devices included therein for realizing various functions can also be regarded as a structure within the hardware component. Or even, the means for implementing various functions can be regarded as both a software module implementing a method and a structure within a hardware component.
本申请是参照根据本申请实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the present application. It will be understood that each flow and/or block in the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to the processor of a general purpose computer, special purpose computer, embedded processor or other programmable data processing device to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing device produce Means for implementing the functions specified in a flow or flow of a flowchart and/or a block or blocks of a block diagram.
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory result in an article of manufacture comprising instruction means, the instructions The apparatus implements the functions specified in the flow or flows of the flowcharts and/or the block or blocks of the block diagrams.
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。These computer program instructions can also be loaded on a computer or other programmable data processing device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process such that The instructions provide steps for implementing the functions specified in the flow or blocks of the flowcharts and/or the block or blocks of the block diagrams.
在一个典型的配置中，计算设备包括一个或多个处理器(CPU)、输入/输出接口、网络接口和内存。In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
内存可能包括计算机可读介质中的非永久性存储器，随机存取存储器(RAM)和/或非易失性内存等形式，如只读存储器(ROM)或闪存(flash RAM)。内存是计算机可读介质的示例。Memory may include non-persistent memory in computer readable media, random access memory (RAM) and/or non-volatile memory in the form of, for example, read only memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
计算机可读介质包括永久性和非永久性、可移动和非可移动媒体可以由任何方法或技术来实现信息存储。信息可以是计算机可读指令、数据结构、程序的模块或其他数据。计算机的存储介质的例子包括，但不限于相变内存(PRAM)、静态随机存取存储器(SRAM)、动态随机存取存储器(DRAM)、其他类型的随机存取存储器(RAM)、只读存储器(ROM)、电可擦除可编程只读存储器(EEPROM)、快闪记忆体或其他内存技术、只读光盘只读存储器(CD-ROM)、数字多功能光盘(DVD)或其他光学存储、磁盒式磁带，磁盘存储或其他磁性存储设备或任何其他非传输介质，可用于存储可以被计算设备访问的信息。按照本文中的界定，计算机可读介质不包括暂存电脑可读媒体(transitory media)，如调制的数据信号和载波。Computer-readable media includes both persistent and non-permanent, removable and non-removable media, and storage of information may be implemented by any method or technology. Information may be computer readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read only memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), Flash Memory or other memory technology, Compact Disc Read Only Memory (CD-ROM), Digital Versatile Disc (DVD) or other optical storage, Magnetic tape cartridges, magnetic disk storage or other magnetic storage devices or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, computer-readable media does not include transitory computer-readable media, such as modulated data signals and carrier waves.
本领域技术人员应明白，本说明书的实施例可提供为方法、系统或计算机程序产品。因此，本说明书实施例可采用完全硬件实施例、完全软件实施例或结合软件和硬件方面的实施例的形式。而且，本说明书实施例可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。As will be appreciated by one skilled in the art, the embodiments of the present specification may be provided as a method, a system or a computer program product. Accordingly, embodiments of this specification may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present specification may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
本说明书实施例可以在由计算机执行的计算机可执行指令的一般上下文中描述，例如程序模块。一般地，程序模块包括执行特定任务或实现特定抽象数据类型的例程、程序、对象、组件、数据结构等等。也可以在分布式计算环境中实践本说明书实施例，在这些分布式计算环境中，由通过通信网络而被连接的远程处理设备来执行任务。在分布式计算环境中，程序模块可以位于包括存储设备在内的本地和远程计算机存储介质中。Embodiments of this specification may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Embodiments of the description may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including storage devices.
本说明书中的各个实施例均采用递进的方式描述，各个实施例之间相同相似的部分互相参见即可，每个实施例重点说明的都是与其他实施例的不同之处。尤其，对于系统实施例而言，由于其基本相似于方法实施例，所以描述的比较简单，相关之处参见方法实施例的部分说明即可。在本说明书的描述中，参考术语“一个实施例”、“一些实施例”、“示例”、“具体示例”、或“一些示例”等的描述意指结合该实施例或示例描述的具体特征、结构、材料或者特点包含于本说明书实施例的至少一个实施例或示例中。在本说明书中，对上述术语的示意性表述不必须针对的是相同的实施例或示例。而且，描述的具体特征、结构、材料或者特点可以在任一个或多个实施例或示例中以合适的方式结合。此外，在不相互矛盾的情况下，本领域的技术人员可以将本说明书中描述的不同实施例或示例以及不同实施例或示例的特征进行结合和组合。Each embodiment in this specification is described in a progressive manner, and the same and similar parts between the various embodiments may be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, as for the system embodiments, since they are basically similar to the method embodiments, the description is relatively simple, and for related parts, please refer to the partial descriptions of the method embodiments. In the description of this specification, description with reference to the terms "one embodiment," "some embodiments," "example," "specific example," or "some examples", etc., mean specific features described in connection with the embodiment or example , structures, materials, or features are included in at least one example or example of embodiments of this specification. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, those skilled in the art may combine and combine the different embodiments or examples described in this specification, as well as the features of the different embodiments or examples, without conflicting each other.
以上所述仅为本说明书实施例的实施例而已，并不用于限制本说明书实施例。对于本领域技术人员来说，本说明书实施例可以有各种更改和变化。凡在本说明书实施例的精神和原理之内所作的任何修改、等同替换、改进等，均应包含在本说明书实施例的权利要求范围之内。The above descriptions are merely examples of the embodiments of the present specification, and are not intended to limit the embodiments of the present specification. For those skilled in the art, various modifications and variations can be made to the embodiments of the present specification. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the embodiments of the present specification shall be included within the scope of the claims of the embodiments of the present specification.
Claims (10)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111234647.7ACN114039936B (en) | 2021-10-22 | 2021-10-22 | Virtual power plant communication service flow scheduling method and device based on time sensitivity |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111234647.7ACN114039936B (en) | 2021-10-22 | 2021-10-22 | Virtual power plant communication service flow scheduling method and device based on time sensitivity |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114039936Atrue CN114039936A (en) | 2022-02-11 |
| CN114039936B CN114039936B (en) | 2023-12-26 |
Family
ID=80135204
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111234647.7AActiveCN114039936B (en) | 2021-10-22 | 2021-10-22 | Virtual power plant communication service flow scheduling method and device based on time sensitivity |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114039936B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114221912A (en)* | 2022-02-22 | 2022-03-22 | 北京科技大学 | A time-sensitive network access method for aperiodic time-triggered service flow |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110310732A1 (en)* | 2000-07-14 | 2011-12-22 | Jin-Meng Ho | Admission control for q0s-driven wireless lans |
| US20150327261A1 (en)* | 2014-05-08 | 2015-11-12 | Cisco Technology, Inc. | Timeslot distribution in a distributed routing protocol for deterministic wireless networks |
| US20170070439A1 (en)* | 2015-09-07 | 2017-03-09 | Fts Computertechnik Gmbh | Online incremental scheduling method for deterministic networks |
| US20180103094A1 (en)* | 2016-10-12 | 2018-04-12 | Cisco Technology, Inc. | Deterministic stream synchronization |
| CN110601888A (en)* | 2019-09-10 | 2019-12-20 | 清华大学 | Deterministic fault detection and positioning method and system in time-sensitive network |
| CN110870285A (en)* | 2017-07-06 | 2020-03-06 | 西门子股份公司 | Method for high performance data transmission in a data network with partial real-time requirements and apparatus for performing the method |
| CN111600754A (en)* | 2020-05-11 | 2020-08-28 | 重庆邮电大学 | Industrial heterogeneous network scheduling method for interconnection of TSN (transmission time network) and non-TSN (non-Transmission time network) |
| CN112235194A (en)* | 2020-09-03 | 2021-01-15 | 北京邮电大学 | Method and device for online routing and scheduling of delay-sensitive traffic |
| CN113068263A (en)* | 2021-03-26 | 2021-07-02 | 鹏城实验室 | Time slot scheduling method for time-sensitive network, terminal and storage medium |
| WO2021181541A1 (en)* | 2020-03-10 | 2021-09-16 | 三菱電機株式会社 | Controller, network system, and flow management method |
- 2021
- 2021-10-22CNCN202111234647.7Apatent/CN114039936B/enactiveActive
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110310732A1 (en)* | 2000-07-14 | 2011-12-22 | Jin-Meng Ho | Admission control for q0s-driven wireless lans |
| US20150327261A1 (en)* | 2014-05-08 | 2015-11-12 | Cisco Technology, Inc. | Timeslot distribution in a distributed routing protocol for deterministic wireless networks |
| US20170070439A1 (en)* | 2015-09-07 | 2017-03-09 | Fts Computertechnik Gmbh | Online incremental scheduling method for deterministic networks |
| US20180103094A1 (en)* | 2016-10-12 | 2018-04-12 | Cisco Technology, Inc. | Deterministic stream synchronization |
| CN110870285A (en)* | 2017-07-06 | 2020-03-06 | 西门子股份公司 | Method for high performance data transmission in a data network with partial real-time requirements and apparatus for performing the method |
| CN110601888A (en)* | 2019-09-10 | 2019-12-20 | 清华大学 | Deterministic fault detection and positioning method and system in time-sensitive network |
| WO2021181541A1 (en)* | 2020-03-10 | 2021-09-16 | 三菱電機株式会社 | Controller, network system, and flow management method |
| CN111600754A (en)* | 2020-05-11 | 2020-08-28 | 重庆邮电大学 | Industrial heterogeneous network scheduling method for interconnection of TSN (transmission time network) and non-TSN (non-Transmission time network) |
| CN112235194A (en)* | 2020-09-03 | 2021-01-15 | 北京邮电大学 | Method and device for online routing and scheduling of delay-sensitive traffic |
| CN113068263A (en)* | 2021-03-26 | 2021-07-02 | 鹏城实验室 | Time slot scheduling method for time-sensitive network, terminal and storage medium |
Non-Patent Citations (5)
| Title |
|---|
| JONATHAN FALK ET AL.: "Time-Triggered Traffic Planning for Data Networks with Conflict Graphs", 《2020 IEEE REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM (RTAS)》* |
| M. REITBLATT ET AL.: "Abstractions for network update", 《ACM SIGCOMM COMPUTER COMMUNICATION REVIEW》* |
| 刘川 等: "满足电力通信业务时延容忍度的SDN控制策略", 《中国电力》* |
| 姜旭艳 等: "SSA:一种面向CQF模型的TSN资源调度算法", 《东北大学学报(自然科学版)》* |
| 许方敏 等: "时间敏感网络（TSN）及无线TSN技术", 《电信科学》* |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114221912A (en)* | 2022-02-22 | 2022-03-22 | 北京科技大学 | A time-sensitive network access method for aperiodic time-triggered service flow |
| CN114221912B (en)* | 2022-02-22 | 2022-05-03 | 北京科技大学 | Time-sensitive network access method for non-periodic time-triggered service flow |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114039936B (en) | 2023-12-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kliazovich et al. | CA-DAG: Modeling communication-aware applications for scheduling in cloud computing | |
| CN111030835B (en) | Task scheduling model of TTFC network and message scheduling table generation method | |
| US20170078207A1 (en) | Network prioritization based on node-level attributes | |
| CN114286413A (en) | TSN network combined routing and stream distribution method and related equipment | |
| Kliazovich et al. | CA-DAG: Communication-aware directed acyclic graphs for modeling cloud computing applications | |
| CN112468412A (en) | Method for generating schedules for mixed-critical computer networks | |
| CN110990140B (en) | Method for scheduling distributed machine learning flow in photoelectric switching network | |
| CN119496750B (en) | Priority scheduling method, device, electronic device, storage medium and program product | |
| Yang et al. | A multipolicy deep reinforcement learning approach for multiobjective joint routing and scheduling in deterministic networks | |
| CN117857424A (en) | Data scheduling method, device, equipment and computer readable storage medium | |
| Joshi et al. | The multi-domain frame packing problem for CAN-FD | |
| CN118400313A (en) | Route scheduling optimization method and system based on time sensitive network | |
| CN112213956B (en) | Automatic driving simulation task scheduling method, device, equipment and readable medium | |
| AlOrbani et al. | Load balancing and resource allocation in smart cities using reinforcement learning | |
| CN113765825A (en) | Planning method and system architecture for chain type service flow scheduling | |
| CN114039936B (en) | Virtual power plant communication service flow scheduling method and device based on time sensitivity | |
| CN100562117C (en) | A code stream scheduling method, device and system | |
| US10027597B2 (en) | Collaborative route reservation and ranking in high performance computing fabrics | |
| CN114286304B (en) | MEC resource allocation method based on two-dimensional dynamic matching | |
| CN117978737A (en) | Message transmission method, device, storage medium and program product | |
| CN104065707B (en) | Based on the time triggered scheduling system calculated with communication coordinated design | |
| Fan et al. | Deep Reinforcement Learning Based Dynamic Time Slot Allocation in Unmanned Aerial Vehicle | |
| CN116319526B (en) | Incompatibility-aware joint routing partition scheduling method, device and medium | |
| CN118740646B (en) | A virtual graph construction method, device, equipment and storage medium | |
| CN105681214B (en) | A kind of large scale network transmission optimization method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |