CN115967653B - Task-based network entity time delay evaluation method - Google Patents
Task-based network entity time delay evaluation method Download PDFInfo
- Publication number
- CN115967653B CN115967653B CN202211562949.1A CN202211562949A CN115967653B CN 115967653 B CN115967653 B CN 115967653B CN 202211562949 A CN202211562949 A CN 202211562949A CN 115967653 B CN115967653 B CN 115967653B
- Authority
- CN
- China
- Prior art keywords
- task
- space
- link
- time delay
- node
- 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
Links
- 238000011156 evaluation Methods 0.000 title claims abstract description 40
- 230000005540 biological transmission Effects 0.000 claims abstract description 137
- 238000012546 transfer Methods 0.000 claims abstract description 48
- 230000000977 initiatory effect Effects 0.000 claims abstract description 42
- 239000011159 matrix material Substances 0.000 claims abstract description 42
- 238000000034 method Methods 0.000 claims abstract description 20
- 238000012545 processing Methods 0.000 claims abstract description 17
- 238000013507 mapping Methods 0.000 claims abstract description 4
- 230000006870 function Effects 0.000 claims description 109
- 238000010586 diagram Methods 0.000 claims description 15
- 230000008569 process Effects 0.000 claims description 9
- 230000000903 blocking effect Effects 0.000 claims description 8
- 230000000694 effects Effects 0.000 description 4
- 238000011160 research Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000012512 characterization method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000011158 quantitative evaluation Methods 0.000 description 2
- 241000764238 Isis Species 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
Classifications
-
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a task-based network entity time delay evaluation method, belongs to the technical field of network capability evaluation, and solves the problem that the prior art lacks a task-based network entity time delay evaluation method. The method comprises the following steps: acquiring nodes and links in a network digital twin body obtained by mapping a network entity; analyzing the time delay condition of the transmission task between the user nodes to obtain a space-to-ground link transmission task, and processing the time delay moment mother function of the space link transmission task from the receiving end to the transmitting end in the space node; acquiring all transmission paths from a user node initiating a task to a user node receiving the task in a network digital twin; based on the time delay matrix function and the transmission path, obtaining a time delay transfer function from a user node initiating the task to a user node receiving the task; based on the delay transfer function, a delay evaluation result of a task transmitted from a user node corresponding to the initiating task to a user node receiving the task in the network entity is obtained.
Description
Technical Field
The invention relates to the technical field of network capability assessment, in particular to a task-based network entity time delay assessment method.
Background
The digital twin system facing future meta-universe application is about to bear massive data, and modeling of the digital twin system through networked characterization is one of important research problems. For the systematic ability assessment of networked characterization, originating from graph theory, a number of assessment or metric methods are proposed in the relevant studies. Typical evaluation criteria include cohesion, maximum subgraph, average path length, network efficiency, connectivity, etc., but these typical evaluation methods are mainly static evaluation methods based on structure, lacking consideration of limited resources of digital twin systems and different transmission or routing strategies for future meta-universe applications. On the other hand, if the dynamics of the nodes in the digital twin system are considered, as the nodes move, the nodes and links for executing the current tasks can be freely replaced, and how to realize the exact simulation of the digital twin system in the process of replacing the nodes and links is a problem that needs to be studied. Furthermore, the capability assessment depends to a large extent on the topology and transmission or routing algorithms employed by the digital twin. The existing capability evaluation method has low pertinence on the capability evaluation of a digital twin system for future metauniverse application.
Considering a digital twin system for future meta-universe applications, the related capability evaluation methods have the following ways:
(1) It is considered that the transmission of metauniverse applications in a digital twin system must have sufficient resources or capacity, not just connectivity. Related art research proposes a system capability evaluation method based on topology and capacity measurement, and can also combine system reliability with elasticity to measure capacity and resource-limited system capability.
(2) The capacity index of the system is modeled by using the related service quality index, and the capacity index is considered to be reflected by the service quality index such as delay or blocking probability because some potential meta-universe application tasks are sensitive to delay. Related studies have proposed average latency and blocking rate for random failure of the system and lower task flow situations to verify system capability. Similar approaches are related to system architecture, cost of system construction implementation, traffic or throughput, and latency. Still other methods are based on fault tolerant network routing ideas, based on expected transmission time and estimated transmission cost costs, to obtain an optimal transmission scheme.
(3) And (5) capability evaluation based on a cost function. The basic idea is that maximum system capacity can be obtained by minimizing the cost. The optimal path and its associated capacity index may also be calculated from an estimated cost function between the system start node and the target node based on the virtual topology strategy.
In summary, when the existing research is applied to the capability evaluation of digital twin systems facing the metauniverse, there are still some problems to be solved: the existing evaluation method emphasizes the functional characteristics of system elements, but lacks a numerical twin system theory calculation framework for a task; the mutual backup and dynamic connection of a plurality of nodes improve the reliable guarantee task transmission capability of the network, and the influence of access path selection and digital twin system design parameters on the evaluation of the whole network capability needs to be further refined. In addition, when the above-described capability evaluation method is landed in the delay evaluation direction, adjustment of the correlation evaluation method is required. Currently, there is a lack of task-based network entity latency assessment methods.
Disclosure of Invention
In view of the above analysis, the present embodiment of the present invention aims to provide a task-based network entity delay evaluation method, so as to solve the problem that the prior art lacks a task-based network entity delay evaluation method.
The invention provides a task-based network entity time delay evaluation method, which comprises the following steps:
Mapping the network entity into a network digital twin body, and obtaining nodes and links in the mapped network digital twin body; the nodes are divided into user nodes and space nodes, and the links are divided into space links and space links; the space-space links are divided into an uplink space-space link and a downlink space-space link;
Analyzing the time delay condition of the transmission task between the user nodes, and obtaining: a time delay matrix function of an uplink space link transmission task, a time delay matrix function of a space node processing task from a receiving end to a transmitting end, a time delay matrix function of a space link transmission task, and a time delay matrix function of a downlink space link transmission task;
Acquiring all transmission paths from a user node initiating a task to a user node receiving the task in a network digital twin; based on the time delay moment mother function and all transmission paths, obtaining a time delay transfer function from a user node initiating a task to a user node receiving the task;
And obtaining a delay evaluation result of a task transmitted from a corresponding user node initiating the task to a user node receiving the task in the network entity based on the delay transfer function.
Based on the scheme, the invention also makes the following improvements:
Further, the time delay matrix function of the uplink space link transmission task Expressed as:
Where s represents the laplace operator, d ppus represents the spatial link propagation delay, and μ us represents the uplink transmission rate of the air-to-ground link;
time delay matrix function of downlink space link transmission task Expressed as:
Wherein P su0 represents the downlink transmission power of the air-to-ground link; m 1、m2 represents the number of space link resources and the number of space link resources respectively; Lambda sui、μsu respectively represents the service arrival rate and the downlink sending rate of the downlink space-space link of the space node; b s denotes the buffer space of the space node; p ss0 denotes the transmission power of the spatial link; Mu ss represents the transmission rate of the spatial link, and lambda ssi represents the traffic arrival rate of the spatial link.
Further, a moment-delay mother function for processing tasks from a receiving end to a transmitting end in the space nodeExpressed as:
Where μ sp represents the rate at which spatial nodes process tasks.
Further, the moment of delay mother function of the space link transmission task between two space nodesExpressed as:
further, the obtaining a delay transfer function from the user node initiating the task to the user node receiving the task includes:
constructing a signal flow diagram from the user node initiating the task to the user node receiving the task according to all transmission paths from the user node initiating the task to the user node receiving the task in the network digital twin;
Respectively obtaining the product of the task transmission probability of each space node in the signal flow diagram and the time delay moment mother function of processing tasks from a receiving end to a transmitting end in the space node as the time delay transfer function of the space node;
respectively obtaining the product of the task transmission probability of each spatial link in the signal flow diagram and the time delay moment mother function of the transmission task of the spatial link, and the time delay transfer function of the corresponding spatial link;
respectively obtaining the product of the task transmission probability of each air-ground link in the signal flow diagram and the time delay moment mother function of the air-ground link transmission task as the time delay transfer function of the air-ground link;
And obtaining the time delay transfer function from the user node initiating the task to the user node receiving the task based on the time delay transfer functions of all the space nodes, the space links and the space-to-ground links in the signal flow graph.
Further, in the signal flow graph, spatial links in each transmission path do not intersect;
The obtaining a delay transfer function from a user node initiating a task to a user node receiving the task comprises:
Solving the product of time delay transfer functions of the space node, the space link and the space-to-ground link related in each transmission path to serve as the time delay transfer function of the corresponding transmission path;
the sum of the delay transfer functions of all transmission paths is calculated as the delay transfer function from the user node initiating the task to the user node receiving the task.
Further, the delay evaluation result of the task transmission from the user node U i initiating the task to the user node U j receiving the task in the network entity is the average delay of the task transmissionExpressed as:
wherein, A time delay transfer function representing the transfer of a task from a user node U i initiating the task to a user node U j receiving the task; p i,j denotes the probability of choosing to transmit a task by the user node U i to the user node U j; s denotes the laplace operator.
Further, the task transmission probability p ui,sx' of the uplink space link from the source end U i of the user node U i initiating the task to the receiving end S x' of the space node S x is expressed as:
Wherein a ui,sx' represents the probability that the source end U i of the user node U i selects the receiving end S x' of the visible space node S x as an access node to perform a task, The access blocking rate of the uplink space-time link from the source U i of U i to the receiving end S x' of the spatial node S x is indicated.
Further, the task transmission probability p sx,sy' of the spatial link from the transmitting end S x of the spatial node S x to the receiving end S y' of the spatial node S y is expressed as:
Where a sx,sy' denotes the probability that the spatial node S x selects the neighboring spatial node S y as the next hop to perform the task, The transmission congestion rate at the transmitting end of the spatial node S x is indicated.
Further, the task transmission probability p sz,uj' of the downlink space-time link from the transmitting end S z of the space node S z to the sink end U j' of the user node U j is expressed as:
compared with the prior art, the invention has at least one of the following beneficial effects:
According to the task-based network entity time delay evaluation method provided by the invention, the time delay parent function of an uplink space link transmission task, the time delay parent function of a space node processing task from a receiving end to a transmitting end, the time delay parent function of a space link transmission task and the time delay parent function of a downlink space link transmission task are obtained by analyzing the time delay condition of transmission tasks among user nodes in a network digital twin body; based on the time delay matrix function and the transmission path, a time delay transfer function from a user node initiating a task to a user node receiving the task can be obtained; and finally, obtaining a corresponding time delay evaluation result. The method can realize quantitative evaluation of the time delay, effectively makes up the blank of the related technology, is convenient for the skilled person to evaluate the time delay condition of the network entity more in detail, and the evaluation result can guide the actual operation of the network entity.
In the invention, the technical schemes can be mutually combined to realize more preferable combination schemes. Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention may be realized and attained by the structure particularly pointed out in the written description and drawings.
Drawings
The drawings are only for purposes of illustrating particular embodiments and are not to be construed as limiting the invention, like reference numerals being used to refer to like parts throughout the several views.
Fig. 1 is a flowchart of a task-based network entity delay evaluation method according to an embodiment of the present invention.
Detailed Description
The following detailed description of preferred embodiments of the application is made in connection with the accompanying drawings, which form a part hereof, and together with the description of the embodiments of the application, are used to explain the principles of the application and are not intended to limit the scope of the application.
The invention discloses a task-based network entity time delay evaluation method, and a flow chart is shown in fig. 1, and comprises the following steps:
Step S1: mapping the network entity into a network digital twin body, and obtaining nodes and links in the mapped network digital twin body; the nodes are divided into user nodes and space nodes, and the links are divided into space links and space links;
specifically, in this embodiment, the user node is generally a user terminal on the ground, and the position is relatively fixed; the spatial nodes are unmanned aerial vehicles or other forms of task forwarding nodes in the air. Illustratively, assume that in a network digital twin:
The set of spatial nodes s= { S 1,S2,…,SN }, N representing the total number of spatial nodes;
User node set u= { U 1,U2,ε,UL }, L represents the total number of user nodes;
In the present embodiment, the air-ground links are divided into an uplink air-ground link and a downlink air-ground link. The space nodes receive the tasks of the user nodes U i initiating the tasks in the coverage area of the space nodes through an uplink wireless link (namely an uplink air-ground link) between the space nodes, forward the tasks between the adjacent space nodes through a wireless link (a space link) between the space nodes, and finally the space nodes send the tasks to the user nodes U j receiving the tasks through a downlink wireless link (namely a downlink air-ground link) between the space and the ground.
To facilitate better practice of the present embodiments by those skilled in the art, the following definitions are now made:
Each space node internally comprises a receiving end and a transmitting end; illustratively, the spatial node S x includes a receiving end S x' and a transmitting end S x;
Each user node internally comprises an information source end and an information destination end; illustratively, the user node U i includes a source U i and a sink U i'.
Thus, the user basic activities of the network digital twin include:
An uplink space link transmission task MS ui,sx' from the source U i of the user node U i to the receiving end S x' of the space node S x;
Processing task MS sx',sx from receiving end S x' to transmitting end S x inside spatial node S x;
A spatial link transmission task MS sx,sy' from the transmitting end S x of the spatial node S x to the receiving end S y of the spatial node S y;
The downlink space link from the transmitting end S z of the space node S z to the sink end U j' of the user node U j transmits the task MS sz,uj'.
When the processing rate of the space node can completely meet the rate received by the space link, no blocking and queuing exist in the processing process, and no retry feedback activity exists; when the access or processing rate of the spatial node does not meet the user rate of access, then there is blocking feedback activity.
Step S2: analyzing the time delay condition of the transmission task between the user nodes, and obtaining: a time delay matrix function of an uplink space link transmission task, a time delay matrix function of a space node processing task from a receiving end to a transmitting end, a time delay matrix function of a space link transmission task, and a time delay matrix function of a downlink space link transmission task; the specific process is as follows:
in this embodiment, since the air-to-ground link is divided into an uplink air-to-ground link and a downlink air-to-ground link, the time moment mother function of the air-to-ground link transmission task is divided into: and (3) a time delay matrix function of an uplink space link transmission task and a time delay matrix function of a downlink space link transmission task. Next, the following description is made of the calculation method of each time delay matrix function according to the present embodiment:
Propagation delay: the time required for an electromagnetic signal to propagate in a spatial transmission medium.
Transmission delay: refers to the time required for a user node or a spatial node to transmit data from the node into the transmission medium, or to receive data from the transmission medium into the node. The longer the transmission delay, the more energy is consumed by the user node or spatial node.
(1) Time delay matrix function of uplink space link transmission task
The time delay of the uplink air-ground link comprises the propagation delay d ppus and the transmission delay of the air-ground link
Specifically, the time delay matrix function when the task MS ui,sx' is transmitted from the source U i of the user node U i to the receiving S x' of the spatial node S x by the uplink air-space link
Wherein s represents a laplace operator; d ppus denotes a spatial link propagation delay, and μ us denotes an uplink transmission rate of the space-earth link.
From the formula (1), the obtained time delay matrix functionThe result is independent of the selected user node, spatial node. That is, when a user node that transmits a task and a spatial node that receives a task via an uplink air-ground link change, the obtained time delay matrix functions are all the following by the formula (1)From this, it can be seen that:
time delay matrix function of uplink space link transmission task Expressed as:
Where s represents the laplace operator, d ppus represents the spatial link propagation delay, and μ us represents the uplink transmission rate of the space-to-ground link.
(2) Moment-of-delay mother function for processing tasks from receiving end to transmitting end in space node
Processing task MS sx',sx' S time delay matrix function from receiving end S x' to transmitting end S x inside space node S x Expressed as:
Where μ sp represents the rate at which spatial nodes process tasks.
From the formula (3), the obtained time delay matrix functionThe result is independent of the selected spatial node. That is, when the space node changes, the equation (3) is introduced, and the obtained time delay matrix functions are allFrom this, it can be seen that:
moment-of-delay mother function for processing tasks from receiving end to transmitting end in space node Expressed as:
Where μ sp represents the rate at which spatial nodes process tasks.
(3) Moment of delay mother function of space link transmission task between two space nodes
The time delay of the space link transmission task sx, sy' from the space node S x to the space node S y is composed of the link propagation delay d ppss and the link queuing delayAnd transmission delayComposition is prepared. Wherein the transmission delay isIs one of the determinants of the moment of delay parent function.
Time delay matrix function of spatial link transmission activity sx, sy' from spatial node S x to spatial node S y Expressed as:
Wherein P su0 represents the downlink transmission power of the air-to-ground link; m 1、m2 represents the number of space link resources and the number of space link resources respectively; Lambda sui、μsu respectively represents the service arrival rate and the downlink sending rate of the downlink space-space link of the space node; b s denotes the buffer space of the space node; p ss0 denotes the transmission power of the spatial link; Mu ss represents the transmission rate of the spatial link, and lambda ssi represents the traffic arrival rate of the spatial link.
From equation (5), the obtained time delay matrix functionThe result is independent of the selected spatial node. That is, when the spatial node changes, the equation (5) is introduced, and the obtained time delay matrix functions are unchanged, so that it is known that:
moment of delay mother function of space link transmission task between two space nodes Expressed as:
(4) Time delay matrix function of downlink space link transmission task
The time delay of the downlink air-ground link is composed of propagation delay d ppsu and queuing delayAnd transmission delayComposition is prepared. Queuing delay and queue lengthProportional to the ratio. Order the
The downlink space-time link from the sender S z of the space node S z to the sink U j' of the user node U j receives the time delay matrix function of the active MS sz,uj' Expressed as:
from equation (7), the obtained time delay matrix function The result is independent of the selected spatial node, the user node. That is, when the space node and the user node change, the equation (7) is carried, and the obtained time delay matrix functions are all kept unchanged, so that the following can be known:
time delay matrix function of downlink space link transmission task Expressed as:
Wherein P su0 represents the downlink transmission power of the air-to-ground link; m 1、m2 represents the number of space link resources and the number of space link resources respectively; Lambda sui、μsu respectively represents the service arrival rate and the downlink sending rate of the downlink space-space link of the space node; b s denotes the buffer space of the space node; p ss0 denotes the transmission power of the spatial link; Mu ss represents the transmission rate of the spatial link, and lambda ssi represents the traffic arrival rate of the spatial link.
Step S3: acquiring all transmission paths from a user node initiating a task to a user node receiving the task in a network digital twin; based on the time delay moment mother function and all transmission paths, obtaining a time delay transfer function from a user node initiating a task to a user node receiving the task;
specifically, the method comprises the following steps:
step S31: constructing a signal flow diagram from the user node initiating the task to the user node receiving the task according to all transmission paths from the user node initiating the task to the user node receiving the task in the network digital twin;
Step S32: respectively obtaining the product of the task transmission probability of each space node in the signal flow diagram and the time delay moment mother function of processing tasks from a receiving end to a transmitting end in the space node as the time delay transfer function of the space node;
step S33: respectively obtaining the product of the task transmission probability of each spatial link in the signal flow diagram and the time delay moment mother function of the transmission task of the spatial link as the time delay transfer function of the spatial link;
step S34: respectively obtaining the product of the task transmission probability of each air-ground link in the signal flow diagram and the time delay moment mother function of the air-ground link transmission task as the time delay transfer function of the air-ground link;
Step S35: and obtaining the time delay transfer function from the user node initiating the task to the user node receiving the task based on the time delay transfer functions of all the space nodes, the space links and the space-to-ground links in the signal flow graph.
In the signal flow diagram provided in this embodiment, the spatial links in each transmission path do not intersect, i.e., each transmission path does not share the same spatial link. At this time, the signal flow diagram only includes a plurality of unidirectional transmission paths; at this time, obtaining a delay transfer function from a user node initiating a task to a user node receiving the task includes:
Step S351: solving the product of time delay transfer functions of the space node, the space link and the space-to-ground link related in each transmission path to serve as the time delay transfer function of the corresponding transmission path;
Step S352: the sum of the delay transfer functions of all transmission paths is calculated as the delay transfer function from the user node initiating the task to the user node receiving the task.
Step S4: and obtaining a delay evaluation result of a task transmitted from a corresponding user node initiating the task to a user node receiving the task in the network entity based on the delay transfer function.
Specifically, the network digital twin is equal to the time delay evaluation result of the task transmission from the corresponding user node initiating the task to the user node receiving the task in the network entity. Thus, the delay estimate of the task transmitted from the user node U i initiating the task to the user node U j receiving the task in the network entity is the task transmission average delayExpressed as:
wherein, A time delay transfer function representing the transfer of a task from a user node U i initiating the task to a user node U j receiving the task; p i,j denotes the probability of choosing to transmit a task by the user node U i to the user node U j; s denotes the laplace operator.
In this embodiment, the transmission probability in step S3 may be set manually in advance. For a working process closer to the network entity, the transmission probabilities may also be set according to the following formula:
1) The transmission probability p ui,sx' of the uplink air-space link from the source U i of the user node U i initiating the task to the receiving S x' of the spatial node S x is expressed as:
Wherein a ui,sx' represents the probability that the source end U i of the user node U i selects the receiving end S x' of the visible space node S x as an access node to perform a task, The access blocking rate of the uplink space-time link from the source U i of U i to the receiving end S x' of the spatial node S x is indicated.
2) The task transmission probability p sx',sx from the receiving end s x' to the transmitting end s x inside the spatial node is related to the transmission sub-link capacity from the receiving end s x' to the transmitting end s x, and how much of the task amount is transmitted in the current period. In the implementation process, the method can be determined according to actual conditions.
3) The task transmission probability p sx,sy' of the spatial link from the transmitting end S x of the spatial node S x to the receiving end S y' of the spatial node S y is expressed as:
Where a sx,sy' denotes the probability that the spatial node S x selects the neighboring spatial node S y as the next hop to perform the task, The transmission congestion rate at the transmitting end of the spatial node S x is indicated.
4) The task transmission probability p sz,uj' of the downlink space-time link from the transmitting end S z of the space node S z to the sink end U j' of the user node U j is expressed as:
when all resources are occupied and not idle, user access is blocked and access blocking rate is increased Expressed as:
wherein, The arrival rate of tasks sent by the space nodes through the uplink space links and received by the user nodes is represented.
In summary, according to the task-based network entity time delay evaluation method provided by the embodiment of the invention, the time delay matrix function of the uplink space link transmission task, the time delay matrix function of the space link transmission task processed from the receiving end to the sending end in the space node, the time delay matrix function of the space link transmission task, and the time delay matrix function of the downlink space link transmission task are obtained by analyzing the time delay condition of the transmission task between the user nodes in the network digital twin; based on the time delay matrix function and the transmission path, a time delay transfer function from a user node initiating the task to a user node receiving the task can be obtained; and finally, obtaining a corresponding time delay evaluation result. The method can realize quantitative evaluation of the time delay, effectively makes up the blank of the related technology, is convenient for the skilled person to evaluate the time delay condition of the network entity more in detail, and the evaluation result can guide the actual operation of the network entity.
Those skilled in the art will appreciate that all or part of the flow of the methods of the embodiments described above may be accomplished by way of a computer program to instruct associated hardware, where the program may be stored on a computer readable storage medium. Wherein the computer readable storage medium is a magnetic disk, an optical disk, a read-only memory or a random access memory, etc.
The present invention is not limited to the above-mentioned embodiments, and any changes or substitutions that can be easily understood by those skilled in the art within the technical scope of the present invention are intended to be included in the scope of the present invention.
Claims (4)
1. The task-based network entity time delay evaluation method is characterized by comprising the following steps of:
Mapping the network entity into a network digital twin body, and obtaining nodes and links in the mapped network digital twin body; the nodes are divided into user nodes and space nodes, and the links are divided into space links and space links; the space-space links are divided into an uplink space-space link and a downlink space-space link;
Analyzing the time delay condition of the transmission task between the user nodes, and obtaining: a time delay matrix function of an uplink space link transmission task, a time delay matrix function of a space node processing task from a receiving end to a transmitting end, a time delay matrix function of a space link transmission task, and a time delay matrix function of a downlink space link transmission task;
Acquiring all transmission paths from a user node initiating a task to a user node receiving the task in a network digital twin; based on the time delay moment mother function and all transmission paths, obtaining a time delay transfer function from a user node initiating a task to a user node receiving the task;
based on the delay transfer function, obtaining a delay evaluation result of a task transmitted from a user node corresponding to the initiating task to a user node receiving the task in a network entity;
time delay matrix function of uplink space link transmission task Expressed as:
Where s represents the laplace operator, d ppus represents the spatial link propagation delay, and μ us represents the uplink transmission rate of the air-to-ground link;
time delay matrix function of downlink space link transmission task Expressed as:
Wherein P su0 represents the downlink transmission power of the air-to-ground link; m 1、m2 represents the number of space link resources and the number of space link resources respectively; Lambda sui、μsu respectively represents the service arrival rate and the downlink sending rate of the downlink space-space link of the space node; b s denotes the buffer space of the space node; p ss0 denotes the transmission power of the spatial link; Mu ss represents the transmission rate of the spatial link, and lambda ssi represents the traffic arrival rate of the spatial link;
moment-of-delay mother function for processing tasks from receiving end to transmitting end in space node Expressed as:
wherein μ sp represents the rate at which spatial nodes process tasks;
moment of delay mother function of space link transmission task between two space nodes Expressed as:
The obtaining a delay transfer function from a user node initiating a task to a user node receiving the task comprises:
constructing a signal flow diagram from the user node initiating the task to the user node receiving the task according to all transmission paths from the user node initiating the task to the user node receiving the task in the network digital twin;
Respectively obtaining the product of the task transmission probability of each space node in the signal flow diagram and the time delay moment mother function of processing tasks from a receiving end to a transmitting end in the space node as the time delay transfer function of the space node;
Respectively obtaining the product of the task transmission probability of each spatial link in the signal flow diagram and the time delay moment mother function of the transmission task of the spatial link as the time delay transfer function of the spatial link;
respectively obtaining the product of the task transmission probability of each air-ground link in the signal flow diagram and the time delay moment mother function of the air-ground link transmission task as the time delay transfer function of the air-ground link;
Acquiring a time delay transfer function from a user node initiating a task to a user node receiving the task based on time delay transfer functions of all space nodes, space links and space-to-ground links in a signal flow graph;
In the signal flow diagram, spatial links in each transmission path do not intersect;
The obtaining a delay transfer function from a user node initiating a task to a user node receiving the task comprises:
Solving the product of time delay transfer functions of the space node, the space link and the space-to-ground link related in each transmission path to serve as the time delay transfer function of the corresponding transmission path;
solving the sum of delay transfer functions of all transmission paths as a delay transfer function from a user node initiating a task to a user node receiving the task;
The delay evaluation result of the task transmitted from the user node U i initiating the task to the user node U j receiving the task in the network entity is the average delay of the task transmission Expressed as:
wherein, A time delay transfer function representing the transfer of a task from a user node U i initiating the task to a user node U j receiving the task; p i,j denotes the probability of choosing to transmit a task by the user node U i to the user node U j; s denotes the laplace operator.
2. The task-based network entity delay evaluation method according to claim 1, wherein the task transmission probability p ui,sx' of the uplink air-ground link from the source end U i of the user node U i initiating the task to the receiving end sx' of the spatial node S x is expressed as:
Wherein a ui,sx' represents the probability that the source end U i of the user node U i selects the receiving end S x' of the visible space node S x as an access node to perform a task, The access blocking rate of the uplink space-time link from the source U i of U i to the receiving end S x' of the spatial node S x is indicated.
3. The task-based network entity latency assessment method according to claim 2, wherein a task transmission probability p sx,sy' of a spatial link from a transmitting end S x of a spatial node S x to a receiving end S y' of a spatial node S y is expressed as:
Where a sx,sy' denotes the probability that the spatial node S x selects the neighboring spatial node S y as the next hop to perform the task, The transmission congestion rate at the transmitting end of the spatial node S x is indicated.
4. A task based network entity delay evaluation method according to claim 3, characterized in that the task transmission probability p sz,uj' of the downlink space-time link from the transmitting end S z of the space node S z to the sink end U j' of the user node U j is expressed as:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211562949.1A CN115967653B (en) | 2022-12-07 | 2022-12-07 | Task-based network entity time delay evaluation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211562949.1A CN115967653B (en) | 2022-12-07 | 2022-12-07 | Task-based network entity time delay evaluation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115967653A CN115967653A (en) | 2023-04-14 |
| CN115967653B true CN115967653B (en) | 2024-09-10 |
Family
ID=87360815
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211562949.1A Active CN115967653B (en) | 2022-12-07 | 2022-12-07 | Task-based network entity time delay evaluation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115967653B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101416427A (en) * | 2006-04-04 | 2009-04-22 | 艾利森电话股份有限公司 | Maximum likelihood sequence estimation in optical fibre communication systems |
| AU2020100146A4 (en) * | 2020-01-29 | 2020-02-27 | University Of Chinese Academy Of Sciences | CF-GERT Method for Risk Evaluation in New Product Research and Development |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP7532097B2 (en) * | 2020-06-02 | 2024-08-13 | キヤノン株式会社 | Image forming device |
| CN115086202B (en) * | 2022-04-14 | 2023-06-20 | 安世亚太科技股份有限公司 | Time delay analysis method and system based on network digital twin |
-
2022
- 2022-12-07 CN CN202211562949.1A patent/CN115967653B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101416427A (en) * | 2006-04-04 | 2009-04-22 | 艾利森电话股份有限公司 | Maximum likelihood sequence estimation in optical fibre communication systems |
| AU2020100146A4 (en) * | 2020-01-29 | 2020-02-27 | University Of Chinese Academy Of Sciences | CF-GERT Method for Risk Evaluation in New Product Research and Development |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115967653A (en) | 2023-04-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Qureshi et al. | Link quality and energy utilization based preferable next hop selection routing for wireless body area networks | |
| Hasan et al. | Optimizing multipath routing with guaranteed fault tolerance in Internet of Things | |
| EP1473889B1 (en) | Predictive routing in a mobile ad hoc network | |
| EP1473879B1 (en) | Predictive routing including the use of fuzzy logic in a mobile ad hoc network | |
| EP1473890B1 (en) | Predictive routing maintenance in a mobile ad hoc network | |
| Pagin et al. | Resource management for 5G NR integrated access and backhaul: A semi-centralized approach | |
| Kopeikin et al. | Dynamic mission planning for communication control in multiple unmanned aircraft teams | |
| Kamyabpour et al. | Modeling overall energy consumption in Wireless Sensor Networks | |
| Vendramin et al. | Grant: Inferring best forwarders from complex networks’ dynamics through a greedy ant colony optimization | |
| Moetesum et al. | An adaptive and efficient buffer management scheme for resource-constrained delay tolerant networks | |
| Arafat et al. | QQAR: A Q-learning-based QoS-aware routing for IoMT-enabled wireless body area networks for smart healthcare | |
| CN115865761B (en) | Network entity task activity cost evaluation method considering blocking feedback | |
| CN115967653B (en) | Task-based network entity time delay evaluation method | |
| Santos et al. | CGR: Centrality-based green routing for Low-power and Lossy Networks | |
| Zhang et al. | Sac: A novel multi-hop routing policy in hybrid distributed iot system based on multi-agent reinforcement learning | |
| CN116016218B (en) | Task-based network entity energy consumption assessment method | |
| Azim et al. | Real-time routing protocols for (m, k)-firm streams based on multi-criteria in wireless sensor networks | |
| Mishra et al. | A novel method for evaluation of reliability of WSN under different failure models | |
| Kim et al. | Adaptive Data Transmission Method According to Wireless State in Long Range Wide Area Networks. | |
| Sardouk et al. | Multi-agent system based wireless sensor network for crisis management | |
| CN115941533B (en) | Task activity cost assessment method for network entity | |
| Ruiz-Ibarra et al. | Cooperation mechanism taxonomy for wireless sensor and actor networks | |
| Al-Turjman et al. | Intelligent UAVs for Multimedia Delivery in Smart-Cities’ Applications | |
| Smith | Cognitive techniques: three types of network awareness | |
| Mokbal et al. | Energy Consumption Evaluation of AODV and AOMDV Routing Protocols in Mobile Ad-Hoc Networks |
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 |