CN115604170A - Edge network container data routing method and system for distributed equipment aggregation - Google Patents
Edge network container data routing method and system for distributed equipment aggregation Download PDFInfo
- Publication number
- CN115604170A CN115604170A CN202211155318.8A CN202211155318A CN115604170A CN 115604170 A CN115604170 A CN 115604170A CN 202211155318 A CN202211155318 A CN 202211155318A CN 115604170 A CN115604170 A CN 115604170A
- Authority
- CN
- China
- Prior art keywords
- container
- linked list
- node
- control
- nodes
- 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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method and a system for routing edge network container data for distributed equipment aggregation, wherein the method comprises the following steps: on one hand, the dispatching center sends the linked list to each control container, each control container automatically searches the path and adds the path into the linked list, and the linked list is returned to the dispatching center after the path search is completed; and on the other hand, the scheduling center selects the data of the linked list with the minimum node number according to the received linked list to update the pheromone concentration of the communication link until the variance of the sequence formed by the node numbers of the plurality of linked lists newly received by the scheduling center meets the convergence condition, and finally extracts the data of the linked list with the minimum node number in the queue to obtain the data transmission routing path of the control container which meets the scheduling requirement and has the minimum communication cost. The invention can obtain the container data transmission routing path with the minimum communication cost for dispatching the distributed equipment, reduce the communication overhead of the cooperative interaction of the distributed equipment control containers in the edge network and improve the reliability of the aggregated dispatching of the distributed equipment.
Description
Technical Field
The invention relates to the field of digital information transmission of distribution Internet of things edge calculation, in particular to an edge network container data routing method and system for distributed equipment aggregation.
Background
Under the background that massive distributed power resources are accessed into the power distribution system, massive data generated by distributed equipment are processed through the edge device, and data transmission pressure and data processing delay of a communication network of the power distribution system are reduced. A plurality of edge devices of a communication network of a power distribution system are interconnected to form a power distribution edge network, a control container of the edge device is in reliable communication connection with a distributed equipment terminal, the control container bears the information interaction function controlled by the distributed equipment, the characteristic of lightweight data isolation of the control container is exerted, and the distributed equipment terminal is mapped to be a container node of the edge network.
Based on Software Defined Network (SDN) and edge computing technology, unified management is carried out on computing and communication resources of edge devices of a power distribution system, data routing between distributed equipment control containers is adjusted, and information interaction efficiency between the edge network containers is improved. However, the current distributed device scheduling communication route is unorganized, and an optimal route path is difficult to obtain, so that the problem of high communication cost of distributed device coordination control is caused.
Disclosure of Invention
The invention provides a data routing method and a data routing system for an edge network container for distributed equipment aggregation, which aim to solve the problem of high communication cost of the existing distributed equipment coordination control.
In a first aspect, an edge network container data routing method for distributed device aggregation is provided, where the method includes:
s1: the dispatching center generates a linked list of the power control quantity of the distributed equipment according to dispatching requirements and sends the linked list to control containers of all the edge devices;
s2: after each control container receives the linked list, extracting scheduling constraints of the header nodes, wherein the scheduling constraints comprise root node adjusting time, root node adjusting power and a distribution network root node set;
s3: comparing the scheduling constraint of the table header node in the linked list with the distributed equipment data in the control container by the control container; when the equipment adjusting time is longer than the root node adjusting time and the equipment distribution network node number belongs to a distribution network root node set, writing the distributed equipment data in the control container into the linked list nodes, and updating the root node adjusting power of the list node by using the residual adjusting power; otherwise, executing step S5;
s4: when the adjusting power of the root node in the header nodes is more than zero, building a linked list node and executing the step S5; otherwise, when the adjusting power of the root node in the header node is less than or equal to zero, executing the step S7;
s5: the control container obtains the communication cost and the communication link pheromone concentration of all the control containers adjacent to the control container, and the forwarding probability of the linked list in different links is calculated; determining a forwarding link in a roulette mode, writing a destination container address of the forwarding link into a newly-built linked list node, and forwarding the linked list to a next control container;
s6: repeating the steps S2 to S5;
s7: the control container transmits the linked list to a dispatching center, the dispatching center calculates the number of nodes of the linked list after receiving the linked list, and the linked list is inserted into a queue with the smallest number of nodes and with dequeuing priority; forming a node number sequence X (N) by N linked list node numbers inserted into the queue newly, wherein N is less than or equal to N, and calculating the variance D [ X (N) ] of the node number sequence; when the variance satisfies the convergence condition, that is, the variance satisfies D [ X (n) ] < μ, where μ is a preset threshold, performing step S9; otherwise, executing step S8;
s8: extracting container addresses and distributed equipment data of all nodes of a linked list with the minimum number of nodes in the queue, calculating the pheromone concentration of a communication link corresponding to the container addresses, and updating the pheromone concentration of the communication link between the containers; returning to the step S7;
s9: extracting the data of the linked list with the minimum number of nodes in the queue to obtain a control container data transmission routing path which meets the scheduling requirement and has the minimum communication cost
Further, step S1 is preceded by:
s0: the method comprises the steps that a dispatching center issues a distributed equipment aggregation dispatching instruction to an edge device, the edge device starts a controlled container after receiving the instruction, and after the controlled container and the distributed equipment establish unique mapping relation and communication connection, equipment adjusting power, equipment adjusting time, equipment type codes and equipment distribution network node numbers of the distributed equipment are obtained and packaged into distributed equipment data in the controlled container.
Further, the process of comparing the scheduling constraint of the header node with the distributed device data in the control container in step S3 is as follows:
distribution network root node set R for controlling container i to extract head nodes root And acquiring the equipment distribution network node number R of the distributed equipment i i And judging the equipment distribution network node number R i Whether the node belongs to a distribution network root node set R root (ii) a Obtaining distribution network root node adjusting time T agg Device throttling time with distributed device i
Comparing root node adjustment times T of header nodes agg Time adjustment with the apparatus
If it is
Or
Skipping step S4 and executing step S5; if R is i ∈R root And is
Controlling a container to obtain device regulated power for distributed devices
The available capacity loss for distributed device power scaling is calculated as:
regulating power of distributed devices
Loss of available capacity
And equipment distribution network node number R i And writing the linked list nodes.
Further, updating the root node regulation power of the table head node with the residual regulation power comprises:
regulating power according to equipment
Calculating the remaining regulated power of the header node
Wherein, P agg Adjusting power for the root node, wherein k is the total number of nodes of non-header nodes in the linked list;
regulating power with surplus
And replacing the root node of the header node to adjust the power, and realizing the update of the root node adjusted power.
Further, the forwarding probability of the linked list at different links is calculated by the following method:
the control container where the current linked list is located is taken as a source container, and the container address is recorded as w i (ii) a The control container which can be reached by linked lists adjacently is taken as a target container, and the container address is recorded as w j The average bandwidth occupancy of the communication link from the source container to the destination container is
Average time delay of
The link transmits data at a communication cost of
Alpha is parameter weight, and the communication link pheromone concentration of the link is lambda i,j Obtaining the forwarding probability P (i, j) of the linked list in the link as follows:
wherein, U is the control container address set that the current linked list is adjacent to and can reach, and C is the control container address set that the forwarding path of the current linked list passes through.
Further, the determining of the forwarding link by the roulette method specifically includes:
correspondingly dividing the interval of [0,1] into a plurality of subintervals according to the forwarding probability of the linked list in different links;
according to roulette rules, the control container generates a random number between 0 and 1, and a corresponding forwarding link is determined according to a subinterval to which the random number belongs.
Further, updating the pheromone concentration of the communication link between the control containers specifically includes:
taking the container address of a node in the linked list with the minimum number of nodes in the queue as the container address of the source container i, and extracting the container address of the node of the next linked list of the source container i as the container address of the target container j, wherein the communication link pheromone concentration updating formula is as follows:
wherein λ is i,j Indicating the pheromone concentration of the communication link between control containers i and j,
the device representing the destination container j adjusts the power,
representing the available capacity loss of a target container j, wherein k is the total number of nodes of non-header nodes in a linked list, sigma is an pheromone volatilization factor, and m is the global pheromone updating frequency;
and updating the concentration of the pheromone of the communication link between all adjacent control containers in the linked list with the minimum node number by adopting the communication link pheromone concentration updating formula.
In a second aspect, an edge network container data routing system for distributed device aggregation is provided, including:
the dispatching center is used for generating a linked list of the power control quantity of the distributed equipment according to dispatching requirements and sending the linked list to the control containers of the edge devices; and realizing the optimal routing path selection, wherein the optimal routing path selection process is as follows:
a1: receiving a linked list returned by a control container, calculating the node number of the linked list, inserting the linked list into a queue with the node number being minimum and dequeuing being preferred, forming a node number sequence by N node numbers of the linked list newly inserted into the queue, and calculating the variance of the node number sequence; when the variance meets the convergence condition, executing the step A3; otherwise, executing the step A2;
a2: extracting container addresses and distributed equipment data of all nodes of a linked list with the minimum number of nodes in the queue, calculating the pheromone concentration of a communication link corresponding to the container addresses, and updating and controlling the pheromone concentration of the communication link between the containers; returning to the step A1;
a3: extracting data of a linked list with the minimum number of nodes in the queue to obtain a control container data transmission routing path which meets the scheduling requirement and has the minimum communication cost;
the system comprises a plurality of control containers, wherein each control container is correspondingly arranged in an edge device and is used for realizing the forwarding of the linked list, and the forwarding process of the linked list comprises the following steps:
b1: after the control container receives the linked list, extracting scheduling constraints of the header nodes, wherein the scheduling constraints comprise root node adjusting time, root node adjusting power and a distribution network root node set;
b2: comparing the scheduling constraints of the header nodes with the distributed equipment data in the control container; when the equipment adjusting time is longer than the root node adjusting time and the equipment distribution network node number belongs to a distribution network root node set, writing the distributed equipment data into the linked list nodes and updating the root node adjusting power of the head nodes with the residual adjusting power; otherwise, executing step B4;
b3: when the adjusting power of the root node in the header nodes is more than zero, building a linked list node and executing the step B4; otherwise, the linked list is forwarded to the dispatching center;
b4: acquiring the communication cost and the pheromone concentration of communication links of all control containers adjacent to the control containers, and calculating the forwarding probability of the linked list in different links; determining a forwarding link in a roulette mode, writing a destination container address of the forwarding link into a newly-built linked list node, and forwarding the linked list to a next control container;
b5: and (5) repeating the steps B1 to B4.
Advantageous effects
The invention has proposed a edge network container data routing method and system used for distributed apparatus to aggregate, including two cycles of running at the same time, one of them is that the control center sends the link table to each control container, each control container searches the route automatically and joins the link table, return the link table to the control center after finishing the route search; and the other is that the dispatching center updates the pheromone concentration of the communication link according to the data of the linked list with the minimum node number received by the dispatching center, realizes the updating of the current optimal link weight, acts on the previous cycle, improves the maximum power of the control container and the selection probability of the optimal link until the variance of the sequence formed by the node numbers of the linked lists received by the dispatching center most recently meets the convergence condition, and finally extracts the data of the linked list with the minimum node number in the queue to obtain the data transmission routing path of the control container, which meets the dispatching requirement and has the minimum communication cost. The distributed device adjustable resource self-heuristic search method can obtain a container data transmission routing path with the minimum communication scheduling cost of the distributed device, reduce the communication overhead of the distributed device control container cooperative interaction in the edge network, and improve the reliability of distributed device aggregation scheduling.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart of an edge network container data routing method for distributed device aggregation according to an embodiment of the present invention;
fig. 2 is a schematic diagram of edge network information interaction for aggregation control of distributed devices according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be described in detail below. It is to be understood that the described embodiments are merely exemplary of the invention, and not restrictive of the full scope of the invention. All other embodiments, which can be derived by a person skilled in the art from the examples given herein without any inventive step, are within the scope of the present invention.
The invention relates to an information transmission process of distributed resource aggregation of a power distribution system, which is used for determining an optimal transmission path of distributed resource scheduling information so as to reduce communication overhead of distributed coordination control of massive flexible resources. The following detailed description of embodiments of the invention refers to the accompanying drawings.
An embodiment of the present invention provides a method for routing container data of an edge network for aggregation of distributed devices, where as shown in fig. 2, a scheduling center issues a linked list of device power control quantities to an edge device according to a scheduling requirement of a distribution network. The control container of the distributed equipment is deployed on the edge device and is responsible for data acquisition and coordination control of the distributed equipment. In one embodiment, the control container is a collection of micro-service programs, including micro-service programs such as collection, control, analysis, remote interface, etc., and has the capability of acquiring data and analyzing decision independently through networking. The control container is in communication connection with the distributed equipment by using the edge device, directly exchanges data with the communication interface of the distributed equipment to acquire the real-time state of the distributed equipment, and dynamically adjusts the real-time power of the equipment according to the scheduling instruction.
Specifically, in an edge network formed by interconnection of edge devices, the following method is adopted to carry out information interaction coordination of distributed equipment and control data routing self-organization coordination in a container group. As shown in fig. 1, the method specifically comprises the following steps:
s1: the dispatching center issues a distributed equipment aggregation dispatching instruction to the edge device, the edge device initializes the control container after receiving the instruction, the edge device starts the control container of the governed distributed equipment and distributes a unique communication address w of an edge network for the control container i . The edge device binds the data interface of the distributed equipment terminal with the control container, and establishes the unique communication connection and mapping relation between the distributed equipment and the control container. The control container obtains distributed device data, determines device adjustment power, device adjustment time, device distribution network node number, device type and the like of a single device, and stores the device adjustment power, the device adjustment time, the device distribution network node number, the device type and the like in a data mounting volume of the control container.
S2: and the dispatching center determines the adjusting power and the adjusting time of the distributed equipment aggregate dispatching according to the dispatching requirement of the distribution network, and generates a linked list of the distributed equipment power control quantity. And the dispatching center acquires the load of the edge network, sets the maximum sending quantity of the linked lists, and sends the linked lists to a control container of the distribution network edge device.
S3: the control container i receives the linked list, extracts the scheduling constraints of the head nodes, the scheduling constraints including the root node adjustment time T agg Root node adjusts power P agg Distribution network root node set R root . The distribution network root node set comprises distribution network node numbers of all root node subordinate nodes.
S4: controlling container i to obtain distributed device data to adjust time for devices
Plant regulating power
Equipment distribution network node number R i The control container compares the table head node data in the chain table with the distributed equipment data;
distribution network root node set R for controlling container i to extract head nodes root And acquiring the equipment distribution network node number R of the distributed equipment i i And judging the equipment distribution network node number R i Whether belong to distribution network root node set R root (ii) a Obtaining root node adjustment time T agg Device throttling time with distributed device i
Comparing root node adjustment times T of header nodes agg Time adjustment with the apparatus
If it is
Or
Skipping S5, executing S6, wherein the corresponding node in the linked list still retains the container address of the control container, but the distributed device data is empty; if R is i ∈R root And is
Device throttling power to control container to obtain distributed device i
Calculating available capacity loss for distributed device power scaling
Comprises the following steps:
regulating power according to equipment
Calculating the remaining regulated power of the header node
k is the total number of nodes of non-header nodes in the linked list; regulating power to a device
Loss of available capacity
Device distribution network node number R i Writing to linked list nodes to adjust power with residual
And replacing the root node of the header node to adjust the power, and realizing the update of the root node adjusted power.
S5: the control container reads the root node adjusting power (namely the residual adjusting power) in the head nodes of the table, when the root node adjusting power is larger than zero, a linked list node is newly built at the tail part of the linked list, and the step S6 is executed; otherwise, step S8 is performed.
S6: the edge device traverses the control container addresses of the linked list nodes to obtain a control container address set C passed by the linked list forwarding path; acquiring a control container address set which is adjacent to and reachable by the current linked list as U; the control container i where the current linked list is located is the source container, and the address is recorded as w i (ii) a The control container j which can be reached by the adjacent linked list is the target container, and the address is recorded as w j Obtaining the average bandwidth occupancy rate of a communication link between a control container i and a control container j
Average time delay of
Calculating communication cost of data transmitted by link
Alpha is the parameter weight; obtaining the pheromone concentration of a communication link between a control container i and a control container j to be lambda i,j The link table forwarding probability P (i, j) is calculated as:
correspondingly dividing the interval of [0,1] into a plurality of subintervals according to the forwarding probability of the linked list in different links; according to the roulette rule, the control container generates a random number between 0 and 1, and determines a corresponding forwarding link according to a sub-interval to which the random number belongs. And writing the destination container address of the forwarding link into the newly-built linked list node, and forwarding the linked list data to the next control container.
S7: and repeating the steps S3 to S6.
S8: the control container forwards the linked list to the dispatch center.
S9: the dispatching center receives the linked list data, calculates the node number of the single linked list, and inserts the linked list into the queue with the node number being minimum and dequeuing being prior;
taking the node numbers of the N (10 in this embodiment) linked lists that are newly enqueued to form a node number sequence X (N) = { k = 1 、k 2 、…、k 10 }, calculating the variance D [ X (n) of the node number sequence](ii) a When the variance satisfies the convergence condition D [ X (n)]When the mu is less than or equal to mu, the mu is a preset threshold value, and the step S11 is executed; otherwise, step S10 is executed.
S10: extracting the container address of the link list with the minimum number of nodes in the queue and the distributed equipment data, taking the container address of a node in the link list with the minimum number of nodes in the queue as the container address of a source container i, and extracting the container address of a node of the next link list of the source container i as the container address of a target container j, wherein the communication link pheromone concentration updating formula is as follows:
wherein λ is i,j Indicating the pheromone concentration of the communication link between control containers i and j,
the device representing the destination container j adjusts the power,
representing the available capacity loss of a target container j, wherein k is the total number of nodes of non-header nodes in a linked list, s is an pheromone volatilization factor, and m is the global pheromone updating frequency;
and updating the communication link pheromone concentration between all adjacent control containers in the linked list with the minimum node number by adopting the communication link pheromone concentration updating formula. After the update is completed, the process returns to step S9.
The process realizes the updating of the current optimal link weight, acts in the step S6, and improves the maximum power of the control container and the selection probability of the optimal link, so that the linked list newly received by the scheduling center is the linked list with the minimum node number.
S11: and extracting the data of the link table with the minimum number of nodes in the queue to obtain a control container data transmission routing path which meets the scheduling requirement and has the minimum communication cost.
As can be seen from the above steps and fig. 1, the method includes two cycles running simultaneously, one of which is that the scheduling center sends a linked list to each control container, each control container automatically searches for a path and adds the linked list, and the linked list is returned to the scheduling center after the path search is completed; and the other is that the dispatching center selects the data of the linked list with the minimum node number according to the received linked list to update the pheromone concentration of the communication link, so as to realize the update of the current optimal link weight, the selection probability of the optimal link and the maximum power of the control container is improved when the selection probability acts on the previous cycle until the variance of a sequence formed by the node numbers of the linked lists received by the dispatching center at the latest meets the convergence condition, and finally, the data of the linked list with the minimum node number in the queue is extracted, so that the data transmission routing path of the control container, which meets the dispatching requirement and has the minimum communication cost, is obtained. The self-heuristic search method for the adjustable resources of the distributed equipment can obtain a container data transmission routing path with the minimum dispatching communication cost of the distributed equipment, reduce the communication overhead of cooperative interaction of the control containers of the distributed equipment in the edge network and improve the reliability of aggregate dispatching of the distributed equipment.
The embodiment of the present invention further provides an edge network container data routing system for distributed device aggregation, including:
the dispatching center is used for generating a linked list of the power control quantity of the distributed equipment according to dispatching requirements and sending the linked list to the control containers of the edge devices; and realizing the optimal routing path selection, wherein the optimal routing path selection process is as follows:
a1: receiving a linked list returned by the control container, calculating the node number of the linked list, inserting the linked list into a queue with the node number being minimum and being dequeued preferentially, forming a node number sequence by N linked list node numbers newly inserted into the queue, and calculating the variance of the node number sequence; when the variance meets the convergence condition, executing the step A3; otherwise, executing the step A2;
a2: extracting container addresses and distributed equipment data of all nodes of a linked list with the minimum number of nodes in the queue, calculating the pheromone concentration of a communication link corresponding to the container addresses, and updating and controlling the pheromone concentration of the communication link between the containers; returning to the step A1;
a3: extracting data of a linked list with the minimum number of nodes in the queue to obtain a control container data transmission routing path which meets the scheduling requirement and has the minimum communication cost;
the system comprises a plurality of control containers, wherein each control container is correspondingly arranged in an edge device and is used for realizing the forwarding of the linked list, and the forwarding process of the linked list comprises the following steps:
b1: after the control container receives the linked list, extracting scheduling constraints of the header nodes, wherein the scheduling constraints comprise root node adjusting time, root node adjusting power and a distribution network root node set;
b2: comparing the scheduling constraints of the header nodes with the distributed equipment data in the control container; when the equipment adjusting time is longer than the root node adjusting time and the equipment distribution network node number belongs to a distribution network root node set, writing the distributed equipment data into the linked list nodes and updating the root node adjusting power of the head nodes with the residual adjusting power; otherwise, executing step B4;
b3: when the adjusting power of the root node in the header nodes is more than zero, building a linked list node and executing the step B4; otherwise, the linked list is forwarded to a dispatching center;
b4: acquiring the communication cost and the pheromone concentration of communication links of all control containers adjacent to the control containers, and calculating the forwarding probability of the linked list in different links; determining a forwarding link in a roulette mode, writing a destination container address of the forwarding link into a newly-built linked list node, and forwarding the linked list to a next control container;
b5: and (5) repeating the steps B1 to B4.
It is understood that the same or similar parts in the above embodiments may be mutually referred to, and the same or similar parts in other embodiments may be referred to for the content which is not described in detail in some embodiments.
Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made to the above embodiments by those of ordinary skill in the art within the scope of the present invention.
Claims (8)
1. An edge network container data routing method for distributed device aggregation, comprising:
s1: the dispatching center generates a linked list of the distributed equipment power control quantity according to dispatching requirements and sends the linked list to the control containers of the edge devices;
s2: after the control container receives the linked list, extracting scheduling constraints of the header nodes, wherein the scheduling constraints comprise root node adjusting time, root node adjusting power and a distribution network root node set;
s3: the control container compares the scheduling constraint of the header node with the distributed equipment data in the control container; when the equipment adjusting time is longer than the root node adjusting time and the equipment distribution network node number belongs to a distribution network root node set, writing the distributed equipment data into the linked list nodes and updating the root node adjusting power of the head nodes with the residual adjusting power; otherwise, executing step S5;
s4: when the adjusting power of the root node in the header nodes is more than zero, building a linked list node and executing the step S5; otherwise, executing step S7;
s5: the control container obtains the communication cost and the communication link pheromone concentration of all the control containers adjacent to the control container, and the forwarding probability of the linked list in different links is calculated; determining a forwarding link in a roulette mode, writing a destination container address of the forwarding link into a newly-built linked list node, and forwarding the linked list to a next control container;
s6: repeating the steps S2 to S5;
s7: the control container transmits the linked list to a dispatching center, the dispatching center calculates the number of nodes of the linked list, and the linked list is inserted into a queue with the minimum number of nodes and with dequeuing priority; the node numbers of the N linked lists inserted into the queue at the latest form a node number sequence, and the variance of the node number sequence is calculated; when the variance meets the convergence condition, executing step S9; otherwise, executing step S8;
s8: extracting container addresses and distributed equipment data of all nodes of a linked list with the minimum number of nodes in the queue, calculating the pheromone concentration of a communication link corresponding to the container addresses, and updating and controlling the pheromone concentration of the communication link between the containers; returning to the step S7;
s9: and extracting the data of the link table with the minimum number of nodes in the queue to obtain a control container data transmission routing path which meets the scheduling requirement and has the minimum communication cost.
2. The edge network container data routing method for distributed device aggregation according to claim 1, wherein step S1 is preceded by:
s0: the method comprises the steps that a dispatching center issues a distributed equipment aggregation dispatching instruction to an edge device, the edge device starts a controlled container after receiving the instruction, and after the controlled container and the distributed equipment establish unique mapping relation and communication connection, equipment adjusting power, equipment adjusting time, equipment type codes and equipment distribution network node numbers of the distributed equipment are obtained and packaged into distributed equipment data in the controlled container.
3. The edge network container data routing method for distributed device aggregation according to claim 1, wherein the process of comparing the scheduling constraint of the header node with the distributed device data in the control container in step S3 is as follows:
distribution network root node set R for controlling container i to extract head nodes root And acquiring the equipment distribution network node number R of the distributed equipment i i Judging the equipment distribution network node number R i Whether the node belongs to a distribution network root node set R root (ii) a Obtaining distribution network root node adjusting time T agg Device throttling time with distributed device i
Comparing root node adjustment times T of header nodes agg Time adjustment with the apparatus
If it is
Or
Skipping step S4 and executing step S5; if R is i ∈R root And is
Device throttling power to control container to obtain distributed device i
The available capacity loss for distributed device power scaling is calculated as:
regulating power of distributed device i
Loss of available capacity
And equipment distribution network node number R i And writing the linked list nodes.
4. The edge network container data routing method for distributed device aggregation according to claim 3, wherein updating a root node of a header node with remaining throttling power to throttle power comprises:
regulating power according to equipment
Calculating the remaining regulated power of the header node
Wherein, P agg Adjusting power for the root node, wherein k is the total number of nodes which are not header nodes in the linked list;
regulating power with surplus
And replacing the root node of the header node to adjust the power, and realizing the update of the root node adjusted power.
5. The edge network container data routing method for distributed device aggregation according to claim 1, wherein the forwarding probabilities of linked lists at different links are calculated by:
taking the control container where the current linked list is located as the source container, and recording the container address as w i (ii) a The control container which can be reached by linked lists adjacently is taken as a target container, and the container address is recorded as w j From a source containerAverage bandwidth occupancy of the communication link to the destination container of
Average time delay of
The link transmits data at a communication cost of
Alpha is parameter weight, and the communication link pheromone concentration of the link is lambda i,j Obtaining the forwarding probability P (i, j) of the linked list in the link as follows:
wherein, U is the control container address set that the current linked list is adjacent to and can reach, and C is the control container address set that the forwarding path of the current linked list passes through.
6. The edge network container data routing method for distributed device aggregation as recited in claim 5, wherein determining forwarding links by roulette specifically comprises:
correspondingly dividing the interval of [0,1] into a plurality of subintervals according to the forwarding probability of the linked list in different links;
according to the roulette rule, the control container generates a random number between 0 and 1, and determines a corresponding forwarding link according to a sub-interval to which the random number belongs.
7. The edge network container data routing method for distributed device aggregation according to claim 1, wherein updating control inter-container communication link pheromone concentration specifically includes:
taking the container address of a node in the linked list with the minimum number of nodes in the queue as the container address of the source container i, and extracting the container address of the node of the next linked list of the source container i as the container address of the target container j, wherein the communication link pheromone concentration updating formula is as follows:
wherein λ is i,j Indicating the pheromone concentration of the communication link between control containers i and j,
the device representing the destination container j adjusts the power,
representing the available capacity loss of a target container j, wherein k is the total number of nodes of non-header nodes in a linked list, sigma is an pheromone volatilization factor, and m is the global pheromone updating frequency;
and updating the concentration of the pheromone of the communication link between all adjacent control containers in the linked list with the minimum node number by adopting the communication link pheromone concentration updating formula.
8. An edge network container data routing system for distributed device aggregation, comprising:
the dispatching center is used for generating a linked list of the power control quantity of the distributed equipment according to dispatching requirements and sending the linked list to the control containers of the edge devices; and realizing the optimal routing path selection, wherein the optimal routing path selection process is as follows:
a1: receiving a linked list returned by a control container, calculating the node number of the linked list, inserting the linked list into a queue with the node number being minimum and dequeuing being preferred, forming a node number sequence by N node numbers of the linked list newly inserted into the queue, and calculating the variance of the node number sequence; when the variance meets the convergence condition, executing the step A3; otherwise, executing the step A2;
a2: extracting container addresses and distributed equipment data of all nodes of a linked list with the minimum number of nodes in the queue, calculating the pheromone concentration of a communication link corresponding to the container addresses, and updating and controlling the pheromone concentration of the communication link between the containers; returning to the step A1;
a3: extracting data of a linked list with the minimum number of nodes in the queue to obtain a control container data transmission routing path which meets the scheduling requirement and has the minimum communication cost;
the system comprises a plurality of control containers, wherein each control container is correspondingly arranged in an edge device and is used for realizing the forwarding of the linked list, and the forwarding process of the linked list comprises the following steps:
b1: after the control container receives the linked list, extracting scheduling constraints of the header nodes, wherein the scheduling constraints comprise root node adjusting time, root node adjusting power and a distribution network root node set;
b2: comparing the scheduling constraints of the header nodes with the distributed equipment data in the control container; when the equipment adjusting time is longer than the root node adjusting time and the equipment distribution network node number belongs to a distribution network root node set, writing the distributed equipment data into the linked list nodes and updating the root node adjusting power of the head nodes with the residual adjusting power; otherwise, executing step B4;
b3: when the adjusting power of the root node in the header nodes is more than zero, building a linked list node and executing the step B4; otherwise, the linked list is forwarded to a dispatching center;
b4: acquiring the communication cost and the pheromone concentration of communication links of all control containers adjacent to the control containers, and calculating the forwarding probability of the linked list in different links; determining a forwarding link in a roulette mode, writing a destination container address of the forwarding link into a newly-built linked list node, and forwarding the linked list to a next control container;
b5: and (5) repeating the steps B1 to B4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211155318.8A CN115604170B (en) | 2022-09-22 | 2022-09-22 | Edge network container data routing method and system for distributed device aggregation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211155318.8A CN115604170B (en) | 2022-09-22 | 2022-09-22 | Edge network container data routing method and system for distributed device aggregation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115604170A true CN115604170A (en) | 2023-01-13 |
| CN115604170B CN115604170B (en) | 2023-06-27 |
Family
ID=84844285
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211155318.8A Active CN115604170B (en) | 2022-09-22 | 2022-09-22 | Edge network container data routing method and system for distributed device aggregation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115604170B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111641557A (en) * | 2020-06-02 | 2020-09-08 | 西安电子科技大学 | Minimum cost backup path method for delay tolerant network |
| WO2021227245A1 (en) * | 2020-05-11 | 2021-11-18 | 重庆邮电大学 | Scheduling method for tsn and non-tsn interconnected industrial heterogeneous network |
| CN114422423A (en) * | 2021-12-24 | 2022-04-29 | 大连大学 | Satellite network multi-constraint routing method based on SDN and NDN |
-
2022
- 2022-09-22 CN CN202211155318.8A patent/CN115604170B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021227245A1 (en) * | 2020-05-11 | 2021-11-18 | 重庆邮电大学 | Scheduling method for tsn and non-tsn interconnected industrial heterogeneous network |
| CN111641557A (en) * | 2020-06-02 | 2020-09-08 | 西安电子科技大学 | Minimum cost backup path method for delay tolerant network |
| CN114422423A (en) * | 2021-12-24 | 2022-04-29 | 大连大学 | Satellite network multi-constraint routing method based on SDN and NDN |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115604170B (en) | 2023-06-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109818865B (en) | SDN enhanced path boxing device and method | |
| CN106789648B (en) | Software defined network route decision method based on content storage and Network status | |
| CN114866474B (en) | Method, device, system and storage medium for scheduling cooperative traffic of end network | |
| CN109548052B (en) | Data transmission method and device, electronic equipment and readable storage medium | |
| CN113746748B (en) | Explicit congestion control method in named data network | |
| CN108183828B (en) | Flow control method based on local wireless network topology | |
| CN1964326A (en) | A method to monitor flow and flow monitoring equipment | |
| CN114268548A (en) | Network slice resource arranging and mapping method based on 5G | |
| CN113572694A (en) | Congestion control method, device and system and computer storage medium | |
| CN112153153B (en) | Coordinated distributed intra-network resource scheduling method and system and storage medium | |
| CN107147734A (en) | A kind of network traffics thread-level dynamic load balancing method and system based on two level forwarding | |
| CN107454630B (en) | Load balancing method and load balancing router | |
| CN1200538C (en) | Method for selecting route by accounting and controlling node status | |
| CN113114335B (en) | Software-defined space-based network networking architecture based on artificial intelligence | |
| CN112929452B (en) | Message collaborative pushing method based on Internet of things edge gateway | |
| CN110266606A (en) | Active queue management optimization method and device in a kind of edge network | |
| CN115604170B (en) | Edge network container data routing method and system for distributed device aggregation | |
| CN110943927B (en) | Named data network transmission control method, device and equipment based on time delay management | |
| CN111988805B (en) | End edge cooperation method for reliable time delay guarantee | |
| CN115604311A (en) | Cloud fusion computing system and self-adaptive routing method for service network | |
| CN113542121A (en) | Load balancing routing method for tree data center link layer based on annealing method | |
| CN114650257B (en) | SDN network congestion control system and method based on RTT | |
| CN110493313A (en) | A kind of method and system of the dispatch service use-case in based on mobile edge calculations network | |
| CN113705826B (en) | Parameter synchronous multicast method for distributed machine learning | |
| CN116760777B (en) | Multipath congestion control method based on ABEA3C |
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 | ||
| CB03 | Change of inventor or designer information |
Inventor after: Yang Hongming Inventor after: Chen Yusi Inventor after: Zhang Shijie Inventor after: Luo Dingyuan Inventor after: Xu Zhiqiang Inventor after: Tian Jianwei Inventor after: Yu Haifeng Inventor after: Liu Mouhai Inventor before: Yang Hongming Inventor before: Chen Yusi Inventor before: Zhang Shijie Inventor before: Luo Dingyuan Inventor before: Xu Zhiqiang Inventor before: Tian Jianwei Inventor before: Yu Haifeng |
|
| CB03 | Change of inventor or designer information |