CN107743077B - Method and device for evaluating network performance of information-physical fusion system - Google Patents
Method and device for evaluating network performance of information-physical fusion system Download PDFInfo
- Publication number
- CN107743077B CN107743077B CN201711248319.6A CN201711248319A CN107743077B CN 107743077 B CN107743077 B CN 107743077B CN 201711248319 A CN201711248319 A CN 201711248319A CN 107743077 B CN107743077 B CN 107743077B
- Authority
- CN
- China
- Prior art keywords
- time
- real
- deadline
- data streams
- queue
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
Abstract
The invention discloses a method and a device for evaluating network performance of an information-physical fusion system, and relates to the field of information-physical fusion systems. The method is used for solving the problem of low network transmission efficiency caused by the fact that different scenes adopt the same network operation parameters. The method comprises the following steps: determining the generation time and the deadline of a plurality of data streams included in a message set of an information-physical fusion system, and determining the transmission time and the transmission state of a message queue consisting of the data streams in network transmission according to the generation time and the deadline of the data streams; and dividing the data streams into a first quantity, a second quantity and a third quantity according to the transmission state, and determining the deadline failure rate according to the first quantity and the third quantity.
Description
Technical Field
The invention relates to the field of information-physical fusion systems, in particular to a method and a device for evaluating network performance of an information-physical fusion system.
Background
An information-Physical fusion system (CPS for short in English) is a large-scale networked embedded system. The system has the 3C fusion characteristic of vivid calculation, control and communication, is mainly used in the application fields of time key and safety key, and has the real-time performance and reliability as main non-functional attributes. The CPS communication provides support for distributed real-time cooperation and control, and is a bridge for interaction of a physical space and an information space. The deep interaction and fusion of control and computation pose new challenges to communication. On one hand, CPS application requires system behavior determination in a network environment, and communication can provide real-time and reliable data transmission service for calculation and control; on the other hand, large-scale heterogeneous network composition and highly dynamic physical environment may result in unpredictable communication performance. If the communication fails to meet the transmission delay limit, the CPS' design goal may be hindered from being successfully achieved.
CPS network research is involved in many CPS-related articles and can be largely divided into application-oriented instantiation analysis and underlying-oriented network research. The first type of research does not consider network factors too much, and establishes a typical CPS system by directly using the existing network, and meanwhile, some network-related optimizations may be made. The second type of research combines network characteristics under CPS to research the syntax semantics and challenges of the network. However, although the above two types of research are verified in the CPS environment, the two types of research do not consider optimizing the network design for the network requirements and proposing relevant performance evaluation indexes and methods.
Generally, the evaluation of system performance can be largely divided into qualitative evaluation analysis and quantitative evaluation analysis. However, the qualitative analysis cannot accurately reflect the influence of different operation parameters of the network on the network performance, so that the quantitative analysis is mainly adopted in the evaluation of the network. The quantitative analysis method can be mainly divided into a measurement analysis method, a modeling analysis method and a simulation analysis method, wherein the measurement analysis method is based on the assistance of physical equipment and a test program, acquires each parameter of network operation, and then carries out data analysis and processing to evaluate the network performance based on the parameter; the modeling analysis method is to establish a mathematical model between the network performance and each parameter through theoretical derivation and analyze the condition of the network performance index changing along with the parameter through changing the parameter; the simulation analysis method is to establish a network simulation model with the assistance of computer simulation software, simulate and test the network performance, observe the simulation operation conditions of the network under different parameter conditions, analyze and process the data obtained by simulation, and evaluate the network performance.
In summary, the existing network performance evaluation method has the problems that the content delivery network and the distributed control network are evaluated by the same method, and the network transmission efficiency is low due to the fact that the same network operation parameters are adopted in different scenes.
Disclosure of Invention
The embodiment of the invention provides a method and a device for evaluating network performance of an information-physical fusion system, which are used for solving the problems that a content transmission network and a distributed control network are evaluated by the same method and the same network operation parameters are adopted in different scenes, so that the network transmission efficiency is low in the conventional network performance evaluation method.
The embodiment of the invention provides a method for evaluating network performance of an information-physical fusion system, which comprises the following steps:
determining the generation time and the deadline of a plurality of data streams included in a message set of an information-physical fusion system, and determining the transmission time and the transmission state of a message queue consisting of the data streams in network transmission according to the generation time and the deadline of the data streams;
dividing the data streams into a first number, a second number and a third number according to the transmission state, wherein the first number corresponds to the data streams arriving at the message queue within the deadline; the second number corresponds to the data streams arriving at the message queue and transmitted out within the deadline; the third number corresponds to the data streams that exceed the deadline and that have not been transmitted out of the message queue;
and determining the deadline failure rate according to the first quantity and the third quantity.
Preferably, the time-to-failure rate is determined by the following equation:
where i denotes the ith message queue, k is time, Di(k) Indicating the data flow dropped by the message queue i at time k, Ai(k) Representing the newly arriving data flow for queue i at time k,
is the deadline failure rate.
Preferably, the data stream comprises a real-time data stream and a non-real-time data stream, the deadline of the real-time data stream is determined by a system, and the deadline of the non-real-time data stream is defaulted by the system;
the determining the transmission time and the transmission state of a message queue composed of a plurality of data streams in network transmission according to the generation time and the deadline of the data streams comprises the following steps:
determining a first successful transmission time or discarding information of each real-time data stream in network transmission; and determining information that the second successful transmission time or transmission delay of each non-real-time data stream in the network is greater than the second deadline.
Preferably, after dividing the data stream into the first number, the second number and the third number according to the transmission status, the method further includes:
and determining network delay according to the first successful transmission time, the number of the real-time data streams transmitted in the first successful transmission time, the second successful transmission time and the number of the non-real-time data streams transmitted in the first successful transmission time.
Preferably, after dividing the data stream into the first number, the second number and the third number according to the transmission status, the method further includes:
determining the number of said data flows in said message queue consisting of a plurality of said data flows by the following formula:
Qi(t+1)＝max[Qi(t)-Si(t)-Di(t),0]+Ai(t)
wherein Q isi(t +1) represents the number of data streams in message queue i at the end of time step t +1, Di(t) represents the number of data streams dropped from queue i in time step t, Ai(t) indicates the number of data streams arriving at queue i within time step t, Si(t) represents the number of data streams arriving in queue i and transmitted out in time steps, Qi(t) represents the number of quantity flows in message queue i at the end of time step t.
Preferably, the message queue is represented by the following formula:
Mij＝＜Eij,Dij,Tij,Pij＞
the set of messages made up of a plurality of the message queues is represented by the following formula:
θ＝{(M1,D1,P1),(M2,D2,P2),...,(Mn,Dn,Pn)}
wherein M isijRepresenting the jth data stream in queue i, EijData field representing the jth data stream in queue i, DijIndicates the deadline, T, of the jth data stream in queue iijIndicating the generation time, P, of the j-th data stream in queue iijIndicating the priority of the jth data stream in queue i, MiData flow representing queue i, DiDenotes the average deadline of queue i, PiIndicating the priority of queue i.
The embodiment of the invention also provides a device for evaluating the network performance of the information-physical fusion system, which comprises the following steps:
the information-physical fusion system comprises a first determining unit, a second determining unit and a transmitting unit, wherein the first determining unit is used for determining the generation time and the deadline of a plurality of data streams included in a message set of the information-physical fusion system, and determining the transmission time and the transmission state of a message queue consisting of the data streams in network transmission according to the generation time and the deadline of the data streams;
a dividing unit, configured to divide the data streams into a first number, a second number, and a third number according to the transmission status, where the first number corresponds to the data streams arriving at the message queue within the deadline; the second number corresponds to the data streams arriving at the message queue and transmitted out within the deadline; the third number corresponds to the data streams that exceed the deadline and that have not been transmitted out of the message queue;
and the second determining unit determines the deadline failure rate according to the first number and the third number.
Preferably, the time-to-failure rate is determined by the following equation:
where i denotes the ith message queue, k is time, Di(k) Indicating the data flow dropped by the message queue i at time k, Ai(k) Representing the newly arriving data flow for queue i at time k,
is the deadline failure rate.
Preferably, the data stream comprises a real-time data stream and a non-real-time data stream, the deadline of the real-time data stream is determined by a system, and the deadline of the non-real-time data stream is defaulted by the system;
the first determination unit is further configured to:
determining a first successful transmission time or discarding information of each real-time data stream in network transmission; and determining information that the second successful transmission time or transmission delay of each non-real-time data stream in the network is greater than the second deadline.
Preferably, the dividing unit is further configured to:
determining the number of said data flows in said message queue consisting of a plurality of said data flows by the following formula:
Qi(t+1)＝max[Qi(t)-Si(t)-Di(t),0]+Ai(t)
wherein Q isi(t +1) represents the number of data streams in message queue i at the end of time step t +1, Di(t) represents the number of data streams dropped from queue i in time step t, Ai(t) indicates the number of data streams arriving at queue i within time step t, Si(t) represents the number of data streams arriving in queue i and transmitted out in time steps, Qi(t) represents the number of quantity flows in message queue i at the end of time step t.
The embodiment of the invention provides a method and a device for evaluating network performance of an information-physical fusion system, wherein the method takes an application target of the information-physical fusion system as a starting point, sets a deadline for a data stream, divides the data stream transmitted in a data stream queue into three categories according to the deadline, and determines the deadline failure rate of the data stream in network transmission according to the divided categories, so that the network operation parameters can be adjusted according to the feedback deadline failure rate under different scenes, thereby solving the problems that the content delivery network and a distributed control network are evaluated by the same method in different scenes, and the network transmission efficiency is low due to the fact that the same network operation parameters are adopted in different scenes in the existing network performance evaluation method.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic flowchart of a method for evaluating network performance of an information-physical fusion system according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an apparatus for evaluating network performance of an information-physical fusion system according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Fig. 1 is a schematic flowchart illustrating a method for evaluating network performance of an information-physical convergence system according to an embodiment of the present invention. As shown in fig. 1, the method mainly comprises the following steps:
and 103, determining the deadline failure rate according to the first quantity and the third quantity.
Before introducing the method for evaluating the network performance of the information-physical fusion system provided by the embodiment of the present invention, it should be noted that, in the embodiment of the present invention, the method for evaluating the network performance of the information-physical fusion system is established in a CPS network abstract message set, where the message set includes N message queues waiting for transmission, and each message queue includes a plurality of data streams waiting for scheduling.
Each message queue has a plurality of data streams waiting for transmission, and each data stream can be represented by formula (1):
Mij＝＜Eij,Dij,Tij,Pij＞ (1)
in the formula (1), MijRepresenting the jth data stream in queue i, EijData field representing the jth data stream in queue i, DijIndicates the deadline, T, of the jth data stream in queue iijIndicating the generation time, P, of the j-th data stream in queue iijIndicating the priority of the jth data stream in queue i.
Further, a message set composed of a plurality of message queues can be represented by formula (2):
Mij＝＜Eij,Dij,Tij,Pij＞ (2)
in the formula (2), MiData flow representing queue i, DiDenotes the average deadline of queue i, PiIndicating the priority of queue i.
In step 101, it should be noted that the message queue forming the message set may be divided into a real-time data flow message queue and a non-real-time data flow message queue, where the real-time data flow message queue is formed by a plurality of real-time data flows, and the non-real-time data flow message queue is formed by a plurality of non-real-time data flows. In practical applications, the generation time and the deadline of the plurality of real-time data streams included in the real-time data stream message queue may be determined accordingly, and the generation time and the deadline of the plurality of non-real-time data streams included in the non-real-time data stream message queue may be determined accordingly. It should be noted that, in the embodiment of the present invention, the deadline of the real-time data flow in the real-time data flow message queue is determined by the system application, and the deadline of the non-real-time data flow in the non-real-time data flow message queue is a virtual deadline, that is, the virtual deadline is a default value of the system.
Further, after the generation time and the deadline of the real-time data streams in the real-time data stream message queue are confirmed, the transmission time and the transmission status of the real-time data stream message queue composed of the real-time data streams in the network transmission can be confirmed. After the generation time and the deadline of the plurality of non-real-time data flows in the non-real-time data flow message queue are confirmed, the transmission time and the transmission state of the non-real-time data flow message queue consisting of the plurality of non-real-time data flows in network transmission can also be confirmed.
In the embodiment of the invention, the plurality of real-time data streams included in the real-time data message queue have two states of successful transmission and unsuccessful transmission in network transmission. Specifically, if the real-time data stream is successfully transmitted in the network transmission, the successful transmission time of the real-time data stream in the network transmission needs to be confirmed, and if the real-time data stream is unsuccessfully transmitted in the network transmission, the real-time data stream needs to be discarded and recorded.
Further, the plurality of non-real-time data streams included in the non-real-time data message queue have two states of transmission success and transmission failure in network transmission. Specifically, if the non-real-time data stream is successfully transmitted in the network transmission, the successful transmission time of the non-real-time data stream in the network transmission needs to be confirmed, and if the non-real-time data stream is unsuccessfully transmitted in the network transmission, the non-real-time data stream needs to be recorded, but the non-real-time data stream is not discarded.
It should be noted that, in the embodiment of the present invention, in order to distinguish the successful transmission time of the real-time data stream in the network from the successful transmission time of the non-real-time data stream in the network, the successful transmission time of the real-time data stream in the network is recorded as the first successful transmission time, and the successful transmission time of the non-real-time data stream in the network is recorded as the second successful transmission time.
In step 102, according to the transmission status of the real-time data flows in the real-time data flow message queue, the number of the real-time data flows included in the real-time data flow message queue is divided into three categories, wherein the first number corresponds to the number of the real-time data flows arriving at the real-time data flow message queue within the deadline, the second number corresponds to the number of the real-time data flows arriving at the real-time data flow message queue within the deadline and transmitted from the real-time data flow message queue, and the third number corresponds to the number of the data flows exceeding the deadline and not transmitted from the real-time data flow message queue.
Correspondingly, the number of the plurality of non-real-time data streams included in the non-real-time data stream message queue is divided into three categories according to the transmission state of the plurality of non-real-time data streams in the non-real-time data stream message queue, wherein the first number corresponds to the number of the non-real-time data streams arriving at the non-real-time data stream message queue within the deadline, the second number corresponds to the number of the non-real-time data streams arriving at the non-real-time data stream message queue within the deadline and transmitted from the non-real-time data stream message queue, and the third number corresponds to the number of the non-real-time data streams exceeding the deadline and not transmitted from the non-real-time data stream message queue.
It should be noted that the first number and the second number correspond to the number of successful transmissions confirmed in step 101, and the third number corresponds to the number of unsuccessful transmissions confirmed in step 101.
In the embodiment of the present invention, the length of the real-time data flow message queue may be determined according to the following formula (3) after determining the first number, the sum of the second number and the third number of the real-time data flow message queue accordingly, where the formula (3) is as follows:
Qi(t+1)＝max[Qi(t)-Si(t)-Di(t),0]+Ai(t) (3)
wherein Q isi(t +1) represents the number of real-time data streams in the real-time data stream message queue i at the end of time step t +1, namely the length of the real-time data stream message queue i at the moment of t + 1; di(t) represents the number of real-time data streams dropped from the real-time data stream message queue i within time step t; a. thei(t) indicates the number of real-time data streams arriving in the real-time data stream message queue i within time step t, Si(t) represents the number of real-time data streams arriving in the real-time data stream message queue i and transmitted out, Q, within a time step ti(t) represents the number of real-time data streams in the real-time data stream message queue i at the end of time step t.
Accordingly, in identifying the first number, the sum of the second number and the third number of the non-real-time data flow message queue accordingly, the length of the non-real-time data flow message queue can also be identified according to equation (3),
Qi(t+1)＝max[Qi(t)-Si(t)-Di(t),0]+Ai(t)
wherein Q isi(t +1) represents the number of non-real-time data streams in the non-real-time data stream message queue i at the end of time step t +1, namely the length of the non-real-time data stream message queue i at the moment of t + 1; di(t) represents the number of non-real time data streams virtually discarded from the non-real time data stream message queue i within time step t; a. thei(t) indicates the number of non-real time data streams arriving in the non-real time data stream message queue i within time step t, Si(t) represents the number of non-real time data streams arriving in the non-real time data stream message queue i and transmitted out, Q, within a time step ti(t) represents the number of non-real time data streams in the non-real time data stream message queue i at the end of time step t.
It should be noted that, in the embodiment of the present invention, if the transmission of the non-real-time data stream included in the non-real-time data message queue fails in the network transmission, only the non-real-time data stream is recorded, and the non-real-time data stream is not discarded, that is, the non-real-time data stream is representedIn the formula for the length of the time data flow message queue, Di(t) represents the number of non-real time data streams virtually dropped from the non-real time data stream message queue i within time step t.
In the embodiment of the present invention, when the lengths of the real-time data flow message queue and the non-real-time data flow message queue are determined, that is, when the first functional transmission time, the first number, the second number, the third number of the real-time data flow message queue, and the second functional transmission of the non-real-time data flow message queue are determined accordingly, after the first number, the second number, and the third number of the non-real-time data flow message queue, the indicator for evaluating the Network performance of the information-physical fusion system may be determined as Metrics of < Network Delay, BitError Ratio, and performance of Delay failure >.
Specifically, the network delay of the real-time data flow message queue when one network transmission is completed may be determined according to the first successful transmission time, the first number and the second number of the real-time data flow message queue, and the network delay of the non-real-time data flow message queue when one network transmission is completed may be determined according to the second successful transmission time, the first number and the second number of the real-time data flow message queue.
The network delay of a real-time data stream message queue completing a network transmission can be represented by the following formula (4):
in the formula (4), the first and second groups,
the average value of delay time of the real-time data flow successfully transmitted in the real-time data flow message queue in the network transmission process is obtained; n is the number of corresponding real-time data streams within the first successful transmission time in the real-time data stream message queue, i.e. the sum of the first number and the second number; delayi is the transmission delay time of each successfully transmitted real-time data stream in the real-time data stream message queue recorded by the system.
Accordingly, the network delay of the non-real-time data stream message queue completing one network transmission can also be expressed by the following formula (4):
in the formula (4), the first and second groups,
the average value of delay time of the successfully transmitted non-real-time data flow in the non-real-time data flow message queue in the network transmission process is obtained; n is the number of corresponding non-real-time data streams within the second successful transmission time in the non-real-time data stream message queue, i.e. the sum of the first number and the second number; delayi is the transmission delay time of each non-real-time data stream successfully transmitted in the non-real-time data stream message queue recorded by the system.
In particular, Bit Error Ratio is defined as the Bit Error rate of network transmission, which represents the noise immunity of the network and is defined as Pe＝P(1)P(0|1)+P(0)P(1|0)
Where P (i) represents the probability of the system transmitting bit i, and P (j | i) represents the probability of the transmitting end transmitting bit i and the receiving end deciding as j. The bit error rate index can describe the anti-noise capability of the communication system under different scenes.
Specifically, the Probability of Deadline failure is a Deadline failure rate, which represents a Probability that a data stream is not successfully received within a Deadline, and the indicator is used to check whether a network meets system requirements, which can be determined by the following formula (5):
where i denotes the ith message queue, k is time, Di(k) Indicating the data flow dropped by the message queue i at time k, Ai(k) Representing the newly arriving data flow for queue i at time k,
is the deadline failure rate.
Based on the same inventive concept, the embodiment of the invention provides a device for evaluating the network performance of an information-physical fusion system, and as the principle of solving the technical problem of the device is similar to the method for evaluating the network performance of the information-physical fusion system, the implementation of the device can refer to the implementation of the method, and repeated parts are not described again.
Fig. 2 is a schematic structural diagram of an apparatus for evaluating network performance of an information-physical fusion system according to an embodiment of the present invention, and as shown in fig. 2, the apparatus includes a first determining unit 21, a dividing unit 22, and a second determining unit 23.
A first determining unit 21, configured to determine generation time and deadline of multiple data streams included in a message set of an information-physical fusion system, and determine transmission time and transmission status of a message queue composed of the multiple data streams in network transmission according to the generation time and deadline of the data streams;
a dividing unit 22, configured to divide the data streams into a first number, a second number, and a third number according to the transmission status, where the first number corresponds to the data streams arriving at the message queue within the deadline; the second number corresponds to the data streams arriving at the message queue and transmitted out within the deadline; the third number corresponds to the data streams that exceed the deadline and that have not been transmitted out of the message queue;
and a second determining unit 23 that determines the deadline failure rate according to the first number and the third number.
Preferably, the time-to-failure rate is determined by the following equation:
where i denotes the ith message queue, k is time, Di(k) Indicating the data flow dropped by the message queue i at time k, Ai(k) Representing the newly arriving data flow for queue i at time k,
is the deadline failure rate.
Preferably, the data stream comprises a real-time data stream and a non-real-time data stream, the deadline of the real-time data stream is determined by a system, and the deadline of the non-real-time data stream is defaulted by the system;
the first determination unit 21 is further configured to:
determining a first successful transmission time or discarding information of each real-time data stream in network transmission; and determining information that the second successful transmission time or transmission delay of each non-real-time data stream in the network is greater than the second deadline.
Preferably, the dividing unit 22 is further configured to:
determining the number of said data flows in said message queue consisting of a plurality of said data flows by the following formula:
Qi(t+1)＝max[Qi(t)-Si(t)-Di(t),0]+Ai(t)
wherein Q isi(t +1) represents the number of data streams in message queue i at the end of time step t +1, Di(t) represents the number of data streams dropped from queue i in time step t, Ai(t) indicates the number of data streams arriving at queue i within time step t, Si(t) represents the number of data streams arriving in queue i and transmitted out in time steps, Qi(t) represents the number of quantity flows in message queue i at the end of time step t.
It should be understood that the above device for evaluating network performance of an information-physical fusion system includes only logical partitions according to functions implemented by the apparatus, and in practical applications, the above units may be stacked or split. The functions implemented by the apparatus for evaluating network performance of an information-physical convergence system provided in this embodiment correspond to the method for evaluating network performance of an information-physical convergence system provided in the foregoing embodiment one by one, and for a more detailed processing flow implemented by the apparatus, the detailed description is already given in the foregoing method embodiment, and the detailed description is not repeated here.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (10)
1. A method for evaluating network performance of an information-physical fusion system, comprising:
determining the generation time and the deadline of a plurality of data streams included in a message set of an information-physical fusion system, and determining the transmission time and the transmission state of a message queue consisting of the data streams in network transmission according to the generation time and the deadline of the data streams;
dividing the data streams into a first number, a second number and a third number according to the transmission state, wherein the first number corresponds to the data streams arriving at the message queue within the deadline; the second number corresponds to the data streams arriving at the message queue and transmitted out within the deadline; the third number corresponds to the data streams that exceed the deadline and that have not been transmitted out of the message queue;
determining a deadline failure rate according to the first number and the third number; and adjusting network operation parameters according to the deadline failure rate.
2. The method of claim 1, wherein the deadline failure rate is determined by the following equation:
where i denotes the ith message queue, k is time, Di(k) Indicating the data flow dropped by the message queue i at time k, Ai(k) Indicating the newly arrived data flow, P, of queue i at time ki dmIs the deadline failure rate.
3. The method of claim 1, wherein the data stream comprises a real-time data stream and a non-real-time data stream, wherein an expiration time of the real-time data stream is determined by a system, and wherein an expiration time of the non-real-time data stream is defaulted by the system;
the determining the transmission time and the transmission state of a message queue composed of a plurality of data streams in network transmission according to the generation time and the deadline of the data streams comprises the following steps:
determining a first successful transmission time or discarding information of each real-time data stream in network transmission; determining information that a second successful transmission time or transmission delay of each non-real-time data stream in the network is larger than a second deadline;
and the successful transmission time of the real-time data stream in the network is the first successful transmission time, and the successful transmission time of the non-real-time data stream in the network is the second successful transmission time.
4. The method of claim 3, wherein said dividing the data streams into a first number, a second number, and a third number according to the transmission status further comprises:
and determining network delay according to the first successful transmission time, the number of the real-time data streams transmitted in the first successful transmission time, the second successful transmission time and the number of the non-real-time data streams transmitted in the second successful transmission time.
5. The method of claim 1, wherein said dividing the data streams into a first number, a second number, and a third number according to the transmission status further comprises:
determining the number of said data flows in said message queue consisting of a plurality of said data flows by the following formula:
Qi(t+1)＝max[Qi(t)-Si(t)-Di(t),0]+Ai(t)
wherein Q isi(t +1) represents the number of data streams in message queue i at the end of time step t +1, Di(t) represents the number of data streams dropped from queue i in time step t, Ai(t) indicates the number of data streams arriving at queue i within time step t, Si(t) represents the number of data streams arriving in queue i and transmitted out in time step t, Qi(t) represents the number of quantity flows in message queue i at the end of time step t.
6. The method of claim 1, wherein the message queue is represented by the following formula:
Mij＝＜Eij,Dij,Tij,Pij＞
the set of messages made up of a plurality of the message queues is represented by the following formula:
θ＝{(M1,D1,P1),(M2,D2,P2),...,(Mn,Dn,Pn)}
wherein M isijRepresenting the jth data stream in queue i, EijData field representing the jth data stream in queue i, DijIndicates the deadline, T, of the jth data stream in queue iijIndicating the generation time, P, of the j-th data stream in queue iijIndicating the priority of the jth data stream in queue i, MiData flow representing queue i, DiDenotes the average deadline of queue i, PiIndicating the priority of queue i.
7. An apparatus for evaluating network performance of an cyber-physical system, comprising:
the information-physical fusion system comprises a first determining unit, a second determining unit and a transmitting unit, wherein the first determining unit is used for determining the generation time and the deadline of a plurality of data streams included in a message set of the information-physical fusion system, and determining the transmission time and the transmission state of a message queue consisting of the data streams in network transmission according to the generation time and the deadline of the data streams;
a dividing unit, configured to divide the data streams into a first number, a second number, and a third number according to the transmission status, where the first number corresponds to the data streams arriving at the message queue within the deadline; the second number corresponds to the data streams arriving at the message queue and transmitted out within the deadline; the third number corresponds to the data streams that exceed the deadline and that have not been transmitted out of the message queue;
a second determining unit, which determines the deadline failure rate according to the first quantity and the third quantity; and adjusting network operation parameters according to the deadline failure rate.
8. The apparatus of claim 7, wherein the deadline failure rate is determined by the following equation:
where i denotes the ith message queue, k is time, Di(k) Indicating the data flow dropped by the message queue i at time k, Ai(k) Indicating the newly arrived data flow, P, of queue i at time ki dmIs the deadline failure rate.
9. The apparatus of claim 7, wherein the data stream comprises a real-time data stream and a non-real-time data stream, an expiration time of the real-time data stream is determined by a system, and an expiration time of the non-real-time data stream is defaulted by the system;
the first determination unit is further configured to:
determining a first successful transmission time or discarding information of each real-time data stream in network transmission; determining information that a second successful transmission time or transmission delay of each non-real-time data stream in the network is larger than a second deadline;
and the successful transmission time of the real-time data stream in the network is the first successful transmission time, and the successful transmission time of the non-real-time data stream in the network is the second successful transmission time.
10. The apparatus of claim 7, wherein the partitioning unit is further to:
determining the number of said data flows in said message queue consisting of a plurality of said data flows by the following formula:
Qi(t+1)＝max[Qi(t)-Si(t)-Di(t),0]+Ai(t)
wherein Q isi(t +1) represents the number of data streams in message queue i at the end of time step t +1, Di(t) represents the number of data streams dropped from queue i in time step t, Ai(t) indicates the number of data streams arriving at queue i within time step t, Si(t) represents the number of data streams arriving in queue i and transmitted out in time step t, Qi(t) represents the number of quantity flows in message queue i at the end of time step t.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711248319.6A CN107743077B (en) | 2017-11-30 | 2017-11-30 | Method and device for evaluating network performance of information-physical fusion system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711248319.6A CN107743077B (en) | 2017-11-30 | 2017-11-30 | Method and device for evaluating network performance of information-physical fusion system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107743077A CN107743077A (en) | 2018-02-27 |
| CN107743077B true CN107743077B (en) | 2020-09-15 |
Family
ID=61239518
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711248319.6A Active CN107743077B (en) | 2017-11-30 | 2017-11-30 | Method and device for evaluating network performance of information-physical fusion system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107743077B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111835533A (en) * | 2019-04-15 | 2020-10-27 | 富士通株式会社 | Device for checking block chain network |
| CN111931066B (en) * | 2020-09-11 | 2021-09-07 | 四川新网银行股份有限公司 | Real-time recommendation system design method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1083709A3 (en) * | 1999-09-10 | 2004-05-06 | Lucent Technologies Inc. | Method and apparatus for scheduling traffic to meet quality of service requirements in a communication network |
| EP3046298A1 (en) * | 2015-01-15 | 2016-07-20 | Alcatel Lucent | Earliest deadline first scheduling system |
| CN106972987A (en) * | 2017-04-25 | 2017-07-21 | 国网江苏省电力公司南京供电公司 | The Delay Analysis of WirelessHART network end-to-ends data transfer in intelligent grid |
| CN107332786A (en) * | 2017-06-16 | 2017-11-07 | 大连理工大学 | A kind of dispatching method that data flow deadline is ensured under service chaining environment |
-
2017
- 2017-11-30 CN CN201711248319.6A patent/CN107743077B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1083709A3 (en) * | 1999-09-10 | 2004-05-06 | Lucent Technologies Inc. | Method and apparatus for scheduling traffic to meet quality of service requirements in a communication network |
| EP3046298A1 (en) * | 2015-01-15 | 2016-07-20 | Alcatel Lucent | Earliest deadline first scheduling system |
| CN106972987A (en) * | 2017-04-25 | 2017-07-21 | 国网江苏省电力公司南京供电公司 | The Delay Analysis of WirelessHART network end-to-ends data transfer in intelligent grid |
| CN107332786A (en) * | 2017-06-16 | 2017-11-07 | 大连理工大学 | A kind of dispatching method that data flow deadline is ensured under service chaining environment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107743077A (en) | 2018-02-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102201919B1 (en) | Random forest model training method, electronic device and storage medium | |
| CN109981744B (en) | Data distribution method and device, storage medium and electronic equipment | |
| CN108965014A (en) | The service chaining backup method and system of QoS perception | |
| CN102724103A (en) | Proxy server, hierarchical network system and distributed workload management method | |
| CN107743077B (en) | Method and device for evaluating network performance of information-physical fusion system | |
| CN109474449A (en) | A kind of method and device of processing network slice example | |
| CN112532409A (en) | Network parameter configuration method and device, computer equipment and storage medium | |
| CN109728981A (en) | A kind of cloud platform fault monitoring method and device | |
| CN109118097B (en) | Reliability maintainability guarantee assessment method and device | |
| CN111369009A (en) | Distributed machine learning method capable of tolerating untrusted nodes | |
| CN110019386A (en) | A kind of stream data processing method and equipment | |
| CN117082008B (en) | Virtual elastic network data transmission scheduling method, computer device and storage medium | |
| CN110941486A (en) | Task management method and device, electronic equipment and computer readable storage medium | |
| WO2022062648A1 (en) | Automatic driving simulation task scheduling method and apparatus, device, and readable medium | |
| CN113543160B (en) | 5G slice resource allocation method, device, computing equipment and computer storage medium | |
| CN109697117A (en) | Terminal control method, device and computer readable storage medium | |
| CN106951278B (en) | Data processing method and device | |
| CN109167738A (en) | The method and apparatus of dispatching communication data | |
| CN114448838B (en) | System reliability evaluation method | |
| US9887928B2 (en) | System and method for identifying performance characteristics in asynchronous networks | |
| WO2013026389A1 (en) | Method and device for simulation | |
| CN112532447A (en) | RDMA parameter configuration method, device and storage medium | |
| CN113747506A (en) | Resource scheduling method, device and network system | |
| CN108259527B (en) | Proxy-based service processing method and device and network element equipment | |
| CN114189454B (en) | Evaluation method, framework, device and electronic equipment of network scheduling strategy |
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 |