CN114189916B - Inter-domain edge cooperation method for low-delay end-to-end communication of 5G network - Google Patents

Inter-domain edge cooperation method for low-delay end-to-end communication of 5G network Download PDF

Info

Publication number
CN114189916B
CN114189916B CN202111397886.4A CN202111397886A CN114189916B CN 114189916 B CN114189916 B CN 114189916B CN 202111397886 A CN202111397886 A CN 202111397886A CN 114189916 B CN114189916 B CN 114189916B
Authority
CN
China
Prior art keywords
node
edge
network
cluster
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.)
Active
Application number
CN202111397886.4A
Other languages
Chinese (zh)
Other versions
CN114189916A (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.)
Xiamen University
Original Assignee
Xiamen 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 Xiamen University filed Critical Xiamen University
Priority to CN202111397886.4A priority Critical patent/CN114189916B/en
Publication of CN114189916A publication Critical patent/CN114189916A/en
Application granted granted Critical
Publication of CN114189916B publication Critical patent/CN114189916B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • 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/121—Shortest path evaluation by minimising delays
    • 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/46—Cluster building
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/18—Negotiating wireless communication parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
    • 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
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The disclosure provides an inter-domain edge collaboration method for low-latency end-to-end communication of a 5G network, comprising the following steps: each sub-network in the 5G network commonly determines a cost function G of an inter-domain edge network through offline negotiation; each edge node i estimates the traffic demand l between it and other nodes j ij The method comprises the steps of carrying out a first treatment on the surface of the Each edge node estimates its delay in transmitting traffic over the backbone with other nodes in the network
Figure DDA0003365287820000011
Each edge node i determines a maximum delay coefficient alpha ij ，α ij The value range is a number greater than zero and less than one; based on alpha ij And
Figure DDA0003365287820000012
determining the maximum allowable transmission delay from the edge node i to other nodes j; in the process of communicating with neighbor nodes, the edge nodes cluster each node in the network, and solve the linear programming problem in the clusters based on each cluster, thereby obtaining the flow distribution mode on each path. The disclosure also provides an inter-domain edge cooperative device for low-latency end-to-end communication of a 5G network, an electronic device and a readable storage medium.

Description

Inter-domain edge cooperation method for low-delay end-to-end communication of 5G network
Technical Field
The disclosure relates to the field of 5G technologies, and in particular, to an inter-domain edge collaboration method, an inter-domain edge collaboration device, an electronic device and a readable storage medium for low-latency end-to-end communication of a 5G network.
Background
There have been many studies on reducing end-to-end latency on cellular networks, and the basic design principle is to avoid sending data traffic over the backbone. Traffic is forwarded through the terminal device using, for example, mobile ad hoc network routing and scheduling protocols. This design avoids data traffic being sent through the edge network and the backbone network, but has limited scalability and is not suitable for application in highly dynamic communication environments where a large number of terminal devices are present. As another example, the server is used as a coordinator in the edge network to determine a routing path between the terminal devices, so that the scalability of the terminal device routing can be improved. However, this way of separating the control path from the data path does not respond in time to the high dynamic environment of 5G, affecting overall performance to some extent. There are also edge networks used for forwarding traffic between devices connected to the same network provider. This avoids delay in forwarding data through the backbone network, but has two disadvantages: first, deploying large edge networks requires a significant capital investment for any network provider; second, for data traffic between devices connected to different network providers, transmission over the backbone is still required, which may still lead to high latency.
Disclosure of Invention
To solve at least one of the above technical problems, the present disclosure provides an inter-domain edge coordination method, an apparatus, an electronic device, and a readable storage medium for low-latency end-to-end communication of a 5G network.
According to one aspect of the disclosure, an inter-domain edge coordination method for listening to low latency end-to-end communications of a 5G network includes:
each sub-network in the 5G network commonly determines a cost function G of an inter-domain edge network through offline negotiation;
each edge node i estimates the traffic demand l between it and other nodes j ij ；
Each edge node estimates its delay in transmitting traffic over the backbone with other nodes in the network
Figure BDA0003365287800000021
Each of which isThe edge node i determines a maximum delay coefficient alpha ij ，α ij The value range is a number greater than zero and less than one;
determining a maximum allowable transmission delay of the edge node i to the other nodes j, the maximum allowable transmission delay being based on alpha ij And
Figure BDA0003365287800000022
it is determined that preferably the maximum allowed transmission delay is +.>
Figure BDA0003365287800000023
The method comprises the steps of,
in the process of communicating with the neighbor nodes, the edge nodes cluster each node in the network, and solve the linear programming problem in the clusters based on each cluster.
According to at least one embodiment of the present disclosure, an inter-domain edge collaboration method for low-latency end-to-end communication in a 5G network, in which an edge node clusters each node in the network during communication with a neighbor node, includes:
Assigning each node i a unique, comparable identifier ID i ；
Each node i according to a probability density function
Figure BDA0003365287800000024
Sampling z i Wherein->
Figure BDA0003365287800000025
Each node i takes its radius r i Is z i And the smaller value in rln |V|+D, i.e., r i ＝min(z i ，r ln|V|+D)；
Each node i faces B (i, r i ) Nodes within range transmit a message with their own identifier ID i Information of (2); the method comprises the steps of,
each node selects a node j=argmin with the smallest identifier ID according to the received information j (ID j ) As a head node of the cluster to which it belongs;
wherein each expression has the following meaning:
Figure BDA0003365287800000026
representing the maximum value of the allowable transmission delay of all the node pairs with traffic transmission requirements in the edge network;
d ij representing the shortest transmission delay between any node i and another node j;
B(i，d)＝{j|J∈V，d ij < d }, which means that for any given node i in the edge network, the node i can reach a node set under the condition that the time delay does not exceed d without considering the network policy;
the calculation result after clustering meets the following conditions: (1) for each partition with non-zero probability
Figure BDA0003365287800000031
Each cluster therein
Figure BDA0003365287800000032
All have max ij∈V d ij O (Dlogn/λ); (2) for node i in set V, the probability that all nodes within the B (i, D) range are in the same cluster is at least 1- λ, i.e. >
Figure BDA0003365287800000033
Wherein (1)>
Figure BDA0003365287800000034
E, representing the probability measure parameter, belonging to the interval (0, 1).
An inter-domain edge coordination method for low-latency end-to-end communication of a 5G network according to at least one embodiment of the present disclosure, based on each cluster, solves a linear programming problem in the cluster, including solving the linear programming problem in the cluster, based on a distributed algorithm implementation, includes:
determining a cost function
Figure BDA0003365287800000035
The method comprises the steps of,
solving the linear programming problem by the following expressions (1) (2) (3) (4) (5) (6) to minimize the value of the cost function g
Figure BDA0003365287800000036
Figure BDA0003365287800000037
Figure BDA0003365287800000038
Figure BDA0003365287800000039
Figure BDA00033652878000000310
Figure BDA00033652878000000311
Figure BDA00033652878000000312
Wherein, the physical meaning of each expression in the inter-domain edge network topology graph g= (V, E) is as follows:
S，S＝{(i，j)|(i，j)∈V×V，l ij > 0}, representing a set of node pairs having traffic transmission requirements;
E C ，E C = { (i, j) | (i, j) ∈e, i, j∈c }, representing the set of edges where both endpoint nodes i and j are within cluster C in a given cluster C;
Sc，
Figure BDA00033652878000000313
representing a set of all node pairs (i, j) with traffic transmission requirements such that all nodes in B (i, D) are in cluster C, i.e.>
Figure BDA00033652878000000314
Figure BDA00033652878000000315
For any node pair (i, j) ∈S, its required traffic l ij Transmission can be performed through one or more loop-free paths in graph g= (V, E), ->
Figure BDA00033652878000000316
Representing that the set of all inter-domain edge paths that meet the policy is + >
Figure BDA0003365287800000041
The strategy is determined based on whether each edge participates in data transmission in edge collaboration;
Figure BDA0003365287800000042
for each pair of nodes (i, j) in S, representing all path sets which accord with the strategy and have the end-to-end time delay less than or equal to the maximum allowable transmission time delay of the node pair;
y p for each pair of nodes (i, j) in S, in a set
Figure BDA0003365287800000043
The path p in (a) represents the traffic transmitted through the path p;
x e representing the total traffic transmitted through edge E for each edge E in the inter-domain edge network graph g= (V, E).
An inter-domain edge coordination method for low-latency end-to-end communication of a 5G network according to at least one embodiment of the present disclosure further includes: after solving the linear programming problem in the cluster based on the distributed algorithm, executing the distributed aggregation algorithm, including:
initialization of
Figure BDA0003365287800000044
Through the method for clustering each node in the network in the process of communicating with the neighbor nodes by the edge nodes, the graph G is divided for T times, and all cluster sets obtained by the T-th division are recorded as
Figure BDA0003365287800000045
The linear programming problem is solved for the head node of each cluster C and the result of the calculation (x C，t ，y C，t ) Informing all nodes in cluster C;
for each node i in the node set V, the following method is performed:
for each edge e= (i, j) E in edge set E, note that node i and node j belong to the same cluster divided into T i，j I.e.
Figure BDA0003365287800000046
Calculating an optimal solution
Figure BDA0003365287800000047
The partition of all nodes belonging to a cluster in the B (i, D) range of node i is T i I.e.
Figure BDA0003365287800000048
The method comprises the steps of,
for each path p passing through the node i in the allowed path set, calculating an optimal solution
Figure BDA0003365287800000049
The inter-domain edge network topology graph is recorded as g= (V, E), and the physical meaning of the related edge network graph is as follows:
v represents the number of nodes;
i E is the number of edges;
Figure BDA00033652878000000410
representing the maximum value of the allowable transmission delay of all the node pairs with traffic transmission requirements in the edge network;
d ij representing the shortest transmission delay between any node i and another node j;
B(i，d)＝{j|j∈V，d ij < d }, which means that for any given node i in the edge network, the node i can reach a node set under the condition that the time delay does not exceed d without considering the network policy;
(x C，t ，y C，t ) Vector representing calculation result, x= [ x ] e ] e∈E ，
Figure BDA0003365287800000051
E, representing probability measurement parameters, belonging to the interval (0, 1);
according to one aspect of the present disclosure, there is provided an inter-domain edge coordination device for low-latency end-to-end communication of a 5G network, including:
the inter-domain edge network cost function determining module is used for determining a cost function G of an inter-domain edge network through off-line negotiation through each sub-network in the 5G network;
An inter-node traffic demand assessment module for estimating traffic demand l between each edge node i and other nodes j in the 5G network ij ；
Backbone network transmission flow delay evaluation module, each edge node evaluates delay of transmission flow of the edge node and other nodes in the network through backbone network
Figure BDA0003365287800000052
A delay coefficient determining module, each edge node i determines a maximum delay coefficient, denoted as alpha ij Time delay coefficient alpha ij The value range is a number greater than zero and less than one;
maximum allowable transmission delay determinationA determining module for determining a maximum allowable transmission delay from the edge node i to the other nodes j, wherein the maximum allowable transmission delay is based on alpha ij And
Figure BDA0003365287800000053
it is determined that preferably the maximum allowed transmission delay is +.>
Figure BDA0003365287800000054
The method comprises the steps of,
and the clustering and linear solving module is used for clustering each node in the network in the process of communicating with the neighbor nodes by the edge nodes and solving the linear programming problem in the clusters based on each cluster.
An inter-domain edge cooperative apparatus for low-latency end-to-end communication in a 5G network according to at least one embodiment of the present disclosure, in a process of communicating with a neighbor node, an edge node clusters each node in the network, including:
assigning each node i a unique, comparable identifier ID i ；
Each node i according to a probability density function
Figure BDA0003365287800000055
Sampling z i Wherein->
Figure BDA0003365287800000056
Each node i takes its radius r i Is z i And the smaller value in rln|v|+d, i.e. r i ＝min(z i ，rln|V|+D)；
Each node i faces B (i, r i ) Nodes within range transmit a message with their own identifier ID i Information of (2); the method comprises the steps of,
each node selects a node j=argmin with the smallest identifier ID according to the received information j (ID j ) As a head node of the cluster to which it belongs;
wherein each expression has the following meaning:
Figure BDA0003365287800000061
representing the maximum value of the allowable transmission delay of all the node pairs with traffic transmission requirements in the edge network;
d ij representing the shortest transmission delay between any node i and another node j;
B(i，d)＝{j|j∈V，d ij < d }, which means that for any given node i in the edge network, the node i can reach a node set under the condition that the time delay does not exceed d without considering the network policy;
the calculation result after clustering meets the following conditions: (1) for each partition with non-zero probability
Figure BDA0003365287800000062
Each cluster therein
Figure BDA0003365287800000063
All have max i，j ∈Vd ij O (Dlogn/lambda); (2) for node i in set V, the probability that all nodes within the B (i, D) range are in the same cluster is at least 1- λ, i.e.>
Figure BDA0003365287800000064
Wherein (1)>
Figure BDA0003365287800000065
E, representing the probability measure parameter, belonging to the interval (0, 1).
An inter-domain edge coordination device for low-latency end-to-end communication of a 5G network according to at least one embodiment of the present disclosure, based on a distributed algorithm, implements solving a linear programming problem in a cluster, comprising:
determining a cost function
Figure BDA0003365287800000066
The method comprises the steps of,
solving the linear programming problem by the following expressions (1) (2) (3) (4) (5) (6) to minimize the value of the cost function g
Figure BDA0003365287800000067
Figure BDA0003365287800000068
Figure BDA0003365287800000069
Figure BDA00033652878000000610
Figure BDA00033652878000000611
Figure BDA00033652878000000612
Figure BDA0003365287800000071
Wherein, the physical meaning of each expression in the inter-domain edge network topology graph g= (V, E) is as follows:
S，S＝{(i，j)|(i，j)∈V×V，l ij > 0}, representing a set of node pairs having traffic transmission requirements;
E C ，E C = { (i, j) | (i, j) ∈e, i, j∈c }, representing the set of edges where both endpoint nodes i and j are within cluster C in a given cluster C;
Sc，
Figure BDA0003365287800000072
representing a set of all node pairs (i, j) with traffic transmission requirements such that all nodes in B (i, D) are in cluster C, i.e.>
Figure BDA0003365287800000073
Figure BDA0003365287800000074
For any node pair (i, j) ∈S, its required traffic l ij Transmission can be performed through one or more loop-free paths in graph g= (V, E), ->
Figure BDA0003365287800000075
Representing that the set of all inter-domain edge paths that meet the policy is +>
Figure BDA0003365287800000076
The strategy is determined based on whether each edge participates in data transmission in edge collaboration;
Figure BDA0003365287800000077
for each pair of nodes (i, j) in S, representing all path sets which accord with the strategy and have the end-to-end time delay less than or equal to the maximum allowable transmission time delay of the node pair;
y p For each pair of nodes (i, j) in S, in a set
Figure BDA0003365287800000078
The path p in (a) represents the traffic transmitted through the path p;
x e representing the total traffic transmitted through edge E for each edge E in the inter-domain edge network graph g= (V, E).
An inter-domain edge coordination device for low-latency end-to-end communication of a 5G network according to at least one embodiment of the present disclosure further comprises: after solving the linear programming problem in the cluster based on the distributed algorithm, executing the distributed aggregation algorithm, including:
initialization of
Figure BDA0003365287800000079
By the method of claim 2, the graph G is divided T times, and all clusters obtained by the T-th division are recorded as a set
Figure BDA00033652878000000710
The linear programming problem is solved for the head node of each cluster C and the result of the calculation (x C，t ，y C，t ) Informing all nodes in cluster C;
for each node i in the node set V, the following method is performed:
for each edge e= (i, j) E in edge set E, note that node i and node j belong to the same cluster divided into T i，j I.e.
Figure BDA0003365287800000081
Calculating an optimal solution
Figure BDA0003365287800000082
The partition of all nodes belonging to a cluster in the B (i, D) range of node i is T i I.e.
Figure BDA0003365287800000083
The method comprises the steps of,
for each path p passing through the node i in the allowed path set, calculating an optimal solution
Figure BDA0003365287800000084
The inter-domain edge network topology graph is recorded as g= (V, E), and the physical meaning of the related edge network graph is as follows:
V represents the number of nodes;
i E is the number of edges;
Figure BDA0003365287800000085
representing the maximum value of the allowable transmission delay of all the node pairs with traffic transmission requirements in the edge network;
d ij representing the shortest transmission delay between any node i and another node j;
B(i，d)＝{j|j∈V，d ij < d }, which means that for any given node i in the edge network, the node i can reach a node set under the condition that the time delay does not exceed d without considering the network policy;
(x C，t ，y C，t ) Vector representing calculation result, x= [ x ] e ] e∈E ，
Figure BDA0003365287800000086
E, representing the probability measure parameter, belonging to the interval (0, 1).
According to still another aspect of the present disclosure, there is provided an electronic apparatus including:
a memory storing execution instructions; the method comprises the steps of,
a processor executing the memory-stored execution instructions, such that the processor performs the method of any one of the above.
According to one aspect of the present disclosure, there is provided a readable storage medium having stored therein execution instructions which, when executed by a processor, are to implement the method of any one of the above.
Drawings
The accompanying drawings, which are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of this specification, illustrate exemplary embodiments of the disclosure and together with the description serve to explain the principles of the disclosure.
Fig. 1 is a flow diagram of an inter-domain edge collaboration method of low latency end-to-end communication of a 5G network according to one embodiment of the present disclosure.
Fig. 2 is a schematic flow diagram of an inter-domain edge co-device for low latency end-to-end communication of a 5G network according to one embodiment of the present disclosure.
Fig. 3 is a schematic diagram of an inter-domain collaborative networking architecture for low latency end-to-end communication of a 5G network according to one embodiment of the present disclosure.
Fig. 4 is a comparative schematic diagram of an inter-domain collaboration method of low-latency end-to-end communication of a 5G network according to one embodiment of the present disclosure.
Description of the reference numerals
1000 Inter-domain edge cooperative device for low-delay end-to-end communication of 5G network
1002. Inter-domain edge network cost function determining module
1004. Inter-node flow demand evaluation module
1006. Backbone network transmission flow time delay evaluation module
1008. Time delay coefficient determining module
1010. Maximum allowable transmission delay determining module
1012. Clustering and linear solving module
1100. Bus line
1200. Processor and method for controlling the same
1300. Memory device
1400. Other circuits.
Detailed Description
The present disclosure is described in further detail below with reference to the drawings and the embodiments. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant content and not limiting of the present disclosure. It should be further noted that, for convenience of description, only a portion relevant to the present disclosure is shown in the drawings.
In addition, embodiments of the present disclosure and features of the embodiments may be combined with each other without conflict. The technical aspects of the present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Unless otherwise indicated, the exemplary implementations/embodiments shown are to be understood as providing exemplary features of various details of some ways in which the technical concepts of the present disclosure may be practiced. Thus, unless otherwise indicated, features of the various implementations/embodiments may be additionally combined, separated, interchanged, and/or rearranged without departing from the technical concepts of the present disclosure.
The use of cross-hatching and/or shading in the drawings is typically used to clarify the boundaries between adjacent components. As such, the presence or absence of cross-hatching or shading does not convey or represent any preference or requirement for a particular material, material property, dimension, proportion, commonality between illustrated components, and/or any other characteristic, attribute, property, etc. of a component, unless indicated. In addition, in the drawings, the size and relative sizes of elements may be exaggerated for clarity and/or descriptive purposes. While the exemplary embodiments may be variously implemented, the specific process sequences may be performed in a different order than that described. For example, two consecutively described processes may be performed substantially simultaneously or in reverse order from that described. Moreover, like reference numerals designate like parts.
When an element is referred to as being "on" or "over", "connected to" or "coupled to" another element, it can be directly on, connected or coupled to the other element or intervening elements may be present. However, when an element is referred to as being "directly on," "directly connected to," or "directly coupled to" another element, there are no intervening elements present. For this reason, the term "connected" may refer to physical connections, electrical connections, and the like, with or without intermediate components.
The terminology used herein is for the purpose of describing particular embodiments and is not intended to be limiting. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. Furthermore, when the terms "comprises" and/or "comprising," and variations thereof, are used in the present specification, the presence of stated features, integers, steps, operations, elements, components, and/or groups thereof is described, but the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof is not precluded. It is also noted that, as used herein, the terms "substantially," "about," and other similar terms are used as approximation terms and not as degree terms, and as such, are used to explain the inherent deviations of measured, calculated, and/or provided values that would be recognized by one of ordinary skill in the art.
Fig. 1 is a flow diagram of an inter-domain edge collaboration method of low latency end-to-end communication of a 5G network according to one embodiment of the present disclosure.
As shown in fig. 1, an inter-domain edge collaboration method S100 for low-latency end-to-end communication of a 5G network includes:
s102: each sub-network in the 5G network commonly determines a cost function G of an inter-domain edge network through offline negotiation;
s104: each edge node i estimates the traffic demand l between it and other nodes j ij ；
S106: each edge node estimates its delay in transmitting traffic over the backbone with other nodes in the network
Figure BDA0003365287800000111
S108: each edge node i determines a maximum delay coefficient alpha ij ，α ij The value range is a number greater than zero and less than one;
s110: determining a maximum allowable transmission delay of the edge node i to the other nodes j, the maximum allowable transmission delay being based on alpha ij And
Figure BDA0003365287800000112
it is determined that preferably the maximum allowed transmission delay is +.>
Figure BDA0003365287800000113
The method comprises the steps of,
s112: in the process of communicating with the neighbor nodes, the edge nodes cluster each node in the network, and solve the linear programming problem in the clusters based on each cluster.
In the process of communicating with the neighbor node (including direct communication between the edge node and the neighbor node and indirect communication between the edge node and other nodes), the edge node clusters each node in the network, including:
Assigning each node i a unique, comparable identifier ID i ；
Each node i according to a probability density function
Figure BDA0003365287800000114
Sampling zi, wherein ∈>
Figure BDA0003365287800000115
Each node i takes its radius r i Is z i And the smaller value in rln |V|+D, i.e., r i ＝min(z i ，r ln|V|+D)；
Each node i faces B (i, r i ) Nodes within range transmit a message with their own identifier ID i Information of (2); the method comprises the steps of,
each node selects a node j=argmin with the smallest identifier ID according to the received information j (ID j ) As a head node of the cluster to which it belongs;
wherein each expression has the following meaning:
Figure BDA0003365287800000116
representing the maximum value of the allowable transmission delay of all the node pairs with traffic transmission requirements in the edge network;
d ij representing the shortest transmission delay between any node i and another node j;
B(i，d)＝{j|j∈V，d ij < d }, which means that for any given node i in the edge network, the node i can reach a node set under the condition that the time delay does not exceed d without considering the network policy;
the calculation result after clustering meets the following conditions: (1) for each partition with non-zero probability
Figure BDA0003365287800000121
Each cluster therein
Figure BDA0003365287800000122
All have max ij∈V d ij O (Dlogn/lambda); (2) for node i in set V, the probability that all nodes within the B (i, D) range are in the same cluster is at least 1- λ, i.e. >
Figure BDA0003365287800000123
Wherein (1)>
Figure BDA0003365287800000124
E, representing the probability measure parameter, belonging to the interval (0, 1).
Based on each cluster, solving the linear programming problem in the cluster, including solving the linear programming problem in the cluster, based on a distributed algorithm, includes:
determining a cost function
Figure BDA0003365287800000125
The method comprises the steps of,
solving the linear programming problem by the following expressions (1) (2) (3) (4) (5) (6) to minimize the value of the cost function g
Figure BDA0003365287800000126
Figure BDA0003365287800000127
Figure BDA0003365287800000128
Figure BDA0003365287800000129
Figure BDA00033652878000001210
Figure BDA00033652878000001211
Figure BDA00033652878000001212
Wherein, the physical meaning of each expression in the inter-domain edge network topology graph g= (V, E) is as follows:
S，S＝{(i，j)|(i，j)∈V×V，l ij > 0}, representing a set of node pairs having traffic transmission requirements;
E C ，E C = { (i, j) | (i, j) ∈e, i, j∈c }, representing the set of edges where both endpoint nodes i and j are within cluster C in a given cluster C;
Sc，
Figure BDA00033652878000001213
representing a set of all node pairs (i, j) with traffic transmission requirements such that all nodes in B (i, D) are in cluster C, i.e.>
Figure BDA0003365287800000131
Figure BDA0003365287800000132
For any node pair (i, J) εS, its required traffic l ij Transmission can be performed through one or more loop-free paths in graph g= (V, E), ->
Figure BDA0003365287800000133
Representing that the set of all inter-domain edge paths that meet the policy is +>
Figure BDA0003365287800000134
The strategy is determined based on whether each edge participates in data transmission in edge collaboration;
Figure BDA0003365287800000135
for each pair of nodes (i, j) in S, representing all path sets which accord with the strategy and have the end-to-end time delay less than or equal to the maximum allowable transmission time delay of the node pair;
y p For each pair of nodes (i, j) in S, in a set
Figure BDA0003365287800000136
The path p in (a) represents the traffic transmitted through the path p;
x e representing the total traffic transmitted through edge E for each edge E in the inter-domain edge network graph g= (V, E).
The inter-domain edge cooperative method for the low-delay end-to-end communication of the 5G network further comprises the following steps: after solving the linear programming problem in the cluster based on the distributed algorithm, executing the distributed aggregation algorithm, including:
initialization of
Figure BDA0003365287800000137
Through the method for clustering each node in the network in the process of communicating with the neighbor nodes by the edge nodes, the graph G is divided for T times, and all cluster sets obtained by the T-th division are recorded as
Figure BDA0003365287800000138
The linear programming problem is solved for the head node of each cluster C and the result of the calculation (x C，t ，y C，t ) Informing all nodes in cluster C;
for each node i in the node set V, the following method is performed:
for each edge e= (i, j) E in edge set E, note that node i and node j belong to the same cluster divided into T i，j I.e.
Figure BDA0003365287800000139
Calculating an optimal solution
Figure BDA00033652878000001310
The partition of all nodes belonging to a cluster in the B (i, D) range of node i is T i I.e.
Figure BDA00033652878000001311
The method comprises the steps of,
for each path p passing through the node i in the allowed path set, calculating an optimal solution
Figure BDA00033652878000001312
The inter-domain edge network topology graph is recorded as g= (V, E), and the physical meaning of the related edge network graph is as follows:
v represents the number of nodes;
i E is the number of edges;
Figure BDA0003365287800000141
representing the maximum value of the allowable transmission delay of all the node pairs with traffic transmission requirements in the edge network;
d ij representing the shortest transmission delay between any node i and another node j;
B(i，d)＝{j|j∈V，d ij < d }, which means that for any given node i in the edge network, the node i can reach a node set under the condition that the time delay does not exceed d without considering the network policy;
(x C，t ，y C，t ) Vector representing calculation result, x= [ x ] e ] e∈E ，
Figure BDA0003365287800000142
E, representing probability measurement parameters, belonging to the interval (0, 1);
the invention calculates the route and the flow distribution mode by determining the cost function, estimating the flow transmission requirement and the transmission delay of the backbone network, determining the maximum allowable transmission delay and the distributed algorithm. Firstly, each network formulates an expected target according to the actual problems and actual demands, and determines a proper cost function; secondly, in order to ensure the algorithm effect, the flow transmission requirement and the transmission delay of the network are required to be quantitatively analyzed, so that the maximum allowable transmission delay of the network is determined; then, according to the modeling of the network flow problem, determining constraint conditions in the linear programming problem; finally, in the distributed algorithm, the nodes are clustered, and the linear programming problem is solved only in the clusters, so that the problem scale is reduced to a certain extent. The distributed aggregation algorithm ensures the accuracy of the calculation result, and improves the performance and the expandability of the algorithm on the premise of not influencing the reliability.
According to the inter-domain edge cooperative method for the 5G network low-delay end-to-end communication, which is provided by the disclosure, different networks can jointly use an edge network to transmit data, and the problem of high delay of end-to-end transmission in a 5G network scene is solved. The technology designs a distributed algorithm, and by using the algorithm, edge nodes from different networks can cooperatively determine the optimal route and flow distribution of all flows on the maximum allowable delay path under the condition that network privacy information is not exposed. Compared with a centralized algorithm, the algorithm greatly reduces the calculated amount and the calculated time on the premise of ensuring the accuracy of the calculated result, thereby improving the operation efficiency.
The inter-domain edge cooperative method and device for the low-delay end-to-end communication of the 5G network can effectively reduce the end-to-end delay of data transmission in a 5G scene, and the algorithm is small in scale of the problem to be solved, high in calculation result precision, high in calculation speed and practical. Meanwhile, the investment in the aspect of 5G infrastructure construction can be reduced, the method is suitable for a 5G network environment with a plurality of terminal mobile devices and high dynamic performance, and good expandability is achieved.
Fig. 2 is a schematic structural diagram of an inter-domain edge cooperative device for low-latency end-to-end communication in a 5G network according to the present disclosure.
As shown in fig. 2, the inter-domain edge coordination device 1000 for low-latency end-to-end communication of a 5G network includes:
the inter-domain edge network cost function determining module 1002 determines a cost function G of an inter-domain edge network through offline negotiation through each sub-network in the 5G network;
an inter-node traffic demand assessment module 1004 for estimating, for each edge node i in the 5G network, traffic demand l between the edge node i and other nodes j ij ；
Backbone transport traffic delay evaluation module 1006, each edge node estimates its delay for transporting traffic through the backbone with other nodes in the network
Figure BDA0003365287800000151
A delay factor determining module 1008 determines a maximum delay factor for each edge node i, denoted as α ij ，α ij The value range is a number greater than zero and less than one;
a maximum allowable transmission delay determination module 1010 that determines a maximum allowable transmission delay of the edge node i to the other nodes j, the maximum allowable transmission delay being based on α ij And
Figure BDA0003365287800000152
it is determined that preferably the maximum allowed transmission delay is +.>
Figure BDA0003365287800000153
The method comprises the steps of,
and a clustering and linear solving module 1012, wherein the edge node clusters each node in the network in the process of communicating with the neighbor node, and solves the linear programming problem in the cluster based on each cluster.
The edge node clusters each node in the network in the process of communicating with the neighbor node, and the edge node comprises the following steps:
assigning each node i a unique, comparable identifier ID i ；
Each node i according to a probability density function
Figure BDA0003365287800000154
Sampling z i Wherein->
Figure BDA0003365287800000155
Each node i takes its radius r i Is z i And the smaller value in rln |V|+D, i.e., r i ＝min(z i ，r ln|V|+D)；
Each node i faces B (i, r i ) Nodes within range transmit a message with their own identifier ID i Information of (2); the method comprises the steps of,
each node selects a node j=argmin with the smallest identifier ID according to the received information j (ID j ) As a head node of the cluster to which it belongs;
wherein each expression has the following meaning:
Figure BDA0003365287800000161
representing the maximum value of the allowable transmission delay of all the node pairs with traffic transmission requirements in the edge network;
d ij representing the shortest transmission delay between any node i and another node j;
B(i，d)＝{j|j∈V，d ij < d }, which means that for any given node i in the edge network, the node i can reach a node set under the condition that the time delay does not exceed d without considering the network policy;
the calculation result after clustering meets the following conditions: (1) for each partition with non-zero probability
Figure BDA0003365287800000162
Each cluster therein
Figure BDA0003365287800000163
All have max i，j∈V d ij O (Dlogn/λ); (2) for node i in set V, the probability that all nodes within the B (i, D) range are in the same cluster is at least 1- λ, i.e. >
Figure BDA0003365287800000164
Wherein (1)>
Figure BDA0003365287800000165
E, representing the probability measure parameter, belonging to the interval (0, 1).
The inter-domain edge cooperative device for low-delay end-to-end communication of the 5G network solves a linear programming problem in a cluster based on a distributed algorithm, and comprises the following components:
determining a cost function
Figure BDA0003365287800000166
The method comprises the steps of,
solving the linear programming problem by the following expressions (1) (2) (3) (4) (5) (6) to minimize the value of the cost function g
Figure BDA0003365287800000167
Figure BDA0003365287800000168
Figure BDA0003365287800000169
Figure BDA00033652878000001610
Figure BDA00033652878000001611
Figure BDA00033652878000001612
Figure BDA00033652878000001613
Wherein, the physical meaning of each expression in the inter-domain edge network topology graph g= (V, E) is as follows:
S，S＝{(i，j)|(i，j)∈V×V，l ij > 0}, representing a set of node pairs having traffic transmission requirements;
E C ，E C = { (i, j) | (i, j) ∈e, i, j∈c }, representing the set of edges where both endpoint nodes i and j are within cluster C in a given cluster C;
Sc，
Figure BDA0003365287800000171
representing a set of all node pairs (i, j) with traffic transmission requirements such that all nodes in B (i, D) are in cluster C, i.e.>
Figure BDA0003365287800000172
Figure BDA0003365287800000173
For any node pair (i, J) εS, its required traffic l ij Transmission can be performed through one or more loop-free paths in graph g= (V, E), ->
Figure BDA0003365287800000174
Representing that the set of all inter-domain edge paths that meet the policy is +>
Figure BDA0003365287800000175
The strategy is determined based on whether each edge participates in data transmission in edge collaboration;
Figure BDA0003365287800000176
for each pair of nodes (i, j) in S, representing all path sets which accord with the strategy and have the end-to-end time delay less than or equal to the maximum allowable transmission time delay of the node pair;
y p For each of SFor node (i, j), in the set
Figure BDA0003365287800000177
The path p in (a) represents the traffic transmitted through the path p;
x e representing the total traffic transmitted through edge E for each edge E in the inter-domain edge network graph g= (V, E).
Wherein, still include: after solving the linear programming problem in the cluster based on the distributed algorithm, executing the distributed aggregation algorithm, including:
initialization of
Figure BDA0003365287800000178
By the method for clustering each node in the network in the process of communicating with the neighbor nodes by the edge nodes, the graph G is divided for T times, and all cluster sets obtained by the T-th division are recorded as
Figure BDA0003365287800000179
The linear programming problem is solved for the head node of each cluster C and the result of the calculation (x C，t ，y C，t ) Informing all nodes in cluster C;
for each node i in the node set V, the following method is performed:
for each edge e= (i, j) E in edge set E, note that node i and node j belong to the same cluster divided into T i，j I.e.
Figure BDA00033652878000001710
Calculating an optimal solution
Figure BDA00033652878000001711
The partition of all nodes belonging to a cluster in the B (i, D) range of node i is T i I.e.
Figure BDA00033652878000001712
The method comprises the steps of,
for each path p passing through the node i in the allowed path set, calculating an optimal solution
Figure BDA0003365287800000181
The inter-domain edge network topology graph is recorded as g= (V, E), and the physical meaning of the related edge network graph is as follows:
V represents the number of nodes;
i E is the number of edges;
Figure BDA0003365287800000182
representing the maximum value of the allowable transmission delay of all the node pairs with traffic transmission requirements in the edge network;
d ij representing the shortest transmission delay between any node i and another node j;
B(i，d)＝{j|j∈V，d ij < d }, which means that for any given node i in the edge network, the node i can reach a node set under the condition that the time delay does not exceed d without considering the network policy;
(x C，t ，y C，t ) Vector representing calculation result, x= [ x ] e ] e∈E ，
Figure BDA0003365287800000183
E, representing the probability measure parameter, belonging to the interval (0, 1).
Fig. 3 is a schematic diagram of an inter-domain collaborative networking architecture for low latency end-to-end communication of a 5G network according to one embodiment of the present disclosure.
As shown in fig. 3, in the inter-domain cooperative networking structure for low-latency end-to-end communication of the 5G network, each device is accessed by a wireless network connection mode and is connected with an edge network, the edge network in each ring is a cluster, each edge network is deployed with the inter-domain edge cooperative device for providing low-latency end-to-end communication of the 5G network, by the inter-domain edge cooperative method for providing low-latency end-to-end communication of the 5G network, a routing and traffic distribution mode with the shortest transmission latency is determined in the cluster together, and data is transmitted by edge transmission connection.
Fig. 4 is a comparative schematic diagram of an inter-domain collaboration method of low-latency end-to-end communication of a 5G network according to one embodiment of the present disclosure.
As shown in fig. 4, the method provided by the present invention is compared with the prior art: (1) the number line is an existing architecture, and it can be seen that the data sent by the device 1 needs to pass through the radio access network a, the backbone network and the radio access network C in order to reach the device 2, which results in a long transmission delay. And as shown in the inter-domain edge cooperative architecture of line (2), the data sent by the device 1 only need to pass through the wireless access network A, then is transmitted in the edge network, finally reaches the device 2 through the wireless access network C, thereby reducing the transmission delay.
According to still another aspect of the present disclosure, there is provided an electronic apparatus including:
a memory storing execution instructions; the method comprises the steps of,
a processor executing the memory-stored execution instructions, causing the processor to perform the method of any one of the above.
According to yet another aspect of the present disclosure, there is provided a readable storage medium having stored therein execution instructions which when executed by a processor are adapted to carry out the method of any one of the above.
The apparatus referred to in this disclosure may comprise corresponding modules that execute the steps in the flowcharts described above. Thus, each step or several steps in the flowcharts described above may be performed by respective modules, and the apparatus may include one or more of these modules. A module may be one or more hardware modules specifically configured to perform the respective steps, or be implemented by a processor configured to perform the respective steps, or be stored within a computer-readable medium for implementation by a processor, or be implemented by some combination.
The apparatus referred to in this disclosure may comprise corresponding modules that execute the steps in the flowcharts described above. Thus, each step or several steps in the flowcharts described above may be performed by respective modules, and the apparatus may include one or more of these modules. A module may be one or more hardware modules specifically configured to perform the respective steps, or be implemented by a processor configured to perform the respective steps, or be stored within a computer-readable medium for implementation by a processor, or be implemented by some combination.
The hardware architecture may be implemented using a bus architecture. The bus architecture may include any number of interconnecting buses and bridges depending on the specific application of the hardware and the overall design constraints. Bus 1100 connects together various circuits including one or more processors 1200, memory 1300, and/or hardware modules. Bus 1100 may also connect various other circuits 1400, such as peripherals, voltage regulators, power management circuits, external antennas, and the like.
Bus 1100 may be an industry standard architecture (ISA, industry Standard Architecture) bus, a peripheral component interconnect (PCI, peripheral Component) bus, or an extended industry standard architecture (EISA, extended Industry Standard Component) bus, among others. The buses may be divided into address buses, data buses, control buses, etc. For ease of illustration, only one connection line is shown in the figure, but not only one bus or one type of bus.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and further implementations are included within the scope of the preferred embodiment of the present disclosure in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the embodiments of the present disclosure. The processor performs the various methods and processes described above. For example, method embodiments in the present disclosure may be implemented as a software program tangibly embodied on a machine-readable medium, such as a memory. In some embodiments, part or all of the software program may be loaded and/or installed via memory and/or a communication interface. One or more of the steps of the methods described above may be performed when a software program is loaded into memory and executed by a processor. Alternatively, in other embodiments, the processor may be configured to perform one of the methods described above in any other suitable manner (e.g., by means of firmware).
Logic and/or steps represented in the flowcharts or otherwise described herein may be embodied in any readable storage medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions.
For the purposes of this description, a "readable storage medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable read-only memory (CDROM). In addition, the readable storage medium may even be paper or other suitable medium on which the program can be printed, as the program can be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted, or otherwise processed in a suitable manner if necessary, and then stored in a memory.
It should be understood that portions of the present disclosure may be implemented in hardware, software, or a combination thereof. In the above-described embodiments, the various steps or methods may be implemented in software stored in a memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, may be implemented using any one or combination of the following techniques, as is well known in the art: discrete logic circuits having logic gates for implementing logic functions on data signals, application specific integrated circuits having suitable combinational logic gates, programmable Gate Arrays (PGAs), field Programmable Gate Arrays (FPGAs), and the like.
Those of ordinary skill in the art will appreciate that all or part of the steps implementing the method of the above embodiment may be implemented by a program to instruct related hardware, and the program may be stored in a readable storage medium, where the program when executed includes one or a combination of the steps of the method embodiment.
Furthermore, each functional unit in each embodiment of the present disclosure may be integrated into one processing module, or each unit may exist alone physically, or two or more units may be integrated into one module. The integrated modules may be implemented in hardware or in software functional modules. The integrated modules may also be stored in a readable storage medium if implemented in the form of software functional modules and sold or used as a stand-alone product. The storage medium may be a read-only memory, a magnetic disk or optical disk, etc.
In the description of the present specification, reference to the terms "one embodiment/mode," "some embodiments/modes," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment/mode or example is included in at least one embodiment/mode or example of the present application. In this specification, the schematic representations of the above terms are not necessarily the same embodiments/modes or examples. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments/modes or examples. Furthermore, the various embodiments/implementations or examples described in this specification and the features of the various embodiments/implementations or examples may be combined and combined by persons skilled in the art without contradiction.
Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include at least one such feature. In the description of the present application, the meaning of "plurality" is at least two, such as two, three, etc., unless explicitly defined otherwise.
It will be appreciated by those skilled in the art that the above-described embodiments are merely for clarity of illustration of the disclosure, and are not intended to limit the scope of the disclosure. Other variations or modifications will be apparent to persons skilled in the art from the foregoing disclosure, and such variations or modifications are intended to be within the scope of the present disclosure.

