CN113542371B - Resource scheduling method and system based on edge gateway - Google Patents

Resource scheduling method and system based on edge gateway Download PDF

Info

Publication number
CN113542371B
CN113542371B CN202110730350.3A CN202110730350A CN113542371B CN 113542371 B CN113542371 B CN 113542371B CN 202110730350 A CN202110730350 A CN 202110730350A CN 113542371 B CN113542371 B CN 113542371B
Authority
CN
China
Prior art keywords
edge
subtask
task
time
gateway
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202110730350.3A
Other languages
Chinese (zh)
Other versions
CN113542371A (en
Inventor
赵亦欣
黄伟
张玺
钱俊豪
陈艺
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Southwest University
Original Assignee
Southwest University
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 Southwest University filed Critical Southwest University
Priority to CN202110730350.3A priority Critical patent/CN113542371B/en
Publication of CN113542371A publication Critical patent/CN113542371A/en
Application granted granted Critical
Publication of CN113542371B publication Critical patent/CN113542371B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0893—Assignment of logical groups to network elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

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

Abstract

The invention discloses a resource scheduling method based on an edge gateway, which comprises the following steps: s1, acquiring a task sent by terminal equipment; wherein the task comprises a plurality of subtasks; s2, determining the shortest edge node path for processing the task; s3, according to a set subtask execution sequence, sequentially selecting an edge node with the minimum time consumption for executing a target subtask from the shortest edge node path as a target node; and S4, executing the task by using the target node. The resource scheduling system based on the edge gateway comprises an edge manager, an edge server and the edge gateway; the edge manager is used for scheduling network resources and computing resources; the edge server is used for providing computing resources; the edge gateway is used for receiving the task request sent by the terminal equipment and forwarding the task request to the edge manager. The invention can give full play to the computing power of the edge side, ensures the timely response to the terminal equipment and reduces the network load.

Description

Resource scheduling method and system based on edge gateway
Technical Field
The invention relates to the field of computer edge computing, in particular to a resource scheduling method and system based on an edge gateway.
Background
With the development of computer network technology, edge computing is used as a new technology, and the transformation from entity economy to digital economy is realized through the comprehensive interconnection of people, machines and objects, so that the transformation and upgrading of the traditional industry are accelerated, and the development of the new industry is accelerated.
Meanwhile, the challenges brought about are also inevitable, which is particularly shown in 1. mass data access. In order to better ensure the production safety and improve the production efficiency, more sensing devices can be added in the traditional production process so as to better monitor the working state and the production quality of related equipment. Therefore, mass data access can cause the increase of network load and network delay; 2. a plurality of protocol conversions. Due to different protocols adopted by various sensors, the difficulty of data interconnection and intercommunication is increased, which is difficult to solve by the traditional gateway equipment; 3. resource management of the edge gateway. The edge gateway device is deployed in an industrial production field, and needs to meet the requirements of wide high temperature, low power consumption and high stability, the existing edge gateway mainly focuses on protocol conversion, data is forwarded to an edge server by the edge gateway for processing, the computing function of the edge gateway is not fully exerted, and when the massive data of the terminal device and the personalized service requirements of users are met, the network scale can only be further enlarged, and the network operation cost is increased.
Disclosure of Invention
In view of this, the present invention aims to overcome the defects in the prior art, and provides a resource scheduling method and system based on an edge gateway, which can fully exert the computing capability of an edge side, ensure the timely response to a terminal device, and reduce the network load.
The resource scheduling method based on the edge gateway comprises the following steps:
s1, acquiring a task sent by terminal equipment; wherein the task comprises a plurality of subtasks;
s2, determining the shortest edge node path for processing the task;
s3, according to a set subtask execution sequence, sequentially selecting an edge node with the minimum time consumption for executing a target subtask from the shortest edge node path as a target node;
and S4, executing the task by using the target node.
Further, step S2 specifically includes:
s21, determining a plurality of edge nodes meeting task level requirements;
and S22, calculating to obtain the shortest edge node path by taking the shortest path between the edge nodes as a target.
Further, step S3 specifically includes:
s31, determining a sub-task execution sequence: t is t1,t2,...,tj,...,tn(ii) a Wherein, tjJ is the jth subtask, and j is the subtask number;
s32, constructing a time consumption model for executing the subtasks:
L＝min(Fj)；
wherein L is an execution subtask tjMinimum value of elapsed time; fjTo perform subtask tjThe elapsed time of (c); the above-mentioned
Figure BDA0003139095240000021
Wherein S isjAs a subtask tjThe start time of (c); the | T | is the number of subtasks in the task T; edge is an Edge node set; edge is an edge node; if the subtask tiIs a subtask tjA predecessor task of (2), then eijIs 1, if the subtask tiNot a subtask tjA predecessor task of (2), then eijIs 0; if the subtask tiObtain the resources of edge node edge, then
Figure BDA0003139095240000022
Is 1, if the subtask tiIf the resources of the edge node edge are not obtained, then
Figure BDA0003139095240000023
Is 0; if the subtask tjObtain the resources of edge node edge, then
Figure BDA0003139095240000024
Is 1, if the subtask tjIf the resources of the edge node edge are not obtained, then
Figure BDA0003139095240000025
Is 0;
Figure BDA0003139095240000026
to perform a subtask tjThe establishment time of the virtual machine;
Figure BDA0003139095240000027
to perform a subtask tjThe calculation time of the time in the edge node edge;
and S33, sequentially adjusting parameter values in the time consumption model corresponding to the target subtask according to the execution sequence of the subtasks, so that the time consumption model obtains a minimum value, and taking the edge node determined when the minimum value is obtained as the target node.
Further, the subtask t is determined according to the following formulajStart time S ofj：
Figure BDA0003139095240000031
Wherein, FkAs a subtask tkThe end time of (d); t isjkAs a subtask tkTransmitting data to subtask tjThe time required; pjAs a subtask tjThe set of predecessors of.
Further, the subtask t is determined according to the following formulajPrecursor set P ofj：
Figure BDA0003139095240000032
Wherein, Task is a subtask set; deltaiAnticipating subtasks t for network systemsiThe time of the end; deltajAnticipating subtasks t for network systemsjThe time of the end.
Further, the execution of the subtask t is determined according to the following formulajSetup time of a temporal virtual machine
Figure BDA0003139095240000033
Figure BDA0003139095240000034
Wherein if there is a sub-task tjIs a mirror image of
Figure BDA0003139095240000035
Is 0, if there is no corresponding subtask tjIs a mirror image of
Figure BDA0003139095240000036
Is 1;
Figure BDA0003139095240000037
to correspond to a subtask tjThe mirror transmission time of (1);
Figure BDA0003139095240000038
is the setup time of the virtual machine instance.
A resource scheduling system based on an edge gateway comprises an edge manager, an edge server and an edge gateway;
the edge manager is in communication connection with the edge server and the edge gateway respectively; the system comprises a task request receiving edge gateway, a network resource and a computing resource, and a scheduling policy, wherein the task request is used for receiving a task request of the edge gateway and scheduling the network resource and the computing resource according to the task request to respond to the task request;
the edge server is in communication connection with the edge gateway; for providing computing resources;
the edge gateway is used for receiving the task request sent by the terminal equipment and forwarding the task request to the edge manager, and meanwhile, computing resources are provided.
Further, the edge manager is respectively connected with the edge server and the edge gateway through a management network.
Further, the edge server is connected with the edge gateway through a physical network.
The invention has the beneficial effects that: the invention discloses a resource scheduling method and system based on an edge gateway, which are characterized in that an edge side resource pool is established between the edge gateway and an edge server, a suitable edge node is selected with the aim of minimizing the time consumed by a request task sent by a terminal device according to the computing resource state and the network resource state of the edge gateway and the edge server, a virtual machine is established in the suitable edge node, and a virtual network is established by utilizing an SDN (software defined network), so that the terminal device obtains the service of the virtual machine. The method effectively ensures the timely response to the terminal equipment and reduces the network transmission load.
Drawings
The invention is further described below with reference to the following figures and examples:
FIG. 1 is a schematic flow diagram of the process of the present invention;
FIG. 2 is a schematic diagram of a resource scheduling system according to the present invention;
FIG. 3 is a schematic diagram of a resource scheduling process according to the present invention.
Detailed Description
The invention is further described with reference to the drawings, as shown in fig. 1:
the resource scheduling method based on the edge gateway comprises the following steps:
s1, acquiring a task sent by terminal equipment; wherein the task comprises a plurality of subtasks; the task comprises one or more subtasks;
s2, determining the shortest edge node path for processing the task;
s3, according to a set subtask execution sequence, sequentially selecting an edge node with the minimum time consumption for executing a target subtask from the shortest edge node path as a target node;
and S4, executing the task by using the target node.
In this embodiment, the step S2 specifically includes:
s21, determining a plurality of edge nodes meeting task level requirements; wherein the TASK may be represented as: TASK ═ { Pri, Graph }; pri is the level of the TASK, Pri includes the resource requirement of the TASK, that is, after receiving the TASK, the edge node meeting the TASK resource requirement is selected by inquiring the current computing resource state ComputeState and the network resource state NetState. Wherein, Graph is a relationship Graph between each subtask in the task, and the relationship Graph may be represented as: graph ═ E (Task, E); wherein, Task is the set of subtasks, and is { t }1,t2,...,tn}; e is the data dependency between the subtasks, E is a 0-1 matrix of n,
Figure BDA0003139095240000051
in particular, there are no loops in the directed acyclic graph DAG, i.e., there are no interdependent data relationships, i.e., there are no data relationships
Figure BDA0003139095240000052
Wherein e isij1 denotes the subtask tiIs a subtask tjA predecessor task of, i.e. tiResult of (a) is tjOf input data of size epsilonij。
And S22, calculating to obtain the shortest edge node path by taking the shortest path between the edge nodes as a target. And calculating the shortest edge node path by using the SDN global view and a Dijkstra algorithm.
In this embodiment, the step S3 specifically includes:
s31, determining a sub-task execution sequence: t is t1,t2,...,tj,...,tn(ii) a Wherein, tjJ is the jth subtask, and j is the subtask number; arranging the subtasks which are not allocated with any platform or resource according to the sequence of time to obtain the execution sequence of the subtasks;
s32, constructing a time consumption model for executing the subtasks:
L＝min(Fj)；
wherein L is an execution subtask tjMinimum value of elapsed time; fjTo perform a subtask tjThe elapsed time of (c); the above-mentioned
Figure BDA0003139095240000053
Wherein S isjAs a subtask tjThe start time of (c); the | T | is the number of subtasks in the task T; edge is a set of Edge nodes, Edge ═ G1,G2...Gk,S1,S2...Sm}，GkDenotes the k-th edge gateway, SmRepresents the mth edge server; edge is an edge node; if the subtask tiIs a subtask tjA predecessor task of, then eijIs 1, if the subtask tiNot a subtask tjA predecessor task of, then eijIs 0; if the subtask tiObtain the resources of edge node edge, then
Figure BDA0003139095240000061
Is 1, if the subtask tiIf the resources of the edge node edge are not obtained, then
Figure BDA0003139095240000062
Is 0; if the subtask tjObtain the resources of edge node edge, then
Figure BDA0003139095240000063
Is 1, if the subtask tjIf the resources of the edge node edge are not obtained, then
Figure BDA0003139095240000064
Is 0;
Figure BDA0003139095240000069
to perform a subtask tjThe establishment time of the virtual machine;
Figure BDA0003139095240000065
to perform a subtask tjA calculated time of hour in edge node edge, said calculated time
Figure BDA0003139095240000066
Determined by the hardware platform configured;
and S33, sequentially adjusting parameter values in the time consumption model corresponding to the target subtask according to the execution sequence of the subtasks, so that the time consumption model obtains a minimum value, and taking the edge node determined when the minimum value is obtained as the target node. Wherein each subtask corresponds to a time consumption model of the subtask, and the subtask is taken as a target subtask. By counting and updating the current computing resource state and network resource state as well as the computing resources and network resources required by the target subtask, the edge node determined when the time consumption model of the target subtask obtains the minimum value is taken as the target node for executing the target subtask; thus, several subtasks have several target nodes.
In this embodiment, the subtask t is determined according to the following formulajStart time S ofj：
Figure BDA0003139095240000067
Wherein, FkAs a subtask tkThe end time of (d); t isjkAs a subtask tkTransmitting data to subtask tjTime required, said time TjkThe method comprises the steps that the SDN is obtained by calculating flow estimation per unit time; pjAs a subtask tjThe set of predecessors of.
In this embodiment, the subtask t is determined according to the following formulajPrecursor set P ofj：
Figure BDA0003139095240000068
Wherein, Task is a subtask set; deltaiAnticipating subtasks t for network systemsiThe time of the end; deltajAnticipating subtasks t for network systemsjThe time of the end. The set of predecessors comprising a direct predecessor and an indirect predecessor; the direct predecessor represents a subtask ti、tjHas an inheritance relationship between them, which can be expressed by the formula ti|ti∈Task,eij1} is represented; the indirect predecessor represents a subtask ti、tjIn the same processing platform, and the network system expects a subtask tiTime of termination deltaiExpecting subtasks t in a network systemjTime of termination deltajBefore, it can use the formula
Figure BDA0003139095240000071
There is shown, in which,
Figure BDA0003139095240000072
representing a subtask tiAnd tjThe resources of the edge node edge are obtained.
In this embodiment, the execution subtask t is determined according to the following formulajSetup time of a temporal virtual machine
Figure BDA0003139095240000073
Figure BDA0003139095240000074
Wherein if there is a sub-task tjIs a mirror image of
Figure BDA0003139095240000075
Is 0, if there is no corresponding subtask tjIs a mirror image of
Figure BDA0003139095240000076
Is 1;
Figure BDA0003139095240000077
to correspond to a subtask tjThe mirror transmission time of (1);
Figure BDA0003139095240000078
is the setup time of the virtual machine instance.
An edge gateway-based resource scheduling system, as shown in fig. 2, includes an edge manager, an edge server, and an edge gateway; the number of the edge servers is multiple, and the number of the edge gateways is multiple;
the edge manager is in communication connection with the edge server and the edge gateway respectively; the system comprises a task request receiving edge gateway, a network resource and a computing resource, and a scheduling policy, wherein the task request is used for receiving a task request of the edge gateway and scheduling the network resource and the computing resource according to the task request to respond to the task request; the edge manager manages edge node resources and provides support services for the system. The edge manager mainly comprises a distributed controller and an SDN controller, wherein the distributed controller manages computing resources of edge nodes; the SDN controller manages the network topology of the system. And after obtaining the scheduling strategy, the edge manager establishes a virtual machine in the corresponding edge server or edge gateway to respond to the TASK.
The edge server is in communication connection with the edge gateway; for providing computing resources; the edge server and the edge gateway construct an edge side resource pool, and the edge manager can establish a virtual machine and an Overlay virtual network in the edge server and the edge gateway to form a service chain for the terminal equipment, so that the quick response of the edge side to the terminal equipment is realized.
The edge gateway is used for receiving the task request sent by the terminal equipment and forwarding the task request to the edge manager, and meanwhile, computing resources are provided. And the edge gateway is directly connected with the terminal equipment.
The resource scheduling system realizes the service to the terminal equipment by deploying the virtual machine by the edge manager; and the forwarding flow table can be changed according to the SDN controller instruction in the edge manager, so that network programmability is realized.
In this embodiment, the edge manager is connected to the edge server and the edge gateway through a management network. The management network, namely a network in which an edge control manager is respectively connected with an edge server and an edge gateway, is responsible for transmitting management information, the edge manager is deployed in the management network, management of each edge node is realized through the management network, different virtual networks are constructed in a physical network through an SDN (software defined network) controller, the virtual networks are mutually isolated, and then 'transfer control separation' is realized.
In this embodiment, the edge server is connected to the edge gateway through a physical network. The physical network is a network in which the edge server and the edge gateway are connected, is a basis for constructing a virtual network, and is responsible for continuously forwarding and processing the information related to the terminal equipment.
The scheduling process of the resource scheduling system based on the edge gateway is explained, as shown in fig. 3:
when the terminal equipment needs the task to be processed by the resource scheduling system, request information for processing the task is sent to the edge gateway, and the request information is a REST request and comprises an IP address and a port of an edge manager and a task set in a request task. The request information is forwarded through the edge gateway, and is sent to the edge manager through the management network, and then the edge manager performs subsequent unified scheduling. The edge manager analyzes the resource requirement of the task according to the task request; from task time sensitivity, a virtual machine is used for establishing a time model, a calculation time model and a network transmission time model to construct a resource scheduling target, the resource scheduling target is realized through a scheduling method, and a scheduling result is obtained and executed.
Finally, although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that various changes and modifications may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.

