JP2017037446A - Game server device and distribution processing method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a game server device executing an online game by distribution processing so as to alleviate processing delay when a player of the online game shifts from a current game space to an adjacent space.SOLUTION: A stateful game server device 1 charging a split space that is one of predetermined units into which a game space is split comprises: an original data management unit 11 which stores original data for state data of players who exist in the space managed by the own server device; and a replica arrangement unit 12 which copies a replica of the state data to the other game server device 1 managing an adjacent space. The original data management unit 11 stores the replica of the state data of the player as an original data when detecting that a player in the adjacent space moves to the space managed by the own server device.SELECTED DRAWING: Figure 3

Description

  The present invention relates to a technique for distributed processing of a game server device that executes an online game.

  Non-Patent Document 1 describes a spatial division method (MMO (Massively Multiplayer Online) type online game) that divides the game world based on the geographical structure and assigns processing to another server process or server machine ( Techniques relating to (geographic division of space) are disclosed. Non-Patent Document 1 describes that the servers 1 to 4 are in charge of each divided space by dividing one game space into four equal parts vertically and horizontally.

  A player (game character) operated by the user exists in one of the divided game spaces and plays. The processing related to the play of all the players existing in the same divided space is handled by the server in charge of the divided space. By using the space division method, distributed processing for each divided space can be realized, and the entire load of real-time processing can be reduced.

Kensuke Nakajima, "Technology that Supports Online Games Behind the Scenes of a Spectacular Play Space," Technical Review, p.236-238.

  When a player moves from the current space to the adjacent space, the server in charge of processing related to the player's play is switched. In such switching of the responsible server, a processing delay for transferring the player state data occurs, and the play is temporarily interrupted. In an online game that strongly requires real-time performance, there is a problem that such processing delay and temporary interruption of play result in a decrease in service quality. However, Non-Patent Document 1 does not specifically mention means for solving such a problem.

  Therefore, in view of the above circumstances, the present invention relates to a game server device that executes an online game by distributed processing, and it is an object to reduce processing delay when an online game player moves from a current space to an adjacent space. And

  In order to solve the above-mentioned problem, the invention described in claim 1 is a stateful game server device in charge of a space obtained by dividing a game space into predetermined units, and the player of the player existing in the space in charge of the game space. An original data management unit that stores the original state data, and a replica placement unit that copies the state data replica to another game server device in charge of the adjacent space, the original data management unit includes: When it is detected that a player who is in an adjacent space has moved to the space in charge of the player, a replica of the player's state data is stored as an original.

  The invention according to claim 5 is a distributed processing method in a stateful type game server device that takes charge of a space obtained by dividing the game space into predetermined units, and the game server device is assigned to the space that it is in charge of. Storing the original state data of the existing player, copying a replica of the state data to another game server device in charge of the adjacent space, and a player in the adjacent space When it is detected that the player has moved to the space in charge, a step of storing a replica of the state data of the player as an original is executed.

According to the first and fifth aspects of the present invention, when the player moves to the adjacent space, the game server device in charge of the adjacent space is already copied instead of transferring the state data of the player between the game server devices. The player can continue processing by switching the completed replica to the original. Therefore, the processing delay and the play interruption associated with the state data transfer are avoided, and the service quality is not deteriorated.
Therefore, regarding a game server device that executes an online game by distributed processing, it is possible to reduce processing delay when the player of the online game moves from the current space to the adjacent space.

  The invention according to claim 2 is the game server device according to claim 1, wherein the replica placement unit is in charge of a space including a range extending a predetermined distance from the current position of the player. A replica of the player's state data is copied to the device.

  According to the second aspect of the present invention, it is possible to narrow down the arrangement destination of the replica of the state data, so that the replication load can be reduced.

  The invention according to claim 3 is the game server device according to claim 1, wherein the replica placement unit predicts a space to move next from the velocity vector of the player, and the predicted space. A replica of the state data of the player is copied to the game server device in charge.

  According to the third aspect of the present invention, it is possible to narrow down the arrangement destinations of the replicas of the state data, so that the replication load can be reduced.

  The invention according to claim 4 is the game server device according to any one of claims 1 to 3, wherein the load monitoring unit monitors the load of the game server device of the game server device, and the load When the value exceeds a predetermined value, the space that the user is in charge of is subdivided and one of the subdivided spaces is assigned to a new game server device, and the space before the subdivision The space division notifying unit for notifying the other game server device in charge of the adjacent space of the space information reflecting the subdivision, and receiving the space information from the other game server device in charge of the space before the subdivision In this case, a boundary information calculation unit that updates boundary information of a space that the user is in charge of is further provided.

  According to the invention described in claim 4, since the new game server device can share the load with respect to the overloaded game server device due to the subdivision of the space, the down of the system is avoided. be able to.

  ADVANTAGE OF THE INVENTION According to this invention, regarding the game server apparatus which performs an online game by distributed processing, the processing delay at the time of the player of an online game moving to the adjacent space from the present space can be relieved.

It is a block diagram of the whole distributed processing system of this embodiment. It is a figure which shows the data structure of a server-space correspondence table. It is a functional lineblock diagram of the game server device of this embodiment. It is a figure explaining arrange | positioning a player state (replica) in adjacent space with respect to a player state (original). It is a figure explaining arrange | positioning a player state (replica) in adjacent space based on a replica determination distance. It is a figure explaining arrange | positioning a player state (replica) in adjacent space based on a player's velocity vector. It is a figure explaining the subdivision of the space which an overloaded server takes charge of. It is a figure explaining the arrangement | positioning of the boundary information according to the subdivision of space, and the replica of a player state. It is a flowchart which shows the process regarding the movement to the adjacent space of a player. It is a flowchart which shows the process regarding the subdivision of space.

  EMBODIMENT OF THE INVENTION The form (embodiment) for implementing this invention is demonstrated in detail, referring drawings.

(overall structure)
As shown in FIG. 1, the distributed processing system of the present embodiment includes a plurality of servers 1-1, 1-2,..., 1-n serving as the game server device 1 (see FIG. 2) of the present embodiment. , 2-n and a load balancer 3 are provided. , 1-n, distribution devices 2-1, 2-2,..., 2-n, load balancer 3, and client 4-1 in FIG. ,..., 4-n are communicably connected via a network (not shown).

  The servers 1-1, 1-2,..., 1 -n are stateful servers that have an application that realizes an online game in the MMO format and execute processing related to game events of the online game. A game space of an online game (for convenience of explanation, it is assumed to be two-dimensional, but the present invention can also be applied to a one-dimensional and three-dimensional game space) is divided into predetermined units by a space division method. Each of the servers 1-1, 1-2,..., 1-n is in charge of each of the divided game spaces. In FIG. 1, one game space is divided into spaces A, B, C, D,..., And the servers 1-1, 1-2,. A state of taking charge of one of A, B, C, D,... Is shown.

  Each of the servers 1-1, 1-2,..., 1 -n executes various processes related to the players that exist in the space that it is responsible for. For example, the process includes a process in response to a player operation request from the clients 4-1,..., 4-n and a process related to mutual interference between players (eg, chat, item exchange). The position of the player in the assigned space changes from time to time according to the player operation request (well known). Further, in the present embodiment, mutual interference between players existing in different assigned spaces is excluded from processing in order to reduce processing delay as in the conventional case, but this is not limited as long as the problem of processing delay can be solved.

  Each of the servers 1-1, 1-2,..., 1 -n can exchange and synchronize with the latest information. The latest information includes IP (Internet Protocol) addresses of the servers 1-1, 1-2,..., 1-n, and a server-space correspondence table T1 described later. As described above, in order to adopt a configuration in which continuous information of space is associated with each of the servers 1-1, 1-2,. The range of influence accompanying the increase / decrease can be limited to only a small number of related servers.

  Clients 4-1,..., 4-n in FIG. 1 are computers that accept input from users of online games and operate players in the game space. Upon receiving an input from the user, the clients 4-1,..., 4-n transmit a player operation request including the current position of the player in the game space as a key to the load balancer 3. Note that the current position of the player is a key of the player (Value) in the KVS (Key Value Store) system.

  The load balancer 3 sends the player operation request received from the clients 4-1,..., 4-n to any of the distribution devices 2-1, 2-2,. Send it randomly.

  The distribution devices 2-1, 2-2,..., 2-n distribute the player operation requests received from the load balancer 3 to the servers 1-1, 1-2,. Each of the sorting devices 2-1, 2-2,..., 2-n has a server-space correspondence table T1. The distribution devices 2-1, 2-2,..., 2-n can make their server-space correspondence tables T 1 the same by performing synchronization processing.

  As shown in FIG. 2, the server-space correspondence table T1 sets fields such as space name, space upper left vertex coordinate, space vertical length, space horizontal length, and server in charge. The server-space correspondence table 50 has a record created for each space obtained by dividing the game space, and stores the value of the field for each record.

In the “space name” column, the name of the corresponding space obtained by dividing the game space into predetermined units in the vertical and horizontal directions is stored.
In the “space upper left vertex coordinate” field, the coordinate value of the upper left vertex of the divided space is stored.
In the “space length” column, a value indicating the length in the vertical direction of the divided space is stored.
A value indicating the horizontal length of the divided space is stored in the “space horizontal length” column.
In the “server in charge” column, the identification number of the server in charge of the divided space is stored.
Note that the space name, space upper left vertex coordinate, space vertical length, and space horizontal length of the server-space correspondence table T1 constitute “space information” for each divided space.

  The distribution devices 2-1, 2-2,..., 2-n read the key included in the player operation request received from the load balancer 3, grasp the current position of the player, and store the server-space correspondence table T 1. By referring to the server, the server in charge of the space including the current position of the player can be identified, and the player operation request can be distributed to the identified server.

(Configuration of game server device 1)
As shown in FIG. 3, the game server device 1 of this embodiment includes a processing unit 10, a communication unit 20, and a storage unit 30.

  The communication unit 20 includes a communication interface that transmits and receives information via a communication line, and is connected to the processing unit 10 via an internal bus or the like. The processing unit 10 can transmit / receive information to / from other game server devices 1 and the distribution devices 2-1, 2-2,.

  The storage unit 30 is a storage device such as a hard disk, a flash memory, a ROM (Read Only Memory), and a RAM (Random Access Memory). The storage unit 30 stores an application for realizing an online game (not shown). The storage unit 30 stores a program (distributed processing program) for realizing distributed processing executed between the plurality of game server devices 1 (not shown). In addition, the storage unit 30 includes, for example, the same server-space correspondence table T1 as the server-space correspondence table T1 of the sorting devices 2-1, 2-2,. The original state data (D1) of the player's state data existing in his / her assigned space and the player's state data replica (D2) existing in the space adjacent to his / her assigned space are stored.

  The boundary information T2 of the own assigned space is information indicating the boundary between the assigned assigned space and the adjacent space for each adjacent space. The boundary information T2 can be created based on the contents of the server-space correspondence table T1. When the adjacent space is positioned on the top, bottom, left, and right of its own assigned space, the boundary is a line, and the boundary can be represented by a set of points in the game space coordinates. Further, when the adjacent space is located at the upper right, lower right, lower left, or upper left of its own assigned space, the boundary is a point, and the boundary can be expressed by one coordinate of the game space.

  The processing unit 10 governs the entire processing executed by the game server device 1. The processing unit 10 is realized, for example, by a CPU (Central Processing Unit) developing and executing a program stored in the storage unit 30 on the RAM of the storage unit 30 and executing the program. The processing unit 10 includes functional units such as an original data management unit 11, a replica placement unit 12, a load monitoring unit 13, a space division unit 14, a space division notification unit 15, and a boundary information calculation unit 16. ing.

  The original data management unit 11 stores an original of player state data existing in a space that the game server device 1 itself is in charge of. The original state data (D1) stored in the storage unit 30 of the game server device 1 belongs to the player existing in the space in charge of the game server device 1 itself. When a player existing in his / her assigned space moves to another space, the original data management unit 11 switches the original state data of the player to a replica and stores it in the storage unit 30. In addition, when the original data management unit 11 detects that a player in an adjacent space has moved to the space that he / she is in charge of, the original data management unit 11 stores the original state data of the player in the storage unit 30. At this time, the original data management unit 11 uses a replica of the player's state data stored in advance.

  The replica placement unit 12 copies (places) a replica of the player's state data to another game server device 1 that is in charge of the adjacent space for the player that exists in the space that the game server device 1 itself is in charge of. The replica (D2) of the state data stored in the storage unit 30 of the game server device 1 is that of a player that exists in a space adjacent to the assigned space of the game server device 1 itself.

  The load monitoring unit 13 monitors the load of the game server device 1 itself. Examples of the load monitored by the load monitoring unit 13 include, but are not limited to, a CPU usage rate and a memory usage amount.

  When the load monitored by the load monitoring unit 13 exceeds a predetermined value, the space dividing unit 14 subdivides the space in charge of the space dividing unit 14 and sets one of the subdivided spaces as a new game server. Assign to device 1. The space division unit 14 rewrites the contents of its own server-space correspondence table T1 to reflect the subdivision of the assigned space. Therefore, the space division unit 14 rewrites the spatial information to reflect the subdivision.

  The space division notification unit 15 notifies the other game server device 1 in charge of the space adjacent to the space before the subdivision by the space division unit 14 of the space information reflecting this subdivision.

  When the boundary information calculation unit 16 receives the spatial information notified from the space division notification unit 15 of the other game server device 1 that is in charge of the space before subdivision, the boundary information calculation unit 16 is responsible for the space information based on the received spatial information. Update space boundary information.

(Details about players moving to adjacent spaces)
The game server device 1 has original state data of players existing in its own assigned space. In FIG. 4, when the game space is divided into space A to space K,... And the servers 1 to 11,. A state in which players A and B (represented by circles) exist in the space F in charge is shown. The original data management unit 11 of the server 6 stores a player state a (original) of the player A and a player state b (original) of the player B. The term “player status” is synonymous with “player status data”.

  Here, the server 6 can quickly specify the spaces A, B, C, E, G, I, J, and K adjacent to the space F using the boundary information T2. The replica arrangement unit 12 of the server 6 sends the player states a, B to the servers 1, 2, 3, 5, 7, 9, 10, 11 in charge of the spaces A, B, C, E, G, I, J, and K. Copy replica of b.

  For example, when the player A moves from the space F to the space G, when the original data management unit 11 of the server 7 in charge of the space G detects the player A, it stores the already copied replica of the player state a as the original. . Thereby, the state data transfer process between the servers 6 and 7 accompanying the movement of the player A, which has been conventionally performed, can be omitted. Therefore, the server 7 can quickly start the process for the player A, and can significantly reduce the game interruption time during the space movement.

  In addition, the space F that is the movement source of the player A becomes a new adjacent space as viewed from the movement destination space G. For this reason, the server 6 continues to use the original of the player state “a” of the player A as a replica. At this time, the replica placement unit 12 of the server 7 instructs the server 6 to store the original player state a as a replica.

  As described above, when replicas are placed (copied) in all adjacent spaces, the replication load is very large, and there is a possibility that a corresponding influence will occur on the processing of the game server device 1. For this reason, a method of narrowing down the replica placement destination by predicting the player's destination is conceivable.

(Restriction method 1 for replica placement)
For example, the replica is arranged only in a space including a range extending a predetermined distance from the current position of the player. For the distance that the player can move within the time required for replication (specified by the developer in advance), an arbitrary distance that satisfies the condition of being larger than this distance is set as a replica determination distance that is a criterion for replica placement. .

Then, the distance from the player position to the boundary with the adjacent space is sequentially calculated, and compared with the replica determination distance, when the boundary is within the replica determination distance, the replica is copied to the server in charge of the adjacent space. . In other words,
Player position coordinates: (Xp, Yp)
Replica determination distance: r
Coordinates constituting the boundary of each space: (Xs, Ys)
Replica arrangement determination formula: (Xp−Xs) ² + (Yp−Ys) ² <r ²
If
A replica is arranged in an adjacent space having (Xs, Ys) that satisfies the replica determination formula. For the upper and lower adjacent spaces, the above replica arrangement determination formula is used with Xp−Xs = 0. For the left and right adjacent spaces, the above-described replica arrangement determination formula is used with Yp−Ys = 0.

According to FIG. 5, if the player A is arranged in the position shown in FIG. 5 in the space F, the space including the range extending from the current position of the player A to the replica determination distance is represented by spaces B, C, and G. Become. Therefore, the replica placement unit 12 of the server 6 in charge of the space F copies the replica of the player state a only to the servers 2, 3, and 7 in charge of the spaces B, C, and G.
Further, assuming that the player B is arranged in the position shown in FIG. 5 in the space F, the spaces including the range extending from the current position of the player B to the replica determination distance are spaces A, B, and E. Therefore, the replica placement unit 12 of the server 6 in charge of the space F copies the replica of the player state a only to the servers 1, 2, and 5 in charge of the spaces A, B, and E.

(Method 2 for narrowing down replica placement locations)
For example, the player's position is held every predetermined period, the velocity vector is calculated from the history of the held position, and the space to which the player moves when the movement continues based on the velocity vector is determined. Calculate the time it takes to reach the boundary of the identified space.

When the calculated time is equal to or shorter than the time required for replication, the replica is copied to the server in charge of the adjacent space serving as the movement destination. In other words,
Player position coordinates: (Xp, Yp)
Player velocity vector: (Vx, Vy)
Time required for replication: t
Coordinates of space boundary points that intersect the velocity vector: (Xs, Ys)
If
Replica arrangement determination formula (example of arrival in adjacent space in the left-right direction): When | Xs−Xp | / Vx <t is satisfied, or
Replica placement determination formula (example when reaching the adjacent space in the vertical direction): When satisfying | Ys−Yp | / Vy <t, a replica is placed in the corresponding adjacent space.

According to FIG. 6, assuming that the player A is arranged at the position shown in FIG. 6 in the space F, the velocity vector of the player A intersects with the boundary with the space B. For this reason, the replica placement unit 12 of the server 6 in charge of the space F only sends the player state a to the server 2 in charge of the space B at a timing that satisfies the replica placement determination formula (example when reaching the adjacent space in the vertical direction). Copy a replica.
Further, assuming that the player B is disposed in the position shown in FIG. 6 in the space F, the velocity vector of the player B intersects with the boundary with the space G. For this reason, the replica placement unit 12 of the server 6 in charge of the space F sends only the server 7 in charge of the space G in the player state b at a timing that satisfies the replica placement determination formula (example of arrival in the adjacent space in the left-right direction). Copy a replica.

(Details regarding load bias due to player movement)
The player can move freely in the divided game space (unless the event progress is taken into consideration). For this reason, there is a possibility that the load is unbalanced among the servers, a large number of players are concentrated in a specific space, the server in charge of the space is overloaded, and the system may be down. Further, the position of the player changes at any time according to a player operation request. For this reason, instead of setting the server's assigned space uniformly in the vertical and horizontal directions as described above, predict the load and set the size and shape of the space according to the load. It is difficult.

Therefore, the game server device 1 monitors the load for each assigned space by the load monitoring unit 13, and subdivides the assigned space by the space dividing unit 14 when the load exceeds a threshold due to movement of the player or the like. For example, as an example of a method for subdividing the space, the space is subdivided vertically or horizontally so that the area of the region indicated by the two-dimensional coordinates is halved.
FIG. 7 illustrates a state in which the server 2 in charge of the space B subdivides the space B vertically by the space dividing unit 14 because the player concentrates on the space B and is overloaded. Space B is subdivided so that the left half is space B1 and the right half is space B2.

Regarding the subdivided space B, the server B 2 takes over the space B1, while the space B2 is allocated by adding a new server 2a. The server 2 migrates predetermined data to the new server 2a and causes the server 2a to take over the processing. This data includes the state data of the players existing in the space B2. Further, the server 2 updates its own server-space correspondence table T1, and indicates the area of the space B1, the server 2 in charge of the space B1, the area of the space B2, and the server 2a in charge of the space B2. Reflect that. As a result, spatial information corresponding to the spaces B1 and B2 is generated.
In addition, the server 2 is a server-space correspondence table of the distribution devices 2-1, 2-2,..., 2-n with respect to the distribution devices 2-1, 2-2,. A request to update T1 is made to reflect the area of space B1, the server 2 in charge of space B1, the area of space B2, and the server 2a in charge of space B2.

  In the game server device 1 in charge of the space (spaces A, C, and D in FIG. 7) adjacent to the space before the subdivision (space B in FIG. 7), the movement of the player existing in the space that the user is in charge of There is something that increases ahead (space D in FIG. 7). For this reason, the game server device 1 in which the movement destination increases needs to immediately recognize the increase in the movement destination and rearrange the replicas. Based on this, the space division notifying unit 15 of the server 2 that is in charge of the space B before being subdivided is sent to the server (1, 3, 4) that is in charge of the adjacent space (A, C, D). Notify the spatial information reflecting the division. The notification content of the space division notification unit 15 is, for example, if the shape of the assigned space (space B2 in FIG. 7) of the added new server (server 2a in FIG. 7) is a rectangle, etc. including.

  The game server device 1 in charge of the adjacent space of the subdivided space is based on the notification content from the space division notification unit 15 of the game server device 1 in charge of the space before subdivision by the boundary information calculation unit 16. Update its own boundary information. According to FIG. 8, the server 4 in charge of the space D adjacent to the subdivided spaces B1 and B2 causes the boundary information calculation unit 16 to perform boundary information on the space D (boundary information stored in the storage unit 30 of the server 4). T2) is updated to identify the adjacent spaces B1, B2 and the coordinates that make up the boundary of these spaces.

  The game server device 1 in charge of the space in which the number of adjacent spaces has increased is determined by the replica placement unit 12 based on the space information and the boundary information, to each of the subdivided spaces, and the state of the player existing in its own space Place a replica of the data. Therefore, even when the player is moving the subdivided space, the process can be taken over quickly by switching from the replica described above to the original. FIG. 8 shows how the server 4 arranges replicas of the player state p (original) of the space D in charge in the subdivided spaces B1 and B2.

  In addition, even if there is a subdivision of the space, the game server device 1 in which the number of adjacent spaces has not increased discards a replica of the player's state data that exists in the space that is no longer adjacent due to the subdivision. Although not explicitly shown in FIG. 8, the space B before the subdivision was adjacent to the spaces A and C. However, by subdividing the space B into the spaces B1 and B2, the space B2 is no longer a space. It is no longer adjacent to A and C. Therefore, for a player that exists in the space B before subdivision and exists in the space B2 after subdivision, the replica placement unit 12 of the server 2a in charge of the space B2 sends the corresponding state data to the space A, Process so as not to place in C.

  The functions described so far can be implemented by middleware, and have the advantage that they can be used universally regardless of the type of application.

