EP3584702B1 - Procédé et dispositif de traitement de demande de ressources - Google Patents

Procédé et dispositif de traitement de demande de ressources Download PDF

Info

Publication number
EP3584702B1
EP3584702B1 EP18787656.0A EP18787656A EP3584702B1 EP 3584702 B1 EP3584702 B1 EP 3584702B1 EP 18787656 A EP18787656 A EP 18787656A EP 3584702 B1 EP3584702 B1 EP 3584702B1
Authority
EP
European Patent Office
Prior art keywords
resource request
density
quota
preset
virtual objects
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP18787656.0A
Other languages
German (de)
English (en)
Other versions
EP3584702A1 (fr
EP3584702A4 (fr
Inventor
Haitao Jiang
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.)
Tencent Technology Shenzhen Co Ltd
Original Assignee
Tencent Technology Shenzhen 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 Tencent Technology Shenzhen Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Publication of EP3584702A1 publication Critical patent/EP3584702A1/fr
Publication of EP3584702A4 publication Critical patent/EP3584702A4/fr
Application granted granted Critical
Publication of EP3584702B1 publication Critical patent/EP3584702B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/30—Interconnection arrangements between game servers and game devices; Interconnection arrangements between game devices; Interconnection arrangements between game servers
    • A63F13/35—Details of game servers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/505—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/30—Interconnection arrangements between game servers and game devices; Interconnection arrangements between game devices; Interconnection arrangements between game servers
    • A63F13/35—Details of game servers
    • A63F13/358—Adapting the game course according to the network or server load, e.g. for reducing latency due to different connection speeds between clients
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/80—Special adaptations for executing a specific game genre or game mode
    • A63F13/822—Strategy games; Role-playing games
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061—Partitioning or combining of resources
    • G06F9/5077—Logical partitioning of resources; Management or configuration of virtualized resources
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/50—Indexing scheme relating to G06F9/50
    • G06F2209/5013—Request control
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/50—Indexing scheme relating to G06F9/50
    • G06F2209/5022—Workload threshold
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/50—Indexing scheme relating to G06F9/50
    • G06F2209/504—Resource capping

Definitions

  • Embodiments of this application relates to the field of games, and in particular, to a method, an apparatus and a computer-readable storage medium for processing a resource request.
  • a Massive Multiplayer Online Role-Playing Game refers to a game in which a player plays a role in a virtual world running in a server and can create a user group to participate in large-scale user group interactive activities.
  • a next generation strong-interaction action online game is an mmorpg based on a powerful computing processing capability and network transmission capability of a modem computing system, and can provide players with high-quality combat performance, fast-paced combat experience, complex combat details, and a highfrequency interaction function between players during a combat.
  • Computing system performance overheads and a network traffic pressure caused by casting of a single combat spell in such a game are multiple orders of magnitude higher than in a typical conventional mmorpg.
  • CN 103 873 457 A concerns a method and equipment for balancing loads among game servers.
  • the method comprises the step of counting the number of players who currently play the game in at least one scene of at least one game server.
  • the method also comprises the step that when the number exceeds the preset threshold value, establishing the game scene same as the at least one game scene on at least the other one game server.
  • the method further comprises the step of transferring the subsequent players who plan to enter the at least one game scene for playing the game to the established game scene.
  • access virtual objects are classified into a plurality of density grades according to a density of interaction virtual objects in a current visual range of each virtual object; a resource request quota is allocated to each density grade; when a resource request sent by a virtual object in a density grade is received within preset duration, the received resource request is processed if it is determined that a resource request quota corresponding to the density grade is greater than a preset quota threshold, and a preset value is subtracted from the resource request quota corresponding to the density grade; and the resource request is rejected if it is determined that the resource request quota corresponding to the density grade is less than or equal to the preset quota threshold.
  • virtual objects can be classified into density grades, and a resource request quota is allocated to each density grade; when the resource request quota is less than or equal to a preset quota threshold, a central processing unit (CPU) rejects processing resource requests sent by virtual objects in the density grade, so that processing of the CPU is avoided from being overloaded, thereby alleviating a stalling problem caused by an insufficient computing capability of a server.
  • CPU central processing unit
  • FIG. 1 Spell casting logic of a typical next generation strong-interaction action online game is shown in FIG. 1 .
  • a player casts a spell A at a time point T0.
  • the spell has 15 stages including a stage 1 to a stage 15, and hits 60 targets including a target t1 to a target 60.
  • the buff is interactive data with time-effectiveness on an active entity. The buff changes as time in a virtual world goes by, and interacts logically with virtual world objects other than the active entity. When there is a buff A on a spell caster, the buff causes an effect A on the spell caster.
  • the effect A has the following logic: there is such a buff B that, on a target hit by a stage X of the spell A, if execution of corresponding logic of a stage B of the buff B is completed before a time point T1, logic of stages of the spell A after the stage X is replaced with the logic of the spell B.
  • a computing task of spell casting of a single player is a state machine that is strongly correlated to a timeline and that has a plurality of stages. Computing of each stage needs to depend on a computing result of a previous stage. Therefore, it is difficult to decompose computing dependency. Because there is strong data dependency between players, it is difficult to decompose the data dependency. Therefore, it is difficult to perform parallel processing.
  • the avalanche effect herein means that, when load of a server reaches a physical limit, processing of a failure event inside the server produces extra processing pressure, and at the same time, a client starts to execute a policy of post-failure re-requesting and therefore generates an extra processing request, resulting in a dramatic decline in an actual processing capability of the server. Consequently, a stalling problem is caused.
  • Performance of a physical server is always limited in a given period of time.
  • players have unlimited demands on the number of players in the same-screen match and improvement in combat quality.
  • due to features of a computing model of an mmorpg multi-player same-screen match application scenario it is difficult to improve the overall processing capability linearly by expanding the number of computing elements. Therefore, in fact, the server cannot ensure lossless completion of computing processing operations for all combat requests in real time.
  • a product requirement of the mmorpg multi-player same-screen match is to enable players to experience as high combat quality as possible, rather than enabling the server to actually process as many combat effects as possible successfully. Due to the presence of psychological features such as a biological response time of a player and selective neglect of information in a particularly complex scenario by a human body, it is possible to significantly reduce the computing load of the server while ensuring the actual experience of players.
  • FIG. 2 is a flowchart of a method for processing a resource request according to an embodiment of this application.
  • each player has a corresponding visual range.
  • the visual range can be interpreted as a current screen of the player, that is, an area where the player is located on an entire map provided by a game application program.
  • a typical behavior mode of the player is shown in FIG. 3 .
  • the player obtains a corresponding feedback for each attack launched.
  • the player is extremely sensitive to real-time combat feedbacks and the timeline, and uplink requests are at a relatively low frequency and strategic.
  • the player is extremely sensitive each time an attack decision is made, until the attack hits a target object and the target object is under attack. The player pays close attention to the feedback corresponding to each attack.
  • the player in the high density area is actually insensitive to precisely logical real-time combat feedbacks and the timeline. Moreover, because the player sends repeated requests at a high frequency, the player cannot determine whether a single request is responded to in time. Therefore, the player does not pay attention to the feedback for each attack.
  • the virtual object in this embodiment of this application refers to an object virtualized in a game application program, and is an active entity in a game virtual world.
  • Each virtual object corresponds to a registered user in the game application program, that is, corresponds to a player.
  • a specific process of classifying access virtual objects into a plurality of density grades may be as follows: A density of interaction virtual objects in a current visual range of each virtual object is obtained, and virtual objects, whose densities belong to the same numerical range, are classified into the same density grade.
  • a location of the virtual object on a map provided by the game application program is obtained, and a visual range of the virtual object is obtained according to the location.
  • the visual range of the virtual object is an area that the player can see on a current screen.
  • a total number of interaction virtual objects in the area is calculated.
  • the interaction virtual objects herein are other virtual objects in the visual range of the virtual object except the virtual object. That is, the number of enemies in the current screen of the player corresponding to the virtual object is calculated.
  • the virtual object may generate a broadcasting event to obtain the number of interaction virtual objects nearby.
  • the numerical range may be a preset numerical range, or the numerical range may be set in real time according to a total number of current online virtual objects.
  • the total number of interaction virtual objects in the current visual range of the virtual object 1 is 10
  • the total number of interaction virtual objects in the current visual range of the virtual object 2 is 5
  • the total number of interaction virtual objects in the current visual range of the virtual object 3 is 200
  • the total number of interaction virtual objects in the current visual range of the virtual object 4 is 30, and the total number of interaction virtual objects in the current visual range of the virtual object 5 is 60.
  • the virtual object 1 and the virtual object 2 belong to the numerical range [1-20] and are classified into the density grade 1
  • the virtual object 4 and the virtual object 5 belong to the numerical range [21-100] and are classified into the density grade 2
  • the virtual object 3 belongs to the numerical range [101-co] and is classified into the density grade 3.
  • Online virtual objects in the game application program are classified into M density grades, and a virtual object in a density grade m is recorded as ACTORm.
  • a virtual object in a density grade m is recorded as ACTORm.
  • virtual objects in the density grade 1, the density grade 2, the density grade 3, and the density grade 4 are recorded as ACTORm1, ACTORm2, ACTORm3, and ACTORm4 respectively.
  • the density grade into which each virtual object is classified changes in real time with a density degree of interaction virtual objects in the area where the virtual object is located.
  • a resource request in this embodiment of this application may be a game spell request sent by a virtual object to a server during the game.
  • the virtual object sends the game spell request to the server, so as to release a game spell.
  • the game spell refers to a behavior mode of the virtual object in the virtual world of the online game.
  • the virtual object may cast a spell to generate a series of effects on itself and a target.
  • the resource request in this embodiment of this application may also be another request such as a game buff request sent by the virtual object to the server during the game, for example, using props or obtaining a buff displayed on the map.
  • a game buff request sent by the virtual object to the server during the game, for example, using props or obtaining a buff displayed on the map.
  • an initial resource request quota is allocated to each density grade.
  • the initial resource request quota corresponding to each density grade is the number of resource requests that are sent by virtual objects in the density grade and that are allowed to be processed within first preset duration t. That is, the virtual objects in the density grade share one resource request quota within the first preset duration t.
  • the same initial resource request quota may be allocated to each density grade.
  • values of N1, N2, N3, and N4 may be the same.
  • the initial resource request quota is specifically allocated according to current load of a CPU of the server (that is, usage of the CPU).
  • the value of the resource request quota is negatively correlated to the current load of the CPU.
  • the resource request quota decreases gradually.
  • a low resource request quota is allocated to each density grade; when the current load of the CPU is low, a high resource request quota is allocated to each density grade.
  • the load of the CPU increases, the overall performance overheads are decreased more significantly.
  • the load of the CPU is extremely high and exceeds a preset overload threshold, for example, when the usage of the CPU exceeds 90%, the resource request quota is decreased significantly, so as to prevent continuous deterioration of subsequent experience caused by an avalanche.
  • N1, N2, N3, and N4 initially allocated each time have the same value.
  • N1, N2, N3, and N4 are each configured to be 500; when the usage of the CPU is 31% to 60%, N1, N2, N3, and N4 are each configured to be 400; when the usage of the CPU is 61% to 90%, N1, N2, N3, and N4 are each configured to be 300; and when the usage of the CPU is 91% to 100%, N1, N2, N3, and N4 are each configured to be 100.
  • a preset value is correspondingly subtracted from the resource request quota corresponding to the density grade.
  • the preset value is 1.
  • the first density grade in this embodiment of this application is one of a plurality of the density grades obtained through classification.
  • step 204 If the resource request quota corresponding to the first density grade is greater than the preset quota threshold, step 204 is performed; if the resource request quota corresponding to the first density grade is less than the preset quota threshold, step 205 is performed.
  • the received resource request sent by the virtual character in the first density grade is processed, and a preset value, such as 1, is subtracted from the resource request quota corresponding to the density grade.
  • a preset value is subtracted from the resource request quota corresponding to the first density grade, until the resource request quota corresponding to the first density grade is less than or equal to the preset quota threshold, which indicates that the resource request quota corresponding to the density grade is used up or reaches a minimum value, and no more resource requests can be processed. In this case, a resource request sent by a virtual character in the first density grade is rejected.
  • the following operation may be performed directly:
  • virtual objects can be classified into density grades, and a resource request quota is allocated to each density grade; when the resource request quota is less than or equal to a preset quota threshold, a CPU rejects processing a resource request sent by a virtual object in the density grade, so that processing of the CPU is avoided from being overloaded, thereby alleviating a stalling problem caused by an insufficient computing capability of a server.
  • a resource request quota of virtual characters in the first density grade is less than the preset quota threshold, a resource request quota of a density grade higher than the first density grade may be used.
  • the resource request quota corresponding to the first density grade is greater than the preset quota threshold; if the resource request quota corresponding to the first density grade is not greater than the preset quota threshold, that is, if the resource request quota corresponding to the first density grade is less than or equal to the preset quota threshold, it is further determined whether resource request quotas corresponding to other density grades higher than the first density grade are all less than the preset quota threshold; and the received resource request is rejected only when the resource request quotas are all less than the preset quota threshold.
  • a density grade (a second density grade) higher than the first density grade still has an available resource request quota, that is, the resource request quota corresponding to the second density grade is greater than the preset quota threshold, the resource request is processed by using the resource request quota of the second density grade, and a preset value is subtracted from the resource request quota corresponding to the second density grade.
  • the resource request is rejected.
  • a resource request quota of a density grade that is one grade higher than the current density grade is first obtained. If there is an available resource request quota (that is, the resource request quota corresponding to the density grade is greater than the preset quota threshold), the available resource request quota is used. If there is no available resource request quota, a resource request quota of a density grade that is two grades higher than the current density grade is further obtained. If there is an available resource request quota, the available resource request quota is used. If there is no available resource request quota, it is further determined whether a next higher density grade has an available resource request quota.
  • ACTORm1 may use resource request quotas of ACTORm2, ACTORm3, and ACTORm4; ACTORm2 may use resource request quotas of ACTORm3 and ACTORm4; ACTORm3 may use resource request quota of ACTORm4.
  • the resource request is a spell request
  • a preset value subtracted is 1 each time a spell request is processed.
  • N1 corresponding to ACTORm1 is greater than 0
  • the spell request is processed, and 1 is subtracted from N1, until N1 is equal to 0.
  • N2 corresponding to ACTORm2 is greater than 0.
  • N2 is greater than 1
  • the received spell request of the player in the ACTORm 1 is processed.
  • N3 corresponding to ACTORm3 is greater than 0.
  • the processing is performed sequentially. When N2, N3, and N4 corresponding to ACTORm2, ACTORm3, and ACTORm4 are all equal to 0, the spell request is rejected.
  • a resource request quota is reallocated to each density grade.
  • the first preset duration t can be adjusted according to a computing capability of the server and a spell frequency design of the game application program.
  • the first preset duration t should be as short as possible without causing more extra performance overheads.
  • a player with a high level of participation also has a relatively high keying frequency during a large-scale group combat.
  • a density of attack lines is relatively high.
  • the game spell includes a combo spell.
  • the combo spell refers to a behavior mode in which a virtual object continuously casts a plurality of spells in coordination in an action game, which can bring about a fast-paced beautiful game experience.
  • a timeout protection method is added in this embodiment of this application: when it is detected that all resource requests sent by a target virtual object within second preset duration are rejected, upon reception of a next resource request sent by the target virtual object, processing the resource request sent by the target virtual obj ect.
  • the resource request is a spell request
  • a spell request cast quota is directly allocated to the player, so that the experience of the player is not affected.
  • the second preset duration T is set to be less than preset duration of an interval at which two continuous resource requests are allowed to be sent.
  • the preset duration of an interval at which two continuous resource requests are allowed to be sent is an interval time for casting continuous spells commonly used in games, so that the player can cast a combo spell, thereby ensuring a continuous basic game experience.
  • the value of the second preset duration T can be greatly improved instantly, to prevent the occurrence of an avalanche effect, and an effort is made to enable the server to recover a low-load state in a short period time, thereby reducing a time in which the experience of a player is affected and avoiding the occurrence of long-time stalling.
  • players in a low density grade can preempt a spell request quota of players in a high density grade, so that spell casting of players highly sensitive to experience is prioritized adaptively, thereby greatly improving the overall game experience of a player group.
  • spell quotas can be allocated dynamically at a high frequency by improving a refreshing frequency of the first preset duration t, so that experience of players with a high level of participation can be prioritized adaptively.
  • Players with a high keying frequency and a high level of participation are more likely to preempt a spell request quota, thereby prioritizing the experience of the players with a high level of participation.
  • a spell request quota can be directly allocated to a player who fails to a spell request quota in a relatively long time, so that the basic game experience of the player can be ensured.
  • the method for processing a resource request in an embodiment of this application is described above.
  • the following describes an apparatus for processing a resource request in an embodiment of this application from the perspective of functional modules.
  • the apparatus for processing a resource request in this embodiment of this application specifically implements the functions in the method embodiment described in FIG. 2 to FIG. 6 .
  • the functions may be implemented by hardware, or implemented by hardware executing a corresponding software program.
  • the hardware and software include one or more unit modules corresponding to the foregoing functions.
  • the unit module may be software and/or hardware.
  • the apparatus for processing a resource request in this embodiment of this application includes one or more processors, and one or more memories for storing program units.
  • the program units are executed by the processor, and the program units may include a density grade division unit, a quota allocation unit, a resource request receiving unit, and a resource request processing unit.
  • the apparatus for processing a resource request in this embodiment of this application includes:
  • the resource request processing unit 704 may be further configured to process, if it is determined that the resource request quota corresponding to the first density grade is greater than the preset quota threshold, a resource request when the receiving unit receives, within the first preset duration, the resource request sent by a virtual object in the first density grade, and subtract a preset value from the resource request quota corresponding to the first density grade; and reject the resource request if it is determined that the resource request quota corresponding to the first density grade is less than or equal to the preset quota threshold.
  • the resource request processing unit 704 is further configured to determine whether resource request quotas corresponding to other density grades higher than the first density grade are all less than the preset quota threshold when the resource request quota corresponding to the first density grade is less than or equal to the preset quota threshold, and reject the resource request if the resource request quotas corresponding to other density grades are all less than the preset quota threshold.
  • the request processing unit 704 is further configured to reject the resource request when the resource request quota corresponding to the first density grade is less than or equal to the preset quota threshold and it is determined that resource request quotas corresponding to other density grades higher than the first density grade are all less than the preset quota threshold.
  • the resource request processing unit 704 is further configured to process the resource request when a resource request quota corresponding to a second density grade higher than the first density grade is greater than the preset quota threshold, and subtract the preset value from the resource request quota corresponding to the second density grade.
  • the quota allocation unit 702 is specifically configured to allocate a resource request quota to each density grade according to current load of a CPU, a value of the resource request quota being negatively correlated to a value of the current load of the CPU.
  • the quota allocation unit 702 is further configured to reallocate a resource request quota to each density grade after the first preset duration elapses.
  • the resource request processing unit 704 is further configured to process, when it is detected that all resource requests sent by a target virtual object within second preset duration are rejected and a next resource request sent by the target virtual object is received, the next resource request sent by the target virtual object.
  • the apparatus for processing a resource request further includes a setting unit 705, configured to set the second preset duration to be less than preset duration of an interval at which two continuous resource requests are allowed to be sent, when the load of the CPU is less than a preset load threshold.
  • the density grade division unit 701 is specifically configured to obtain the density of interaction virtual objects in the current visual range of each virtual object; and classify virtual objects, whose densities belong to the same numerical range, into the same density grade.
  • functions of the apparatus for processing a resource request shown in FIG. 7 may be executed by a processor in a server.
  • FIG. 8 is a schematic structural diagram of a server according to an embodiment of this application.
  • the server 800 may vary significantly due to different configurations or performance, and may include one or more CPUs 822 (for example, one or more processors) and a memory 830.
  • the memory 830 stores one or more application programs 842, data 844, and one or more operating systems 841.
  • the program stored in the memory 830 may include one or more modules (not marked in the figure), and each module may include a series of instruction operations on the server.
  • the memory 830 stores a game application program.
  • the CPU 822 communicates with the memory 830, and performs, on the server 800, a series of instruction operations in the memory 830.
  • the CPU 822 invokes the game application program stored in the memory 830 to implement the solution described in FIG. 2 to FIG. 6 .
  • the operating system 841 may be, for example, Windows ServerTM, Mac OS XTM, UnixTM, LinuxTM, and FreeBSDTM.
  • the server 800 may further include one or more power supplies 826, one or more wired or wireless network interfaces 850, and one or more input/output interfaces 858.
  • an electronic apparatus for implementing the method for processing a resource request is further provided.
  • the electronic apparatus may include one or more processors 901 (only one processor is shown in FIG. 9 ), a memory 903, and a transmission apparatus 905.
  • the electronic apparatus may further include an input/output device 907.
  • the memory 903 may be configured to store a computer program and modules, for example, program instructions/modules corresponding to the method and apparatus for processing a resource request in the embodiments of this application.
  • the processor 901 is configured to run the software program and modules stored in the memory 903, so as to perform various functional applications and data processing, that is, implement the foregoing data loading method.
  • the memory 903 may include a high speed random access memory, and may also include a non-volatile memory, such as one or more magnetic disk storage apparatuses, a flash memory, or another non-volatile solid-state memory.
  • the memory 903 may further include memories remotely disposed with respect to the processor 901.
  • the remote memories may be connected to a terminal through a network. Examples of the network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communications network, and a combination thereof.
  • the transmission apparatus 905 is configured to receive or send data through a network, and may be further configured to transmit data between the processor and the memory.
  • Specific examples of the network may include a wired network and a wireless network.
  • the transmission apparatus 905 includes a network interface controller (NIC), and may be connected to another network device through a cable, thereby communicating with the Internet or a local area network.
  • the transmission apparatus 905 is a radio frequency (RF) module, and is configured to communicate with the Internet in a wireless manner.
  • RF radio frequency
  • the memory 903 is configured to store an application program.
  • the processor 901 may invoke, through the transmission apparatus 905, the application program stored in the memory 903, so as to perform the following steps: classifying access virtual objects into a plurality of density grades according to a density of interaction virtual objects in a current visual range of each virtual object, a level of the density grade being positively correlated to a value of the density of virtual objects; allocating a resource request quota to each density grade, the resource request quota corresponding to each density grade being the number of resource requests that are sent by virtual objects in the density grade and that are allowed to be processed within first preset duration; when a resource request sent by a virtual object in a first density grade is received within the first preset duration and when it is determined that a resource request quota corresponding to the first density grade is greater than a preset quota threshold, processing the resource request and subtracting a preset value from the resource request quota corresponding to the first density grade; and rejecting the resource request if it is determined that the resource request quota corresponding to the first density grade is less than or equal
  • the processor 901 is further configured to perform the following step: rejecting the resource request if the resource request quota corresponding to the first density grade is less than or equal to the preset quota threshold and it is determined that resource request quotas corresponding to other density grades higher than the first density grade are all less than the preset quota threshold.
  • the processor 901 is further configured to perform the following step: processing the resource request if a resource request quota corresponding to a second density grade higher than the first density grade is greater than the preset quota threshold, and subtracting the preset value from the resource request quota corresponding to the second density grade.
  • the processor 901 is further configured to perform the following step: allocating a resource request quota to each density grade according to current load of a CPU, a value of the resource request quota being negatively correlated to a value of the current load of the CPU.
  • the processor 901 is further configured to perform the following step: reallocating a resource request quota to each density grade after the first preset duration elapses.
  • the processor 901 is further configured to perform the following step: when it is detected that all resource requests sent by a target virtual object within second preset duration are rejected, processing a next resource request sent by the target virtual object upon reception of the next resource request sent by the target virtual object.
  • the processor 901 is further configured to perform the following step: setting the second preset duration to be less than preset duration of an interval at which two continuous resource requests are allowed to be sent, when the load of the CPU is less than a preset load threshold.
  • the processor 901 is further configured to perform the following step: obtaining the density of interaction virtual objects in the current visual range of each virtual object; and classifying virtual objects, whose densities belong to the same numerical range, into the same density grade.
  • the structure shown in FIG. 9 is merely an example, and the electronic apparatus may be a smart phone (such as an Android phone or an iOS phone), a tablet computer, a palmtop computer, a mobile Internet device (Mobile Internet Device), a PAD, and other terminal devices.
  • FIG. 9 does not limit the structure of the electronic apparatus.
  • the electronic apparatus may further include more or fewer components (such as a network interface and a display apparatus) than those shown in FIG. 9 , or may have a configuration different from that shown in FIG. 9 .
  • the disclosed system, apparatus, and method may be implemented in other manners.
  • the described apparatus embodiment is merely exemplary.
  • the unit division is merely a logical function division, and there may be other division manners in actual implementation.
  • a plurality of units or components may be combined or integrated into another system, or some features may be ignored or not performed.
  • the displayed or discussed mutual couplings or direct couplings or communication connections may be implemented through some interfaces.
  • the indirect couplings or communication connections between the apparatuses or units may be implemented in electronic, mechanical, or other forms.
  • the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the objective of the solution of this embodiment.
  • functional units in the embodiments of this application may be integrated into one processing unit, or each of the units may exist alone physically, or two or more units may be integrated into one unit.
  • the integrated units may be implemented in a hardware form, or in a form of a software functional unit.
  • the integrated units When implemented in the form of a software functional unit and sold or used as an independent product, the integrated units may be stored in a computer-readable storage medium.
  • the computer software product is stored in a storage medium, and includes several instructions for instructing a computer device (which may be a personal computer, a server, or a network device) to perform all or some of the steps of the methods described in the embodiments of this application.
  • the foregoing storage medium includes: various media that can store program code, such as a USB flash drive, a removable hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disc.
  • access virtual objects are classified into a plurality of density grades according to a density of interaction virtual objects in a current visual range of each virtual object; a resource request quota is allocated to each density grade; when a resource request sent by a virtual object in a density grade is received within preset duration, the received resource request is processed if it is determined that a resource request quota corresponding to the density grade is greater than a preset quota threshold, and a preset value is subtracted from the resource request quota corresponding to the density grade; and the resource request is rejected if it is determined that the resource request quota corresponding to the density grade is less than or equal to the preset quota threshold.
  • virtual objects can be classified into density grades, and a resource request quota is allocated to each density grade; when the resource request quota is less than or equal to a preset quota threshold, a CPU rejects processing resource requests sent by virtual objects in the density grade, so that processing of the CPU is avoided from being overloaded, thereby alleviating a stalling problem caused by an insufficient computing capability of a server.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Multimedia (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • User Interface Of Digital Computer (AREA)
  • Information Transfer Between Computers (AREA)
  • Stored Programmes (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Debugging And Monitoring (AREA)

Claims (13)

  1. Procédé de traitement d'une demande de ressources, comprenant:
    la classification, par un serveur, d'objets virtuels d'accès selon un degré de densité selon une densité d'objets virtuels d'interaction,
    caractérisé en ce que
    la classification est une classification d'objets virtuels d'accès dans une pluralité de degrés de densité selon une densité d'objets virtuels d'interaction dans une plage visuelle actuelle de chacun des objets virtuels d'accès (201), un niveau du degré de densité étant corrélé positivement à une valeur de la densité d'objets virtuels d'interaction, les objets virtuels d'accès étant des objets virtualisés dans un programme d'application de jeu et chaque objet virtuel d'accès correspond à un joueur du programme d'application de jeu,
    la plage visuelle de l'objet virtuel d'accès est une zone visible par le joueur sur un écran actuel, et
    les objets virtuels d'interaction sont d'autres objets virtuels dans la plage visuelle de l'objet virtuel d'accès respectif;
    l'attribution, par le serveur, d'un quota de demande de ressources à chacun parmi la pluralité des degrés de densité (202), le quota de demande de ressources correspondant à chacun parmi la pluralité des degrés de densité étant le nombre de demandes de ressources qui sont envoyées par les objets virtuels d'accès dans le degré de densité et qui sont autorisées à être traitées dans un premier laps de temps prédéfini; et
    lorsqu'une demande de ressources envoyée par l'objet virtuel d'accès dans un premier degré de densité de la pluralité de degrés de densité est reçue dans le premier laps de temps prédéfini,
    le traitement, par le serveur, de la demande de ressources, et la soustraction, par le serveur, d'une valeur prédéfinie du quota de demande de ressources correspondant au premier degré de densité, s'il est déterminé que le quota de demande de ressources correspondant au premier degré de densité est supérieur à un seuil de quota prédéterminé (204); et
    le rejet, par le serveur, de la demande de ressources s'il est déterminé que le quota de demande de ressources correspondant au premier degré de densité est inférieur ou égal au seuil de quota prédéfini (205), pour empêcher la surcharge de la CPU de serveur et pour réduire des problèmes de blocage causés par une capacité de calcul insuffisante,
    dans lequel la classification, par le serveur, des objets virtuels d'accès dans une pluralité de degrés de densité (201) comprend:
    l'obtention, par le serveur, de la densité d'objets virtuels d'interaction dans la plage visuelle actuelle de chacun des objets virtuels d'accès; et
    la classification, par le serveur, des objets virtuels d'accès, dont les densités correspondantes appartiennent à une même gamme numérique dans un même degré de densité.
  2. Procédé selon la revendication 1, comprenant en outre:
    le rejet, par le serveur, de la demande de ressources si le quota de demande de ressource correspondant au premier degré de densité est inférieur ou égal au seuil de quota prédéfini et il est déterminé que les quotas de demande de ressources correspondant respectivement à d'autres degrés de densité supérieurs au premier degrés de densité sont tous inférieurs au seuil de quota prédéfini.
  3. Procédé selon la revendication 2, comprenant en outre:
    si un quota de demande de ressources correspondant à un second degré de densité de la pluralité des degrés de densité supérieurs au premier degré de densité est supérieur au seuil de quota prédéfini, le traitement, par le serveur, de la demande de ressources et la soustraction, par le serveur, de la valeur prédéfinie du quota de demande de ressources correspondant au second degré de densité.
  4. Procédé selon la revendication 1, dans lequel l'attribution, par le serveur, d'un quota de demande de ressources à chacun de la pluralité de degrés de densité (202) comprend:
    l'attribution, par le serveur, d'un quota de demande de ressources à chacun de la pluralité de degrés de densité selon la charge actuelle de la CPU, une valeur du quota de demande de ressources étant négativement corrélée à une taille de la charge actuelle de la CPU.
  5. Procédé selon l'une quelconque des revendications 1 à 4, comprenant en outre:
    la réattribution, par le serveur, d'un quota de demande de ressources à chaque de la pluralité des degrés de densité une fois le premier laps de temps découlé.
  6. Procédé selon l'une quelconque des revendications 1 à 4, comprenant en outre:
    le traitement, par le serveur, lorsqu'il est détecté que toutes les demandes de ressources envoyées par un objet virtuel cible dans un second laps de temps prédéfini sont rejetées et une demande de ressources suivante envoyée par l'objet virtuel cible est reçue, la demande de ressources suivante envoyée par l'objet virtuel cible.
  7. Procédé selon la revendication 6, comprenant en outre:
    le réglage, par le serveur, du second laps de temps prédéfini pour qu'il soit inférieur à un laps de temps prédéfini d'un intervalle auquel deux demandes de ressources continues sont autorisées à être envoyées, lorsqu'une charge actuelle de la CPU est inférieure à un seuil de charge prédéfini.
  8. Appareil de traitement d'une demande de ressources, comprenant un ou plusieurs processeurs, et une ou plusieurs mémoires pour stocker des unités de programme, les unités de programme étant exécutées par les processeurs, et les unités de programme comprenant:
    une unité de division de degré de densité (701) configurée pour la classification, par un serveur, d'objets virtuels d'accès dans un degré de densité selon une densité d'objets virtuels d'interaction,
    caractérisé en ce que
    l'unité de division de degré de densité (701) est configurée pour la classification d'objets virtuels d'accès dans une pluralité de degrés de densité selon une densité d'objets virtuels d'interaction dans une plage visuelle actuelle de chacun des objets virtuels d'accès, un niveau du degré de densité étant corrélé positivement à une valeur de la densité d'objets virtuels d'interaction, les objets virtuels d'accès étant des objets virtualisés dans un programme d'application de jeu et chaque objet virtuel d'accès correspond à un joueur du programme d'application de jeu,
    la plage visuelle de l'objet virtuel d'accès est une zone visible par le joueur sur un écran actuel, et
    les objets virtuels d'interaction sont d'autres objets virtuels dans la plage visuelle de l'objet virtuel d'accès respectif;
    une unité d'attribution de quota (702), configurée pour l'attribution d'un quota de demande de ressources à chacun parmi la pluralité de degrés de densité (202), le quota de demande de ressources correspondant à chacun parmi la pluralité de degrés de densité étant le nombre de demandes de ressources qui sont envoyées par les objets virtuels d'accès dans le degré de densité et qui sont autorisées à être traitées dans un premier laps de temps prédéfini;
    une unité de réception de demande de ressources (703), configurée pour recevoir une demande de ressources envoyées par l'objet virtuel d'accès dans un premier degré de densité de la pluralité de degrés de densité; et
    une unité de traitement de demande de ressources (704) configurée pour,
    lorsqu'une demande de ressources envoyée par l'objet virtuel d'accès dans le premier degré de densité est reçue par l'unité de réception dans le premier laps de temps prédéfini, traiter, s'il est déterminé que le quota de demande de ressources correspondant au premier degré de densité est supérieur à un seuil de quota prédéfini, la demande de ressources, et pour soustraire une valeur prédéfinie du quota de demande de ressources correspondant au premier degré de densité; et
    pour rejeter la demande de ressources s'il est déterminé que le quota de demande de ressources correspondant au premier degré de densité est inférieur ou égal au seuil de quota prédéfini, pour empêcher la surcharge de la CPU de serveur et pour réduire des problèmes de blocage causés par une capacité de calcul insuffisante,
    dans lequel l'unité de division de degré de densité (701) est en outre configurée pour:
    obtenir la densité d'objets virtuels d'interaction dans la plage visuelle actuelle de chacun des objets virtuels d'accès; et
    classer les objets virtuels d'accès, dont les densités correspondantes appartiennent à une même plage numérique dans un même degré de densité.
  9. Appareil selon la revendication 8, dans lequel
    l'unité de traitement de demande de ressources (704) est en outre configurée pour rejeter la demande de ressources lorsque le quota de demande de ressource correspondant au premier degré de densité est inférieur ou égal au seuil de quota prédéfini et il est déterminé que les quotas de demande de ressources correspondant respectivement à d'autres degrés de densité supérieurs au premier degrés de densité sont tous inférieurs au seuil de quota prédéfini,
    dans lequel l'unité de traitement de demande de ressources (704) est en outre configurée pour, lorsque le quota de demande de ressources correspondant à un second degré de densité de la pluralité des degrés de densité supérieurs au premier degré de densité est supérieur au seuil de quota prédéfini, traiter la demande de ressources et pour soustraire la valeur prédéfinie du quota de demande de ressources correspondant au second degré de densité.
  10. Appareil selon la revendication 9, dans lequel
    l'unité d'attribution de quota (702) est configurée pour attribuer un quota de demande de ressources à chacun de la pluralité de degrés de densité selon la charge actuelle de la CPU, une valeur du quota de demande de ressources étant négativement corrélée à une taille de la charge actuelle de la CPU.
  11. Appareil selon l'une quelconque des revendications 9 à 10, dans lequel
    l'unité d'attribution de quota (702) est en outre configurée pour la réattribution d'un quota de demande de ressources à chacun parmi la pluralité des degrés de densité une fois le premier laps de temps découlé.
  12. Appareil selon l'une quelconque des revendications 9 à 10, dans lequel
    l'unité de traitement de demande de ressources (704) est en outre configurée pour, lorsqu'il est détecté que toutes les demandes de ressources envoyées par un objet virtuel cible dans un second laps de temps prédéfini sont rejetées et une demande de ressources suivante envoyée par l'objet virtuel cible est reçue, traiter la demande de ressources suivante par l'objet envoyée par l'objet virtuel cible,
    l'appareil comprenant en outre:
    une unité de réglage (705), configurée pour le réglage du second laps de temps prédéfini pour qu'il soit inférieur à un laps de temps prédéfini d'un intervalle auquel deux demandes de ressources continues sont autorisées à être envoyées, lorsqu'une charge de la CPU est inférieure à un seuil de charge prédéfini.
  13. Support de stockage lisible par ordinateur comprenant des instructions qui, lorsqu'elles sont exécutées par un ordinateur, amènent l'ordinateur à exécuter les étapes du procédé selon les revendications 1 à 7.
EP18787656.0A 2017-04-18 2018-04-12 Procédé et dispositif de traitement de demande de ressources Active EP3584702B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710253253.3A CN106991013B (zh) 2017-04-18 2017-04-18 一种对资源请求进行处理的方法及装置
PCT/CN2018/082844 WO2018192412A1 (fr) 2017-04-18 2018-04-12 Procédé et dispositif de traitement de demande de ressources

Publications (3)

Publication Number Publication Date
EP3584702A1 EP3584702A1 (fr) 2019-12-25
EP3584702A4 EP3584702A4 (fr) 2020-12-16
EP3584702B1 true EP3584702B1 (fr) 2023-12-06

Family

ID=59416373

Family Applications (1)

Application Number Title Priority Date Filing Date
EP18787656.0A Active EP3584702B1 (fr) 2017-04-18 2018-04-12 Procédé et dispositif de traitement de demande de ressources

Country Status (6)

Country Link
US (1) US11216313B2 (fr)
EP (1) EP3584702B1 (fr)
JP (1) JP6847227B2 (fr)
KR (1) KR102267572B1 (fr)
CN (1) CN106991013B (fr)
WO (1) WO2018192412A1 (fr)

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106991013B (zh) 2017-04-18 2018-09-07 腾讯科技（深圳）有限公司 一种对资源请求进行处理的方法及装置
CN110120963B (zh) * 2018-02-06 2022-08-12 斑马智行网络(香港)有限公司 一种数据处理方法、装置、设备和机器可读介质
CN109675321B (zh) * 2018-12-18 2022-02-15 网易（杭州）网络有限公司 游戏中同屏显示人数的控制方法和装置
CN109885405B (zh) * 2019-02-02 2021-11-12 珠海金山网络游戏科技有限公司 一种动态分配方法及系统、计算设备及存储介质
CN113051265A (zh) * 2019-12-27 2021-06-29 中信百信银行股份有限公司 一种降低关系型数据库表结构变更所带来损耗的方法、装置、计算机设备、和可读存储介质
CN111258751A (zh) * 2020-01-08 2020-06-09 北京松果电子有限公司 一种控制资源访问的方法、装置及介质
CN111298432B (zh) * 2020-01-16 2021-07-06 腾讯科技（深圳）有限公司 虚拟对象信息获取方法、装置、服务器及可读存储介质
CN111589140B (zh) * 2020-05-14 2023-03-14 腾讯科技（深圳）有限公司 虚拟对象的控制方法、装置、终端及存储介质
CN111711642A (zh) * 2020-07-15 2020-09-25 网易（杭州）网络有限公司 协议请求处理方法、装置、电子设备和存储介质
CN112138406A (zh) * 2020-09-24 2020-12-29 网易（杭州）网络有限公司 一种虚拟资源发放方法、装置、计算机设备和存储介质
CN112363839B (zh) * 2020-11-23 2024-03-15 腾讯科技（深圳）有限公司 一种资源请求处理方法、装置及服务器
CN113797549B (zh) * 2021-09-30 2024-05-10 上海完美时空软件有限公司 资源对象的处理方法、装置、计算机设备及存储介质
CN116643893B (zh) * 2023-07-27 2023-10-20 合肥中科类脑智能技术有限公司 算力任务的调度方法、调度装置、存储介质及服务器

Family Cites Families (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020049690A1 (en) * 2000-06-16 2002-04-25 Masanori Takano Method of expressing crowd movement in game, storage medium, and information processing apparatus
GB0302926D0 (en) * 2003-02-08 2003-03-12 Grex Games Ltd System architecture and engine for massively multi-user operation
JP4711223B2 (ja) 2005-08-02 2011-06-29 株式会社セガ 画像生成プログラム、記憶媒体、画像処理方法及び画像処理装置
US20070129126A1 (en) * 2005-10-14 2007-06-07 Leviathan Entertainment, Llc Method and System for Allocating Resources in a Video Game
CN101126991A (zh) * 2006-08-18 2008-02-20 腾讯科技（深圳）有限公司 一种在网络游戏中为用户分配游戏资源的方法及系统
KR101116615B1 (ko) * 2007-03-28 2012-03-07 삼성전자주식회사 자바 가상 머신 상에서 이뤄지는 애플리케이션 및 스레드의자원 관리 시스템 및 방법
WO2009080946A2 (fr) * 2007-12-07 2009-07-02 France Telecom Procédé de gestion d'un ensemble d'entités de contrôle d'un environnement virtuel, dispositif, et produit programme d'ordinateur correspondant
JP5884485B2 (ja) * 2008-07-22 2016-03-15 デイブレイク ゲーム カンパニー リミテッド ライアビリティ カンパニー 自明のマルチユーザコンテンツのためのシステム及び方法
US8972870B2 (en) * 2009-08-27 2015-03-03 International Business Machines Corporation Providing alternative representations of virtual content in a virtual universe
US9038168B2 (en) * 2009-11-20 2015-05-19 Microsoft Technology Licensing, Llc Controlling resource access based on resource properties
KR101644800B1 (ko) * 2010-01-07 2016-08-02 삼성전자주식회사 컴퓨팅 시스템 및 방법
US9024977B2 (en) * 2010-08-02 2015-05-05 International Business Machines Corporation Resizing objects in regions of virtual universes
US8708790B2 (en) * 2011-06-24 2014-04-29 Zynga Inc. Method of operating an online game using consolidated game objects
JP5755064B2 (ja) * 2011-07-08 2015-07-29 株式会社ドワンゴ 会場設置ディスプレイシステム
US9317336B2 (en) * 2011-07-27 2016-04-19 Alcatel Lucent Method and apparatus for assignment of virtual resources within a cloud environment
WO2013111227A1 (fr) * 2012-01-23 2013-08-01 株式会社コナミデジタルエンタテインメント Dispositif de commande de jeu, procédé de commande de jeu, programme, support d'enregistrement et système de jeu
CN103873457A (zh) * 2012-12-17 2014-06-18 人人游戏网络科技发展（上海）有限公司 用于游戏服务器间负载均衡的方法和设备
EP2745892B1 (fr) * 2012-12-21 2018-12-12 Dassault Systèmes Partition d'une scène en 3D en une pluralité de zones traitées par une ressource informatique
CN103218265B (zh) * 2013-05-06 2016-04-27 杭州电子科技大学 基于空间密度聚类的并行式虚拟角色划分方法
US9295915B2 (en) * 2013-05-20 2016-03-29 Microsoft Technology Licensing, Llc Game availability in a remote gaming environment
US9628332B2 (en) * 2013-05-20 2017-04-18 Microsoft Technology Licensing, Llc Resource allocation to game titles in a remote gaming environment
BR112018003775A2 (pt) * 2015-08-31 2018-09-25 Huawei Tech Co Ltd método e aparelho de gerenciamento de recursos
CN105391758B (zh) * 2015-10-09 2019-07-02 天脉聚源（北京）教育科技有限公司 一种局域网中资源分配的方法和装置
CN106991013B (zh) * 2017-04-18 2018-09-07 腾讯科技（深圳）有限公司 一种对资源请求进行处理的方法及装置

Also Published As

Publication number Publication date
JP2020502684A (ja) 2020-01-23
US11216313B2 (en) 2022-01-04
CN106991013B (zh) 2018-09-07
EP3584702A1 (fr) 2019-12-25
KR102267572B1 (ko) 2021-06-18
KR20190126406A (ko) 2019-11-11
US20190303201A1 (en) 2019-10-03
EP3584702A4 (fr) 2020-12-16
WO2018192412A1 (fr) 2018-10-25
CN106991013A (zh) 2017-07-28
JP6847227B2 (ja) 2021-03-24

Similar Documents

Publication Publication Date Title
EP3584702B1 (fr) Procédé et dispositif de traitement de demande de ressources
WO2021244209A1 (fr) Procédé et appareil de commande d'objet virtuel, terminal et support de stockage
US11110352B2 (en) Object moving method and apparatus, storage medium, and electronic apparatus
CN110935169B (zh) 虚拟对象的控制方法、信息显示方法、装置、设备及介质
CN110585697A (zh) 一种游戏中的跨服控制方法及装置
CN112286637A (zh) 计算资源的调整方法及装置
WO2022156442A1 (fr) Procédé et appareil de commande d'interaction de personnages, dispositif informatique et support d'enregistrement
US10238971B2 (en) Dynamic quality of service management in multiplayer gaming
CN113486042B (zh) 数据处理方法、装置、计算机可读介质及电子设备
CN110102047B (zh) 游戏操作处理方法和装置、游戏效果展示方法和装置
CN113440839A (zh) 非玩家游戏角色的控制方法、装置、设备及存储介质
CN109939437B (zh) 游戏程序运行优化方法及装置
KR101845618B1 (ko) 다중 온라인 게임 서버 및 그 다중 온라인 게임 서비스 제공 방법
KR101845616B1 (ko) 다중 온라인 게임 서버 및 그 다중 온라인 게임 서비스 제공 방법
CN112398957B (zh) 服务器的调度方法和装置、存储介质及电子设备
CN113797544A (zh) 虚拟对象的攻击控制方法、装置、计算机设备及存储介质
CN110496387A (zh) 游戏优化方法、装置、移动终端及存储介质
CN117349037B (zh) 在离线应用干扰消除方法、装置、计算机设备及存储介质
CN112451970B (zh) 动作控制方法、装置、电子设备、存储介质及产品
US11998839B2 (en) Information processing method, apparatus and computer storage medium
KR101845617B1 (ko) 다중 온라인 게임 서버 및 그 다중 온라인 게임 서비스 제공 방법
KR101845619B1 (ko) 다중 온라인 게임 서버 및 그 다중 온라인 게임 서비스 제공 방법
CN116889731A (zh) 虚拟角色控制方法和装置、电子设备以及可读存储介质
CN112506672A (zh) 面向虚拟gpu的云手机在线调度与迁移的方法及装置
CN112363839A (zh) 一种资源请求处理方法、装置及服务器

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20190916

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20201116

RIC1 Information provided on ipc code assigned before grant

Ipc: G06F 9/50 20060101AFI20201110BHEP

Ipc: A63F 13/35 20140101ALI20201110BHEP

RAP3 Party data changed (applicant data changed or rights of an application transferred)

Owner name: TENCENT TECHNOLOGY (SHENZHEN) COMPANY LIMITED

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20230414

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20230831

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602018062262

Country of ref document: DE

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20240307

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20231206

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231206

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231206

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231206

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20240307

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231206

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20240306

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1639069

Country of ref document: AT

Kind code of ref document: T

Effective date: 20231206

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231206

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231206

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231206

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20240306

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231206

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231206

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231206