GEOGRAPHIC SPACE MANAGEMENT

• US 20160370185A1
• Filed: 06/25/2015
• Published: 12/22/2016
• Est. Priority Date: 06/19/2015
• Status: Active Grant

• Current Assignee: HCL Technologies Limited
• Original Assignee: International Business Machines Corporation
• Inventors: Gotoh, Yasuhisa, Miyahira, Tomohiro, Sasaki, Taku, Tanibayashi, Makoto
• Granted Patent: US 10,001,377 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G01C 21/20 Instruments for performing navigational calculations G01C21/24, G01C21/26 take precedence
• CPC Class Codes: G01C 21/26 specially adapted for navigation in a road network
• CPC Class Codes: G06F 9/505 considering the load
• CPC Class Codes: G06F 9/5083 Techniques for rebalancing the load in a distributed system
• CPC Class Codes: G06T 11/60 Editing figures and text; Combining figures or text
• CPC Class Codes: G06T 7/74 involving reference images or patches
• CPC Class Codes: H04L 67/1008 based on parameters of servers, e.g. available memory or workload monitoring of computer activity G06F11/30

Abstract

A system is provided that manages a geographic space including a route on which a moving object moves, including a plurality of subsystems operable to respectively manage maps of a plurality of regions obtained by dividing the geographic space, and a region manager operable to adjust loads of the subsystems by dynamically changing a boundary of at least one region among the plurality of regions. Also provided is a method and computer program product.

Claims

1. A method comprising:

respectively managing, with a plurality of subsystems, maps of a plurality of regions obtained by dividing a geographic space including a route on which a first moving object moves; and

adjusting a data processing load of at least one subsystem by changing a boundary of at least one region among the plurality of regions.

2. The method according to claim 1, wherein the respectively managing with the plurality of subsystems includes:

managing the first moving object positioned in a management target region from among a plurality of moving objects, and

beginning data processing relating to a second moving object that has become a new management target in response to the boundary of the management target region being changed.

3. The method according to claim 1, wherein

the beginning of data processing includes changing the boundary of the at least one region according to at least one of a number of moving objects positioned respectively in the plurality of regions and a data processing load relating to the moving objects positioned respectively in the plurality of regions.

4. The method according to claim 1, wherein

the beginning of data processing includes changing the boundary of the at least one region in a manner to decrease an amount of traffic crossing the boundary of the at least one region.

5. The method according to claim 1, further comprising:

changing the boundary of the at least one region to reduce at least one of a number of moving objects positioned within a partial range from the boundary and a data processing load relating to the moving objects positioned within the partial range from the boundary.

6. The method according to claim 1, further comprising:

managing at least one event occurring in a management target region; and

changing the boundary of the at least one region according to at least one of a plurality of numbers of events occurring respectively in the plurality of regions and a data processing load relating to the events.

7. The method according to claim 1, further comprising:

changing the boundary of the at least one region in a manner to decrease an amount of traffic crossing the boundary of the at least one region.

8. The method according to claim 1, further comprising:

changing the boundary of the at least one region when the boundary of the at least one region is positioned within a route portion where the traffic amount exceeds a reference traffic amount, to include the entirety of the route portion.

9. The method according to claim 1, further comprising:

calculating a complexity of a route network in each of the plurality of regions; and

changing the boundary of the at least one region according to the complexity.

10. The method according to claim 9, wherein the calculating the complexity of the route network is based on a history of processing loads of route searches performed in each of the plurality of regions.

11. The method according to claim 1, wherein the plurality of subsystems are realized respectively by a plurality of servers and a region manager is realized by at least one of the plurality of servers.

12. The method according to claim 1, further comprising:

transferring communication between the plurality of subsystems and a plurality of moving objects;

determining the region in which each of the moving objects is positioned based on position information received from each of the moving objects in response to a request from a gateway apparatus;

determining a subsystem that is to manage a map of each region from among the plurality of subsystems; and

transferring information received from each of the moving objects to the corresponding determined subsystems.