(processing)
Next, processing of the game server device of this embodiment will be described.
FIG. 9 is a flowchart showing processing relating to the movement of the player to the adjacent space. This process starts from step S1.

  In step S <b> 1, the game server device 1 stores the original state data of the player in the storage unit 30 with respect to the player in charge in the own space by the original data management unit 11. In addition, the game server device 1 executes the player's operation process in response to a player operation request acquired from the client as needed by the original data management unit 11, and updates the original state data of the player.

  Next, in step S <b> 2, the game server device 1 uses the replica placement unit 12 to copy a replica of the state data of the player in charge to the adjacent space of the player's assigned space. At this time, as already described, the replica placement unit 12 can narrow down the replica placement destinations using the replica determination distance and the velocity vector of the player. In addition, the game server device 1 updates the replica of the state data of the player by the replica placement unit 12 in accordance with the update of the original state data of the player and copies it to the adjacent space.

  Next, in step S3, the game server device 1 determines whether or not the player in charge has moved to the adjacent space. If it has moved (Yes in step S3), it means that the player is no longer in charge, and the process proceeds to step S4. On the other hand, when it is not moving (No in step S3), it means that the game server device 1 continues to be in charge of the player, and the process returns to step S1.

  In step S4, the game server device 1 uses the replica placement unit 12 as an original copy of the destination replica copied in advance to another game server device 1 in charge of the adjacent space to which the player moves. Instruct to switch. In response to this instruction, the other game server device 1 uses the already-stored replica of the target player's state data as the original, and starts the operation process of the target player. Further, the replica placement unit 12 of the other game server device 1 instructs the game server device 1 to store the original state data of the target player as a replica.

  In step S5, the game server device 1 uses the original data management unit 11 as a replica in accordance with an instruction from the replica placement unit 12 of the other game server device 1 as a replica. Save in the storage unit 30.