Claims (4)

1. An inter-domain edge coordination method for low-latency end-to-end communication of a 5G network, comprising:
each sub-network in the 5G network commonly determines a cost function G of an inter-domain edge network through offline negotiation;
each edge node i estimates the traffic demand l between it and other nodes j ij ；
Each edge node estimates its delay in transmitting traffic over the backbone with other nodes in the network
Figure FDA0004279334040000011
Each edge node i determines a maximum delay coefficient alpha ij ，α ij The value range is a number greater than zero and less than one;
determining a maximum allowable transmission delay of the edge node i to the other nodes j, the maximum allowable transmission delay being based on alpha ij And
Figure FDA0004279334040000012
it is determined that preferably the maximum allowed transmission delay is +.>
Figure FDA0004279334040000013
and
The edge node clusters each node in the network in the process of communicating with the neighbor node, and solves the linear programming problem in the cluster based on each cluster;
The edge node clusters each node in the network in the process of communicating with the neighbor node, and the edge node comprises the following steps:
assigning each node i a unique, comparable identifier ID i ；
Each node i according to a probability density function
Figure FDA0004279334040000014
Sampling z i Wherein->
Figure FDA0004279334040000015
Each node i takes its radius r i Is z i And the smaller value in rln |V|+D, i.e., r i ＝min(z i ，r ln|V|+D)；
Each node i faces B (i, r i ) Nodes within range transmit a message with their own identifier ID i Information of (2); and
each node selects a node j=argmin with the smallest identifier ID according to the received information j (ID j ) As a head node of the cluster to which it belongs;
wherein each expression has the following meaning:
Figure FDA0004279334040000016
representing the maximum value of the allowable transmission delay of all the node pairs with traffic transmission requirements in the edge network;
d ij representing the shortest transmission delay between any node i and another node j;
B(i，d)＝{j |j∈V，d ij < d }, mean for any of the edge networksGiven a node i, under the condition that the network strategy is not considered, the node i can reach a node set under the condition that the time delay does not exceed d;
the calculation result after clustering meets the following conditions: (1) for each partition with non-zero probability
Figure FDA0004279334040000021
Each cluster therein
Figure FDA0004279334040000022
All have max i，j∈V d ij O (dlogn/λ); (2) for node i in set V, the probability that all nodes within the B (i, D) range are in the same cluster is at least 1- λ, i.e. >
Figure FDA0004279334040000023
Wherein (1)>
Figure FDA0004279334040000024
E, representing probability measurement parameters, belonging to the interval (0, 1);
based on each cluster, solving the linear programming problem in the cluster, including solving the linear programming problem in the cluster, based on a distributed algorithm, includes:
determining a cost function
Figure FDA0004279334040000025
and
Solving the linear programming problem by the following expressions (1) (2) (3) (4) (5) (6) to minimize the value of the cost function g
Figure FDA0004279334040000026
Figure FDA0004279334040000027
Figure FDA0004279334040000028
Figure FDA0004279334040000029
Figure FDA00042793340400000210
Figure FDA00042793340400000211
Figure FDA00042793340400000212
Wherein, the physical meaning of each expression in the inter-domain edge network topology graph g= (V, E) is as follows:
S，S＝{(i，j)|(i，j)∈V×V，l ij > 0}, representing a set of node pairs having traffic transmission requirements;
E C ，E C = { (i, j) | (i, j) ∈e, i, j∈c }, representing the set of edges where both endpoint nodes i and j are within cluster C in a given cluster C;
Sc，
Figure FDA00042793340400000213
representing a set of all node pairs (i, j) with traffic transmission requirements such that all nodes in B (i, D) are in cluster C, i.e.>
Figure FDA00042793340400000214
Figure FDA0004279334040000031
For any node pair (i, j) ∈S, its required traffic l ij Transmission can be performed through one or more loop-free paths in graph g= (V, E), ->
Figure FDA0004279334040000032
Representing that the set of all inter-domain edge paths that meet the policy is +>
Figure FDA0004279334040000033
The strategy is determined based on whether each edge participates in data transmission in edge collaboration;
Figure FDA0004279334040000034
for each pair of nodes (i, j) in S, representing all path sets which accord with the strategy and have the end-to-end time delay less than or equal to the maximum allowable transmission time delay of the node pair;
y p For each pair of nodes (i, j) in S, in a set
Figure FDA0004279334040000035
The path p in (a) represents the traffic transmitted through the path p;
x e representing the total traffic transmitted through edge E for each edge E in the inter-domain edge network graph g= (V, E);
the inter-domain edge cooperative method for the 5G network low-delay end-to-end communication further comprises the following steps: after solving the linear programming problem in the cluster based on the distributed algorithm, executing the distributed aggregation algorithm, wherein after solving the linear programming problem in the cluster based on the distributed algorithm, executing the distributed aggregation algorithm comprises the following steps:
initialization of
Figure FDA0004279334040000036
Dividing the graph G for T times, and recording all cluster sets obtained by the T-th division as
Figure FDA0004279334040000037
The linear programming problem is solved for the head node of each cluster C and the result of the calculation (x C，t ，y C，t ) Informing all nodes in cluster C;
for each node i in the node set V, the following method is performed:
for each edge e= (i, j) E in edge set E, note that node i and node j belong to the same cluster divided into T i，j I.e.
Figure FDA0004279334040000038
Calculating an optimal solution
Figure FDA0004279334040000039
The partition of all nodes belonging to a cluster in the B (i, D) range of node i is T i I.e.
Figure FDA00042793340400000310
and
For each path p passing through the node i in the allowed path set, calculating an optimal solution
Figure FDA00042793340400000311
The inter-domain edge network topology graph is recorded as g= (V, E), and the physical meaning of the related edge network graph is as follows:
v represents the number of nodes;
i E is the number of edges;
Figure FDA0004279334040000041
representing the maximum value of the allowable transmission delay of all the node pairs with traffic transmission requirements in the edge network;
d ij representing the shortest transmission delay between any node i and another node j;
B(i，d)＝{j|j∈V，d ij < d }, which means that for any given node i in the edge network, the node i can reach a node set under the condition that the time delay does not exceed d without considering the network policy;
(x C，t ，y C，t ) A vector representing the result of the calculation,
Figure FDA0004279334040000042
e, representing the probability measure parameter, belonging to the interval (0, 1).
2. An inter-domain edge coordination device for low-latency end-to-end communication in a 5G network, comprising:
the inter-domain edge network cost function determining module is used for determining a cost function G of an inter-domain edge network through off-line negotiation through each sub-network in the 5G network;
an inter-node traffic demand assessment module for estimating traffic demand l between each edge node i and other nodes j in the 5G network ij ；
Backbone network transmission flow delay evaluation module, each edge node evaluates delay of transmission flow of the edge node and other nodes in the network through backbone network
Figure FDA0004279334040000043
A delay coefficient determining module, each edge node i determines a maximum delay coefficient, denoted as alpha ij Time delay coefficient alpha ij The value range is a number greater than zero and less than one;
a maximum allowable transmission delay determining module for determining the maximum allowable transmission delay from the edge node i to the other nodes j, wherein the maximum allowable transmission delay is based on alpha ij And
Figure FDA0004279334040000044
it is determined that preferably the maximum allowed transmission delay is +.>
Figure FDA0004279334040000045
and
The edge node clusters each node in the network in the process of communicating with the neighbor node, and solves the linear programming problem in the cluster based on each cluster;
the edge node clusters each node in the network in the process of communicating with the neighbor node, and the edge node comprises the following steps:
assigning each node i a unique, comparable identifier ID i ；
Each node i according to a probability density function
Figure FDA0004279334040000046
Sampling z i Wherein->
Figure FDA0004279334040000047
Each node i takes its radius r i Is z i And the smaller value in rln|v|+d, i.e. r i ＝min(z i ，r ln|V|+D)；
Each node i faces B (i, r i ) Nodes within range transmit a message with their own identifier ID i Information of (2); and
each node selects a node j=argmin with the smallest identifier ID according to the received information j (ID j ) As a head node of the cluster to which it belongs;
Wherein each expression has the following meaning:
Figure FDA0004279334040000051
representing the maximum value of the allowable transmission delay of all the node pairs with traffic transmission requirements in the edge network;
d ij representing the shortest transmission delay between any node i and another node j;
B(i，d)＝{j|j∈V，d ij < d }, represent pairIn any given node i in the edge network, under the condition that the network strategy is not considered, the node i can reach a node set under the condition that the time delay does not exceed d;
the calculation result after clustering meets the following conditions: (1) for each partition with non-zero probability
Figure FDA0004279334040000052
Each cluster therein
Figure FDA00042793340400000512
All have max i，j∈V d ij O (dlogn/λ); (2) for node i in set V, the probability that all nodes within the B (i, D) range are in the same cluster is at least 1- λ, i.e.>
Figure FDA0004279334040000053
Wherein (1)>
Figure FDA0004279334040000054
E, representing probability measurement parameters, belonging to the interval (0, 1);
wherein, solve the linear programming problem in the cluster based on the distributed algorithm realization, include:
determining a cost function
Figure FDA0004279334040000055
and
Solving the linear programming problem by the following expressions (1) (2) (3) (4) (5) (6) to minimize the value of the cost function g
Figure FDA0004279334040000056
Figure FDA0004279334040000057
Figure FDA0004279334040000058
Figure FDA0004279334040000059
Figure FDA00042793340400000510
Figure FDA00042793340400000511
Figure FDA0004279334040000061
Wherein, the physical meaning of each expression in the inter-domain edge network topology graph g= (V, E) is as follows:
S，S＝{(i，j)|(i，j)∈V×V，l ij > 0}, representing a set of node pairs having traffic transmission requirements;
E C ，E C = { (i, j) | (i, j) ∈e, i, j∈c }, representing the set of edges where both endpoint nodes i and j are within cluster C in a given cluster C;
Sc，
Figure FDA0004279334040000062
representing a set of all node pairs (i, j) with traffic transmission requirements such that all nodes in B (i, D) are in cluster C, i.e.>
Figure FDA0004279334040000063
Figure FDA0004279334040000064
For any node pair (i, j) ∈S, its required transmissionFlow rate l ij Transmission can be performed through one or more loop-free paths in graph g= (V, E), ->
Figure FDA0004279334040000065
Representing that the set of all inter-domain edge paths that meet the policy is +>
Figure FDA0004279334040000066
The strategy is determined based on whether each edge participates in data transmission in edge collaboration;
Figure FDA0004279334040000067
for each pair of nodes (i, j) in S, representing all path sets which accord with the strategy and have the end-to-end time delay less than or equal to the maximum allowable transmission time delay of the node pair;
y p for each pair of nodes (i, j) in S, in a set
Figure FDA0004279334040000068
The path p in (a) represents the traffic transmitted through the path p;
x e representing the total traffic transmitted through edge E for each edge E in the inter-domain edge network graph g= (V, E);
the inter-domain edge cooperative device for the 5G network low-delay end-to-end communication further comprises: after solving the linear programming problem in the cluster based on the distributed algorithm, executing the distributed aggregation algorithm, wherein after solving the linear programming problem in the cluster based on the distributed algorithm, executing the distributed aggregation algorithm comprises the following steps:
Initialization of
Figure FDA0004279334040000069
Dividing the graph G for T times, and recording all cluster sets obtained by the T-th division as
Figure FDA00042793340400000610
The linear programming problem is solved for the head node of each cluster C and the result of the calculation (x C，t ，y C，t ) Informing all nodes in cluster C;
for each node i in the node set V, the following method is performed:
for each edge e= (i, j) E in edge set E, note that node i and node j belong to the same cluster divided into T i，j I.e.
Figure FDA0004279334040000071
Calculating an optimal solution
Figure FDA0004279334040000072
The partition of all nodes belonging to a cluster in the B (i, D) range of node i is T i I.e.
Figure FDA0004279334040000073
and
For each path p passing through the node i in the allowed path set, calculating an optimal solution
Figure FDA0004279334040000074
The inter-domain edge network topology graph is recorded as g= (V, E), and the physical meaning of the related edge network graph is as follows:
v represents the number of nodes;
i E is the number of edges;
Figure FDA0004279334040000075
representing the maximum value of the allowable transmission delay of all the node pairs with traffic transmission requirements in the edge network;
d ij representing the shortest transmission delay between any node i and another node j;
B(i，d)＝{j|j∈V，d ij < d }, which means that for any given node i in the edge network, the node i can reach a node set under the condition that the time delay does not exceed d without considering the network policy;
(x C，t ，y C，t ) Vector representing calculation result, x= [ x ] e ] e∈E ，
Figure FDA0004279334040000076
E, representing the probability measure parameter, belonging to the interval (0, 1).
3. An electronic device, comprising:
a memory storing execution instructions; and
a processor executing the memory-stored execution instructions, causing the processor to perform the method of claim 1.
4. A readable storage medium having stored therein execution instructions which when executed by a processor are adapted to carry out the method of claim 1.
CN202111397886.4A 2021-11-19 2021-11-19 Inter-domain edge cooperation method for low-delay end-to-end communication of 5G network Active CN114189916B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111397886.4A CN114189916B (en) 2021-11-19 2021-11-19 Inter-domain edge cooperation method for low-delay end-to-end communication of 5G network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111397886.4A CN114189916B (en) 2021-11-19 2021-11-19 Inter-domain edge cooperation method for low-delay end-to-end communication of 5G network

