CN117915366B - A multi-dimensional service quality assurance method, system and device - Google Patents
A multi-dimensional service quality assurance method, system and device Download PDFInfo
- Publication number
- CN117915366B CN117915366B CN202410075414.4A CN202410075414A CN117915366B CN 117915366 B CN117915366 B CN 117915366B CN 202410075414 A CN202410075414 A CN 202410075414A CN 117915366 B CN117915366 B CN 117915366B
- Authority
- CN
- China
- Prior art keywords
- service quality
- peak information
- delay
- quality assurance
- information freshness
- 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
- 238000000275 quality assurance Methods 0.000 title claims description 48
- 238000000034 method Methods 0.000 claims abstract description 54
- 238000005259 measurement Methods 0.000 claims abstract description 13
- 230000005540 biological transmission Effects 0.000 claims description 35
- 230000008569 process Effects 0.000 claims description 27
- 238000005516 engineering process Methods 0.000 claims description 17
- 230000006870 function Effects 0.000 claims description 16
- 230000007246 mechanism Effects 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 10
- 230000001186 cumulative effect Effects 0.000 claims description 7
- 230000007423 decrease Effects 0.000 claims description 7
- 238000012512 characterization method Methods 0.000 claims description 2
- 238000004891 communication Methods 0.000 description 16
- 238000004088 simulation Methods 0.000 description 15
- 238000010586 diagram Methods 0.000 description 8
- 238000005562 fading Methods 0.000 description 8
- 238000004458 analytical method Methods 0.000 description 5
- 238000013459 approach Methods 0.000 description 5
- 230000007547 defect Effects 0.000 description 5
- 238000013461 design Methods 0.000 description 4
- IKGXIBQEEMLURG-NVPNHPEKSA-N rutin Chemical compound O[C@@H]1[C@H](O)[C@@H](O)[C@H](C)O[C@H]1OC[C@@H]1[C@@H](O)[C@H](O)[C@@H](O)[C@H](OC=2C(C3=C(O)C=C(O)C=C3OC=2C=2C=C(O)C(O)=CC=2)=O)O1 IKGXIBQEEMLURG-NVPNHPEKSA-N 0.000 description 4
- 230000009466 transformation Effects 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 230000006399 behavior Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000011217 control strategy Methods 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000003908 quality control method Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0006—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
- H04L1/0007—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format by modifying the frame length
-
- 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
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/06—Testing, supervising or monitoring using simulated traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/08—Testing, supervising or monitoring using real traffic
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A multi-dimensional service quality guarantee method, system and equipment comprise the steps of taking peak information freshness as a service quality guarantee parameter to evaluate and adjust data freshness, performing measurement modeling, obtaining peak information freshness service quality guarantee indexes based on HARQ-IR (hybrid automatic repeat request-infrared) representation peak information freshness violation probability in the field of limited code length coding, obtaining new time delay and reliability service quality guarantee indexes by representing violation probabilities related to time delay and error rate in the field of limited code length coding, approximately establishing a maximum supportable arrival rate model according to the peak information freshness, the time delay and the reliability service quality guarantee indexes, and solving the problem that the existing single service quality guarantee method cannot be suitable for various application scenes and extreme multi-dimensional performance indexes.
Description
Technical Field
The present invention relates to the field of wireless communications technologies, and in particular, to a method, a system, and an apparatus for guaranteeing multidimensional service quality.
Background
With the continuous development of information society, the demand for wireless communication networks is increasing. Considering the problems of complex transmission scene, diversified demands and multi-dimension resources, the method provides new challenges for the three aspects of short code service quality guarantee management, control and optimization. The traditional single service quality guarantee index is difficult to meet higher-level, stricter and more diverse performance requirements, so that the systematic establishment of an effective capacity unified model is more complicated. Aiming at the contradiction between the complicated service scene requirements and the extreme performance requirements faced by the future wireless network, the modeling, the guarantee and the analysis of the multi-dimensional heterogeneous service quality requirements for the key technology are very important. From a plurality of latitudes, the service quality guarantee technology is an important support of the future ultra-reliable low-delay communication service scene. However, under limited resource conditions, the conventional single statistical delay service quality control theory is no longer applicable to future wireless communication services with ultra-high reliability as a priority. Meanwhile, the unilateral method of prolonging the transmission time, increasing the transmission code length and the like improves the reliability of the system, and is not suitable for time delay sensitive wireless communication service. In addition, in the field of limited code length, the traditional technical means for expanding and optimizing the system capacity is not suitable for the requirements of ultra-high efficiency, ultra-large capacity and mass communication of future wireless communication services. Based on the method, the bottleneck problems of contradiction between time delay management and control and reliability priority requirements of the time delay/reliability sensitive multimedia service and contradiction between system capacity optimization and extreme performance requirements are caused on the premise of limited resources. How to build a multidimensional short code service quality guarantee system, uniformly modeling the effective capacity under the constraint condition of delay and reliability combination, and ensuring the dynamic and efficient adaptation of network resources is a difficult problem to be solved.
The patent application document with the publication number of CN106686605B discloses a statistical delay service quality guarantee method for energy efficiency in a wireless sensor network, the method obtains the optimal energy efficiency of a sensor node and a corresponding optimal power distribution scheme, and the optimal power distribution scheme can be dynamically adjusted based on the delay service quality requirement and the channel condition of a main transmitter. The method has the defects that only the service quality guarantee based on single statistical time delay is considered, the traditional service quality level division based on limited and single statistical time delay is not suitable for a novel converged network architecture, specific customized network processing cannot be provided, or the extreme service quality requirement of complicated service scenes is guaranteed. Therefore, the system design lacks consideration of quality of service coefficients of dimensions such as reliability, so that universality of the system design is reduced, and extreme demands of future wireless networks such as ultra-high speed, ultra-high reliability, ultra-low time delay and the like cannot be supported.
C.Li, C.She, N.Yang, T.Q.S.Quek in its published paper "Secure Transmission Rate of Short Packets With Queueing Delay Requirement"(IEEE Transactions on Wireless Communications,2022,21(1)：203-218), a secure short packet transmission power control strategy under the average power constraint and queuing delay requirements is proposed to ensure that ultra-low delay is achieved in secure short packet transmission. In the field of limited code length coding, the method designs a maximum secret rate model which can be realized for statistical time delay service quality, and optimizes the transmitting power on the premise of different channel states so as to ensure the service quality. The method has the defects that only the time delay service quality in the short data packet communication is considered, the reliability problem faced by the short data packet communication is ignored, and the effective transmission problem facing the time delay and reliability combined service quality guarantee is not solved by using the traditional effective capacity formula, so that the ultra-reliable low-time delay requirement of the future wireless communication cannot be completely met.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention aims to provide a multi-dimensional service quality guarantee method, a system and equipment, which are used for solving the problem that the existing single service quality guarantee method cannot be suitable for various application scenes and extreme and multi-dimensional performance indexes by identifying and defining new statistical multi-dimensional service quality guarantee indexes, and providing reliable theoretical basis and technical support for realizing extreme demands of future wireless networks such as ultra-large capacity, ultra-high reliability, ultra-low time delay and the like.
In order to achieve the above purpose, the technical scheme adopted by the invention is as follows:
A multi-dimensional service quality guarantee method comprises the following steps:
step 1, evaluating and adjusting data freshness by taking peak information freshness as a service quality guarantee parameter, and modeling the measurement thereof to establish a peak information freshness model;
Step 2, representing the peak information freshness violation probability based on a hybrid automatic repeat request and incremental redundancy technique (HARQ-IR) in the field of limited code length coding according to the peak information freshness model obtained in the step 1, and obtaining a peak information freshness service quality guarantee index;
Step 3, in the field of limited code length coding, representing the violation probability related to time delay and error rate, and obtaining new time delay and reliability service quality assurance indexes;
And 4, establishing a maximum supportable arrival rate model, namely 'epsilon-effective capacity', according to the service quality guarantee index of the peak value information freshness obtained in the step 2 and the time delay and reliability service quality guarantee index obtained in the step 3.
In the step 1, the peak information freshness model is as follows:
TAoI(u)＝TI(u-1,u)-T(u)
Where T AoI (u) represents peak information freshness, T I (u-1, u) represents the arrival time interval between two state update packets (u-1) and u, and T (u) represents the service time of state update packet u.
The specific process of the step 2 is as follows:
Step 2.1, defining a service quality guarantee index theta AoI based on the freshness of the peak information according to a large deviation principle, wherein the service quality guarantee index theta AoI is used for representing the relation between a threshold value of the freshness of the peak information and the violation probability of the freshness of the peak information exceeding a given threshold value and measuring the exponential decay rate of the violation probability of the freshness of the peak information;
The upper bound of the peak information freshness violation probability p AoI (u) is obtained by the mellin transform as follows:
Where a th represents a peak information freshness violation threshold, n represents a code length, and K (θ AoI, u) is a kernel function for measuring the freshness of peak information, which is defined as follows:
Wherein, Represents the mellin transformation of the arrival time interval of the update packets u-1 to u based on the transmission status in the area of signal-to-noise ratio,A melin transform representing the cumulative service time in the signal-to-noise ratio domain for updating packets v through u based on transmission status, the definition expression of which is as follows:
Step 2.2, assuming that the arrival update follows a poisson process with a rate λ according to the peak information freshness violation probability model obtained in step 2.1, the arrival time interval can be regarded as an exponential process with a rate λ, and the upper bound of the peak information freshness violation probability p AoI (u) can be simplified as follows:
Wherein, A melin transform representing the service time of the update packet u based on the transmission status in the signal-to-noise ratio domain, the definition expression of which is as follows:
Step 2.3, in the field of limited code length coding using HARQ-IR techniques, each limited code length code word of length n is divided into L modules, each module comprising Of symbols, i.eAnd these modules are continuously transmitted at a subsequent time, the peak information freshness violation probability can be expressed approximately as:
Where T represents the unit time used per channel and ε l (u) represents the bit error rate of the transmission status update packet u when transmitting the first HARQ-IR module.
The specific process of obtaining the delay service quality assurance index is as follows:
Step 3.11, constructing a measurement standard oriented to a delay service quality guarantee mechanism, and converging the distribution of the process Q (t) to a random variable Q (infinity) under sufficient conditions according to a large deviation principle so as to enable
The parameter theta delay is a service quality guarantee index (theta delay > 0) based on time delay, and the service quality guarantee index theta delay based on time delay is used for measuring the exponential fading rate of the violation probability of the time delay service quality guarantee;
Step 3.12, using the mellin transformation, the arrival process and the service process are effectively analyzed, and then the upper bound of the delay service quality guarantee violation probability p delay (u) can be obtained, as follows:
Wherein D th represents the delay bound, Is a kernel function for measuring queuing delay, and is defined as follows:
Meanwhile, the following stability conditions can be satisfied:
MA(u)(1+θdelay)MS(u)(1-θdelay)<1
where M A(u)(θdelay) represents the mellin transform in the signal-to-noise ratio domain with respect to the arrival process and M S(u)(θdelay) represents the mellin transform in the signal-to-noise ratio domain with respect to the service process.
And (3) representing the violation probability of the error rate in the step (3) to obtain a reliability service quality assurance index, wherein the specific process is as follows:
Step 3.21, constructing a measure for a reliable quality of service guarantee mechanism, systematically describing the attenuation situation when the error probability e (u) increases along with the code length n, and according to the large deviation principle, when the coding rate is lower than the channel capacity, characterizing the exponential attenuation rate of the reliable quality of service violation probability (i.e. the error rate) based on the reliable quality of service guarantee index, wherein the exponential attenuation rate is defined as follows:
Wherein e (u) indicates the bit error rate for the state update packet u, the above-mentioned reliable quality of service guarantee index characterization formula states that the bit error rate decays at an exponential rate θ error, measures that the severity of the statistical reliability of the quality of service guarantee increases with increasing code length n, and correspondingly, for a given code rate, the bit error rate decreases exponentially as the code length n approaches infinity, i.e.
∈(u)≤exp(-nθerror)
Step 3.22, the reliability-based quality of service guarantee index can be obtained by definition, and the specific definition is as follows:
θerror＝sup{E0[ρ,Px(x)]-ρR*(u)}
Where R * (u) is the maximum coding rate for the state update packet u, ρ ε [0,1] is the Lagrangian multiplier parameter, P x (x) is the Probability Density Function (PDF) of the transmission signal vector x, E 0[ρ,Px (x) ] is defined as the Cumulative Generation Function (CGF) expressed as follows:
Where γ (u) represents the signal-to-interference-and-noise ratio of the system.
In the step 4, on the premise of constructing the peak information freshness, time delay and reliability combined service quality guarantee constraint, the maximum supportable arrival rate model, namely 'epsilon-effective capacity', and the EC ε (theta) approximate expression is as follows:
In the step 3.22, E 0[ρ,Px (x) is expressed progressively by applying a Jensen inequality, and the statistical reliability service quality guarantee index is modeled accurately under the condition of high signal-to-noise ratio.
A multi-dimensional quality of service assurance system, comprising:
The peak information freshness module is used for evaluating and adjusting the data freshness by taking the peak information freshness as a service quality guarantee parameter, and modeling the measurement of the data freshness to establish a peak information freshness model;
The peak information freshness service quality guarantee index module is used for representing the peak information freshness violation probability based on a hybrid automatic repeat request and incremental redundancy technology (HARQ-IR) in the field of limited code length coding according to the peak information freshness model obtained by the peak information freshness module, so as to obtain a peak information freshness service quality guarantee index;
The delay and reliability service quality guarantee index module characterizes the violation probability of the delay and the error rate in the field of limited code length coding, and obtains delay and reliability service quality guarantee indexes;
And the arrival rate model module is used for establishing a maximum supportable arrival rate model, namely 'epsilon-effective capacity', according to the service quality guarantee index of the freshness of the peak information and the delay and reliability service quality guarantee index.
A multi-dimensional quality of service assurance device, comprising:
a memory for storing a computer program of the multi-dimensional quality of service assurance method;
and the processor is used for realizing a multidimensional service quality guarantee method when executing the computer program.
A computer readable storage medium storing a computer program which, when executed by a processor, enables a multi-dimensional quality of service assurance method.
Compared with the prior art, the invention has the beneficial effects that:
Firstly, the invention fills the defect of the traditional quality of service guarantee performance index, and aims at the defect of the research on the quality of service guarantee indexes such as non-zero error rate, information freshness and the like at present, and a multi-dimensional quality of service guarantee performance index system for short codes is re-identified and defined, so as to construct a multi-dimensional quality of service guarantee method, realize the measurement modeling of information freshness, time delay and reliability, effectively reflect various and extremely performance indexes in special application scenes and support the complete end-to-end multiple application scenes in the future wireless network.
Secondly, in the field of limited code length coding, the invention develops a statistical multidimensional service quality guarantee mechanism, measures the exponential fading rate of the violation probability of a plurality of service quality guarantees, asymptotically formulates a corresponding analysis and measurement model for the ultra-reliable low-delay communication performance index, comprises error rate, peak information freshness violation probability and delay violation probability exponential function, analyzes the interdependence, coupling and restriction relation among multidimensional service quality guarantee performance indexes, expands supportable application scenes, and supports the establishment of a comprehensive performance guarantee mechanism for future ultra-reliable low-delay communication.
Thirdly, the invention defines a new unified epsilon-effective capacity theory, balances the freshness of peak information, queuing delay and transmission error rate in short code transmission through a peak information freshness, delay and reliability combined control mechanism, provides an effective capacity universality model oriented to multidimensional heterogeneous service quality guarantee, and lays a theoretical foundation for realizing resource self-adaptive adjustment.
In summary, the invention establishes a multidimensional statistical service quality guarantee mechanism oriented to information freshness, time delay and reliability by using a hybrid automatic repeat request and incremental redundancy technology aiming at the field of limited code length transmission, creatively defines a new 'epsilon-effective capacity' theory oriented to peak information freshness, time delay and reliability, provides an effective capacity universality model oriented to multidimensional heterogeneous service quality guarantee, and lays a theoretical foundation for ensuring dynamic and efficient adaptation of network resources.
Drawings
FIG. 1 is a diagram of a system model constructed in accordance with the present invention.
Fig. 2 is a diagram of a joint resource scheduling model constructed by the invention and oriented to the quality of service guarantee of short codes.
Fig. 3 is a technical route and working principle diagram of the invention.
FIG. 4 is a simulation diagram of the simulation experiment 1 of the present invention, showing the relationship between the peak information freshness violation probability and the peak information freshness QoS guarantee index.
FIG. 5 is a diagram showing the relationship between the freshness of the peak information and the code length n in the simulation experiment 2 of the present invention.
Fig. 6 is a simulation diagram of the simulation experiment 3 of the present invention, which shows the relationship between the time delay violation probability and the time delay service quality assurance index.
Fig. 7 is a simulation diagram of the simulation experiment 4 of the present invention, which shows the relationship between the bit error rate and the reliability service quality assurance index.
FIG. 8 is a simulation of the present invention simulation experiment 5 showing the relationship between "ε -effective capacity" and code length n.
Detailed Description
The invention is described in further detail below with reference to the drawings and examples.
Aiming at the field of limited code length transmission, the invention provides a multidimensional statistical service quality guarantee mechanism by using a hybrid automatic repeat request and incremental redundancy technology (HARQ-IR). The dynamic joint control scheme is designed by designing a measurement model based on information freshness, characterizing service quality indexes with limited peak information freshness by using a hybrid automatic repeat request and incremental redundancy technical protocol, developing a group of new basic statistical service quality indexes in a limited code length range, including service quality indexes based on time delay and service quality indexes based on bit error rate in limited code length transmission, evaluating and analyzing a multidimensional statistical service quality guarantee scheme, defining a new unified epsilon-effective capacity formula, accurately and quantitatively characterizing a modeling frame for joint statistical service quality guarantee of peak information freshness, time delay and reliability.
As shown in fig. 1, the steps of the present invention are as follows:
step 1, evaluating and adjusting data freshness by taking peak information freshness as a service quality guarantee parameter, and modeling the measurement thereof to establish a peak information freshness model;
The peak information freshness model is as follows:
TAoI(u)＝TI(u-1,u)-T(u)
Where T AoI (u) represents peak information freshness, T I (u-1, u) represents the arrival time interval between two state update packets (u-1) and u, and T (u) represents the service time of state update packet u.
Step 2, using a finite code length coding (FBC) technology, a hybrid automatic repeat request (HARQ) technology and an incremental redundancy technology to represent the peak information freshness violation probability;
And 2.1, quantitatively describing a statistical quality of service guarantee technology for information freshness, defining a quality of service guarantee index theta AoI based on the freshness of peak information according to a large deviation principle, representing the relation between a threshold value of the freshness of the peak information and the violation probability of the freshness of the peak information exceeding a given threshold value, measuring the exponential decay rate of the violation probability of the freshness of the peak information, aiming at relieving the tail violation related to the freshness index of the peak information, wherein the violation probability of the freshness of the peak information quantitatively represents the tail behavior of the freshness of the peak information and can be compared with the time delay and the violation probability of the bit error rate.
The upper bound of the peak information freshness violation probability p AoI (u) is obtained by the mellin transform as follows:
Where a th represents a peak information freshness violation threshold, n represents a code length, and K (θ AoI, u) is a kernel function for measuring the freshness of peak information, which is defined as follows:
Wherein, Represents the mellin transformation of the arrival time interval of the update packets u-1 to u based on the transmission status in the area of signal-to-noise ratio,A melin transform representing the cumulative service time in the signal-to-noise ratio domain for updating packets v through u based on transmission status, the definition expression of which is as follows:
The above peak information freshness violation probability model comprehensively describes probability limits of peak information freshness violations under a wireless communication network modeling framework driven by information freshness. The result is helpful to compare with the time delay and the error rate violation probability, thereby establishing a multidimensional service quality assurance system based on information freshness, time delay and error rate.
Step 2.2, based on the above model, assuming that the arrival update follows a poisson process with a rate λ, the arrival time interval can be seen as an exponential process with a rate λ, and therefore, the upper bound of the peak information age violation probability p AoI (u) can be reduced to the following result:
Wherein, A melin transform representing the service time of the update packet u based on the transmission status in the signal-to-noise ratio domain, the definition expression of which is as follows:
step 2.3, using HARQ-IR technique, in the field of limited code length, each limited code length code word of length n is divided into L modules, each module comprising Of symbols, i.eAnd these modules are continuously transmitted at a later time. The peak information freshness violation probability can be expressed approximately as:
Where T represents the unit time used per channel and ε l (u) represents the bit error rate of the transmission status update packet u when transmitting the first HARQ-IR module.
By applying the HARQ-IR protocol, an analysis of the asymptotic peak information freshness violation probability is provided. Due to the dynamic characteristics of channel fading, the closed expression of the peak information freshness violation probability becomes complex, so that the asymptotic expression under the condition of high signal-to-noise ratio can be adopted for analysis in a more convenient manner. This simplification helps to more clearly understand the system behavior while still capturing its fundamental features.
Step 3, representing the violation probability related to the time delay and the bit error rate in the field of limited code length, and developing a group of new service quality guarantee performance indexes with bounded statistical time delay and bit error rate;
Step 3.11, quantitatively describing a statistical quality of service guarantee technology facing to time delay, constructing a measurement standard facing to a time delay quality of service guarantee mechanism, thereby facilitating the explanation of a design thought of multi-source business time delay quality of service guarantee, and converging the distribution of a process Q (t) to a random variable Q (infinity) under a sufficient condition according to a large deviation principle, so that
The Q th is a queue length limit, the parameter theta delay is called a delay-based quality of service guarantee index (theta delay > 0) and is used for measuring an exponential fading rate of a delay quality of service guarantee violation probability, the larger the theta delay is, the faster the fading rate is, which indicates that the system can provide a strict delay quality of service guarantee requirement, the slower the fading rate is, which indicates that the delay quality of service guarantee requirement provided by the system is loose, and when the theta delay gradually approaches infinity, the system cannot tolerate any delay and corresponds to a very strict delay quality of service guarantee constraint.
Step 3.12, using the mellin transform, the arrival process and the service process are effectively analyzed, and further the upper bound of the delay violation probability p delay (u) can be deduced, as follows:
Wherein D th represents the delay bound, Is a kernel function for measuring queuing delay, and is defined as follows:
Meanwhile, the following stability conditions can be satisfied:
MA(u)(1+θdelay)MS(u)(1-θdelay)<1
Where M A(u)(θdelay) represents the mellin transform in the signal-to-noise ratio domain with respect to the arrival process and M S(u)(θdelay) represents the mellin transform in the signal-to-noise ratio domain with respect to the service process.
Step 3.21, quantitatively describing a reliability-oriented statistical quality of service guarantee technology, constructing a measure for a reliability quality of service guarantee mechanism in the field of limited code length, systematically describing the attenuation situation when the error probability (e (u)) increases along with the code length (n), and according to the principle of large deviation, when the coding rate is lower than the channel capacity, characterizing the exponential attenuation rate of the reliability quality of service violation probability (namely the error rate) by a quality of service guarantee index based on the error rate, wherein the method is defined as follows:
Wherein, E (u) indicates the error rate of the state update data packet u, and the above formula indicates that the error rate decays at an exponential rate θ error, and the severity of the statistical reliability service quality guarantee is measured to increase with the increase of the code length n. Accordingly, for a given coding rate, the bit error rate decreases exponentially as the code length n tends to infinity, i.e
∈(u)≤exp(-nθerror)
Step 3.22, the service quality guarantee index based on the error rate can be obtained by definition, and the specific definition is as follows:
Where R * (u) is the maximum coding rate for the state update packet u, ρ ε [0,1] is the Lagrangian multiplier parameter, P x (x) is the Probability Density Function (PDF) of the transmission signal vector x, E 0[ρ,Px (x) ] is defined as the Cumulative Generation Function (CGF) expressed as follows:
Where γ (u) represents the signal-to-interference-and-noise ratio of the system.
The most challenging part of the closed expression of the reliability quality of service assurance indicators obtained from the above formula involves solving a closed solution of E 0[ρ,Px (x) described in the cumulative generation function, by applying the Jensen inequality, E 0[ρ,Px (x) can be expressed progressively. In addition, the statistical reliability service quality guarantee index can be accurately modeled under the condition of high signal-to-noise ratio.
And step 4, creatively providing an epsilon-effective capacity for supporting ultra-reliable low-delay communication under the guarantee of taking the freshness, delay and information reliability of peak information as multiple statistical service quality, and designing an epsilon-effective capacity combined control scheme for the freshness, delay and reliability of the peak information. Different from the traditional single delay-oriented service quality guarantee, the short code service quality guarantee theoretical system establishes a maximum supportable arrival rate model, namely a unified mathematical expression of 'epsilon-effective capacity' EC ε (theta) under the premise of constructing the combined constraint of peak information freshness, delay and reliability, and the unified mathematical expression is as follows:
The formula shows that the 'epsilon-effective capacity' is different from the effective capacity of the traditional system, is related to the peak information freshness, the time delay service quality guarantee index and is also a function of a limited code length and an error rate (namely the system reliability), and can be used for carrying out joint dynamic control on the multidimensional service quality requirements which can be guaranteed by the system from low-aging low-reliability to high-aging high-reliability range, so that the bearing capacity of the system can be more accurately estimated, and more scientific basis is provided for resource allocation of different services.
As shown in fig. 2, in order to construct a joint resource scheduling model diagram for multidimensional quality of service guarantee, by analyzing wireless channel quality and multidimensional quality of service guarantee indexes, the reliability of the system is greatly improved by using a short packet retransmission technology, the transmission quality of a link is ensured, and high-reliability low-delay high-capacity communication is efficiently ensured.
Fig. 3 illustrates the technical route and working principle of the present invention, and by using theoretical tools such as various information theory and probability theory, a short code multidimensional service quality assurance system is established to support the establishment of an epsilon-effective capacity unified model and control mechanism.
The effects of the present invention are further described below in conjunction with simulation experiments:
1. Simulation experiment conditions:
The hardware platform of the simulation experiment is that a processor is Intel Pentium CPU, the main frequency is 3.3GHz, and the memory is 8GB.
The software platform of the simulation experiment is a Windows 10 operating system and Matlab2016a. The antenna gain used by the simulation experiment of the invention is 20dBi, and the transmitting power is between 10dBm and 50dBm.
2. Simulation content and result analysis:
Fig. 4 illustrates that, given the peak information freshness violating threshold a th, the peak information freshness violating probability tends to decrease as the peak information freshness service quality assurance index θ AoI increases. This observation confirms the reliability and accuracy of the peak information freshness quality of service assurance indicator. It is noted that a large peak information freshness quality of service assurance indicator determines a lower bound of peak information freshness violation probability, while a small peak information freshness bounded quality of service assurance indicator determines an upper bound of peak information freshness violation probability.
Fig. 5 illustrates that the peak information freshness degree violation probability tends to increase as the code length n increases, given the peak information freshness degree violation threshold a th and the peak information freshness degree service quality assurance index θ AoI. Meanwhile, a larger peak information freshness violation threshold results in a smaller peak information freshness violation probability. This is because as a th increases, the constraint on the freshness of the peak information by the model becomes more relaxed, thereby achieving a smaller peak information freshness violation probability. Further, when the peak information freshness quality of service guarantee index θ AoI increases from 0.01 to 0.05, the peak information freshness violation probability decreases.
Fig. 6 illustrates a relationship between the delay violation probability and the delay quality of service guarantee index θ delay, which decreases with increasing delay quality of service guarantee index given the delay bound D th. Therefore, a smaller delay qos indicator determines the upper bound of the delay violation probability, while a larger delay qos indicator determines the lower bound of the delay violation probability. At the same time, a larger delay bound D th results in a smaller delay violation probability. This is because as D th increases, the model latency-based constraints become more relaxed, thereby achieving a smaller latency violation probability.
As can be seen from fig. 7, in the non-asymptotic region, the reliability qos guarantee index characterizes the relationship between the formula for the bit error rate and the reliability qos guarantee index θ error. Fig. 7 shows a pattern in which the reliable quality of service guarantee indicator exhibits indicator decay with respect to the bit error rate, confirming the accuracy of the definition of the reliable quality of service guarantee indicator, in the case of code lengths n of 500, 700, 900 and 1100, respectively.
FIG. 8 shows the relationship between "ε -effective capacity" and code length n. It is demonstrated that the "epsilon-effective capacity" is an increasing function with respect to the limited code length given the delay quality of service guarantee index theta delay and the maximum number of transmission modules of HARQ-IR L. In fig. 8, the dashed line indicates the relationship between the effective capacity of the conventional channel, in which the error rate approaches 0, and the delay quality of service guarantee index when the effective capacity in the ideal model, i.e., the finite code length n, approaches infinity. When the delay service quality guarantee index is larger, the corresponding fading rate of epsilon-effective capacity is higher, which means that the model of the invention can guarantee stricter delay service quality requirements, and when the delay service quality guarantee index is smaller, the corresponding fading rate of epsilon-effective capacity is lower, which means that the model of the invention can only meet loose delay service quality requirements. The "epsilon-effective capacity" approaches the channel effective capacity as the code length increases indefinitely. Further, fig. 8 shows that a higher "epsilon-effective capacity" can be achieved by reducing the maximum number of HARQ-IR transmission modules L. This is because decreasing L results in a decrease in the number of HARQ-IR retransmissions, thereby increasing the maximum achievable coding rate and increasing the "epsilon-effective capacity".
A multi-dimensional quality of service assurance system, comprising:
The peak information freshness module is used for evaluating and adjusting the data freshness by taking the peak information freshness as a service quality guarantee parameter, and modeling the measurement of the data freshness to establish a peak information freshness model;
the peak information freshness service quality guarantee index module is used for representing the peak information freshness violation probability based on a hybrid automatic repeat request and incremental redundancy technology (HARQ-IR) in the field of limited code length coding according to the peak information freshness model obtained by the peak information freshness module, so as to obtain a peak information freshness service quality guarantee index;
The delay and reliability service quality guarantee index module characterizes the violation probability of the delay and the error rate in the field of limited code length coding, and obtains delay and reliability service quality guarantee indexes;
And the arrival rate model module is used for establishing a maximum supportable arrival rate model, namely 'epsilon-effective capacity', according to the service quality guarantee index of the freshness of the peak information and the delay and reliability service quality guarantee index.
A multi-dimensional quality of service assurance device, comprising:
a memory for storing a computer program of the multi-dimensional quality of service assurance method;
and the processor is used for realizing a multidimensional service quality guarantee method when executing the computer program.
A computer readable storage medium storing a computer program which, when executed by a processor, enables a multi-dimensional quality of service assurance method.
Claims (10)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410075414.4A CN117915366B (en) | 2024-01-18 | 2024-01-18 | A multi-dimensional service quality assurance method, system and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410075414.4A CN117915366B (en) | 2024-01-18 | 2024-01-18 | A multi-dimensional service quality assurance method, system and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117915366A CN117915366A (en) | 2024-04-19 |
| CN117915366B true CN117915366B (en) | 2024-12-31 |
Family
ID=90683545
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410075414.4A Active CN117915366B (en) | 2024-01-18 | 2024-01-18 | A multi-dimensional service quality assurance method, system and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117915366B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103974345A (en) * | 2014-05-15 | 2014-08-06 | 西安电子科技大学 | Joint optimization scheme oriented to guarantee of statistic quality of service and suitable for wireless network |
| CN106686605A (en) * | 2016-09-28 | 2017-05-17 | 西安交通大学 | An Energy Efficient Statistical Delay Quality of Service Guarantee Method in Wireless Sensor Networks |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003084134A1 (en) * | 2002-03-29 | 2003-10-09 | Network Genomics, Inc. | Systems and methods for end-to-end quality of service measurements in a distributed network environment |
| CN1258894C (en) * | 2003-06-18 | 2006-06-07 | 清华大学 | Resource scheduling method utilized in operations sensitive to downward error in OFDM |
| CN110536398B (en) * | 2019-08-29 | 2020-10-02 | 北京邮电大学 | Method and system for average delay guaranteed power control based on multi-dimensional effective capacity |
| CN113259968A (en) * | 2021-04-14 | 2021-08-13 | 国网四川省电力公司电力科学研究院 | Intelligent calculation method for power distribution network equipment based on information freshness |
| CN113543271B (en) * | 2021-06-08 | 2022-06-07 | 西安交通大学 | Effective capacity-oriented resource allocation method and system |
-
2024
- 2024-01-18 CN CN202410075414.4A patent/CN117915366B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103974345A (en) * | 2014-05-15 | 2014-08-06 | 西安电子科技大学 | Joint optimization scheme oriented to guarantee of statistic quality of service and suitable for wireless network |
| CN106686605A (en) * | 2016-09-28 | 2017-05-17 | 西安交通大学 | An Energy Efficient Statistical Delay Quality of Service Guarantee Method in Wireless Sensor Networks |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117915366A (en) | 2024-04-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lin et al. | Resource management for pervasive-edge-computing-assisted wireless VR streaming in industrial Internet of Things | |
| Chiang et al. | Layering as optimization decomposition: A mathematical theory of network architectures | |
| Hu et al. | Intelligent resource allocation for edge-cloud collaborative networks: A hybrid DDPG-D3QN approach | |
| WO2023179010A1 (en) | User packet and resource allocation method and apparatus in noma-mec system | |
| Cao et al. | Information age-delay correlation and optimization with finite block length | |
| Pokhrel et al. | Multipath communication with deep Q-network for industry 4.0 automation and orchestration | |
| Ma et al. | Performance evaluation of URLLC in 5G based on stochastic network calculus | |
| CN114697333B (en) | An edge computing method for energy queue balance | |
| CN117915481B (en) | Resource allocation method and system of ultra-dense industrial Internet of things | |
| Qiao et al. | Age-optimal power control for status update systems with packet-based transmissions | |
| Ren et al. | End-to-end network SLA quality assurance for C-RAN: A closed-loop management method based on digital twin network | |
| Javani et al. | Age of information for multiple-source multiple-server networks | |
| CN116962187A (en) | Cloud response method, device and medium of multi-coupling algorithm edge gateway | |
| Zhang et al. | Intelligent resource adaptation for diversified service requirements in industrial IoT | |
| He et al. | Age of information aware resource allocation and packet sampling control in vehicular networks | |
| Zhu et al. | Short packet-based status updates in cognitive internet of things: Analysis and optimization | |
| CN115633380A (en) | A multi-edge service cache scheduling method and system considering dynamic topology | |
| CN117915366B (en) | A multi-dimensional service quality assurance method, system and device | |
| Han et al. | QoS differential scheduling of URLLC under FIFO service discipline: A cross-layer approach | |
| CN117915482A (en) | Resource allocation method and system for UAV-assisted Internet of Things device network | |
| Apostolakis et al. | ATHENA: Machine Learning and Reasoning for Radio Resources Scheduling in vRAN Systems | |
| CN114257988A (en) | Imperfect CSI-oriented resource allocation method and system in ultra-reliable car networking | |
| Ayepah-Mensah et al. | Adaptive Digital Twin and Communication-Efficient Federated Learning Network Slicing for 5G-enabled Internet of Things | |
| Chen et al. | Cost minimization for cooperative mobile edge computing systems | |
| CN112953666A (en) | Spectrum prediction switching method based on channel quality in cognitive wireless network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |