WO2010040179A1 - Utilisation de régions bornées dynamiques pour améliorer l'extensibilité d'environnements en ligne décentralisés - Google Patents

Utilisation de régions bornées dynamiques pour améliorer l'extensibilité d'environnements en ligne décentralisés Download PDF

Info

Publication number
WO2010040179A1
WO2010040179A1 PCT/AU2009/001331 AU2009001331W WO2010040179A1 WO 2010040179 A1 WO2010040179 A1 WO 2010040179A1 AU 2009001331 W AU2009001331 W AU 2009001331W WO 2010040179 A1 WO2010040179 A1 WO 2010040179A1
Authority
WO
WIPO (PCT)
Prior art keywords
region
bounded
peer
objects
computer program
Prior art date
Application number
PCT/AU2009/001331
Other languages
English (en)
Inventor
Scott Douglas
Santosh Kulkarni
David Churchill
Original Assignee
National Ict Australia Pty 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
Priority claimed from AU2008905220A external-priority patent/AU2008905220A0/en
Application filed by National Ict Australia Pty Ltd filed Critical National Ict Australia Pty Ltd
Priority to US13/122,684 priority Critical patent/US20110256935A1/en
Priority to EP09818684A priority patent/EP2350852A4/fr
Priority to AU2009301637A priority patent/AU2009301637A1/en
Publication of WO2010040179A1 publication Critical patent/WO2010040179A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • 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
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1044—Group management mechanisms 
    • H04L67/1053—Group management mechanisms  with pre-configuration of logical or physical connections with a determined number of other peers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
    • H04L67/1065—Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] 
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/131—Protocols for games, networked simulations or virtual reality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004—Server selection for load balancing
    • H04L67/1008—Server selection for load balancing based on parameters of servers, e.g. available memory or workload

