Method and processing device in a system comprising a resource scheduler and a set of devices - Patents.com
By calculating and transmitting configuration-based resource utilization ratios to a resource scheduler, the method addresses the challenge of adapting to sudden changes in wireless environments, ensuring efficient resource allocation and minimizing waste in industrial applications.
Patent Information
- Application Number
- JP2024555468
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2022-02-24
- Filing Date
- 2022-07-11
- Publication Date
- 2024-12-05
- Estimated Expiration
- 2042-07-11
AI Technical Summary
Existing resource allocation methods in wireless environments for industrial applications are unable to quickly and accurately adapt to sudden changes in application performance requirements, leading to inefficiencies and resource wastage due to unpredictable radio conditions and varying application needs.
A method and device for calculating configuration-based resource utilization ratios, which involves obtaining parameters like message lifetime and resilience, estimating stream configurations within a time window, and transmitting these ratios to a resource scheduler to guide dynamic radio resource allocation, using cost functions and optimization algorithms to optimize resource usage.
This approach allows for more accurate and rapid adaptation to changing application requirements, optimizing resource allocation and reducing waste by ensuring that each stream is allocated resources efficiently, even in the face of unpredictable radio conditions and varying application demands.
Smart Images

Figure 2024545361000001_ABST
Abstract
Description
[Technical field]
[0001] At least one of the embodiments generally relates to a method for calculating resource usage ratios and transmitting them to a resource scheduler. At least one of the embodiments also relates to a device configured to implement the method. [Background technology]
[0002] The Fourth Industrial Revolution (or Industry 4.0) refers to the automation of traditional manufacturing using smart technologies such as the Internet of Things and cloud computing.
[0003] Robotics is part of Industry 4.0. Indeed, in smart factories, robots are used to limit human tasks. In this framework, communication plays a key role. The requirements for applications in Industry 4.0 are centered on several factors such as reliability, latency, and lifetime of the communication devices. Currently, robots are often connected to wired infrastructures. Time Sensitive Networking (TSN) is a standard Ethernet-based technology for Industry 4.0 integrated networks due to its ability to support deterministic latency requirements. More precisely, the TSN standard extends the traditional Ethernet data link layer standard to ensure data transmission with ultra-low latency, low latency variation (jitter), and ultra-low loss, making it ideal for industrial control and automotive applications.
[0004] TSN defines a Time Aware Shaper (TAS) scheduler to guarantee the transmission of high-priority deterministic traffic within a bounded time. However, TAS has the problem of large overhead for short-lived flows, which degrades communication performance.
[0005] In addition, in contrast to wireless technologies, TSN-based networks cannot offer the flexibility required to support the mobile industrial applications required for the factory of the future. Wireless networks offer many advantages, such as flexibility, low cost and ease of deployment, but at the expense of reliability.
[0006] In such wireless environments, existing schedulers typically implement resource allocation methods that predict future resource allocations from past resource allocations. Thus, such resource allocation methods cannot adapt to sudden changes in application performance requirements, which occur when an application needs to adapt to new radio link conditions.
[0007] It is therefore desirable to find a method of resource allocation in a wireless environment that quickly and more accurately adapts to sudden changes in application performance requirements. Summary of the Invention
[0008] At least one of the embodiments generally relates to a method in a system comprising a resource scheduler and a set of devices, each device hosting at least one application, each application transmitting a stream of messages to at least one receiver. The method includes: obtaining, for each stream, parameters including a message lifetime, a message duration, and the last buffering time of a message of the stream before a given time window begins; estimating a set of stream configurations within a time window from the obtained parameters, where a stream configuration is defined as a particular configuration of active streams, and a stream is active within a given time slot if there is a packet corresponding to a message to be transmitted or received; calculating, for each configuration, one configuration-based resource utilization ratio per stream such that the sum of the configuration-based resource utilization ratios for the configurations is one, the calculating being performed under the constraint that, for each stream, there is at least one configuration for which the configuration-based resource utilization ratio for the stream is non-zero; sending data to a resource scheduler, the data including each configuration having a set of calculated configuration-based resource usage ratios; Includes.
[0009] By sending data to the resource scheduler, the resource scheduler can be guided, thus allowing resource allocation to adapt quickly and more accurately to sudden changes in application performance requirements.
[0010] In one embodiment, the obtained parameters further include a resilience value, which is the maximum time that the application is allowed to not receive a packet, and the size of the time window is defined from the resilience value.
[0011] In one embodiment, the method comprises: For each stream, averaging a configuration-based resource usage ratio of the stream; Sending data to the resource scheduler includes sending an averaged configuration-based resource usage ratio instead of sending each configuration with a set of calculated configuration-based resource usage ratios for each stream.
[0012] In one embodiment, calculating, for each configuration, one configuration-based resource usage ratio per stream comprises: Selecting a cost function; Selecting a solution method, optimizing the cost function using the selected solution method to calculate, for each configuration, one configuration-based resource utilization ratio per stream such that the configuration-based resource utilization ratios for the configurations sum to one, the calculating being subject to the constraint that, for each stream, there is at least one configuration for which the configuration-based resource utilization ratio for the stream is non-zero; Includes.
[0013] In one embodiment, the cost function is the following cost function:
number
number
number
[0014] In one embodiment, the selected cost function is:
number
[0015] In one embodiment, the selected cost function is:
number
[0016] In one embodiment, the selected cost function is:
number
[0017] In one embodiment, the solution comprises: Configuration-based resource utilization ratio {ρ k,j (W)} k,j a brute force algorithm in which all possible values of Configuration-based resource utilization ratio {ρ k,j (W)} k,j a random algorithm that randomly selects a set of values for A genetic algorithm and The simplex algorithm, The method is selected from a set of solver methods including
[0018] In one embodiment, the transmitted data is used by a resource scheduler to allocate radio resources among the streams.
[0019] Further disclosed is a processing device in a system comprising a resource scheduler and a set of devices, each device hosting at least one application, each application transmitting a stream of messages to at least one receiver. obtaining, for each stream, parameters including a message lifetime, a message duration, and the last buffering time of a message of the stream before a given time window begins; estimating a set of stream configurations within a time window from the obtained parameters, where a stream configuration is defined as a particular configuration of active streams, and a stream is active within a given time slot if there is a packet corresponding to a message to be transmitted or received; calculating, for each configuration, one configuration-based resource utilization ratio per stream such that the sum of the configuration-based resource utilization ratios for the configurations is one, the calculating being performed under the constraint that, for each stream, there is at least one configuration for which the configuration-based resource utilization ratio for the stream is non-zero; sending data to a resource scheduler, the data including each configuration having a set of calculated configuration-based resource usage ratios; The device includes at least one processor configured to:
[0020] A system is disclosed comprising a processing device according to one of the above embodiments and a resource scheduler, which allocates radio resources to each stream taking into account the data transmitted by the processing device.
[0021] A computer program product is disclosed that includes program code instructions that can be loaded into a programmable device, which when executed by the programmable device cause a method according to any one of the above embodiments to be implemented.
[0022] A storage medium is disclosed storing a computer program including program code instructions, which when read from the storage medium and executed by a programmable device, cause a method according to any one of the above embodiments to be implemented.
[0023] The characteristics of the invention will emerge more clearly on reading the following description of at least one example of embodiment, the said description being made with reference to the accompanying drawings, in which: [Brief description of the drawings]
[0024] [Figure 1] FIG. 1 illustrates a system in which the present embodiment can be implemented. [Diagram 2] FIG. 2 illustrates the principle of contention between devices for radio resource allocation. [Diagram 3] FIG. 2 illustrates various application parameters for a given application. [Figure 4] FIG. 2 is a diagram illustrating three streams with buffered messages according to a particular embodiment. [Figure 5A] FIG. 2 illustrates a flowchart of a method for calculating and transmitting configuration-based resource usage ratios, according to certain embodiments. [Figure 5B] FIG. 1 illustrates the definition of a common time window from resilience values associated with different streams according to certain embodiments. [Figure 6] FIG. 1 illustrates a flowchart of a method for calculating and transmitting configuration-based resource usage ratios according to another embodiment. [Figure 7]FIG. 1 illustrates the principle of radio resource allocation by a random scheduler without guidance. [Figure 8] FIG. 1 illustrates the principle of radio resource allocation by a random scheduler guided by configuration-based resource usage ratios according to a first example. [Figure 9] FIG. 13 illustrates the principle of radio resource allocation by a random scheduler guided by configuration-based resource usage ratios according to a second example. [Figure 10] FIG. 1 illustrates the principle of radio resource allocation by a guidance-free round-robin scheduler. [Figure 11] A diagram illustrating the principle of radio resource allocation by a round-robin scheduler guided by configuration-based resource usage ratios, according to a particular example. [Figure 12] FIG. 1 illustrates the principle of radio resource allocation by a throughput maximum scheduler without guidance. [Figure 13] FIG. 1 illustrates the principle of radio resource allocation by a throughput maximization scheduler guided by configuration-based resource utilization ratios, according to a particular example. [Figure 14] FIG. 2 is a diagram illustrating an example of a hardware architecture of a processing device configured to calculate and transmit configuration-based resource usage ratios, according to certain embodiments. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0025] Various embodiments are disclosed in the context of a smart factory where mobile robots are deployed to perform various missions, such as moving from one location to another within a factory within a certain time period, however, the embodiments may also be applied to other environments, such as environments involving autonomous vehicles.
[0026] FIG. 1 shows a system 1, for example as part of a smart factory, in which the present embodiment can be implemented. The system 1 comprises a set 10 of mobile robots 10A-10D. Each mobile robot can move from one place to another in the factory. The set 10 may also comprise non-mobile robots. The mobile robots 10A-10D communicate wirelessly with one or more control devices 12A and 12B with which they exchange application messages. Each control device 12A and 12B is a base station, an MEC (acronym for Multi-access Edge Computing) station, or a mobile station. The control devices 12A and 12B are configured, for example, to plan and monitor missions of the robots 10A-10D. As an example, in FIG. 1, the control device 12A sends application messages to the robot 10A including data representative of its mission, and the control device 12B sends application messages to the robot 10C including data representative of its mission. The mission data includes displacement data (e.g. angular velocity, linear velocity, pressure level, etc.), interaction data, motion data, etc. In response, the robot 10A (and 10C, respectively) sends application messages to the control device 12A (and 12B, respectively). Application messages sent from the robot to the control device include, for example, monitoring data or environmental data. The exchange of application messages is periodic or aperiodic depending on the application.
[0027] Each robot 10A-10D and each control device 12A and 12B comprises at least one application module. Application messages are therefore exchanged, more specifically, between the application module of the robot and the application module of the control device. An application module generally includes a software entity, i.e. an application, together with hardware elements such as application buffers.
[0028] A robot typically comprises several physical elements, e.g. wheels, arms, etc. A given robot therefore needs to exchange application messages with a control device, which contain different types of data, depending on the physical elements involved. Therefore, in the following, a stream S k is the number of application messages m sent from (or received by) a given physical element of a given robot in the set of robots 10. k (n) In other words, multiple streams may be associated with one and the same robot, e.g., one stream associated with the robot's arm and one stream associated with each wheel of the robot. In the following, we define Ns streams {S1,...,S Ns} is considered, and for each stream S k is the given application APP k Therefore, the application APP k and Stream S k There is a one-to-one relationship between the application APP k is the message m k (n) one by one into the application buffer of messages of size 1, and k (n) is transmitted to a corresponding receiver, e.g., a control device, at time n using radio resources.
[0029] In a wireless environment, the number of radio resources is limited. In wireless communication, the number of resources is defined as the number of frequency resources (e.g., subchannels, each of which contains a finite number of frequency blocks) used in a limited time. Other transmission dimensions, such as the spatial dimension provided by multiple antennas, the polarization dimension provided by the use of different polarizations at the transmitter and receiver, or the multiple access dimension that allows multiple transmitter / receiver pairs to have simultaneous transmissions as soon as they do not significantly interfere with each other, can be used to create additional transmission resources. The set of all radio resources available for transmission by all transmitter / receiver pairs is called the available resource set.
[0030] To appropriately allocate these limited radio resources, the system 1 further comprises a resource scheduler (RS) 14. This resource scheduler (RS) 14 periodically, i.e. every dt (e.g. dt=1 ms), allocates the available radio resources to one particular stream S. k Therefore, for each dt, the application message m k (n) There is an opportunity, i.e. a time slot, during which the robots, or more precisely the streams, can be transmitted. As shown in Fig. 2, the robots, or more precisely the streams, compete for radio resource allocation. Thus, the resource scheduler 14 is configured to select one of the Ns streams and allocate the radio resources to it.
[0031] The resource scheduler 14 typically includes a software entity together with hardware elements such as buffers etc. The resource scheduler 14 may be located in a base station, a MEC station or a mobile station.
[0032] Figure 3 shows the k APPLICATION APPLICATION kis an application located on one of the control devices, configured to control the movement of, for example, the arm of a particular robot, for example robot 10C. k is an application that is deployed on a particular robot and configured to monitor the robot's environment. k is a set of multiple messages m at various times n (n=1, 2, 3, and 4). k (n) A stream S containing k These messages are sent to the stream S k A transmission channel H between the antenna of a robot, e.g. 10C, associated with the k The signal is transmitted on the transmission channel H k is the channel error probability
number
[0033] Each application APP k is a set of application parameters that define some requirements, namely the resilience value R k , message lifetime D k , and message period T k These parameters can vary over time, but are the same for all streams S k is assumed to be constant within a time window W common to all
[0034] Resilience value R k APP k is the maximum time that R is allowed to not receive a packet. In other words, R k The resilience value R k In case of violation of the application APP k R kIf no packets are received for a time exceeding , an application failure occurs. In this case, the associated robot may enter a safety mode, for example a partial or complete shutdown with reinitialization. Hence the resilience value R k defines a resilience window, as shown in Figure 3, within which at least one packet must be received and decoded.
[0035] Message Lifetime D k is the value of the message m when it is pushed into the application buffer. k (n) (also called the message delay budget in the literature). In practice, for example, the lifetime of a message m k (n) is only relevant for a limited duration, especially due to the movement of the robot. In FIG. 3, the first message m k (1) , the second message m k (2) , and a third message m k (3) The lifetime of is 3 time slots.
[0036] Message period T k is the time between the beginning of the life of any two successive messages. In other words, T k is the time between the buffering times of two successive messages. This period can be variable if the application does not require periodic traffic.
[0037] {Stream configuration definition} A data stream, or more simply a stream S k A j-th stream configuration C is said to be “active” at a given time if there are packets being sent or received at that time associated with the j-th stream configuration C j is defined as a particular combination of streams. For example, C jcorresponds to S1 being active, S2 being inactive, and S3 being active, and j is a vector in the set [0;N c -1]. Configuration C j Stream S in k The active index of is defined as follows:
number
[0038] Figure 4 shows three streams with buffered messages. Below the streams in Figure 4, a table of stream activity is shown, where for each time slot in a common window W, the configuration is derived from the active index of the stream. There are eight different configurations. In the first time slot of window W, all three streams are active, so δ 1,0 = δ 2,0 = δ 3,0 =1, and similarly in the second time slot. Configuration C1 occurs only once in the third time slot, configuration C2 occurs twice in the fourth and eleventh time slots, configuration C3 occurs twice in the fifth and tenth time slots, configuration C4 occurs once in the sixth time slot, configuration C5 occurs twice in the seventh and eighth time slots, configuration C6 occurs once in the ninth time slot, and configuration C7 occurs once in the last time slot.
[0039]
number
[0040] {Definition of resource usage ratio by configuration} Within the window W, the jth configuration C j is n j (W) For example, in FIG. 4, C5 occurs in two time slots, so (W) = 2, and C6 occurs in one time slot, so n6 (W) = 1. Configuration-based resource utilization ratio ρ k,j (W) is a stream S in W k C assigned to j Duration of n j (W) In other words, the configuration-based resource usage ratio represents the number of resources allocated to each stream in the window W. This fraction is defined as: ρ k,j (W) =(n k,j (W) ) / (n j (W) ) In the formula, n k,j (W) Stream S k is the number of time slots allocated to k,j (W) is n j (W) The upper limit is ρ k,j (W) For each configuration C j The normalization condition for Σ k ρ k,j (W) = 1, which means that configuration C j This means that all the nodes in the configuration are fully allocated. jis inactive in, i.e., δ k,j = 0 for stream S k For ρ k,j (W) is set to 0 (the "null-null" condition).
[0041] In reality, ρ k,j (W) The value of is the set {0 / (n j (W) ),1 / (n j (W) ),2 / (n j (W) ),...,(n j (W) ) / (n j (W) )}. However, in one embodiment, ρ k,j (W) can be any real number between 0 and 1, and the value {0 / (n j (W) ),1 / (n j (W) ),2 / (n j (W) ),...,(n j (W) ) / (n j (W) )} is then performed, for example, just before sending the value to a resource scheduler.
[0042] Multiple sets of values
number
[0043] In configuration C5, the second stream is inactive, and therefore, due to the “null-null” condition, ρ 2,5 (W) =0.
[0044] In the following,
number
[0045] Therefore, at least one set of configuration-based resource utilization ratios must be calculated such that the normalization condition is satisfied with the constraint that each data stream is allocated in at least one configuration, and the at least one set is sent to the resource scheduler for guidance.
[0046] FIG. 5A illustrates a flowchart of a method for calculating and transmitting configuration-based resource usage ratios in accordance with certain embodiments.
[0047] In step S100, each stream S k Application parameters that represent the requirements of the application are obtained for at least D k , T k and t k is obtained, and t k is the time domain of the stream S before the common window W begins.k In Figure 4, t1=t2, and t3 is one time slot after t1. k Knowing this makes it possible to position the streams relative to each other.
[0048] In step S102, the configuration C of the streams within the common time window W is j A finite number N c But application parameter D k and T k From then, at time t k The stream configurations within the common window are listed before the common window starts.
[0049] In step S104, a set of configuration-based resource usage ratios {ρ k,j (W)} k We define,ρ,such that,ρ,satisfies the normalization condition and,under the constraint that each stream is assigned in at,least one configuration, i.e., k,j (W) There is at least one configuration C such that j For each configuration C, such that j Therefore, for a given configuration C j For this set, the stream S k Configuration-based resource usage ratio ρ k,j (W) Includes.
[0050] There are multiple such sets. In one simple embodiment, ρ k,j (W) At least one configuration C such that ≠ 0 j ∈A k (W) There exists a set {ρ k,j (W)} k,j Once is determined, the method proceeds to step S106.
[0051] In step S106, each configuration or configuration identifier and its associated set of configuration-based resource usage ratios, i.e., {{ρ k,j (W)} k ,C j} j are transmitted to the resource scheduler, which uses the transmitted information to guide radio resource allocation. j value {ρ k,j (W)} k and therefore the stream S k One value for each ρ k,j (W) The information is transmitted in the form of a table that relates
[0052] An example of a table obtained using three streams and eight configurations as shown in FIG. 4 is shown below. [Table 1]
[0053] These sets of configuration-based resource utilization ratios satisfy the normalization condition, the “null-null” condition, and for each stream, k, k,j (W) There is at least one configuration C such that j There is data for the eighth configuration, namely {{ρ k,7 (W)} k ,C7}7 is also sent. In this case, for all k, k,7 (W) = 0. In a variant, the data of the eighth configuration, i.e., {{ρ k,7 (W)} k , C7}7 are not transmitted since all configuration-based resource usage ratios are zero in this configuration.
[0054] The calculated configuration-based resource usage ratio {ρ k,j(W)} k,j The use of depends on the algorithm embedded within the resource scheduler.
[0055] In one embodiment, the structure {{ρ k,j (W)} k ,C j} j The calculated configuration-based resource usage ratio, having the configuration-based resource usage ratio {ρ k,j (W)} k,j is first averaged in optional step S105 as follows:
number
[0056] In that case, the data {{ρ k,j (W)} k ,C j} j Instead of ,the average calculated configuration-based resource utilization ratio {ρ k (W)} k is sent to the resource scheduler. In this latter embodiment, no configuration is sent to the resource scheduler.
[0057] The common window W can be adapted in time. In one embodiment, the common window is shifted. At a given time, all configuration-based resource utilization ratios {ρ k,j (W)} k,j is pre-computed and applied within a common window W. When the end of the common window W is reached, a new common window W starts and the configuration-based resource utilization ratio {ρ k,j (W)} k,j A new set of is calculated.
[0058] In another embodiment, the common window is a sliding window that can increase robustness. At a given time, all configuration-based resource utilization ratios {ρ k,j (W)} k,j is pre-computed and applied within a common window W. Before the end of the common window W, a new common window W starts and a new set of configuration-based resource utilization ratios {ρ k,j (W)} k,j is calculated.
[0059] In another embodiment disclosed with reference to FIG. 5B, t0 is the time when the configuration-based resource usage ratio is expected to be calculated, and the size of the common window W is set to 1 for each stream S. k The common window W starts at t0 and ends at tf, where tf is defined from the next end of the resilience window. More precisely, tf is the most distant next end of the resilience window. The end of the resilience window corresponds to the resilience violation time. In FIG. 5B, the most distant next end of the resilience window is the end of stream S2. For any stream whose resilience window ends earlier, i.e., S1 and S3 in FIG. 5B, its activity is disabled from the end of its own resilience window zk until tf. In other words, for stream S k is set to inactive in the interval [zk;tf].
[0060] In another embodiment, the configuration-based resource utilization ratio {ρ k,j (W)} k,j can be calculated each time an event occurs, e.g., each time parameters, e.g., R, T, and D, are modified.
[0061] FIG. 6 illustrates a flowchart of a method for calculating and transmitting configuration-based resource usage ratios in accordance with certain embodiments.
[0062] Steps that are identical to those of the method illustrated by Figure 5A are identified with the same reference numerals in Figure 6. In particular, the method of Figure 6 includes steps S100 to S106, and optionally step S105.
[0063] In step S104, the configuration-based resource utilization ratio {ρ k,j (W)} k,j is calculated.
[0064] In step S104-1, {ρ k,j (W)} k,j The cost function J is defined as a function of the configuration-based resource utilization ratio, k (W) is chosen to reflect the target metric of the stream. In other words, depending on the target metric, the cost function J k (W) are defined differently: the goal metric is a) reliability (i.e., minimizing the probability of failure for each stream), b) power saving (i.e., minimizing the power consumption of the device), or c) throughput (i.e., maximizing the amount of data transmitted for each stream).
[0065] a) Reliability To increase reliability, the goal is to minimize the probability of failure. k,j (W) n j (W) S k Composition C j Assuming that the usage time is
number
number
number
[0066] b) Power saving Stream is S k To reduce the power consumption of a device with ,the goal is to minimize the number of transmission attempts.,This means that the streams should have the least access to the,resource.,The cost function is therefore defined as the average resource,usage ratio itself.
number
[0067] c) Throughput Any stream S k To maximize the throughput of,the network, the goal is to maximize the number of transmission attempts.,This means that the streams should have the greatest access to the,resource.,The cost function is therefore defined as the average resource,utilization ratio itself.
number
[0068] Therefore, the configuration-based resource utilization ratio {ρ k,j (W)} k,j To compute the best set of,the goal is to compute the best set of,for any stream,S,. k About J k (W) That is, to solve the following optimization problem: In the cases of a) and b)
number
number
[0069] In step S104-2, a solution method (e.g., brute force, random selection, genetic algorithm, linear programming, etc.) is selected to obtain a configuration-based resource utilization ratio {ρ k,j (W)} k,j Solve the optimization problem above to compute the best set of
[0070] In step S104-3, the selected method is applied to solve the optimization problem derived from the selected cost function, i.e. In the cases of a) and b)
number
number
[0071] To solve the above optimization problem, the following methods can be selected and used as a result:
[0072] 1) Brute force The basic approach to solving this problem is to use the k,j (W) ∈{0 / (n j (W) ),1 / (n j (W) ),2 / (n j (W) ),...,(n j (W) ) / (n j (W))}. Alternatively, the method tests all possible values of ρ in any interval belonging to [0;1]. k,j (W) This set of arbitrary values is linked to any other hardware or software constraints, such as hardware capacity or complexity. An example of such a set of arbitrary values is {1 / Ns, 2 / Ns, ..., 1}. Each set {ρ k,j (W)} k,j For ρ k,j (W) At least one configuration C such that ≠ 0 j ∈A k (W) The ratio is tested for normalization with the further constraint that there exists a set {ρ k,j (W)} k,j , the set that better optimizes the cost function, i.e.,
number
number
number
number
number
number
[0073] Multiple sets {ρ k,j (W)} k,j If satisfies the condition, the final set is selected randomly.
[0074] 2) Random selection This method selects one set {ρ k,j (W)} k,j The solution is to randomly select:
[0075] Alternatively, the method can be k,j (W) At least one configuration C such that ≠ 0 j ∈A k (W) Among all sets that satisfy the normalization condition with the further constraint that there exists a set of {ρ k,j (W)} k,j Randomly select,x, ...
number
number
[0076] 3) Genetic Algorithm This method uses ρ k,j (W) We start with a random configuration of values. Then, ρ k,j (W) The configuration of values is iteratively improved by evaluating the effect of small changes to the cost function. For example, at each iteration, k,j (W) The value is 1 / (n j (W)) and if improvement is observed,
number
[0077] 4) Linear Programming The problem to be solved is a cost function (
number
number
[0078] 4.a) Linear programming to minimize the probability of failure Resource usage ratio {ρ k,j (W)} k is calculated to minimize the probability of failure of each stream. Therefore, the best set {ρ k,j (W)} k,j * In order to find
number
number
[0079] An equivalent method that is easier to implement is to assume that the maximum expected probability of failure is an arbitrary upper bound:
number
number
[0080] The logarithmic expectation of the failure probability is defined as follows:
number
[0081] The above inequality (
number
number
[0082] The selection matrix S is defined as follows:
number
number
[0083] δ k,j If =0 (the "null-null condition"), then by applying the selection matrix S, ρ k,j (W) will be automatically disabled.
[0084]
number
number
number
[0085] In this way, we obtain the standard form for linear programming problems,
number
[0086] Linear programming problems are solved by the simplex algorithm.
number
number
[0087] 4.b) Linear programming to minimize the number of transmission attempts. To reduce power consumption, the resource usage ratio {ρ k,j (W)} k,j is calculated to minimize the number of transmission attempts. Therefore, the best set {ρ k,j (W)} k,j * In order to find
number
number
[0088] An equivalent method, which is easier to implement, is to consider the maximum expected value of consumption as an arbitrary upper bound ρ target That is, for any stream S k About J k (W) ≦ρ target So that {ρ k,j (W)} k,j * The aim is to seek...
[0089] For this purpose, each stream S k Regarding the above inequality (J k (W) ≦ρ target )teeth,
number
[0090] Then, the same implementation as in 4.a) is applied.
[0091] 4.c) Linear programming to maximize the number of transmission attempts. To maximize throughput, the resource utilization ratio {ρ k,j (W)} k is calculated to maximize the number of transmission attempts. Therefore, the best set {ρ k,j (W)} k,j * In order to find
number
number
[0092] An equivalent method, which is easier to implement, is to use an arbitrary upper bound on the maximum expected value of consumption: -U target That is, for any stream S k About -J k (W) ≦-U target So that {ρ k,j (W)} k,j * The aim is to seek...
[0093] For this purpose, each stream S k Regarding the above inequality (-J k (W) ≦-U target )teeth,
number
[0094] Then, the same implementation as in 4.a) is applied.
[0095] Configuration-based resource utilization ratio {ρ k,j (W)} k,j * Calculating θ enables the scheduler to obtain a better prediction of resource usage, which improves performance over predictions based on learning from past transmissions.
[0096] The method is robust to unexpected events that may relate to radio conditions or packet arrivals, i.e. jitter, as well as new application requirements, new stream parameters, etc. Indeed, an application may change its requirements based on observed communication performance.
[0097] 7 to 13 show how the resource scheduler uses the configuration-based resource usage ratio {ρ k,j (W)} k,j * The resource scheduler belongs to a non-exhaustive list of resource schedulers that includes a) a random scheduler, b) a round-robin scheduler, and c) a throughput maximum scheduler. Other schedulers may also be used.
[0098] a) Random Scheduler The random scheduler schedules the stream S k The random scheduler allocates radio resources for each time slot by randomly selecting a stream with dead messages. Without any guidance, the random scheduler will either give resources to streams with dead messages or give too much radio resources to one stream at the expense of other streams. An example is shown in Figure 7, where the random scheduler allocates radio resources without any guidance.
[0099] As a result, S1 has five time slots, i.e. the three time slots in which S1 has a packet to transmit; and S1 are respectively assigned to two time slots in which they do not have a packet to transmit. S2 consists of four time slots, i.e. two time slots in which S2 has a packet to transmit; and S2 are respectively assigned to two time slots in which they do not have a packet to transmit. S3 has three time slots, i.e. One time slot in which S3 has a packet to transmit, and S3 are assigned to two time slots in which they do not have a packet to transmit.
[0100] Thus, there is an apparent waste of radio resources, since, for example, a timeslot is assigned to a stream that does not have a packet to transmit in the assigned timeslot.From the configuration of streams as in Figure 4, the following description table can be obtained: [Table 2]
[0101] The following table shows in the left two columns examples of configuration-based resource utilization ratios that satisfy the normalization conditions. For each stream k, ρ k,j (W) There is at least one configuration C such that j The condition that exists is also satisfied. The four right-hand columns show examples of radio resource allocation by a random scheduler that respects the configuration-based resource usage ratios. [Table 3]
[0102] Thus, radio resources are allocated to each stream when relevant: S1 is allocated 3 time slots, S2 is allocated 4 time slots, S3 is allocated 4 time slots, etc. Finally, whenever configuration of any stream occurs, the resource scheduler randomly selects the stream to be allocated, for example as shown in FIG.
[0103] In the following example, the configuration-based resource utilization ratio targets unequal shares of the resource with high priority on S1. The table below shows examples of configuration-based resource utilization ratios that satisfy the normalization conditions in the left two columns. For each stream k, ρ k,j (W) There is at least one configuration C such that j The condition that exists is also satisfied. The four right-hand columns show examples of radio resource allocation by a random scheduler that respects the configuration-based resource usage ratios. [Table 4]
[0104] Thus, radio resources are allocated to each stream as it relates to the higher priority given to S1: S1 is allocated 6 time slots, S2 is allocated 2 time slots, S3 is allocated 3 time slots, and finally, whenever any stream configuration occurs, the resource scheduler randomly selects the stream to be allocated, for example as shown in FIG.
[0105] b) Round Robin Scheduler The round-robin scheduler is disclosed in Arpaci-Dusseau's book "Operating Systems: Three Easy Pieces" (Chapter 7, Arpaci-Dusseau Books, 2014), section 7.7. Such a resource scheduler allocates each stream to an equal part, in a circular order without priority, as shown in Figure 10. In this figure, the round-robin scheduler allocates radio resources without any guidance. Essentially, the scheduler turns on all streams permanently in order to allocate radio resources, no matter what the resource consumption of each stream is and no matter what their needs are. This leads to a waste of radio resources.
[0106] In one embodiment, the round-robin scheduler counts per round the amount of radio resources allocated to each stream within a common window W. When the amount of radio resources reaches a value for a stream derived from the configuration-based resource usage ratio, that stream is removed from the scheduler at W.
[0107] More precisely, W and the composition C j Given,the number of allocation attempts that each stream will make in,W,is known.,Using guidance, i.e., configuration-based resource,utilization ratios, the fraction of these attempts that must be taken into,account is estimated. Thus, for a given configuration,C, j The ratio ρ k,j (W) Stream S reached k will not be considered by the scheduler for the next allocation attempt for this configuration within the common window W.
[0108] Round-robin scheduler is configured j If the round robin scheduler does not have access to , the round robin scheduler applies the averaged ratio obtained in optional step S105.
[0109] Therefore, the average ratio ρ k (W) A stream that reaches ,is not considered by the scheduler for the next allocation attempt within the common window,W.
[0110] Considering the following configuration-based resource utilization ratios, ρ1 (W) =50%, ρ2 (W) = 33%, ρ3 (W) = 75%, and the message lifetime of the stream in W is D k Given, the number of allocated time slots is n1 (W) =3, n2 (W) =2, n3 (W) = 6. In fact, configuration C j If ρ is known, then S1 has 6 packets or 6 requests for allocation in W. (W) = 50%, out of 6 packets or requests, only 3 time slots are actually assigned to S1.
[0111] S2 has 6 packets or 6 requests for allocation in W. (W) = 33%, out of 6 packets or requests, only 2 time slots are actually assigned to S2.
[0112] S3 has 8 packets or 8 requests for allocation in W. (W) = 75%, out of 8 packets or requests, 6 time slots are actually allocated to S3.
[0113] c) Max Throughput Scheduler At each timeslot, the throughput max scheduler allocates radio resources to the stream with the largest expected throughput, as shown in Figure 12. In this figure, the throughput max scheduler allocates radio resources without any guidance, which leads to a waste of radio resources.
[0114] In one embodiment, the throughput max scheduler counts per round the amount of radio resources allocated to each stream within a common window W. When the amount of radio resources reaches a value for a stream derived from the configuration-based resource usage ratio, that stream is removed from the scheduler at W.
[0115] Considering the following configuration-based resource utilization ratios, ρ1 (W) =50%, ρ2 (W) = 33%, ρ3 (W) = 75%, and the message lifetime of the stream in W is D k Given, the number of allocated time slots is n1 (W) =3, n2 (W) =2, n3 (W) =6.
[0116] FIG. 14 illustrates generally an example of a hardware architecture for a processing device 10 configured to calculate configuration-based resource usage ratios, in accordance with certain embodiments.
[0117] The processing device 10 comprises a processor or CPU (Central Processing Unit) PROC101, a random access memory RAM102, a read-only memory ROM103, a storage unit STCK104 such as a hard disk or a storage medium reader, e.g. an SD (Secure Digital) card reader, connected by a communication bus 110, and at least one set of communication interfaces COM105 that enable the processing device 10 to send and receive data.
[0118] PROC 101 can execute instructions loaded into RAM 102 from ROM 103, from an external memory (such as an SD card), from a storage medium (such as an HDD), or from a communication network. When the processing device 10 is powered up, PROC 101 can read instructions from RAM 102 and execute them. These instructions form a computer program that causes PROC 101 to implement the method described in relation to Figures 5-6.
[0119] The methods described in relation to Figures 5-6 may be implemented in software form by execution of a set of instructions by a programmable machine, such as a DSP (digital signal processor), a microcontroller, or a GPU (graphics processing unit), or in hardware form by a machine or dedicated components (chips or chipsets), such as an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit). In general, the processing device 10 includes electronic circuits adapted and configured to implement the methods described in relation to Figures 5-6.
Claims
1. A method in a system comprising a resource scheduler and a set of devices, each device hosting at least one application, each application transmitting a stream of messages to at least one receiver, the method comprising: Obtaining, for each stream, parameters including a message lifetime, a message duration, and the last buffering time of a message of the stream before a given time window begins; estimating from the obtained parameters a set of stream configurations within the time window, the stream configurations being defined as a particular configuration of active streams, a stream being active within a given time slot if there is a packet corresponding to a message to be sent or received; calculating, for each configuration, one configuration-based resource usage ratio per stream such that the configuration-based resource usage ratios for said configurations sum to one, said calculating being performed under the constraint that, for each stream, there is at least one configuration for which the configuration-based resource usage ratio for said stream is non-zero; sending data to the resource scheduler, the data including each configuration having its calculated set of configuration-based resource usage ratios; A method comprising:
2. The method of claim 1 , wherein the obtained parameters further comprise a resilience value, which is a maximum time an application is allowed to not receive a packet, and the size of the time window is defined from the resilience value.
3. The method comprises: and for each stream, averaging the configuration-based resource usage ratio of the stream; and transmitting data to the resource scheduler includes transmitting, for each stream, an averaged configuration-based resource usage ratio instead of transmitting each configuration having its calculated set of configuration-based resource usage ratios. The method according to claim 1 or 2.
4. Calculating, for each configuration, one configuration-based resource usage ratio per stream, Selecting a cost function; Selecting a solution method, optimizing the cost function using the selected solution method to calculate, for each configuration, one configuration-based resource utilization ratio per stream such that the configuration-based resource utilization ratios for the configurations sum to one, said calculating being performed under the constraint that, for each stream, there is at least one configuration for which the configuration-based resource utilization ratio for the stream is non-zero; The method according to any one of claims 1 to 3, comprising:
5. The cost function is the following cost function [0010] and [0025] where W is the time window, j is the configuration C j is an index that identifies a stream, and k is an index that identifies a stream. ρ k,j (W) is the configuration-based resource usage ratio of the stream with index k in the configuration with index j, A k (W) is the stream S k is the set of configurations in the time window W that are active, [0030] is the channel error probability, n j (W) is the above-mentioned configuration C j is the number of time slots in the time window W in which The method according to claim 4.
6. The chosen cost function is [0045] and optimizing the cost function using a selected solution method is k About J k (W) The method of claim 5 , comprising minimizing
7. The chosen cost function is [0050] and optimizing the cost function using a selected solution method is k About J k (W) The method of claim 5 , comprising minimizing
8. The chosen cost function is [006] and optimizing the cost function using a selected solution method is k About -J k (W) The method of claim 5 , comprising minimizing
9. The solution is as follows: Configuration-based resource utilization ratio {ρ k,j (W) } k,j a brute force algorithm in which all possible values of Configuration-based resource utilization ratio {ρ k,j (W) } k,j a random algorithm that randomly selects a set of values for A genetic algorithm and The simplex algorithm, The method according to any one of claims 4 to 8, wherein the solver method is selected in a set of solver methods comprising:
10. A method according to any one of claims 1 to 9, wherein the transmitted data is used by the resource scheduler to allocate radio resources between streams.
11. A processing device in a system comprising a resource scheduler and a set of devices, each processing device hosting at least one application, each application transmitting a stream of messages to at least one receiver, the processing device comprising: Obtaining, for each stream, parameters including a message lifetime, a message duration, and the last buffering time of a message of the stream before a given time window begins; estimating from the obtained parameters a set of stream configurations within the time window, the stream configurations being defined as a particular configuration of active streams, a stream being active within a given time slot if there is a packet corresponding to a message to be sent or received; calculating, for each configuration, one configuration-based resource usage ratio per stream such that the configuration-based resource usage ratios for said configurations sum to one, said calculating being performed under the constraint that, for each stream, there is at least one configuration for which the configuration-based resource usage ratio for said stream is non-zero; sending data to the resource scheduler, the data including each configuration having its calculated set of configuration-based resource usage ratios; 16. A processing device comprising: at least one processor configured to:
12. 12. A system comprising a processing device according to claim 11 and a resource scheduler, the resource scheduler being adapted to allocate radio resources to each stream taking into account the data transmitted by the processing device.
13. A computer program product comprising program code instructions loadable into a programmable device, said program code instructions causing implementation of a method according to any one of claims 1 to 10 when said program code instructions are executed by said programmable device.
14. A storage medium storing a computer program comprising program code instructions which, when read from the storage medium and executed by a programmable device, cause the method of any one of claims 1 to 10 to be implemented.
Citation Information
Patent Citations
Techniques for reporting delay budgets for urllc uplink transmissions
US20180042042A1
Resource allocation method in communication system, resource allocation system, and base station used for the same
WO2009057391A1
