CN114390001A - Non-delay sensitive service queuing method, service access control method and device - Google Patents

Non-delay sensitive service queuing method, service access control method and device Download PDF

Info

Publication number
CN114390001A
CN114390001A CN202210053488.9A CN202210053488A CN114390001A CN 114390001 A CN114390001 A CN 114390001A CN 202210053488 A CN202210053488 A CN 202210053488A CN 114390001 A CN114390001 A CN 114390001A
Authority
CN
China
Prior art keywords
delay
delay sensitive
service
sensitive service
channel
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.)
Pending
Application number
CN202210053488.9A
Other languages
Chinese (zh)
Inventor
柳兴
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China United Network Communications Group Co Ltd
Original Assignee
China United Network Communications Group Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China United Network Communications Group Co Ltd filed Critical China United Network Communications Group Co Ltd
Priority to CN202210053488.9A priority Critical patent/CN114390001A/en
Publication of CN114390001A publication Critical patent/CN114390001A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/56—Queue scheduling implementing delay-aware scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention provides a non-delay sensitive service queuing method, a service access control method and a device, wherein the method comprises the following steps: acquiring each currently waiting non-delay sensitive service, determining a user corresponding to each non-delay sensitive service, and acquiring the probability of initiating and finishing a delay sensitive service request by the user corresponding to each non-delay sensitive service; obtaining the probability of each channel being allocated with the delay sensitive service, the probability of transmitting the end of the delay sensitive service and the service rate of transmitting the non-delay sensitive service; and allocating each non-delay sensitive service to one or more channels to queue according to the probability of initiating and ending the delay sensitive service request by the user corresponding to each non-delay sensitive service, the probability of allocating the delay sensitive service to each channel, the probability of ending the transmission delay sensitive service and the service rate of transmitting the non-delay sensitive service, so as to meet the delay requirement of the user on the non-delay sensitive service.

Description