Definitions

  • the present invention relates to information networks such as the Internet, and in particular relates to the provision of a multi-user network, such as an online gaming environment, in a manner which is scalable to a large number of users.
  • Multi-user networks may be required for a range of reasons.
  • Among the most resource intensive of such multi-user networks are multi-user online gaming environments. Online gaming environments increasingly involve a complex and large virtual environment which is desired to be portrayed or rendered in as much detail as possible, in as close to real time as possible, in order to provide users or game players with a more realistic gaming experience. Further, an ever increasing number of users wish to participate together within such a gaming environment. Thus, large data volumes, high data rates and high data complexity is generally required in order to manage large numbers of users participating in real time in a spatially complex and highly detailed virtual environment.
  • MMO massively multiplayer online
  • a game publisher desiring to deploy an online gaming environment generally must establish a central game server with sufficient resources to handle game sessions for many hundreds or thousands of participants.
  • a client-server architecture is used to host such applications.
  • Server farms provide the necessary infrastructure to maintain the persistent state and handle all the processing required for sending and receiving the updates in real-time.
  • This architecture based on central servers is inflexible as it is extremely expensive, as servers with sufficient processing power to function in this manner are expensive, leading to high deployment costs for game publishers.
  • One proposal is to provide a server farm, upon which multiple game developers may centrally host their games, which can reduce deployment costs to a certain extent.
  • any system utilising central gaming servers involves substantial expense associated with the gaming servers.
  • central gaming servers presents a single point of failure. Consequently, any power failure, server failure or network connection failure or deterioration at the central gaming server can cause the entire gaming environment to deteriorate or fail.
  • Central gaming servers also suffer from performance problems when MMO applications become overpopulated. Central servers have a limited capacity and can handle a certain number of users. When the number of users increases beyond this number, they experience performance problems and the user experience is compromised.
  • the present invention provides a method for efficiently allocating object responsibility to a controlling peer in a decentralised multi-user online virtual environment, the method comprising: dividing the virtual environment into a plurality of cells, and allocating control of each cell to a responsible peer, each responsible peer participating in a distributed hash table (DHT) to effect integration of the cells to effect the virtual environment; upon a communications and processing load on the responsible peer controlling a cell exceeding a threshold, a second peer creating and taking control responsibility for an object comprising a bounded interest management region covering a region of load; and within the bounded interest management region, removing objects from the associated cell and associating them with the bounded interest management region.
  • DHT distributed hash table
  • the present invention provides a peer node software application for efficiently allocating object responsibility to a controlling peer in a decentralised multi-user online virtual environment, the software application comprising: code for dividing the virtual environment into a plurality of cells, and for allocating control of each cell to a responsible peer, each responsible peer participating in a distributed hash table (DHT) to effect integration of the cells to effect the virtual environment; code for determining whether a communications and processing load on the responsible peer controlling a cell has exceeded a threshold, and if so causing a second peer to create and take control responsibility for an object comprising a bounded interest management region covering a region of load; and code for removing objects within the bounded interest management region from the associated cell and associating them with the bounded interest management region.
  • DHT distributed hash table
  • the present invention provides a computer program product comprising computer program code means to make a computer execute a procedure for efficiently allocating object responsibility to a controlling peer in a decentralised multiuser online virtual environment
  • the computer program product comprising: computer program code means for dividing the virtual environment into a plurality of cells, and for allocating control of each cell to a responsible peer, each responsible peer participating in a distributed hash table (DHT) to effect integration of the cells to effect the virtual environment; computer program code means for determining whether a communications and processing load on the responsible peer controlling a cell has exceeded a threshold, and if so causing a second peer to create and take control responsibility for an object comprising a bounded interest management region covering a region of load; and computer program code means for removing objects within the bounded interest management region from the associated cell and associating them with the bounded interest management region.
  • DHT distributed hash table
  • the present invention provides a system comprised of a plurality of network nodes configured to execute the method of the first aspect.
  • the present invention provides a development platform software application enabling game developers to design multi-player online games in which object responsibility is allocated in accordance with the first aspect.
  • the bounded interest management (IM) region is configured to contain all objects in the load region, so as to reduce network traffic associated with DHT redundancy.
  • the size of the bounded IM region may be altered as the region of load changes size over time.
  • the location of the bounded IM region may be altered as objects within the region of load move over time.
  • Additional or alternative embodiments of the invention may provide for calving off of a second bounded IM region when objects within a first established IM region disperse beyond a maximum region size threshold.
  • two or more bounded IM regions may be merged when they happen to come into proximity.
  • associated objects are re-associated directly with the DHT.
  • the present invention may be applied in implementation of a massively multiplayer online game (MMOG). Additionally or alternatively, the present invention may be applied to implement an alternative form of peer-to-peer platform and application.
  • MMOG massively multiplayer online game
  • Figure 1 schematically illustrates a logical view of peer nodes connected in a ring and having responsibility for respective cells of a peer-to-peer virtual world
  • Figure 2 illustrates the manner in which objects are inserted and interest region queries are made, using the logical view of Figure 1 ;
  • Figure 3 illustrates the manner in which a bounded interest management region is established in accordance with an embodiment of the present invention, using the logical view of Figure 1;
  • Figure 4 illustrates the manner in which two bounded interest management regions can be merged in accordance with an embodiment of the present invention
  • Figure 5 illustrates the manner in which a dispersing bounded interest management region may be split into two bounded interest management regions in accordance with an embodiment of the present invention
  • Figure 6 illustrates a bounded region having two sub-groups
  • Figure 7 illustrates a general-purpose computing device that may be used in an exemplary system for implementing the invention. Description of the Preferred Embodiments
  • the embodiment of the invention described in the following relates to a peer-to-peer platform for deploying massively multi -player online games (MMOG).
  • MMOG massively multi -player online games
  • the present embodiment improves the scalability of decentralised MMOGs.
  • the present embodiment provides for a bounded interest management (IM) service as an additional layer between the objects and the distributed hash table (DHT).
  • IM bounded interest management
  • DHT distributed hash table
  • the present invention recognises that decentralised architectures for deploying an online environment may be used to avoid the problems of centralized gaming servers.
  • decentralized architectures use a peer-to-peer network to manage the MMO, there is no central point of failure and the platform can theoretically scale to a greater number of users.
  • the present invention particularly recognises that when using a structured peer-to-peer network there exists additional overhead in maintaining a distributed hash table (DHT).
  • DHT distributed hash table
  • a DHT is necessary in such architectures as it provides reliability and consistency by replicating game state data several times. However, this puts an additional load on the network and affects the performance of the application that uses the peer-to-peer network.
  • the present invention recognises that such additional load can be a serious problem for near real-time applications such as virtual worlds and online games.
  • the present embodiment of the invention is thus related to a method that reduces the load on the DHT thereby improving the performance and scalability of the application.
  • a peer-to-peer virtual world the entire world is divided into cells.
  • each cell is controlled by a peer in the network.
  • Figure 1 shows a logical view of all the peers connected in the form of a ring.
  • cell Cl is controlled by peer Pl, and so on.
  • All the objects (e.g. players) in a cell send and receive discovery messages to and from the controlling peer to obtain and return game state information about that cell.
  • Discovery messages convey information about remote objects that each object should communicate with.
  • this embodiment implements a bounded interest management (IM) region to address this problem.
  • IM bounded interest management
  • a bounded IM region represents an interest management service that handles interest management in a given region of space, similar to a cell. Unlike a cell, a bounded IM region is dynamic; ' it can move around in the virtual space and be resized as required. Furthermore, a bounded IM region is an object, so it can be inserted into other interest management services (e.g. cells or other bounded IM regions). A bounded IM region can take on any shape supported by the underlying object system.
  • Operation of the system begins with objects inserting themselves and their interest regions into the appropriate cells on the DHT.
  • a bounded IM region is created covering the loaded region, and the bounded IM region is inserted into the DHT.
  • Detection of excessive load can be performed by any appropriate method.
  • the new bounded IM region would normally be created on an unloaded peer having capacity to manage the bounded IM region.
  • Peer nodes responsible for affected cells will detect intersections between the inserted bounded IM region and the existing objects in the space, and notify these objects of the new service. In turn, these objects remove their regions from the cells and insert them into the bounded IM region.
  • the bounded IM service will send a notification to the object informing it that it has separated from the DHT.
  • the net effect is that only one region is inserted into the DHT covering all of the objects, significantly reducing traffic associated with ensuring redundancy on the DHT.
  • bounded IM regions may be established to manage multiple regions of high load in the virtual space.
  • objects are free to enter or leave areas of the virtual space covered by bounded IM regions at any time.
  • the interest management services will inform them of intersections/separations with bounded IM regions and the DHT, and IM subscriptions can then be updated as required.
  • bounded IM regions can move or resize as required to minimize network traffic and the interest management notifications will still ensure consistency of IM subscriptions.
  • the present embodiment further provides for merging and splitting of bounded IM regions.
  • two bounded IM regions intersect in the manner shown in Figure 4, their controlling nodes are notified of each other by the cell in which the intersection arises.
  • the controlling nodes then initially control the intersecting event between the respective IM regions by inserting all objects in each bounded IM region into the other, to ensure all objects are notified of all bounded IM regions that they overlap.
  • the present embodiment achieve this by enlarging one of the regions to encompass the union of the regions, and then removing the other regions.
  • the present embodiment further provides for splitting of a bounded IM region into multiple regions, which can be done by shrinking the original region and introducing one or more new regions as required to encompass the excluded portions, as illustrated in Figure 5.
  • bounded IM regions have a default size when first established. However, they can be increased in size to accommodate additional objects.
  • the present embodiment imposes a maximum limit, recognising that excessively increasing the size of the bounded IM regions will reduce system performance.
  • the maximum limit in this embodiment is based on several parameters such as the visible region size, cell size of the virtual world, and the like. If a bounded IM region has reached its maximum size, it will not merge with a partially intersecting bounded IM region as it will result in its size increasing beyond the maximum value allowed.
  • This embodiment further imposes a maximum limit on the number of objects a bounded IM region can handle. Once a bounded IM region reaches this limit, it will not merge with another bounded IM region even if the two bounded IM regions overlap each other completely.
  • the bounded IM region in this embodiment moves with them. This ensures that the objects and their interest regions are always enclosed within the bounded IM regions. If a particular object moves further away from the rest of the objects within a bounded IM region, the bounded IM region will try and increase its size to accommodate and enclose that object. If the bounded IM region is not able to enclose that object because the bounded IM region has reached its maximum size, the object is split from the bounded IM region and a new bounded IM region is created.
  • the present embodiment further recognises that it is possible that bounded IM regions can fail or lose connectivity (temporarily or permanently) with the objects in its region or the DHT. When this happens, all the objects and the interest regions are set to revert to communicating directly with the DHT, and new bounded IM regions will then be formed anew, under the responsibility of a different peer node having connectivity. This provides a fall back mechanism for discovery in the event of a bounded IM region failure, ensuring that bounded IM regions can recover from network and device failures in a smooth manner without loss of connectivity to the individual peers.
  • one of the key benefits of using this embodiment of the invention is a significant reduction in the traffic overheads associated with the DHT (Distributed Hash Table). This reduces the load on the DHT and improves the overall performance of the system significantly.
  • the invention can be embodied in a number of forms.
  • Such forms include a technology suite for MMO developers and publishers, providing a generic platform that can be optimised for any MMO application.
  • Such a platform would provide the technology for the networking protocols and handle all the routing and messaging allowing game developers to devote less time to the communications aspects of the game and focus on content development.
  • the invention may be embodied in a peer node software application provided to peer nodes to implement the invention in the manner described.
  • Further optimization of this invention may involve efficient encoding of network traffic, suppression of un-required interest notifications, and improvements to algorithms which position/size IM regions.
  • a dynamic bounded interest management region in accordance with this embodiment of the invention is thus a region in space that can be of any shape and size. Unlike a cell, a bounded interest management region is dynamic and can move around in space and resize itself as required. Furthermore, a bounded region is an entity, so it can be inserted into other interest management services (e.g. cells or other bounded IM regions).
  • a bounded IM region can take on any shape supported by the underlying object system. For evaluation purposes, we have assumed a bounded region to have the shape of a sphere. It has a position and a radius.
  • Dynamic bounded regions introduce an additional level in the discovery process.
  • Each entity and its associated interest region are managed by a bounded interest management region.
  • the bounded region queries the DHT to find out about other entities and other bounded regions of interest.
  • the entities and the interest region query their bounded region to identify any remote objects of interest.
  • the bounded region is controlled by a manager.
  • the region manager task for a particular bounded region is assigned to a peer on the network. The peer selection is made in such a way that the load is distributed across the network.
  • the bounded region is maintained by the local peer (the peer that controls the entity). This eliminates the communication overheads between the entity and the bounded region.
  • Operation of the system begins with entities creating a bounded region and inserting themselves and their interest region in the bounded region.
  • the bounded region inserts itself into the DHT using the cell protocol. Cells will detect intersections between the inserted bounded region and existing objects in the space, and notify these objects of the new service. In turn, these objects will remove their regions from the cells and insert them into the bounded region. If an object is fully contained by the bounded region, the bounded region service will send a notification to the object to inform the object that it has separated from the DHT. The net effect is that only one region is inserted into the DHT that covers all the objects, significantly reducing the traffic associated with DHT replication.
  • Entities are free to enter or leave areas of space covered by. bounded regions at any time.
  • the interest management services will inform them of intersections/separations with bounded interest management regions and the DHT.
  • Interest management subscriptions can then be updated as required.
  • bounded regions can move or resize as required to minimize network traffic.
  • Interest management notifications will ensure consistency of interest management subscriptions.
  • Bounded regions have a default size. However, they can grow and shrink in size to accommodate multiple entities. There is a maximum size limit that is calculated in order to optimize system performance. Bounded regions can merge (Fig. 4) with other regions or they can split (Fig. 5) into multiple bounded regions depending on the movement of the entities within the region.
  • the behaviour of bounded regions can be described by the following algorithms. Let us assume that there is a bounded region B 1 that contains N entities O h O 2 , ..., ON- Every time an entity moves out of its subscription region, it will send a request to the bounded region. This will in turn call the Modify _RegionQ function. To understand the algorithms, we introduce the concept of sub-groups.
  • Entities within a region are categorised into sub-groups depending on the overlap of their interest regions. All entities within a sub-group have some degree of overlap or are connected via other entities. For example, in Figure 6, bounded region X has two sub-groups. Even though the interest region for entities A and C do not intersect each other, they are part of the same sub-group as they are connected via entity B.
  • the algorithm for Modify _Region, Merge and Split are as follows:
  • Bounded regions can fail or lose connectivity (temporarily or permanently) with the various entities in its region or the DHT. When this happens, all the entities and the interest regions revert to using the cell protocol, and new bounded regions will be formed from scratch. This provides a fall-back mechanism for interest management in the event of a bounded region failure, ensuring that bounded regions can recover from network and device failures in a smooth manner without loss of connectivity.
  • the present invention also relates to apparatus for performing the operations herein.
  • This apparatus may be specially constructed for the required purposes, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer.
  • a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.
  • ROMs read-only memories
  • RAMs random access memories
  • EPROMs electrically erasable programmable read-only memories
  • EEPROMs electrically erasable programmable read-only memory
  • magnetic or optical cards or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.
  • the algorithms and displays presented herein are not inherently
  • a machine-readable medium includes any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer).
  • a machine-readable medium includes read only memory ("ROM”); random access memory (“RAM”); magnetic disk storage media; optical storage media; flash memory devices; electrical, optical, acoustical or other form of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.); etc.
  • FIG. 7 the invention is illustrated as being implemented in a suitable computing environment.
  • program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types.
  • program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types.
  • program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types.
  • program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types.
  • the invention may be practiced with other computer system configurations, including hand-held devices, multi-processor systems, microprocessor- based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like.
  • the invention may be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network.
  • program modules may be located in both local and remote memory storage devices.
  • a general purpose computing device is shown in the form of a conventional personal computer 20, including a processing unit 21, a system memory 22, and a system bus 23 that couples various system components including the system memory to the processing unit 21.
  • the system bus 23 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures.
  • the system memory includes read only memory (ROM) 24 and random access memory (RAM) 25.
  • ROM read only memory
  • RAM random access memory
  • a basic input/output system (BIOS) 26 containing the basic routines that help to transfer information between elements within the personal computer 20, such as during start-up, is stored in ROM 24.
  • the personal computer 20 further includes a hard disk drive 27 for reading from and writing to a hard disk 60, a magnetic disk drive 28 for reading from or writing to a removable magnetic disk 29, and an optical disk drive 30 for reading from or writing to a removable optical disk 31 such as a CD ROM or other optical media.
  • a hard disk drive 27 for reading from and writing to a hard disk 60
  • a magnetic disk drive 28 for reading from or writing to a removable magnetic disk 29
  • an optical disk drive 30 for reading from or writing to a removable optical disk 31 such as a CD ROM or other optical media.
  • the hard disk drive 27, magnetic disk drive 28, and optical disk drive 30 are connected to the system bus 23 by a hard disk drive interface 32, a magnetic disk drive interface 33, and an optical disk drive interface 34, respectively.
  • the drives and their associated computer-readable media provide nonvolatile storage of computer readable instructions, data structures, program modules and other data for the personal computer 20.
  • the exemplary environment shown employs a hard disk 60, a removable magnetic disk 29, and a removable optical disk 31, it will be appreciated by those skilled in the art that other types of computer readable media which can store data that is accessible by a computer, such as magnetic cassettes, flash memory cards, digital video disks, Bernoulli cartridges, random access memories, read only memories, storage area networks, and the like may also be used in the exemplary operating environment.
  • a number of program modules may be stored on the hard disk 60, magnetic disk 29, optical disk 31, ROM 24 or RAM 25, including an operating system 35, one or more applications programs 36, other program modules 37, and program data 38.
  • a user may enter commands and information into the personal computer 20 through input devices such as a keyboard 40 and a pointing device 42.
  • Other input devices may include a microphone, joystick, game pad, satellite dish, scanner, or the like.
  • These and other input devices are often connected to the processing unit 21 through a serial port interface 46 that is coupled to the system bus, but may be connected by other interfaces, such as a parallel port, game port or a universal serial bus (USB) or a network interface card.
  • a monitor 47 or other type of display device is also connected to the system bus 23 via an interface, such as a video adapter 48.
  • personal computers typically include other peripheral output devices, not shown, such as speakers and printers.
  • the personal computer 20 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 49.
  • the remote computer 49 may be another personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the personal computer 20, although only a memory storage device 50 has been illustrated.
  • the logical connections depicted include a local area network (LAN) 51 and a wide area network (WAN) 52.
  • LAN local area network
  • WAN wide area network
  • the personal computer 20 When used in a LAN networking environment, the personal computer 20 is connected to the local network 51 through a network interface or adapter 53. When used in a WAN networking environment, the personal computer 20 typically includes a modem 54 or other means for establishing communications over the WAN 52.
  • the modem 54 which may be internal or external, is connected to the system bus 23 via the serial port interface 46.
  • program modules depicted relative to the personal computer 20, or portions thereof may be stored in the remote memory storage device. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Computing Systems (AREA)
  • Mathematical Physics (AREA)
  • Computer Hardware Design (AREA)
  • Computer And Data Communications (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

Dans un environnement virtuel en ligne multi-utilisateur décentralisé, une responsabilité d'objet est efficacement allouée à un poste de commande. L'environnement virtuel est divisé en une pluralité de cellules, et la commande de chaque cellule est allouée à un poste responsable. Chaque poste responsable participe à une table de hachage distribuée (DHT) pour effectuer une intégration des cellules en vue d'assurer l'environnement virtuel. Lorsque qu'une charge de communications et de traitement sur le poste responsable commandant une cellule dépasse un seuil, un second poste crée et prend la responsabilité de commande pour un objet comprenant une région de gestion d'intérêt bornée qui recouvre une région de charge. Dans la région de gestion d'intérêt bornée, des objets sont retirés ou désassociés de la cellule associée et, en remplacement, associés à la région de gestion d'intérêt bornée.
PCT/AU2009/001331 2008-10-08 2009-10-08 Utilisation de régions bornées dynamiques pour améliorer l'extensibilité d'environnements en ligne décentralisés WO2010040179A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
US13/122,684 US20110256935A1 (en) 2008-10-08 2009-10-08 Use of dynamic bounded regions to improve the scalability of decentralised online environments
EP09818684A EP2350852A4 (fr) 2008-10-08 2009-10-08 Utilisation de régions bornées dynamiques pour améliorer l'extensibilité d'environnements en ligne décentralisés
AU2009301637A AU2009301637A1 (en) 2008-10-08 2009-10-08 Use of dynamic bounded regions to improve the scalability of decentralised online environments

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
AU2008905220 2008-10-08
AU2008905220A AU2008905220A0 (en) 2008-10-08 Use of dynamic bounded regions to improve the scalability of decentralised online environments

Publications (1)

Publication Number Publication Date
WO2010040179A1 true WO2010040179A1 (fr) 2010-04-15

Family

ID=42100145

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/AU2009/001331 WO2010040179A1 (fr) 2008-10-08 2009-10-08 Utilisation de régions bornées dynamiques pour améliorer l'extensibilité d'environnements en ligne décentralisés

Country Status (5)

Country Link
US (1) US20110256935A1 (fr)
EP (1) EP2350852A4 (fr)
KR (1) KR20110079671A (fr)
AU (1) AU2009301637A1 (fr)
WO (1) WO2010040179A1 (fr)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8972870B2 (en) * 2009-08-27 2015-03-03 International Business Machines Corporation Providing alternative representations of virtual content in a virtual universe
US20120079121A1 (en) * 2010-09-28 2012-03-29 Disney Enterprises, Inc System and method for dynamic adaptive player cells for multi-player environments
KR102034760B1 (ko) 2018-12-31 2019-10-22 지앤에스건설 주식회사 긴장시스템을 도입한 일체형 현장타설 말뚝 시공방법이 적용된 구조
KR102546153B1 (ko) 2022-08-01 2023-06-20 함정아 횡방향 지지력이 증가된 교량용 말뚝 및 그 시공방법

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040064512A1 (en) * 2002-09-26 2004-04-01 Arora Akhil K. Instant messaging using distributed indexes
US20050114862A1 (en) * 2003-11-21 2005-05-26 Chatschik Bisdikian Adaptive load distribution in managing dynamic and transient data for distributed applications
US20060168107A1 (en) * 2004-03-16 2006-07-27 Balan Rajesh K Generalized on-demand service architecture for interactive applications
US20080104609A1 (en) * 2006-10-26 2008-05-01 D Amora Bruce D System and method for load balancing distributed simulations in virtual environments

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008533564A (ja) * 2005-02-24 2008-08-21 ゼラウンド システムズ リミテッド データ管理のための方法および装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040064512A1 (en) * 2002-09-26 2004-04-01 Arora Akhil K. Instant messaging using distributed indexes
US20050114862A1 (en) * 2003-11-21 2005-05-26 Chatschik Bisdikian Adaptive load distribution in managing dynamic and transient data for distributed applications
US20060168107A1 (en) * 2004-03-16 2006-07-27 Balan Rajesh K Generalized on-demand service architecture for interactive applications
US20080104609A1 (en) * 2006-10-26 2008-05-01 D Amora Bruce D System and method for load balancing distributed simulations in virtual environments

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2350852A4 *

Also Published As

Publication number Publication date
EP2350852A4 (fr) 2013-03-13
AU2009301637A1 (en) 2010-04-15
KR20110079671A (ko) 2011-07-07
EP2350852A1 (fr) 2011-08-03
US20110256935A1 (en) 2011-10-20

Similar Documents

Publication Publication Date Title
Hu et al. Voronoi state management for peer-to-peer massively multiplayer online games
Santos et al. Vector-field consistency for ad-hoc gaming
US20100113159A1 (en) Method and apparatus for partitioning virtual worlds using prioritized topic spaces in virtual world systems
JP2010525423A (ja) 人工環境に動的コンテンツを導入する分散ネットワークアーキテクチャ
KR20120040240A (ko) Ｐ２ｐ 네트워크의 가상 환경을 위한 관심 관리
Douglas et al. Enabling massively multi-player online gaming applications on a p2p architecture
US20110256935A1 (en) Use of dynamic bounded regions to improve the scalability of decentralised online environments
Veiga et al. Unifying divergence bounding and locality awareness in replicated systems with vector-field consistency
CN112988377B (zh) 用于云服务的资源分配方法、系统和介质
Chang et al. Scalable and efficient update dissemination for distributed interactive applications
Beskow et al. Latency reduction in massively multi-player online games by partial migration of game state
CN114047918A (zh) 任务处理方法、装置、设备、存储介质及产品
Diaconu et al. Manycraft: Scaling minecraft to millions
Lee et al. Load-balancing for peer-to-peer networked virtual environment
Behnke Increasing the supported number of participants in distributed virtual environments
Almashor et al. Automatic and autonomous load management in peer-to-peer virtual environments
Wang et al. A Grid-enabled Multi-server Network Game Architecture.
Behnke et al. QuP: graceful degradation in state propagation for DVEs
CN116637358B (zh) 一种数据传输的方法、相关装置、设备以及存储介质
Vik Game state and event distribution using proxy technology and application layer multicast
David et al. Improving scalability in MMOGs-scalamo: A new architecture
Bamutange et al. Zoneless load balancing for massively multiplayer online games
Maamar et al. Energy management control for supplying partner selection protocol in mobile peer‐to‐peer three‐dimensional streaming
US10831552B1 (en) Using map-reduce to increase processing efficiency of small files
Wang et al. A finding less-loaded server algorithm based on mmog and analysis

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 09818684

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2009301637

Country of ref document: AU

Date of ref document: 20091008

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 20117009338

Country of ref document: KR

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 2009818684

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 13122684

Country of ref document: US