Claims (7)

1. A resource scheduling method based on an edge gateway is characterized in that: the method comprises the following steps:
constructing a resource scheduling system based on an edge gateway;
s1, acquiring a task sent by terminal equipment; wherein the task comprises a plurality of subtasks;
s2, determining the shortest edge node path for processing the task; the method specifically comprises the following steps:
s21, determining a plurality of edge nodes meeting task level requirements;
s22, calculating to obtain a shortest edge node path by taking the shortest path between edge nodes as a target;
s3, according to a set subtask execution sequence, sequentially selecting an edge node with the minimum time consumption for executing a target subtask from the shortest edge node path as a target node; the method specifically comprises the following steps:
s31, determining a sub-task execution sequence: t is t1,t2,...,tj,...,tn(ii) a Wherein, tjJ is the jth subtask, and j is the subtask number;
s32, constructing a time consumption model for executing the subtasks:
L＝min(Fj)；
wherein L is an execution subtask tjTime consumingMinimum value of (d); fjTo perform a subtask tjThe elapsed time of (c); the above-mentioned
Figure FDA0003581048750000011
Wherein S isjAs a subtask tjThe start time of (c); the | T | is the number of subtasks in the task T; edge is an Edge node set; edge is an edge node; if the subtask tiIs a subtask tjA predecessor task of, then eijIs 1, if the subtask tiNot a subtask tjA predecessor task of, then eijIs 0; if the subtask tiObtain the resources of edge node edge, then
Figure FDA0003581048750000012
Is 1, if the subtask tiIf the resources of the edge node edge are not obtained, then
Figure FDA0003581048750000013
Is 0; if the subtask tjObtain the resources of edge node edge, then
Figure FDA0003581048750000014
Is 1, if the subtask tjIf the resources of the edge node edge are not obtained, then
Figure FDA0003581048750000015
Is 0;
Figure FDA0003581048750000016
to perform a subtask tjThe establishment time of the virtual machine;
Figure FDA0003581048750000017
to perform a subtask tjThe calculation time of the time in the edge node edge;
s33, according to the execution sequence of the subtasks, sequentially adjusting parameter values in a time consumption model corresponding to the target subtask to enable the time consumption model to obtain a minimum value, and taking an edge node determined when the minimum value is obtained as a target node;
and S4, executing the task by using the target node.
2. The edge gateway-based resource scheduling method of claim 1, wherein: determining the subtask t according to the following formulajStart time S ofj：
Figure FDA0003581048750000021
Wherein, FkAs a subtask tkThe end time of (d); t isjkAs a subtask tkTransmitting data to subtask tjThe time required; pjAs a subtask tjThe set of predecessors of.
3. The edge gateway-based resource scheduling method of claim 2, wherein: determining the subtask t according to the following formulajPrecursor set P ofj：
Figure FDA0003581048750000022
Wherein, Task is a subtask set; deltaiAnticipating subtasks t for network systemsiThe time of the end; deltajAnticipating subtasks t for network systemsjThe time of the end.
4. The edge gateway-based resource scheduling method of claim 1, wherein: determining to execute the subtask t according to the following formulajSetup time of a temporal virtual machine
Figure FDA0003581048750000023
Figure FDA0003581048750000024
Wherein if there is a sub-task tjIs a mirror image of
Figure FDA0003581048750000025
Is 0, if there is no corresponding subtask tjIs a mirror image of
Figure FDA0003581048750000026
Is 1;
Figure FDA0003581048750000027
to correspond to a subtask tjThe mirror transmission time of (1);
Figure FDA0003581048750000028
is the setup time of the virtual machine instance.
5. The method for resource scheduling based on an edge gateway according to claim 1, wherein: the resource scheduling system based on the edge gateway comprises an edge manager, an edge server and the edge gateway;
the edge manager is in communication connection with the edge server and the edge gateway respectively; the system comprises a task request receiving edge gateway, a network resource and a computing resource, and a scheduling policy, wherein the task request is used for receiving a task request of the edge gateway and scheduling the network resource and the computing resource according to the task request to respond to the task request;
the edge server is in communication connection with the edge gateway; for providing computing resources;
the edge gateway is used for receiving the task request sent by the terminal equipment and forwarding the task request to the edge manager, and meanwhile, computing resources are provided.
6. The edge gateway-based resource scheduling method of claim 5, wherein: the edge manager is respectively connected with the edge server and the edge gateway through a management network.
7. The edge gateway-based resource scheduling method of claim 5, wherein: the edge server is connected with the edge gateway through a physical network.
CN202110730350.3A 2021-06-29 2021-06-29 Resource scheduling method and system based on edge gateway Active CN113542371B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110730350.3A CN113542371B (en) 2021-06-29 2021-06-29 Resource scheduling method and system based on edge gateway

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110730350.3A CN113542371B (en) 2021-06-29 2021-06-29 Resource scheduling method and system based on edge gateway