According to the processing of FIG. 9, when a player moves to an adjacent space, the game server device in charge of the adjacent space copies the original copy that has already been copied, instead of transferring the state data of the player between the game server devices. The player's processing can be continued by switching to. Therefore, the processing delay and the play interruption associated with the state data transfer are avoided, and the service quality is not deteriorated.
Therefore, regarding a game server device that executes an online game by distributed processing, it is possible to reduce processing delay when the player of the online game moves from the current space to the adjacent space.

  Further, the replica placement distance can be narrowed down by using the replica determination distance and the player velocity vector, so that the replication load can be reduced.

  FIG. 10 is a flowchart showing processing relating to space subdivision. This process starts from step S11.

  In step S <b> 11, the game server device 1 monitors the load of the game server device 1 itself by the load monitoring unit 13.

  Next, in step S12, the game server device 1 uses the load monitoring unit 13 to load the game server device 1 itself with a preset threshold value (for example, stored in the storage unit 30 of the game server device 1). It is determined whether or not the number is exceeded. If the load exceeds the threshold (Yes in Step S12), it means that the game server device 1 is in an overload state, and the process proceeds to Step S13. On the other hand, if the load does not exceed the threshold value (No in step S12), it means that the game server device 1 is not overloaded, and the process returns to step S11.

  In step S <b> 13, the game server device 1 subdivides its own assigned space by the space dividing unit 14. At this time, the game server device 1 continues to take charge of one of the subdivided spaces and allocates the rest to the new game server device 1.

  In step S <b> 14, the game server device 1 updates the contents of its own server-space correspondence table T <b> 1 by the space dividing unit 14 to reflect the subdivision by the space dividing unit 14. At this time, spatial information of the subdivided space is generated. In addition, the game server device 1 has a server space of the sorting devices 2-1, 2-2,..., 2-n with respect to the sorting devices 2-1, 2-2,. Request to update the correspondence table T1. Each of the distribution devices 2-1, 2-2,..., 2-n updates its own server-space correspondence table T 1 to reflect the above subdivision.

  In step S <b> 15, the game server device 1 notifies the space information after subdivision to the adjacent server in charge of the adjacent space of the assigned space before subdivision by the space division notification unit 15. The boundary information calculation unit 16 of the adjacent server that has received the notification updates its boundary information according to the notification content.

  In step S <b> 16, the game server device 1 causes the replica placement unit 12 to copy a replica of the state data of the player in charge to the adjacent space in accordance with the subdivision by the space division unit 14. In addition, the game server device 1 updates the replica of the state data of the player by the replica placement unit 12 in accordance with the update of the original state data of the player and copies it to the adjacent space.

  According to the process of FIG. 10, since the new game server device can share the load with respect to the game server device that is overloaded due to the subdivision of the space, it is possible to avoid a system down. .

