CN113642780A - Method and system for predicting queuing time - Google Patents

Method and system for predicting queuing time Download PDF

Info

Publication number
CN113642780A
CN113642780A CN202110834752.8A CN202110834752A CN113642780A CN 113642780 A CN113642780 A CN 113642780A CN 202110834752 A CN202110834752 A CN 202110834752A CN 113642780 A CN113642780 A CN 113642780A
Authority
CN
China
Prior art keywords
queuing
queue
time
user
queue set
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.)
Withdrawn
Application number
CN202110834752.8A
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.)
Guangzhou Dianyun Technology Co ltd
Original Assignee
Guangzhou Dianyun Technology 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 Guangzhou Dianyun Technology Co ltd filed Critical Guangzhou Dianyun Technology Co ltd
Priority to CN202110834752.8A priority Critical patent/CN113642780A/en
Publication of CN113642780A publication Critical patent/CN113642780A/en
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
    • G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
    • G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
    • G07C2011/04—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere related to queuing systems

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Data Mining & Analysis (AREA)
  • Pure & Applied Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Mathematical Optimization (AREA)
  • Mathematical Analysis (AREA)
  • Operations Research (AREA)
  • Economics (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Probability & Statistics with Applications (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Evolutionary Biology (AREA)
  • Marketing (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Business, Economics & Management (AREA)
  • Game Theory and Decision Science (AREA)
  • Algebra (AREA)
  • Development Economics (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention provides a method and a system for predicting queuing time, wherein the method comprises the following steps: receiving a queuing request of a user, and obtaining a target queue according to the queuing request; acquiring the current queuing number of people of the target queue and calculating the average queuing time of the target queue; and calculating to obtain a predicted value of the queuing time of the user according to the current queuing number and the average queuing time, and returning the predicted value of the queuing time to the user. The invention can provide a dynamically-changed queuing prediction time for a user, can continuously adjust according to the speed of the queue processing service, has more referential significance compared with fixed time or no notification of the queuing time for the user, avoids the trouble of manually setting the prediction time, and improves the accuracy of the queuing prediction time.

Description

Method and system for predicting queuing time
Technical Field
The invention relates to the technical field of data processing, in particular to a method and a system for predicting queuing time.
Background
At present, a user enters a queue of a specific service type for queuing, the adopted calculation of the queuing time of the user is to obtain the queue length of the queue of the user and multiply the preset queuing time of a single user, and the obtained result is used as the queuing time required by the user and is returned to the user, so that the user can know the queuing time.
The existing method calculates the time required by user queuing directly through the preset queue single-user service time, and has the advantages of simple flow and low cost. However, the time obtained by using the method is too single, the time is preset, the time cannot be changed any more, the queuing time cannot be obtained more accurately and more truly, and the reference is not large, so that the user experience is poor, the current queuing state cannot be truly reflected, and even the user loss is directly caused.
Disclosure of Invention
In order to solve the existing problems, the invention provides a method and a system for predicting queuing time, which can continuously calculate the predicted time according to the state change of a queue, can reflect the queuing condition of the current queue, have high reference, can enable a user to reasonably arrange time, and improve the user experience.
The first aspect of the present invention provides a method for predicting queuing time, including:
receiving a queuing request of a user, and obtaining a target queue according to the queuing request;
acquiring the current queuing number of people of the target queue and calculating the average queuing time of the target queue;
and calculating to obtain a predicted value of the queuing time of the user according to the current queuing number and the average queuing time, and returning the predicted value of the queuing time to the user.
Further, the calculating the average queuing time of the target queue includes:
recording a user as an Nth user of the target queue, and acquiring the enqueue time of the Nth user;
acquiring the enqueue time of each user of M users arranged before the Nth user;
a first queue set is formed by the enqueue time of each user and the enqueue time of the Nth user; and N > M is satisfied;
performing data cleaning on the first queue set according to a quartile method to obtain a second queue set;
and calculating the average value of all the numerical values in the second queue set, and taking the average value as the average queuing time.
Further, the performing data cleaning on the first queue set according to a quartile method to obtain a second queue set includes:
all the numerical values in the first queue set are arranged in an ascending order to obtain a third queue set;
screening a numerical value of a fourth digit and a numerical value of a fourth digit in a third queue set according to a quartile method, recording the numerical value of the fourth digit as a minimum value of a data cleaning range, and recording the numerical value of the fourth digit as a maximum value of the data cleaning range;
and taking the data meeting the data cleaning range in the third queue set as the data in the second queue set to obtain the second queue set.
Further, before taking the average value as the average queuing time, the method further includes:
calculating the standard deviation of all the values in the second queue set;
and adjusting the average value according to the standard deviation.
Further, after obtaining the target queue according to the queuing request, the method further includes:
and putting the users into the tail of the target queue, and queuing in sequence.
The second aspect of the present invention provides a system for predicting queuing time, including:
the queuing request processing module is used for receiving a queuing request of a user and obtaining a target queue according to the queuing request;
the queuing data processing module is used for acquiring the current queuing number of people of the target queue and calculating the average queuing time of the target queue;
and the queuing time length prediction module is used for calculating a queuing time length prediction value of the user according to the current queuing number and the average queuing time length and returning the queuing time length prediction value to the user.
Further, the queuing data processing module is further configured to:
recording a user as an Nth user of the target queue, and acquiring the enqueue time of the Nth user;
acquiring the enqueue time of each user of M users arranged before the Nth user;
a first queue set is formed by the enqueue time of each user and the enqueue time of the Nth user; and N > M is satisfied;
performing data cleaning on the first queue set according to a quartile method to obtain a second queue set;
and calculating the average value of all the numerical values in the second queue set, and taking the average value as the average queuing time.
Further, the queuing data processing module is further configured to:
all the numerical values in the first queue set are arranged in an ascending order to obtain a third queue set;
screening a numerical value of a fourth digit and a numerical value of a fourth digit in a third queue set according to a quartile method, recording the numerical value of the fourth digit as a minimum value of a data cleaning range, and recording the numerical value of the fourth digit as a maximum value of the data cleaning range;
and taking the data meeting the data cleaning range in the third queue set as the data in the second queue set to obtain the second queue set.
Further, the queuing data processing module is further configured to:
calculating the standard deviation of all the values in the second queue set;
and adjusting the average value according to the standard deviation.
Further, the queued request processing module is further configured to:
and putting the users into the tail of the target queue, and queuing in sequence.
Compared with the prior art, the embodiment of the invention has the beneficial effects that:
the invention provides a method and a system for predicting queuing time, wherein the method comprises the following steps: receiving a queuing request of a user, and obtaining a target queue according to the queuing request; acquiring the current queuing number of people of the target queue and calculating the average queuing time of the target queue; and calculating to obtain a predicted value of the queuing time of the user according to the current queuing number and the average queuing time, and returning the predicted value of the queuing time to the user. The invention can provide a dynamically-changed queuing prediction time for a user, can continuously adjust according to the speed of the queue processing service, has more referential significance compared with fixed time or no notification of the queuing time for the user, avoids the trouble of manually setting the prediction time, and improves the accuracy of the queuing prediction time.
Drawings
In order to more clearly illustrate the technical solution of the present invention, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flow chart of a method for predicting queuing duration according to an embodiment of the present invention;
FIG. 2 is a flow chart of a method for predicting queuing duration according to another embodiment of the present invention;
FIG. 3 is a flow chart of a prior art queuing time duration prediction method;
FIG. 4 is a diagram of an apparatus for a queue duration prediction system according to an embodiment of the present invention;
fig. 5 is a block diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be understood that the step numbers used herein are for convenience of description only and are not intended as limitations on the order in which the steps are performed.
It is to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the specification of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
The terms "comprises" and "comprising" indicate the presence of the described features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The term "and/or" refers to and includes any and all possible combinations of one or more of the associated listed items.
Interpretation of terms:
1) cloud game: the game mode based on cloud computing is adopted, all games run at a server side in a running mode of the cloud game, and rendered game pictures are compressed and then transmitted to users through a network. At the client, the user's gaming device does not require any high-end processor and graphics card, but only basic video decompression capability.
2) A service server: a control center for realizing various service logics, such as user queuing, machine distribution and the like, is composed of a plurality of services divided according to different service functions.
3) Quartile: the boxplot drawing applied to statistics is one of quantiles in statistics, namely all numerical values are arranged from small to large and divided into four equal parts, and the numerical values at the positions of three dividing points are the quantiles.
Introduction of the prior art:
referring to fig. 3, after a user enters a queue of a specific service type for queuing, a service server obtains the length a of the queue according to the queue where the user is located, then sets the total queuing time of the queue of the type as t according to a preset queue single-user queuing time b distinguished according to the queue type, obtains a result through t ═ a × b, and finally returns the result to the user to let the user know the queuing time. The method has problems that: the time required by the user queuing is directly calculated through the preset queue single-user service time, the process is simple, and the cost is low. However, the time obtained by using the method is too single, the time is preset, the time cannot be changed any more, the queuing time cannot be obtained more accurately and more truly, and the reference is not large, so that the user experience is poor, the current queuing state cannot be truly reflected, and even the user loss is directly caused, and therefore improvement is needed.
According to the scheme, on the premise that the queuing prediction time is displayed for the user, the service server continuously collects time samples according to the real-time state change of different types of queues in the background, regularly calculates sample data through a statistical algorithm to obtain the average queuing time of the user according with the current queue state, and finally obtains a final result according to the number of input queued people, so that the queuing prediction time can be more real and accurate for the user.
A first aspect.
Referring to fig. 1, an embodiment of the present invention provides a method for predicting a queuing time, including:
and S10, receiving a queuing request of a user, and obtaining a target queue according to the queuing request.
It will be appreciated that when a user enters a program, such as a hand game or an end game, the current access is too large, and therefore a queue is required to ensure that each user operates normally. And after the user clicks to enter, a queuing request is initiated, and after the service server receives the queuing request sent by the user, the service server judges to obtain a target queue according to the queuing request.
In a specific implementation manner of the embodiment of the present invention, after obtaining the target queue according to the queuing request, the method further includes:
and putting the users into the tail of the target queue, and queuing in sequence.
It will be appreciated that after a user initiates a queuing request, it is automatically queued to the rear of the currently queued users of the target queue, i.e., the sequential ranking.
And S20, acquiring the current queuing number of people of the target queue and calculating the average queuing time of the target queue.
It should be noted that the current number of people in the target queue does not include the user who initiated the queuing request, but refers to the number of people in the target queue that have been queued.
In a specific implementation manner of the embodiment of the present invention, the calculating an average queuing time of the target queue includes:
and recording the user as the Nth user of the target queue, and acquiring the enqueue time of the Nth user.
The enqueue time of each of the M users arranged before the Nth user is acquired.
A first queue set is formed by the enqueue time of each user and the enqueue time of the Nth user; and N > M is satisfied.
And carrying out data cleaning on the first queue set according to a quartile method to obtain a second queue set.
And calculating the average value of all the numerical values in the second queue set, and taking the average value as the average queuing time.
It should be noted that the enqueue time of the user is the time when the user initiates the queuing request.
It is understood that the specific step of calculating the average queuing time of the target queue includes:
1. recording the queuing users of the target queue as: the 1 st user, the 2 nd user, the 3 rd user (N-M +1) th user, (N-M +2) th user, (N-M +3) th user (N-1) th user, and the Nth user;
2. taking M users and an Nth user which are arranged before the Nth user as a user sample data set, wherein the total number of the users in the user sample data set is M + 1;
3. acquiring the enqueue time of each user in the user sample data set, and forming a first queue set by the enqueue time of each user in the user sample data set, and recording the first queue set as L1＝{Ti(N-M+1)、Ti(N-M+2)、Ti(N-M+3)···Ti(N-1)、TiN}；
4. Set L to the first queue1Performing data cleaning to obtain a second queue set L without abnormal values2；
5. Computing a second set of queues L2And averaging all the values, and taking the average value obtained by calculation as the average queuing time.
In a preferred method of this embodiment, the performing data cleaning on the first queue set according to a quartile method to obtain a second queue set includes:
and performing ascending arrangement on all the numerical values in the first queue set to obtain a third queue set.
And screening the numerical value of the fourth digit and the numerical value of the fourth digit in the third queue set according to a quartile method, recording the numerical value of the fourth digit as the minimum value of a data cleaning range, and recording the numerical value of the fourth digit as the maximum value of the data cleaning range.
And taking the data meeting the data cleaning range in the third queue set as the data in the second queue set to obtain the second queue set.
It will be appreciated that the first set of queues L is given by the quartile method1Performing data cleaning to obtain a second queue set L without abnormal values2The method comprises the following specific steps:
1. set the first queue L1All the numerical values in the queue are rearranged according to an ascending sorting mode to obtain a third queue set L3；
2. Selecting a third set of queues L3The numerical value of the fourth digit and the numerical value of the fourth digit are used as interval end point values for eliminating abnormal data;
3. set the third queue L3Eliminating the numerical value of the interval which does not satisfy the abnormal data elimination, and forming a second queue set L by the numerical value of the interval which satisfies the abnormal data elimination2。
In a preferred method of this embodiment, before taking the average value as the average queuing time length, the method further includes:
calculating the standard deviation of all the values in the second queue set;
and adjusting the average value according to the standard deviation.
It will be appreciated that the average of all values in the second set of queues may be adjusted according to the standard deviation of all values in the second set of queues.
And S30, calculating to obtain a predicted value of the queuing time length of the user according to the current queuing number and the average queuing time length, and returning the predicted value of the queuing time length to the user.
It is understood that the predicted value of the queuing time of the user can be calculated in the above manner. It should be noted that the calculation result only represents the predicted data, and the actual queuing time is subject to the actual criterion.
The invention can provide a dynamically-changed queuing prediction time for a user, can continuously adjust according to the speed of the queue processing service, has more referential significance compared with fixed time or no notification of the queuing time for the user, avoids the trouble of manually setting the prediction time, and improves the accuracy of the queuing prediction time.
In another embodiment of the present invention, an embodiment of the present invention provides a method for predicting a queuing time, including:
1. and (4) queuing the user request, and acquiring the queue type of the user request.
2. And acquiring the number of people currently queued in the queue according to the obtained queue type.
3. And acquiring the current 'queue average queuing time' which is already calculated by the service server according to the queue type.
4. And finally, multiplying the current number of people in the queue by the result obtained in the step 3 to obtain the final predicted time.
Wherein:
step 1: when a user requests to queue, a corresponding queue is obtained according to the queuing type requested by the user, the user is placed at the tail of the queue, if only one user is currently requested in the queue at the moment, the timestamp millisecond at the moment is stored as the last dequeuing time of the queue, and otherwise, the queuing time interval is obtained inaccurately when the user dequeues.
Step 2: and obtaining the number of people currently queued in the queue according to the queue obtained in the step 1.
As shown in fig. 2, before obtaining the current queue average queuing time in step 3, the method further includes the following calculation steps:
3.1 when a user is dequeued in a certain type of queue, recording the time stamp millisecond at the time as t1Then, the timestamp millisecond t recorded by the queue when the queue was dequeued last time or when the first user entered the queue (mentioned in step 1) is obtained2Through tq＝t1-t2Calculating to obtain a dequeue time interval tqAnd will t1And the queue is saved as the last dequeue time of the queue.
3.2 dequeue time interval t calculated in step 3.1qAs sample data, storing in the sample data set of "dequeue time interval" of corresponding queue, wherein the sampleThe data set can be set with a maximum number N, and when the number of the updated sample data sets is larger than N, the oldest sample data is removed.
3.3 the service server sets a timing time T (such as 1 minute), and every T time, the set sample data sets of each type queue in step 3.2 are obtained and calculated respectively.
3.4 for each sample set acquired in step 3.3, if the set samples are too few and less than the set value, directly calculating the average value as the "queue average queuing time". Otherwise, sorting the sets from small to large according to the size of the dequeue time interval to obtain a new set L, and calculating the quartile value Q by using a quartile method1And the value Q of four three bits3。
3.5Q by step 3.41And Q3Some outliers are rejected. The acceptable minimum value of the sample data is set as:
min＝Q1-K×(Q3-Q1)；
the acceptable maximum value of sample data is:
min＝Q3+K×(Q3-Q1)；
the K value can be adjusted according to actual conditions. Eliminating the values which are not between min and max in the set l to obtain a final set l2。
3.6 solving the set l obtained in step 3.52Is denoted as R, optionally according to the set l2The standard deviation is adjusted to adjust the value of R. And finally, recording the R value and the corresponding queue type, wherein the R value is the average queuing time of the queue.
And 4, step 4: and (3) recording the current number of people who queue according to the queue obtained in the step 2 as X, obtaining the 'average queue time' of the corresponding queue finally obtained in the step 3 as R, and obtaining the total queue predicted time T of the user through T ═ X R.
In the cloud game platform, a user needs to play a game and needs to distribute a remote machine to run game playing, however, the platform machines are limited, and under the condition that the user quantity is too large, a sufficient number of machines are not distributed to the hands of each user, so that the user needs to queue for the available machines to appear, and at the moment, the user can know how long the machines need to be distributed to play the game through the queuing time prediction algorithm of the scheme.
The scheme can provide a dynamically-changed queuing prediction time for a user, can continuously adjust according to the speed of the queue processing service, has more referential significance compared with fixed time or no notification of the queuing time for the user, and avoids the trouble of manually setting the prediction time.
A second aspect.
Referring to fig. 4, an embodiment of the invention provides a system for predicting queuing time, including:
a queuing request processing module 10, configured to receive a queuing request of a user, and obtain a target queue according to the queuing request.
In a specific implementation manner of the embodiment of the present invention, the queuing request processing module 10 is further configured to:
and putting the users into the tail of the target queue, and queuing in sequence.
And the queuing data processing module 20 is configured to obtain the current number of people in the target queue and calculate an average queuing time of the target queue.
In a specific implementation manner of the embodiment of the present invention, the queuing data processing module 20 is further configured to:
recording a user as an Nth user of the target queue, and acquiring the enqueue time of the Nth user;
acquiring the enqueue time of each user of M users arranged before the Nth user;
a first queue set is formed by the enqueue time of each user and the enqueue time of the Nth user; and N > M is satisfied;
performing data cleaning on the first queue set according to a quartile method to obtain a second queue set;
and calculating the average value of all the numerical values in the second queue set, and taking the average value as the average queuing time.
In another specific implementation manner of the embodiment of the present invention, the queuing data processing module 20 is further configured to:
all the numerical values in the first queue set are arranged in an ascending order to obtain a third queue set;
screening a numerical value of a fourth digit and a numerical value of a fourth digit in a third queue set according to a quartile method, recording the numerical value of the fourth digit as a minimum value of a data cleaning range, and recording the numerical value of the fourth digit as a maximum value of the data cleaning range;
and taking the data meeting the data cleaning range in the third queue set as the data in the second queue set to obtain the second queue set.
In another specific implementation manner of the embodiment of the present invention, the queuing data processing module 20 is further configured to:
calculating the standard deviation of all the values in the second queue set;
and adjusting the average value according to the standard deviation.
And the queuing time length prediction module 30 is used for calculating a queuing time length prediction value of the user according to the current queuing number and the average queuing time length, and returning the queuing time length prediction value to the user.
The invention can provide a dynamically-changed queuing prediction time for a user, can continuously adjust according to the speed of the queue processing service, has more referential significance compared with fixed time or no notification of the queuing time for the user, avoids the trouble of manually setting the prediction time, and improves the accuracy of the queuing prediction time.
In a third aspect.
The present invention provides an electronic device, including:
a processor, a memory, and a bus;
the bus is used for connecting the processor and the memory;
the memory is used for storing operation instructions;
the processor is configured to call the operation instruction, and the executable instruction enables the processor to execute an operation corresponding to the method for predicting queuing time as shown in the first aspect of the present application.
In an alternative embodiment, an electronic device is provided, as shown in fig. 5, the electronic device 5000 shown in fig. 5 includes: a processor 5001 and a memory 5003. The processor 5001 and the memory 5003 are coupled, such as via a bus 5002. Optionally, the electronic device 5000 may also include a transceiver 5004. It should be noted that the transceiver 5004 is not limited to one in practical application, and the structure of the electronic device 5000 is not limited to the embodiment of the present application.
The processor 5001 may be a CPU, general purpose processor, DSP, ASIC, FPGA or other programmable logic device, transistor logic device, hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor 5001 may also be a combination of processors implementing computing functionality, e.g., a combination comprising one or more microprocessors, a combination of DSPs and microprocessors, or the like.
Bus 5002 can include a path that conveys information between the aforementioned components. The bus 5002 may be a PCI bus or EISA bus, etc. The bus 5002 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown in FIG. 5, but this is not intended to represent only one bus or type of bus.
The memory 5003 may be, but is not limited to, a ROM or other type of static storage device that can store static information and instructions, a RAM or other type of dynamic storage device that can store information and instructions, an EEPROM, a CD-ROM or other optical disk storage, optical disk storage (including compact disk, laser disk, optical disk, digital versatile disk, blu-ray disk, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.
The memory 5003 is used for storing application program codes for executing the present solution, and the execution is controlled by the processor 5001. The processor 5001 is configured to execute application program code stored in the memory 5003 to implement the teachings of any of the foregoing method embodiments.
Among them, electronic devices include but are not limited to: mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and the like, and fixed terminals such as digital TVs, desktop computers, and the like.
A fourth aspect.
The present invention provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements a method for predicting queuing time as set forth in the first aspect of the present application.
Yet another embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored, which, when run on a computer, enables the computer to perform the corresponding content in the aforementioned method embodiments.

Claims (10)

1. A method for predicting queuing time, comprising:
receiving a queuing request of a user, and obtaining a target queue according to the queuing request;
acquiring the current queuing number of people of the target queue and calculating the average queuing time of the target queue;
and calculating to obtain a predicted value of the queuing time of the user according to the current queuing number and the average queuing time, and returning the predicted value of the queuing time to the user.
2. A method for predicting queuing time as claimed in claim 1, wherein said calculating the average queuing time of said target queue comprises:
recording a user as an Nth user of the target queue, and acquiring the enqueue time of the Nth user;
acquiring the enqueue time of each user of M users arranged before the Nth user;
a first queue set is formed by the enqueue time of each user and the enqueue time of the Nth user; and N > M is satisfied;
performing data cleaning on the first queue set according to a quartile method to obtain a second queue set;
and calculating the average value of all the numerical values in the second queue set, and taking the average value as the average queuing time.
3. The method for predicting queuing time according to claim 2, wherein the performing data washing on the first queue set according to a quartile method to obtain a second queue set comprises:
all the numerical values in the first queue set are arranged in an ascending order to obtain a third queue set;
screening a numerical value of a fourth digit and a numerical value of a fourth digit in a third queue set according to a quartile method, recording the numerical value of the fourth digit as a minimum value of a data cleaning range, and recording the numerical value of the fourth digit as a maximum value of the data cleaning range;
and taking the data meeting the data cleaning range in the third queue set as the data in the second queue set to obtain the second queue set.
4. A method for predicting queuing time as claimed in claim 2, wherein said taking the average value as the average queuing time further comprises:
calculating the standard deviation of all the values in the second queue set;
and adjusting the average value according to the standard deviation.
5. The method for predicting queuing time according to claim 1, wherein after obtaining the target queue according to the queuing request, the method further comprises:
and putting the users into the tail of the target queue, and queuing in sequence.
6. A queuing time prediction system comprising:
the queuing request processing module is used for receiving a queuing request of a user and obtaining a target queue according to the queuing request;
the queuing data processing module is used for acquiring the current queuing number of people of the target queue and calculating the average queuing time of the target queue;
and the queuing time length prediction module is used for calculating a queuing time length prediction value of the user according to the current queuing number and the average queuing time length and returning the queuing time length prediction value to the user.
7. A queuing time prediction system as claimed in claim 6 wherein the queuing data processing module is further adapted to:
recording a user as an Nth user of the target queue, and acquiring the enqueue time of the Nth user;
acquiring the enqueue time of each user of M users arranged before the Nth user;
a first queue set is formed by the enqueue time of each user and the enqueue time of the Nth user; and N > M is satisfied;
performing data cleaning on the first queue set according to a quartile method to obtain a second queue set;
and calculating the average value of all the numerical values in the second queue set, and taking the average value as the average queuing time.
8. A queuing time prediction system as claimed in claim 7 wherein the queuing data processing module is further configured to:
all the numerical values in the first queue set are arranged in an ascending order to obtain a third queue set;
screening a numerical value of a fourth digit and a numerical value of a fourth digit in a third queue set according to a quartile method, recording the numerical value of the fourth digit as a minimum value of a data cleaning range, and recording the numerical value of the fourth digit as a maximum value of the data cleaning range;
and taking the data meeting the data cleaning range in the third queue set as the data in the second queue set to obtain the second queue set.
9. A queuing time prediction system as claimed in claim 7 wherein the queuing data processing module is further configured to:
calculating the standard deviation of all the values in the second queue set;
and adjusting the average value according to the standard deviation.
10. A queuing time prediction system as claimed in claim 6 wherein the queuing request processing module is further configured to:
and putting the users into the tail of the target queue, and queuing in sequence.
CN202110834752.8A 2021-07-23 2021-07-23 Method and system for predicting queuing time Withdrawn CN113642780A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110834752.8A CN113642780A (en) 2021-07-23 2021-07-23 Method and system for predicting queuing time

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110834752.8A CN113642780A (en) 2021-07-23 2021-07-23 Method and system for predicting queuing time

Publications (1)

Publication Number Publication Date
CN113642780A true CN113642780A (en) 2021-11-12

Family

ID=78418195

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110834752.8A Withdrawn CN113642780A (en) 2021-07-23 2021-07-23 Method and system for predicting queuing time

Country Status (1)

Country Link
CN (1) CN113642780A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115695317A (en) * 2022-12-23 2023-02-03 海马云（天津）信息技术有限公司 Queuing and dequeuing method and device of access request, electronic equipment and storage medium

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115695317A (en) * 2022-12-23 2023-02-03 海马云（天津）信息技术有限公司 Queuing and dequeuing method and device of access request, electronic equipment and storage medium

Similar Documents

Publication Publication Date Title
US20200264942A1 (en) Message management method and device, and storage medium
CN108762907B (en) Task processing method and system based on multiple clients
US8190743B2 (en) Most eligible server in a common work queue environment
CN110808922A (en) Message processing method and device, storage medium and electronic equipment
CN113395572B (en) Video processing method and device, storage medium and electronic equipment
CN111459783B (en) Application program optimization method and device, electronic equipment and storage medium
CN112492372B (en) Comment message display method and device, electronic equipment, system and storage medium
CN113642780A (en) Method and system for predicting queuing time
CN114490082A (en) Graphics processor resource management method, device, equipment and storage medium
CN110233840B (en) Service processing method, device, equipment and storage medium
CN111135586A (en) Game matching method, game matching device, storage medium and electronic device
CN111026532B (en) Message queue management method for voice data
CN113144620A (en) Detection method, device, platform, readable medium and equipment for frame synchronization game
CN109729061A (en) Message treatment method, device, equipment and readable storage medium storing program for executing
CN115391053B (en) Online service method and device based on CPU and GPU hybrid calculation
CN110460987B (en) Card writing method, device, server and storage medium
CN109240995B (en) Method and device for counting time delay of operation word
EP2700023B1 (en) Reducing latency for served applications by anticipatory preprocessing
CN115086194A (en) Data transmission method for cloud application, computing equipment and computer storage medium
CN113176909A (en) Method and device for determining fluency of terminal, electronic equipment and storage medium
Scharf On the response time of the large-scale composite Web services
CN113660352A (en) Server scheduling method and device, electronic equipment and readable storage medium
CN110119364B (en) Method and system for input/output batch submission
CN113457142A (en) Method and device for determining cloud equipment server in cloud game and business server
CN112685156A (en) Task execution method and device, electronic equipment and computer readable medium

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
WW01 Invention patent application withdrawn after publication
WW01 Invention patent application withdrawn after publication

Application publication date: 20211112