Publications (2)

Publication Number Publication Date
CN113542371A CN113542371A (en) 2021-10-22
CN113542371B true CN113542371B (en) 2022-05-17

Family

ID=78097169

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110730350.3A Active CN113542371B (en) 2021-06-29 2021-06-29 Resource scheduling method and system based on edge gateway

Country Status (1)

Country Link
CN (1) CN113542371B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114024894B (en) * 2021-11-03 2023-04-25 苏州全时空信息技术有限公司 Dynamic calculation method and system in software-defined heaven-earth integrated network

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109905470A (en) * 2019-02-18 2019-06-18 南京邮电大学 A kind of expense optimization method for scheduling task based on Border Gateway system

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7660296B2 (en) * 2005-12-30 2010-02-09 Akamai Technologies, Inc. Reliable, high-throughput, high-performance transport and routing mechanism for arbitrary data flows
SE535670C2 (en) * 2009-04-01 2012-11-06 Synapse Int Sa A system and method for enabling the shortest connection path for a mobile body
CN102395181B (en) * 2011-11-07 2014-11-05 华为技术有限公司 Method and device for scheduling resources
US9832168B2 (en) * 2014-07-01 2017-11-28 Cable Television Laboratories, Inc. Service discovery within multi-link networks
GB201507208D0 (en) * 2015-04-28 2015-06-10 Sonitor Technologies As Location system
KR102471665B1 (en) * 2015-08-27 2022-11-25 포그혼 시스템스 인코포레이티드 Edge Intelligence Platform and Internet of Things Sensor Stream System
CN108092888B (en) * 2017-10-31 2021-06-08 华为技术有限公司 Transmission method, gateway and transmission system based on Overlay network
US11533268B2 (en) * 2018-03-30 2022-12-20 Intel Corporation Methods and apparatus to schedule service requests in a network computing system using hardware queue managers
CN108924198B (en) * 2018-06-21 2021-05-11 中国联合网络通信集团有限公司 Data scheduling method, device and system based on edge calculation
AU2019200432A1 (en) * 2018-12-07 2020-06-25 Fleet Space Technologies Pty Ltd Remote LPWAN gateway with backhaul over a high-latency communication system
CN110365541B (en) * 2019-07-31 2021-06-15 腾讯科技（深圳）有限公司 Method for generating corresponding relation in gateway, and method and device for sending instruction
CN110519374B (en) * 2019-08-28 2021-09-28 西南大学 Edge computing method of ZigBee networked industrial control system and edge node thereof
CN112422687A (en) * 2020-11-19 2021-02-26 青岛海尔科技有限公司 Route decision method and device and storage medium
CN112995348B (en) * 2021-05-12 2021-09-07 北京金山云网络技术有限公司 Control method, device and system of Internet of things equipment

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109905470A (en) * 2019-02-18 2019-06-18 南京邮电大学 A kind of expense optimization method for scheduling task based on Border Gateway system