(Modification)
The replica placement unit 12 can place not only one state data replica but two or more state data in one adjacent space.
In addition, the space dividing unit 14 of the present embodiment can subdivide one space into not only two but also three or more. In this case, the dividing direction is not limited to the vertical and horizontal directions, and can be divided by diagonal lines, broken lines, and curved lines.

A technique obtained by appropriately combining various techniques described in the present embodiment can also be realized.
The software described in this embodiment can be realized as hardware, and the hardware can also be realized as software.
In addition, hardware, software, flowcharts, and the like can be changed as appropriate without departing from the spirit of the present invention.

DESCRIPTION OF SYMBOLS 1 Game server apparatus 2-1 to 2-n Distribution apparatus 3 Load balancer 4-1 to 4-n Client 10 Processing part 11 Original data management part 12 Replica arrangement | positioning part 13 Load monitoring part 14 Space division part 15 Space division notification part 16 Boundary information calculation unit 20 Communication unit 30 Storage unit T1 Server-space correspondence table T2 Boundary information D1 Original of state data D2 Replica of state data

Claims (5)

A stateful game server device in charge of a space obtained by dividing a game space into predetermined units,
An original data management unit for storing original state data of players existing in the space in charge of the player,
A replica placement unit that copies a replica of the state data to another game server device in charge of an adjacent space;
The original data management unit
When it is detected that the player in the adjacent space has moved to the space in charge of the player, a replica of the player's state data is stored as an original,
The game server apparatus characterized by the above-mentioned. The replica placement unit copies a replica of the player's state data to a game server device in charge of a space including a range extending a predetermined distance from the current position of the player.
The game server device according to claim 1. The replica placement unit predicts a space to move next from the velocity vector of the player, and copies a replica of the player's state data to the game server device in charge of the predicted space.
The game server device according to claim 1. A load monitoring unit for monitoring the load of its own game server device;
When the load exceeds a predetermined value, a space division unit that subdivides the space in charge of the load and allocates one of the subdivided spaces to a new game server device;
A space division notifying unit for notifying the other game server device in charge of the space adjacent to the space before the subdivision of the space information reflecting the subdivision;
A boundary information calculation unit that updates the boundary information of the space in charge when the space information is received from another game server device in charge of the space before the subdivision;
The game server device according to claim 1, wherein the game server device is a game server device. A distributed processing method in a stateful game server device in charge of a space obtained by dividing a game space into predetermined units,
The game server device is
A step of saving the original state data of the player existing in the space that he is in charge of;
Copying the state data replica to another game server device in charge of the adjacent space;
When it is detected that the player in the adjacent space has moved to the space in charge of the player, a step of storing a replica of the player's state data as an original is performed.
A distributed processing method.

Images