Non-delay sensitive service queuing method, service access control method and device
Technical Field
The invention relates to the technical field of network control, in particular to a non-delay sensitive service queuing method, a service access control method and a device.
Background
All services in the mobile edge calculation can be divided into two types, wherein one type of services, such as video call, mobile game, network conference and the like, need to be interacted in real time and are very sensitive to the delay jitter of the network, and the system must allocate certain bandwidth after receiving the services to ensure the service quality of the services, and the services are called delay sensitive services; another type of service, such as mobile medical service, file transmission and the like, does not need real-time interaction, can have delay jitter, has no special requirement on network bandwidth, but still pays more attention to network delay and bit error rate, and the service is called non-delay sensitive service.
The non-delay sensitive service requires the delay as small as possible on the premise of allowing the delay jitter, and the prior art lacks a control algorithm for reducing the delay of the non-delay sensitive service as much as possible under the condition that a busy channel of a network is occupied.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a queuing method, a service access control method and a device for non-delay sensitive services, aiming at the above deficiencies in the prior art, so as to solve the problem that the delay of the non-delay sensitive services cannot be effectively controlled in the absence of the condition that the busy channel of the network is occupied in the prior art.
In a first aspect, the present invention provides a queuing method for non-delay sensitive services, which is applied to a mobile proxy server, and the method includes:
acquiring each currently waiting non-delay sensitive service, determining a user corresponding to each non-delay sensitive service, and acquiring the probability of initiating and finishing a delay sensitive service request by the user corresponding to each non-delay sensitive service;
obtaining the probability of each channel being allocated with the delay sensitive service, the probability of transmitting the end of the delay sensitive service and the service rate of transmitting the non-delay sensitive service;
and allocating each non-delay sensitive service to one or more channels to queue according to the probability of initiating and finishing the delay sensitive service request by the user corresponding to each non-delay sensitive service, the probability of allocating the delay sensitive service to each channel, the probability of finishing transmitting the delay sensitive service and the service rate of transmitting the non-delay sensitive service.
Preferably, the allocating each non-delay sensitive service to one or more channels for queuing according to the probability of initiating and ending the delay sensitive service request by the user corresponding to each non-delay sensitive service, the probability of allocating the delay sensitive service to each channel, the probability of ending transmitting the delay sensitive service, and the service rate of transmitting the non-delay sensitive service includes:
obtaining the strength of the request of the delay sensitive service according to the probability of the user initiating and finishing the delay sensitive service request corresponding to each non-delay sensitive service and obtaining the allowed delay of each non-delay sensitive service;
acquiring the total data amount of all currently waiting non-delay sensitive services according to the data amount of each non-delay sensitive service;
determining the optimal distribution quantity of the total data quantity of all currently-waiting non-delay sensitive services on each channel according to the probability of the distributed delay sensitive services of each channel, the probability of the end of transmitting the delay sensitive services and the service rate of transmitting the non-delay sensitive services, and obtaining the time delay which can be met by the transmission of each channel corresponding to the optimal distribution quantity;
and allocating each non-delay sensitive service to one or more channels to be queued according to the allowed delay of each non-delay sensitive service and the delay which can be met by the optimal allocation quantity corresponding to each channel transmission.
Preferably, the obtaining the strength of the request for the delay-sensitive service according to the probability of the user initiating and ending the delay-sensitive service request corresponding to each non-delay-sensitive service and obtaining the allowed delay of each non-delay-sensitive service specifically includes:
obtaining the strength of the user request delay sensitive service corresponding to each non-delay sensitive service according to the following formula:
Figure BDA0003475360930000021
where ρ isiFor ith non-delay sensitive serviceThe user requests the strength of the delay sensitive traffic,
Figure BDA0003475360930000031
probability of initiating a delay-sensitive service request for a user corresponding to the ith non-delay-sensitive service,
Figure BDA0003475360930000032
the probability of ending the delay sensitive service request for the user corresponding to the ith non-delay sensitive service;
the allowed delay for each non-delay sensitive service is obtained according to the following formula:
Ti＝Aexp(ρi·τ0)
wherein, TiAllowed time delay for ith non-time delay sensitive service, A and tau0Is a constant coefficient.
Preferably, the total data amount of all currently waiting non-delay sensitive services is obtained according to the data amount of each non-delay sensitive service, specifically according to the following formula:
Figure BDA0003475360930000033
wherein λ isnIs the total data amount, lambda, of all the non-delay sensitive services currently waitingn-iIs the data volume of the ith non-delay sensitive service, and N is the total number of all currently waiting non-delay sensitive services.
Preferably, the determining, according to the probability of allocating the delay-sensitive service to each channel, the probability of transmitting the delay-sensitive service to the end, and the service rate of transmitting the non-delay-sensitive service, the optimal allocation amount of the total data amount of all currently-waiting non-delay-sensitive services on each channel, and obtaining the delay that can be satisfied by the optimal allocation amount corresponding to transmission of each channel specifically includes:
obtaining a delay parameter for each channel according to the following formula:
Figure BDA0003475360930000034
and obtaining the average service rate of each channel for transmitting the non-time delay sensitive service according to the following formula:
Figure BDA0003475360930000035
wherein, γjIs the delay parameter for the channel j,
Figure BDA0003475360930000036
the average service rate for transmitting non-delay sensitive traffic for channel j,
Figure BDA0003475360930000037
the probability of channel j being assigned delay sensitive traffic,
Figure BDA0003475360930000038
the probability of transmitting the delay sensitive traffic end for channel j,
Figure BDA0003475360930000039
transmitting a service rate of the non-delay sensitive service for the channel j;
determining optimal allocation parameters according to:
Figure BDA0003475360930000041
wherein alpha is*The optimal distribution parameters are distributed on all channels for the total data amount of all currently waiting non-delay sensitive services, and M is the total number of the channels;
determining an optimal dispensing amount according to the following formula:
Figure BDA0003475360930000042
wherein λ is*jFor data totality of all currently waiting non-delay sensitive servicesThe optimal allocation of the quantity on channel j;
obtaining the time delay which can be satisfied by the optimal allocation quantity corresponding to each channel transmission according to the following formula:
Figure BDA0003475360930000043
wherein,
Figure BDA0003475360930000044
and transmitting the time delay which can be met by the corresponding optimal allocation amount for the channel j.
Preferably, the allocating each non-delay-sensitive service to one or more channels for queuing according to the delay allowed by each non-delay-sensitive service and the delay that can be satisfied by the optimal allocation amount corresponding to each channel transmission specifically includes:
and sequencing each non-delay sensitive service according to the allowed delay size:
T1＜T2＜…＜TN
sequencing each channel according to the time delay size which can be met by the transmission corresponding to the optimal allocation quantity:
Figure BDA0003475360930000045
compare in sequence
Figure BDA0003475360930000046
And TlWhen is coming into contact with
Figure BDA0003475360930000047
And is
Figure BDA0003475360930000048
Then, sequentially distributing the data volume of the 1 st to l th non-time delay sensitive services on the 1 st to m (m is less than or equal to k) th channels according to the optimal distribution volume on the 1 st to m (m is less than or equal to k) th channels;
wherein N is all NOT currently waiting-total number of delay sensitive services, M being total number of channels, TlThe allowed delay for the ith non-delay sensitive traffic,
Figure BDA0003475360930000049
the time delay that can be satisfied for the channel k transmission corresponding to the optimal allocation amount.
Preferably, the sequential comparisons
Figure BDA00034753609300000410
And TlIn the process of (a), the method further comprises:
when in use
Figure BDA00034753609300000411
When the channel is not the same as the channel, randomly distributing each non-delay sensitive service on each channel according to the optimal distribution quantity on each channel;
when in use
Figure BDA0003475360930000051
Sequentially distributing each non-delay sensitive service on each channel according to the optimal distribution quantity on each channel;
when present, is
Figure BDA0003475360930000052
And is
Figure BDA0003475360930000053
And then, sequentially distributing the data volume of the non-exceeding part of the 1 st to the k th channels according to the optimal distribution volume on the 1 st to the k th channels, and distributing the data volume of the exceeding part of the 1 st non-delay sensitive service to the channels adjacent to the k according to the optimal distribution volume on the channels sequenced after the k.
In a second aspect, the present invention provides a service access control method, which is applied to a mobile proxy server, and the method includes:
when a new service is received, judging whether an idle channel exists currently, if so, allocating the idle channel to the new service, and if not, entering the next step;
judging whether the new service is a non-delay sensitive service, if so, queuing the new service by using the non-delay sensitive service queuing method, and if not, entering the next step;
judging whether a channel is delivering the non-time delay sensitive service currently, if so, interrupting at least one delivered non-time delay sensitive service, distributing the corresponding channel to the new service, queuing the interrupted non-time delay sensitive service by using the non-time delay sensitive service queuing method, and if not, rejecting the new service.
In a third aspect, the present invention provides a non-delay sensitive service queuing apparatus, which is disposed in a mobile proxy server, and includes: a non-delay sensitive traffic queuing module, the non-delay sensitive traffic queuing module comprising:
the first obtaining unit is used for obtaining each currently waiting non-delay sensitive service, determining a user corresponding to each non-delay sensitive service, and obtaining the probability of initiating and finishing a delay sensitive service request by the user corresponding to each non-delay sensitive service;
a second obtaining unit, configured to obtain a probability that each channel is assigned with a delay-sensitive service, a probability that transmission of the delay-sensitive service is completed, and a service rate for transmitting a non-delay-sensitive service;
and the distribution queuing unit is connected with the first obtaining unit and the second obtaining unit and used for distributing each non-delay sensitive service to one or more channels to queue according to the probability that the user corresponding to each non-delay sensitive service initiates and ends the delay sensitive service request, the probability that each channel is distributed with the delay sensitive service, the probability that the transmission delay sensitive service ends and the service rate of the transmission non-delay sensitive service.
In a fourth aspect, the present invention provides a service access control device, which is installed in a mobile proxy server, and includes:
the first judging module is used for judging whether an idle channel exists currently or not when a new service is received, if so, distributing the idle channel to the new service, and if not, starting the second judging module;
the second judging module is connected with the first judging module and used for judging whether the new service is a non-delay sensitive service or not, if so, queuing the new service by using the non-delay sensitive service queuing method, and if not, starting a third judging module;
and the third judging module is connected with the second judging module and used for judging whether a channel delivers the non-delay sensitive service currently or not, if so, at least one delivered non-delay sensitive service is interrupted, the corresponding channel is distributed to the new service, the interrupted non-delay sensitive service is queued by using the non-delay sensitive service queuing method, and if not, the new service is rejected.
In a fifth aspect, the present invention provides a non-delay-sensitive traffic queuing apparatus, including a memory and a processor, where the memory stores a computer program, and when the processor runs the computer program stored in the memory, the processor executes the non-delay-sensitive traffic queuing method as described above.
The invention provides a queuing method of non-delay sensitive service, a service access control method and a device thereof, which are characterized in that a mobile proxy server is used for acquiring the non-delay sensitive service waiting for transmission at present, and an appropriate channel is allocated for the non-delay sensitive service waiting for transmission at present according to the delay sensitive service being transmitted by a channel, the probability of new delay sensitive service possibly received and the transmission capability of the channel, in combination with the probability of the user initiating and finishing the delay sensitive service request, so as to effectively control the actual delay of the non-delay sensitive service waiting for transmission at present and meet the delay requirement of the user on the non-delay sensitive service requested by the user as far as possible.
Drawings
Fig. 1 is a flowchart of a non-delay sensitive service queuing method according to embodiment 1 of the present invention;
fig. 2 is a detailed flowchart of step S53 in fig. 1;
fig. 3 is a flowchart of a service access control method according to embodiment 2 of the present invention;
fig. 4 is a schematic structural diagram of a non-delay sensitive service queuing apparatus according to embodiment 3 of the present invention;
fig. 5 is a schematic structural diagram of a service access control apparatus according to embodiment 4 of the present invention;
fig. 6 is a schematic structural diagram of a non-delay sensitive traffic queuing apparatus according to embodiment 5 of the present invention.
Detailed Description
In order to make those skilled in the art better understand the technical solution of the present invention, the following detailed description will be made with reference to the accompanying drawings.
It is to be understood that the specific embodiments and figures described herein are merely illustrative of the invention and are not limiting of the invention.
It is to be understood that the embodiments and features of the embodiments can be combined with each other without conflict.
It is to be understood that, for the convenience of description, only parts related to the present invention are shown in the drawings of the present invention, and parts not related to the present invention are not shown in the drawings.
It should be understood that each unit and module related in the embodiments of the present invention may correspond to only one physical structure, may also be composed of multiple physical structures, or multiple units and modules may also be integrated into one physical structure.
It will be understood that, without conflict, the functions, steps, etc. noted in the flowchart and block diagrams of the present invention may occur in an order different from that noted in the figures.
It is to be understood that the flowchart and block diagrams of the present invention illustrate the architecture, functionality, and operation of possible implementations of systems, apparatus, devices and methods according to various embodiments of the present invention. Each block in the flowchart or block diagrams may represent a unit, module, segment, code, which comprises executable instructions for implementing the specified function(s). Furthermore, each block or combination of blocks in the block diagrams and flowchart illustrations can be implemented by a hardware-based system that performs the specified functions or by a combination of hardware and computer instructions.
It is to be understood that the units and modules involved in the embodiments of the present invention may be implemented by software, and may also be implemented by hardware, for example, the units and modules may be located in a processor.
Example 1:
as shown in fig. 1, an embodiment 1 of the present invention provides a non-delay sensitive service queuing method applied to a mobile proxy server, where the method includes:
step S51, obtaining each currently waiting non-delay sensitive service, determining a user corresponding to each non-delay sensitive service, and obtaining probabilities of initiating and ending a delay sensitive service request by the user corresponding to each non-delay sensitive service.
Specifically, this embodiment 1 aims to solve the problem that when the network is busy, an appropriate channel is allocated to the non-delay sensitive service requested by the user, so as to meet the delay requirement of the user on the non-delay sensitive service of the user, and obtain higher user satisfaction. The inventive idea of this embodiment 1 is that, when the user uses the delay-sensitive service more frequently, the delay requirement of the user on the non-delay-sensitive service requested by the user is reduced, that is, the delay of the user on the non-delay-sensitive service requested by the user may be longer. For example, when a user is performing a video call (delay-sensitive service) and is watching a network video program (non-delay-sensitive service), the perception of the user on the delay (e.g., stuck) of the network video program may be reduced, that is, the delay of the user allowing the non-delay-sensitive service requested by the user is longer, and conversely, the delay allowed by the user is shorter. Based on the above principle, in this embodiment 1, by setting the mobile proxy server in its service range, each non-delay sensitive service currently waiting for channel transmission is obtained, and a user corresponding to each non-delay sensitive service is determined, and then according to the probability that the user corresponding to each non-delay sensitive service obtains its request for initiating and ending the delay sensitive service, the probability that the user initiates and ends the delay sensitive service request is used as the basis for queuing the requested non-delay sensitive service.
Step S52, obtaining the probability of each channel being allocated with the delay-sensitive service, the probability of transmitting the end of the delay-sensitive service, and the service rate of transmitting the non-delay-sensitive service.
Specifically, in this embodiment 1, the probability of allocating the delay sensitive service to each channel, the probability of transmitting the delay sensitive service and the probability of initiating the delay sensitive service request by all the users served by the channel are obtained and are corresponding to each other, so it is assumed that the probability is respectively subject to poisson distribution and negative index distribution, and the probability is set
Figure BDA0003475360930000091
Robust and sturdy lanes j are assigned a probability of delay sensitive traffic,
Figure BDA0003475360930000092
obtaining the probability of ending the transmission delay sensitive service for the channel j according to the statistical data of the past transmission delay sensitive service of each channel
Figure BDA0003475360930000093
And
Figure BDA0003475360930000094
the specific numerical value of (1). The service rate for transmitting the non-time delay sensitive service is related to the transmission performance of each channel, and is set
Figure BDA0003475360930000095
The service rate for transmitting the non-delay sensitive service for the channel j is obtained by measuring the rate of the channel j when the non-delay sensitive service is actually transmitted.
Step S53, allocating each non-delay sensitive service to one or more channels for queuing according to the probability of the user initiating and ending the delay sensitive service request corresponding to each non-delay sensitive service, the probability of each channel being allocated with the delay sensitive service, the probability of transmitting the end of the delay sensitive service, and the service rate of transmitting the non-delay sensitive service.
Specifically, in this embodiment 1, in order to implement the purpose of allocating channels with different delays to users with different delay requirements respectively so as to optimize the use experience of each user, since data of a non-delay sensitive service can be transmitted for multiple times, in order to meet the delay requirements of all users as much as possible, one non-delay sensitive service may be allocated to one or multiple channels to be queued for transmission.
As shown in fig. 2, in this embodiment, step S53 specifically includes:
step S531, obtaining the strength of the request for the delay sensitive service according to the probability of the user initiating and ending the delay sensitive service request corresponding to each non-delay sensitive service, and obtaining the allowed delay of each non-delay sensitive service.
In this embodiment, the obtaining the strength of the request for the delay-sensitive service and the time delay allowed by each non-delay-sensitive service according to the probability of the user initiating and ending the delay-sensitive service request corresponding to each non-delay-sensitive service specifically includes:
obtaining the strength of the user request delay sensitive service corresponding to each non-delay sensitive service according to the following formula:
Figure BDA0003475360930000096
where ρ isiThe strength of the delay-sensitive service requested by the user corresponding to the ith non-delay-sensitive service,
Figure BDA0003475360930000097
probability of initiating a delay-sensitive service request for a user corresponding to the ith non-delay-sensitive service,
Figure BDA0003475360930000098
the probability of ending the delay sensitive service request for the user corresponding to the ith non-delay sensitive service;
the allowed delay for each non-delay sensitive service is obtained according to the following formula:
Ti＝Aexp(ρi·τ0)
wherein, TiAllowed time delay for ith non-time delay sensitive service, A and tau0Is a constant coefficient.
Specifically, this embodiment 1 obtains the probability that the user corresponding to the ith non-delay-sensitive service initiates the delay-sensitive service request
Figure BDA0003475360930000101
Probability of user ending time delay sensitive service request corresponding to ith non-time delay sensitive service
Figure BDA0003475360930000102
According to empirical data, the probability of starting and ending is assumed to respectively obey parameters of
Figure BDA0003475360930000103
Has a Poisson distribution and a parameter of
Figure BDA0003475360930000104
The negative exponential distribution of (2) is obtained according to the statistical data of the past use delay sensitive service of each user
Figure BDA0003475360930000105
And
Figure BDA0003475360930000106
e.g. statistics of the frequency of use of the video call made by user i in relation to it
Figure BDA0003475360930000107
Value of (a), call duration statistics associated therewith
Figure BDA0003475360930000108
The statistical methods of how the data is obtained in particular are not technical contents claimed by the present invention and are not described in detail herein.
In particular toIn this embodiment 1, the strength ρ of the user request delay sensitive service corresponding to the ith non-delay sensitive service is obtainediThen, the time delay T allowed by the non-time delay sensitive service requested by the user is further calculated and obtainediWithout loss of generality, assume TiObtaining constant coefficients A and tau by modeling analysis fitting, obeying exponential distribution0So that it meets the delay requirements of most users.
And step S532, obtaining the total data amount of all the currently waiting non-delay sensitive services according to the data amount of each non-delay sensitive service.
In this embodiment, the obtaining the total data amount of all currently waiting non-delay sensitive services according to the data amount of each non-delay sensitive service specifically includes:
Figure BDA0003475360930000109
wherein λ isnIs the total data amount, lambda, of all the non-delay sensitive services currently waitingn-iIs the data volume of the ith non-delay sensitive service, and N is the total number of all currently waiting non-delay sensitive services.
Step S533, determining an optimal allocation amount of the total amount of data of all currently waiting non-delay sensitive services on each channel according to the probability of being allocated with the delay sensitive service for each channel, the probability of transmitting the delay sensitive service over, and the service rate of transmitting the non-delay sensitive service, and obtaining a delay that can be satisfied by the optimal allocation amount corresponding to transmission of each channel.
In this embodiment, step S533 specifically includes:
obtaining a delay parameter for each channel according to the following formula:
Figure BDA0003475360930000111
and obtaining the average service rate of each channel for transmitting the non-time delay sensitive service according to the following formula:
Figure BDA0003475360930000112
wherein, γjIs the delay parameter for the channel j,
Figure BDA0003475360930000113
the average service rate for transmitting non-delay sensitive traffic for channel j,
Figure BDA0003475360930000114
the probability of channel j being assigned delay sensitive traffic,
Figure BDA0003475360930000115
the probability of transmitting the delay sensitive traffic end for channel j,
Figure BDA0003475360930000116
transmitting a service rate of the non-delay sensitive service for the channel j;
determining optimal allocation parameters according to:
Figure BDA0003475360930000117
wherein alpha is*The optimal distribution parameters are distributed on all channels for the total data amount of all currently waiting non-delay sensitive services, and M is the total number of the channels;
determining an optimal dispensing amount according to the following formula:
Figure BDA0003475360930000118
wherein λ is*jThe optimal distribution quantity of the total data quantity of all currently waiting non-delay sensitive services on a channel j is obtained;
obtaining the time delay which can be satisfied by the optimal allocation quantity corresponding to each channel transmission according to the following formula:
Figure BDA0003475360930000119
wherein,
Figure BDA00034753609300001110
and transmitting the time delay which can be met by the corresponding optimal allocation amount for the channel j.
Specifically, in this embodiment 1, a modeling analysis is performed according to a one-dimensional markov chain principle, so as to obtain an average time delay of a certain data volume transmitted by a channel j, and an optimal scheme of a total data amount of all currently-waiting non-delay sensitive services is allocated according to the above-mentioned state of the channel transmission delay sensitive services assumed according to statistics, and a time delay that can be satisfied by each channel under the optimal scheme is obtained.
Step S534, allocating each non-delay sensitive service to one or more channels for queuing according to the delay allowed by each non-delay sensitive service and the delay that can be satisfied by the optimal allocation amount corresponding to each channel transmission.
In this embodiment, step S534 specifically includes:
and sequencing each non-delay sensitive service according to the allowed delay size:
T1＜T2＜…＜TN
sequencing each channel according to the time delay size which can be met by the transmission corresponding to the optimal allocation quantity:
Figure BDA0003475360930000121
compare in sequence
Figure BDA0003475360930000122
And TlWhen is coming into contact with
Figure BDA0003475360930000123
And is
Figure BDA0003475360930000124
Then, sequentially distributing the data volume of the 1 st to l th non-time delay sensitive services on the 1 st to m (m is less than or equal to k) th channels according to the optimal distribution volume on the 1 st to m (m is less than or equal to k) th channels;
wherein N is the total number of all currently waiting non-delay sensitive services, M is the total number of channels, and T islThe allowed delay for the ith non-delay sensitive traffic,
Figure BDA0003475360930000125
the time delay that can be satisfied for the channel k transmission corresponding to the optimal allocation amount.
In this embodiment, the sequential comparison
Figure BDA0003475360930000126
And TlIn the process of (a), the method further comprises:
when in use
Figure BDA0003475360930000127
When the channel is not the same as the channel, randomly distributing each non-delay sensitive service on each channel according to the optimal distribution quantity on each channel;
when in use
Figure BDA0003475360930000128
Sequentially distributing each non-delay sensitive service on each channel according to the optimal distribution quantity on each channel;
when present, is
Figure BDA0003475360930000129
And is
Figure BDA00034753609300001210
And then, sequentially distributing the data volume of the non-exceeding part of the 1 st to the k th channels according to the optimal distribution volume on the 1 st to the k th channels, and distributing the data volume of the exceeding part of the 1 st non-delay sensitive service to the channels adjacent to the k according to the optimal distribution volume on the channels sequenced after the k.
Specifically, in this embodiment 1, all the currently waiting N non-delay sensitive services are sorted first, where the sorting is to number the N non-delay sensitive services in sequence from short to long according to the allowed delay; similarly, all M channels are numbered from short to long according to the time delay which can be met by the M channels; compare T in sequenceiAnd
Figure BDA0003475360930000131
the method aims to find a channel capable of meeting the delay requirement of each non-delay sensitive service, and distribute each non-delay sensitive service to the channel capable of meeting the requirement to queue; the ideal comparison result is that each non-delay sensitive service can match a channel that is sufficient to transmit its full amount of data and whose delay meets its requirements, which can be satisfied by two cases:
the first is when
Figure BDA0003475360930000132
In the process, the channel with the longest time delay in all the channels can also meet the requirement of the service with the shortest time delay requirement, so that all the N non-time-delay sensitive services can be randomly distributed on the M channels only according to the optimal distribution quantity, and the time delay of each channel is the calculated time delay;
the second is when
Figure BDA0003475360930000133
And is
Figure BDA0003475360930000134
The present invention is the most advantageous case, at this time, only a part of channels for some non-delay sensitive services can meet their delay requirements, and the part of channels can also meet the requirements of the data volume to be transmitted for these non-delay sensitive services, so that these non-delay sensitive services need to be allocated to the corresponding channels, in order to meet the delay requirements of all non-delay sensitive services, the non-delay sensitive services need to be sequentially allocated to the corresponding channels, at this time, a cycle can be designedThe algorithm achieves this by setting 1 ≦ i ≦ N and 1 ≦ j ≦ M, and cyclically comparing TiAnd
Figure BDA0003475360930000135
sequentially distributing the data quantity to be transmitted of the non-time delay sensitive service to the corresponding channels by calculation; for example, there are non-delay sensitive services 1-3, whose data volumes are: 10M, 100M, 20| M, the allowed time delay is: 1ms, 2ms and 3ms, channels 1-4 are provided, and the optimal allocation amounts are respectively as follows: 5M, 100M, 20M and 5M, wherein the time delays which can be met are respectively as follows: 0.5ms, 1ms, 2ms, 3ms, then the result of the allocation according to the above method is that the data amount of the non-delay sensitive services 1-3 allocated by the channels 1-4 in sequence is: 5M, 5M +95M, 5M +15M and 5M, and all data transmission can meet the time delay requirement of a user;
thirdly, there is
Figure BDA0003475360930000136
And is
Figure BDA0003475360930000137
In time, that is, the data volume transmission of a part of non-delay sensitive services cannot be allocated to the channel satisfying its delay requirement, so it is only arranged on the adjacent channel to make it use the faster channel as much as possible.
Fourthly, when
Figure BDA0003475360930000141
In this case, all the channels cannot meet the delay requirement of the user, and then all the N non-delay sensitive services are only sequentially allocated to the channels according to the sequence, so that the user with short delay requirement uses a faster channel.
Example 2:
as shown in fig. 3, an embodiment 2 of the present invention provides a service access control method, which is applied to a mobile proxy server, and the method includes:
step S2, when receiving new service, judging whether there is idle channel, if yes, distributing idle channel to said new service, if not, entering next step;
step S4, judging whether the new service is a non-time delay sensitive service, if so, queuing the new service, and if not, entering the next step;
step S6, judging whether there is channel delivering non-time delay sensitive service, if yes, interrupting at least one delivered non-time delay sensitive service, distributing the corresponding channel to the new service, queuing the interrupted non-time delay sensitive service, if not, rejecting the new service.
In this embodiment, the queuing of the new service and the queuing of the interrupted non-delay-sensitive service are performed by using the queuing method for non-delay-sensitive services as described in embodiment 1.
Specifically, in this embodiment 2, after the mobile proxy server starts to work, the steps are sequentially executed according to the sequence in fig. 3, after all data of one service is delivered, the service delivery process is ended, whether a new service is received is continuously detected, and once the new service is received, the above steps are still repeated.
Example 3:
as shown in fig. 4, embodiment 3 of the present invention provides a non-delay sensitive service queuing apparatus, which is disposed in a mobile proxy server, and includes: a non-delay sensitive traffic queuing module 5, wherein the non-delay sensitive traffic queuing module 5 comprises:
a first obtaining unit 51, configured to obtain each currently-waiting non-delay sensitive service, determine a user corresponding to each non-delay sensitive service, and obtain probabilities of initiating and ending a delay sensitive service request by the user corresponding to each non-delay sensitive service;
a second obtaining unit 52, configured to obtain a probability that each channel is assigned with a delay-sensitive service, a probability that transmission of the delay-sensitive service is ended, and a service rate for transmitting a non-delay-sensitive service;
and an allocation queuing unit 53, connected to the first obtaining unit 51 and the second obtaining unit 52, configured to allocate each non-delay-sensitive service to one or more channels for queuing according to the probability that a user corresponding to each non-delay-sensitive service initiates and ends a delay-sensitive service request, the probability that each channel is allocated with a delay-sensitive service, the probability that a transmission delay-sensitive service ends, and the service rate for transmitting the non-delay-sensitive service.
Optionally, the allocating and queuing unit 53 specifically includes:
the first time delay calculating subunit is used for obtaining the strength of the request of the time delay sensitive service according to the probability of the user initiating and finishing the time delay sensitive service request corresponding to each non-time delay sensitive service and obtaining the time delay allowed by each non-time delay sensitive service;
the data total amount counting subunit is used for obtaining the data total amount of all the currently waiting non-delay sensitive services according to the data amount of each non-delay sensitive service;
the second time delay calculation subunit is used for determining the optimal distribution quantity of the total data quantity of all currently-waiting non-time delay sensitive services on each channel according to the probability of the time delay sensitive services distributed to each channel, the probability of the end of transmitting the time delay sensitive services and the service rate of transmitting the non-time delay sensitive services, and obtaining the time delay which can be met by the transmission of each channel corresponding to the optimal distribution quantity;
and the distribution queuing subunit is used for distributing each non-delay sensitive service to one or more channels for queuing according to the time delay allowed by each non-delay sensitive service and the time delay which can be met by the optimal distribution quantity corresponding to each channel transmission.
Optionally, the first time delay calculating subunit specifically includes:
obtaining the strength of the user request delay sensitive service corresponding to each non-delay sensitive service according to the following formula:
Figure BDA0003475360930000151
where ρ isiDelay sensitivity of user request corresponding to ith non-delay sensitive serviceThe intensity of the service is such that,
Figure BDA0003475360930000152
probability of initiating a delay-sensitive service request for a user corresponding to the ith non-delay-sensitive service,
Figure BDA0003475360930000153
the probability of ending the delay sensitive service request for the user corresponding to the ith non-delay sensitive service;
the allowed delay for each non-delay sensitive service is obtained according to the following formula:
Ti＝Aexp(ρi·τ0)
wherein, TiAllowed time delay for ith non-time delay sensitive service, A and tau0Is a constant coefficient.
Optionally, the total data amount calculation subunit calculates a total data amount of all currently waiting non-delay sensitive services according to the following formula:
Figure BDA0003475360930000161
wherein λ isnIs the total data amount, lambda, of all the non-delay sensitive services currently waitingn-iIs the data volume of the ith non-delay sensitive service, and N is the total number of all currently waiting non-delay sensitive services.
Optionally, the second time delay calculating subunit specifically performs the following calculation:
obtaining a delay parameter for each channel according to the following formula:
Figure BDA0003475360930000162
and obtaining the average service rate of each channel for transmitting the non-time delay sensitive service according to the following formula:
Figure BDA0003475360930000163
wherein, γjIs the delay parameter for the channel j,
Figure BDA0003475360930000164
the average service rate for transmitting non-delay sensitive traffic for channel j,
Figure BDA0003475360930000165
the probability of channel j being assigned delay sensitive traffic,
Figure BDA0003475360930000166
the probability of transmitting the delay sensitive traffic end for channel j,
Figure BDA0003475360930000167
transmitting a service rate of the non-delay sensitive service for the channel j;
determining optimal allocation parameters according to:
Figure BDA0003475360930000168
wherein alpha is*The optimal distribution parameters are distributed on all channels for the total data amount of all currently waiting non-delay sensitive services, and M is the total number of the channels;
determining an optimal dispensing amount according to the following formula:
Figure BDA0003475360930000169
wherein λ is*jThe optimal distribution quantity of the total data quantity of all currently waiting non-delay sensitive services on a channel j is obtained;
obtaining the time delay which can be satisfied by the optimal allocation quantity corresponding to each channel transmission according to the following formula:
Figure BDA0003475360930000171
wherein,
Figure BDA0003475360930000172
and transmitting the time delay which can be met by the corresponding optimal allocation amount for the channel j.
Optionally, the allocating queue subunit specifically performs the following operations and allocations:
and sequencing each non-delay sensitive service according to the allowed delay size:
T1＜T2＜…＜TN
sequencing each channel according to the time delay size which can be met by the transmission corresponding to the optimal allocation quantity:
Figure BDA0003475360930000173
compare in sequence
Figure BDA0003475360930000174
And TlWhen is coming into contact with
Figure BDA0003475360930000175
And is
Figure BDA0003475360930000176
Then, sequentially distributing the data volume of the 1 st to l th non-time delay sensitive services on the 1 st to m (m is less than or equal to k) th channels according to the optimal distribution volume on the 1 st to m (m is less than or equal to k) th channels;
wherein N is the total number of all currently waiting non-delay sensitive services, M is the total number of channels, and T islThe allowed delay for the ith non-delay sensitive traffic,
Figure BDA0003475360930000177
the time delay that can be satisfied for the channel k transmission corresponding to the optimal allocation amount.
Optionally, the allocating queue subunit further performs operations and allocation, and the sequentially comparing
Figure BDA0003475360930000178
And TlIn the process of (2):
when in use
Figure BDA0003475360930000179
When the channel is not the same as the channel, randomly distributing each non-delay sensitive service on each channel according to the optimal distribution quantity on each channel;
when in use
Figure BDA00034753609300001710
Sequentially distributing each non-delay sensitive service on each channel according to the optimal distribution quantity on each channel;
when present, is
Figure BDA00034753609300001711
And is
Figure BDA00034753609300001712
And then, sequentially distributing the data volume of the non-exceeding part of the 1 st to the k th channels according to the optimal distribution volume on the 1 st to the k th channels, and distributing the data volume of the exceeding part of the 1 st non-delay sensitive service to the channels adjacent to the k according to the optimal distribution volume on the channels sequenced after the k.
Example 4:
as shown in fig. 5, an embodiment 4 of the present invention provides a service access control device, which is disposed in a mobile proxy server, and includes:
the first judging module 2 is used for judging whether an idle channel exists currently when a new service is received, if so, distributing the idle channel to the new service, and if not, starting the second judging module 4;
a second judging module 4, connected to the first judging module 2, for judging whether the new service is a non-delay sensitive service, if so, queuing the new service by using the non-delay sensitive service queuing method as described in embodiment 1, and if not, starting a third judging module 6;
a third determining module 6, connected to the second determining module 4, configured to determine whether a channel is currently delivering a non-delay sensitive service, if so, interrupt at least one non-delay sensitive service being delivered, allocate the corresponding channel to the new service, queue the interrupted non-delay sensitive service by using the non-delay sensitive service queuing method as described in embodiment 1, and if not, reject the new service.
Example 5:
as shown in fig. 6, an embodiment 5 of the present invention provides another non-delay-sensitive traffic queuing apparatus, which includes a memory 10 and a processor 20, where the memory 10 stores a computer program, and when the processor 20 runs the computer program stored in the memory 10, the processor 20 executes the non-delay-sensitive traffic queuing method according to embodiment 1.
The memory 10 is connected to the processor 20, the memory 10 may be a flash memory, a read-only memory or other memories, and the processor 20 may be a central processing unit or a single chip microcomputer.
The non-delay sensitive service queuing method, the service access control method and the device provided in embodiments 1 to 5 of the present invention obtain, through the mobile proxy server, the non-delay sensitive service currently waiting for transmission, and allocate an appropriate channel for the non-delay sensitive service currently waiting for transmission according to the delay sensitive service being transmitted by the channel, the probability of a new delay sensitive service that may be received, and the transmission capability of the channel, in combination with the strength of the delay sensitive service used by the user, so as to effectively control the actual delay of the non-delay sensitive service currently waiting for transmission, and to meet the delay requirement of the user for the non-delay sensitive service requested by the user as much as possible.
It will be understood that the above embodiments are merely exemplary embodiments taken to illustrate the principles of the present invention, which is not limited thereto. It will be apparent to those skilled in the art that various modifications and improvements can be made without departing from the spirit and substance of the invention, and these modifications and improvements are also considered to be within the scope of the invention.