Publications (2)

Publication Number Publication Date
CN114189916A CN114189916A (en) 2022-03-15
CN114189916B true CN114189916B (en) 2023-07-14

Family

ID=80541326

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111397886.4A Active CN114189916B (en) 2021-11-19 2021-11-19 Inter-domain edge cooperation method for low-delay end-to-end communication of 5G network

Country Status (1)

Country Link
CN (1) CN114189916B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10931743B1 (en) * 2019-07-01 2021-02-23 Facebook, Inc. Systems and methods for dynamically generating routing tables for edge nodes in large-scale networking infrastructures
CN112822752A (en) * 2021-01-07 2021-05-18 西安电子科技大学 Route establishing method and system for unmanned aerial vehicle self-organizing network

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI118291B (en) * 2004-12-22 2007-09-14 Timo D Haemaelaeinen Energy efficient wireless sensor network, node devices for the same and method of arranging, the communications in a wireless sensor network
US8493869B2 (en) * 2009-10-19 2013-07-23 Cisco Technology, Inc. Distributed constraints-based inter-domain network traffic management

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10931743B1 (en) * 2019-07-01 2021-02-23 Facebook, Inc. Systems and methods for dynamically generating routing tables for edge nodes in large-scale networking infrastructures
CN112822752A (en) * 2021-01-07 2021-05-18 西安电子科技大学 Route establishing method and system for unmanned aerial vehicle self-organizing network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
一种无线传感器网络定位问题中的分簇算法;王珊珊;殷建平;张国敏;蔡志平;;计算机科学(08);全文 *