Also Published As

Publication number Publication date
CN113542371A (en) 2021-10-22

Similar Documents

Publication Publication Date Title
WO2021190482A1 (en) Computing power processing network system and computing power processing method
Cheng et al. FogFlow: Easy programming of IoT services over cloud and edges for smart cities
Giang et al. Developing iot applications in the fog: A distributed dataflow approach
CN114756340A (en) Computing power scheduling system, method, device and storage medium
CN111030835B (en) Task scheduling model of TTFC network and message scheduling table generation method
WO2019001092A1 (en) Load balancing engine, client, distributed computing system, and load balancing method
CN107846371B (en) QoE resource allocation method for multimedia service
Veeramanikandan et al. Publish/subscribe based multi-tier edge computational model in Internet of Things for latency reduction
JP5104489B2 (en) Distributed event detection system, distributed event detection method, and distributed event detection program
JP2015515037A (en) A method for mapping media components that employ machine learning
Ji et al. Dynamic network slicing orchestration for remote adaptation and configuration in industrial IoT
Kliazovich et al. CA-DAG: Communication-aware directed acyclic graphs for modeling cloud computing applications
CN113660316B (en) Network resource adaptive configuration method, system and medium based on container cloud platform
CN116389491B (en) Cloud edge computing power resource self-adaptive computing system
CN113542371B (en) Resource scheduling method and system based on edge gateway
CN112162789A (en) Edge calculation random unloading decision method and system based on software definition
Simoens et al. Challenges for orchestration and instance selection of composite services in distributed edge clouds
Cao et al. A deep reinforcement learning approach to multi-component job scheduling in edge computing
Kanwal et al. A genetic based leader election algorithm for IoT cloud data processing
Del Gaudio et al. A lightweight messaging engine for decentralized data processing in the internet of things
Pham Traffic engineering based on reinforcement learning for service function chaining with delay guarantee
US20150127799A1 (en) Hierarchical distribution of control information in a massively scalable network server
WO2023186002A1 (en) Resource scheduling method, apparatus and device
JP2016127393A (en) Information processing unit, method and program
CN111049900A (en) Internet of things flow calculation scheduling method and device and electronic equipment

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