Claims (11)

1. A method for queuing non-delay sensitive traffic, the method being applied to a mobile proxy server, the method comprising:
acquiring each currently waiting non-delay sensitive service, determining a user corresponding to each non-delay sensitive service, and acquiring the probability of initiating and finishing a delay sensitive service request by the user corresponding to each non-delay sensitive service;
obtaining the probability of each channel being allocated with the delay sensitive service, the probability of transmitting the end of the delay sensitive service and the service rate of transmitting the non-delay sensitive service;
and allocating each non-delay sensitive service to one or more channels to queue according to the probability of initiating and finishing the delay sensitive service request by the user corresponding to each non-delay sensitive service, the probability of allocating the delay sensitive service to each channel, the probability of finishing transmitting the delay sensitive service and the service rate of transmitting the non-delay sensitive service.
2. The method of claim 1, wherein the allocating each non-delay sensitive service to one or more channels for queuing according to the probability of the user initiating and ending the delay sensitive service request corresponding to each non-delay sensitive service, the probability of each channel being allocated with the delay sensitive service, the probability of transmitting the end of the delay sensitive service, and the service rate of transmitting the non-delay sensitive service comprises:
obtaining the strength of the request of the delay sensitive service according to the probability of the user initiating and finishing the delay sensitive service request corresponding to each non-delay sensitive service and obtaining the allowed delay of each non-delay sensitive service;
acquiring the total data amount of all currently waiting non-delay sensitive services according to the data amount of each non-delay sensitive service;
determining the optimal distribution quantity of the total data quantity of all currently-waiting non-delay sensitive services on each channel according to the probability of the distributed delay sensitive services of each channel, the probability of the end of transmitting the delay sensitive services and the service rate of transmitting the non-delay sensitive services, and obtaining the time delay which can be met by the transmission of each channel corresponding to the optimal distribution quantity;
and allocating each non-delay sensitive service to one or more channels to be queued according to the allowed delay of each non-delay sensitive service and the delay which can be met by the optimal allocation quantity corresponding to each channel transmission.
3. The method of claim 2, wherein the obtaining the strength of the request for the delay-sensitive service and the time delay allowed by each non-delay-sensitive service according to the probability of the user initiating and ending the delay-sensitive service request corresponding to each non-delay-sensitive service specifically comprises:
obtaining the strength of the user request delay sensitive service corresponding to each non-delay sensitive service according to the following formula:
Figure FDA0003475360920000021
where ρ isiThe strength of the delay-sensitive service requested by the user corresponding to the ith non-delay-sensitive service,
Figure FDA0003475360920000022
probability of initiating a delay-sensitive service request for a user corresponding to the ith non-delay-sensitive service,
Figure FDA0003475360920000023
the probability of ending the delay sensitive service request for the user corresponding to the ith non-delay sensitive service;
the allowed delay for each non-delay sensitive service is obtained according to the following formula:
Ti＝Aexp(ρi·τ0)
wherein, TiAllowed time delay for ith non-time delay sensitive service, A and tau0Is a constant coefficient.
4. The method according to claim 2, wherein the total data amount of all currently waiting non-delay sensitive services is obtained according to the data amount of each non-delay sensitive service, and is specifically obtained according to the following formula:
Figure FDA0003475360920000024
wherein λ isnIs the total data amount, lambda, of all the non-delay sensitive services currently waitingn-iIs the data volume of the ith non-delay sensitive service, and N is the total number of all currently waiting non-delay sensitive services.
5. The method according to claim 2, wherein the determining an optimal allocation amount of a total amount of data of all currently waiting non-delay sensitive services on each channel according to the probability of allocating the delay sensitive service to each channel, the probability of transmitting the delay sensitive service to end, and the service rate of transmitting the non-delay sensitive service, and obtaining a delay that can be satisfied by the optimal allocation amount corresponding to transmission of each channel specifically comprises:
obtaining a delay parameter for each channel according to the following formula:
Figure FDA0003475360920000031
and obtaining the average service rate of each channel for transmitting the non-time delay sensitive service according to the following formula:
Figure FDA0003475360920000032
wherein, γjIs the delay parameter for the channel j,
Figure FDA0003475360920000033
the average service rate for transmitting non-delay sensitive traffic for channel j,
Figure FDA0003475360920000034
the probability of channel j being assigned delay sensitive traffic,
Figure FDA0003475360920000035
the probability of transmitting the delay sensitive traffic end for channel j,
Figure FDA0003475360920000036
transmitting a service rate of the non-delay sensitive service for the channel j;
determining optimal allocation parameters according to:
Figure FDA0003475360920000037
wherein alpha is*The total data amount lambda of all the currently waiting non-delay sensitive servicesnPerforming optimal distribution parameters distributed on all channels, wherein M is the total number of the channels;
determining an optimal dispensing amount according to the following formula:
Figure FDA0003475360920000038
wherein λ is*jThe optimal distribution quantity of the total data quantity of all currently waiting non-delay sensitive services on a channel j is obtained;
obtaining the time delay which can be satisfied by the optimal allocation quantity corresponding to each channel transmission according to the following formula:
Figure FDA0003475360920000039
wherein,
Figure FDA00034753609200000310
and transmitting the time delay which can be met by the corresponding optimal allocation amount for the channel j.
6. The method of claim 2, wherein the allocating each non-delay sensitive service to one or more channels for queuing according to the allowed delay of each non-delay sensitive service and the delay that can be satisfied by the optimal allocation amount corresponding to each channel transmission comprises:
and sequencing each non-delay sensitive service according to the allowed delay size:
T1＜T2＜…＜TN
sequencing each channel according to the time delay size which can be met by the transmission corresponding to the optimal allocation quantity:
Figure FDA0003475360920000041
compare in sequence
Figure FDA0003475360920000042
And TlWhen is coming into contact with
Figure FDA0003475360920000043
And is
Figure FDA0003475360920000044
Then, sequentially distributing the data volume of the 1 st to l th non-time delay sensitive services on the 1 st to m (m is less than or equal to k) th channels according to the optimal distribution volume on the 1 st to m (m is less than or equal to k) th channels;
wherein N is the total number of all currently waiting non-delay sensitive services, M is the total number of channels, and T islThe allowed delay for the ith non-delay sensitive traffic,
Figure FDA0003475360920000045
the time delay that can be satisfied for the channel k transmission corresponding to the optimal allocation amount.
7. The method of claim 6, wherein the sequential comparisons are performed in sequence
Figure FDA0003475360920000046
And TlIn the process of (a), the method further comprises:
when in use
Figure FDA0003475360920000047
When the channel is not the same as the channel, randomly distributing each non-delay sensitive service on each channel according to the optimal distribution quantity on each channel;
when in use
Figure FDA0003475360920000048
Sequentially distributing each non-delay sensitive service on each channel according to the optimal distribution quantity on each channel;
when present, is
Figure FDA0003475360920000049
And is
Figure FDA00034753609200000410
And then, sequentially distributing the data volume of the non-exceeding part of the 1 st to the k th channels according to the optimal distribution volume on the 1 st to the k th channels, and distributing the data volume of the exceeding part of the 1 st non-delay sensitive service to the channels adjacent to the k according to the optimal distribution volume on the channels sequenced after the k.
8. A service access control method is applied to a mobile proxy server, and the method comprises the following steps:
when a new service is received, judging whether an idle channel exists currently, if so, allocating the idle channel to the new service, and if not, entering the next step;
judging whether the new service is a non-delay sensitive service, if so, queuing the new service by using the non-delay sensitive service queuing method according to any one of claims 1 to 7, and if not, entering the next step;
judging whether a channel is delivering non-delay sensitive service currently, if so, interrupting at least one delivered non-delay sensitive service, distributing the corresponding channel to the new service, queuing the interrupted non-delay sensitive service by using the queuing method of the non-delay sensitive service as claimed in any one of claims 1 to 7, and if not, rejecting the new service.
9. A non-delay sensitive traffic queuing apparatus, disposed at a mobile proxy server, the apparatus comprising: a non-delay sensitive traffic queuing module, the non-delay sensitive traffic queuing module comprising:
the first obtaining unit is used for obtaining each currently waiting non-delay sensitive service, determining a user corresponding to each non-delay sensitive service, and obtaining the probability of initiating and finishing a delay sensitive service request by the user corresponding to each non-delay sensitive service;
a second obtaining unit, configured to obtain a probability that each channel is assigned with a delay-sensitive service, a probability that transmission of the delay-sensitive service is completed, and a service rate for transmitting a non-delay-sensitive service;
and the distribution queuing unit is connected with the first obtaining unit and the second obtaining unit and used for distributing each non-delay sensitive service to one or more channels to queue according to the probability that the user corresponding to each non-delay sensitive service initiates and ends the delay sensitive service request, the probability that each channel is distributed with the delay sensitive service, the probability that the transmission delay sensitive service ends and the service rate of the transmission non-delay sensitive service.
10. A service access control apparatus, provided in a mobile proxy server, the apparatus comprising:
the first judging module is used for judging whether an idle channel exists currently or not when a new service is received, if so, distributing the idle channel to the new service, and if not, starting the second judging module;
a second judging module, connected to the first judging module, for judging whether the new service is a non-delay sensitive service, if so, queuing the new service by using the non-delay sensitive service queuing method according to any one of claims 1 to 7, and if not, starting a third judging module;
a third determining module, connected to the second determining module, configured to determine whether a channel is currently delivering a non-delay sensitive service, if so, interrupt at least one non-delay sensitive service being delivered, allocate the corresponding channel to the new service, queue the interrupted non-delay sensitive service by using the non-delay sensitive service queuing method according to any one of claims 1 to 7, and if not, reject the new service.
11. A non-delay sensitive traffic queuing apparatus comprising a memory and a processor, the memory having stored therein a computer program, the processor, when executing the computer program stored by the memory, performing the non-delay sensitive traffic queuing method according to any one of claims 1-7.
CN202210053488.9A 2022-01-18 2022-01-18 Non-delay sensitive service queuing method, service access control method and device Pending CN114390001A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210053488.9A CN114390001A (en) 2022-01-18 2022-01-18 Non-delay sensitive service queuing method, service access control method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210053488.9A CN114390001A (en) 2022-01-18 2022-01-18 Non-delay sensitive service queuing method, service access control method and device