Also Published As

Publication number Publication date
CN114189916A (en) 2022-03-15

Similar Documents

Publication Publication Date Title
Bao et al. Edge computing-based joint client selection and networking scheme for federated learning in vehicular IoT
EP2137888B1 (en) Available bandwidth estimation
US8116324B2 (en) Network resource allocation system and method of the same
CN109151864B (en) Migration decision and resource optimal allocation method for mobile edge computing ultra-dense network
CN109039897B (en) Software defined backhaul network routing method based on service awareness
CN111626352A (en) Adaptive energy consumption optimal vehicle clustering method based on fuzzy C-means
CN107659426B (en) Method for allocating physical resources and network side equipment
CN109547136B (en) Distributed cooperative spectrum sensing method based on maximum and minimum distance clustering
CN112685186A (en) Method and device for unloading computing tasks, electronic equipment and storage medium
Kakalou et al. Sustainable and efficient data collection in cognitive radio sensor networks
CN112601240A (en) Intelligent scheduling method for resource edge of Internet of things
WO2013052161A1 (en) Unifying connected dominating set using localized two hop information with a flexible dominating factor
EP3515018B1 (en) Method, apparatus and system for measuring network path
CN114189916B (en) Inter-domain edge cooperation method for low-delay end-to-end communication of 5G network
CN110621052B (en) Multipath routing optimization method
CN112867088B (en) Dynamic adjustment method and system for cloud-edge-end communication architecture
CN108184175B (en) MC node limitation-based elastic optical network multicast routing and spectrum allocation method
CN111371572B (en) Network node election method and node equipment
WO2018213405A1 (en) Hierarchical channel assignment in wireless networks
CN112235387A (en) Multi-node cooperative computing unloading method based on energy consumption minimization
CN116806043A (en) Routing method, device, electronic equipment and mobile edge network
CN116095789B (en) Link dynamic optimization method in wireless communication
CN108174446B (en) Network node link resource joint distribution method with minimized resource occupancy
Kojić et al. New algorithm for packet routing in mobile ad-hoc networks
Jovith et al. Interference mitigation and optimal hop distance measurement in distributed homogenous nodes over wireless sensor network

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