Publications (1)

Publication Number Publication Date
CN114390001A true CN114390001A (en) 2022-04-22

Family

ID=81202061

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210053488.9A Pending CN114390001A (en) 2022-01-18 2022-01-18 Non-delay sensitive service queuing method, service access control method and device

Country Status (1)

Country Link
CN (1) CN114390001A (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101651963A (en) * 2009-07-09 2010-02-17 南京工业大学 Transmission control method based on differentiated services in IEEE 802.11 WLAN
CN103313421A (en) * 2013-05-22 2013-09-18 中国科学院上海微系统与信息技术研究所 Back off algorithm in medium access control protocol for multi-hop network and wireless sensor network
KR20150053690A (en) * 2013-11-07 2015-05-18 경희대학교 산학협력단 Method for allocating channel of delay-sensitive packet in cognitive radio
CN106793133A (en) * 2017-01-06 2017-05-31 国网江苏省电力公司信息通信分公司 The dispatching method of multi-service QoS is ensured in a kind of electric power wireless communication system
CN108738161A (en) * 2018-04-28 2018-11-02 南京邮电大学 Accidental access method based on different delay demand device packets in a kind of machine type communication
CN112055382A (en) * 2020-07-28 2020-12-08 西安空间无线电技术研究所 Service access method based on refined differentiation
CN112996116A (en) * 2021-01-28 2021-06-18 国网冀北电力有限公司 Resource allocation method and system for guaranteeing quality of power time delay sensitive service
CN113472570A (en) * 2021-06-26 2021-10-01 华北电力大学 Delay-sensitive fronthaul network flow scheduling method for power communication

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101651963A (en) * 2009-07-09 2010-02-17 南京工业大学 Transmission control method based on differentiated services in IEEE 802.11 WLAN
CN103313421A (en) * 2013-05-22 2013-09-18 中国科学院上海微系统与信息技术研究所 Back off algorithm in medium access control protocol for multi-hop network and wireless sensor network
KR20150053690A (en) * 2013-11-07 2015-05-18 경희대학교 산학협력단 Method for allocating channel of delay-sensitive packet in cognitive radio
CN106793133A (en) * 2017-01-06 2017-05-31 国网江苏省电力公司信息通信分公司 The dispatching method of multi-service QoS is ensured in a kind of electric power wireless communication system
CN108738161A (en) * 2018-04-28 2018-11-02 南京邮电大学 Accidental access method based on different delay demand device packets in a kind of machine type communication
CN112055382A (en) * 2020-07-28 2020-12-08 西安空间无线电技术研究所 Service access method based on refined differentiation
CN112996116A (en) * 2021-01-28 2021-06-18 国网冀北电力有限公司 Resource allocation method and system for guaranteeing quality of power time delay sensitive service
CN113472570A (en) * 2021-06-26 2021-10-01 华北电力大学 Delay-sensitive fronthaul network flow scheduling method for power communication

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
XING LIU ETC.: "Wireless Resource Scheduling Based on Backoff for Multiuser Multiservice Mobile Cloud Computing", IEEE *

Similar Documents

Publication Publication Date Title
CN108449286B (en) Network bandwidth resource allocation method and device
Tezcan et al. Dynamic control of N-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic
CN111211830B (en) Satellite uplink bandwidth resource allocation method based on Markov prediction
CN107454019B (en) Dynamic bandwidth allocation method, device, equipment and storage medium for software defined network
EP3754915A1 (en) Data processing method, apparatus and system
CN112131006A (en) Service request distribution method, device, computer equipment and storage medium
US20110165887A1 (en) Allocation of radio resources in a cdma2000 cellular system
CN107682417B (en) Task allocation method and device for data nodes
CN111080126B (en) Task allocation method and device
JP2009026316A (en) Apparatus for predicting wait time in queue
CN110297698B (en) Multi-priority dynamic current limiting method, device, server and storage medium
CN107015942B (en) Method and device for multi-core CPU (Central processing Unit) packet sending
CN113038609B (en) Method, device and equipment for allocating bandwidth resources based on communication demands
CN107222646B (en) Call request distribution method and device
CN113225196B (en) Service level configuration method and device
CN113141321B (en) Data transmission method based on edge calculation and electronic equipment
JPH11275112A (en) Cell transmission scheduling device in atm network
CN113595926A (en) API data transmission method, device, equipment and medium based on data middlebox
CN106413015A (en) Network access switching method and device
CN114390001A (en) Non-delay sensitive service queuing method, service access control method and device
Atar et al. Fluid limits of G/G/1+ G queues under the nonpreemptive earliest-deadline-first discipline
CN109951540A (en) A kind of data transmission method, device and electronic equipment
CN116820769A (en) Task allocation method, device and system
CN112596985A (en) IT asset detection method, device, equipment and medium
KR101491689B1 (en) Apparatus and method for allocating computing resource to multiple users

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20220422