1. Field of the Invention
The present invention relates generally to computer networks and, more particularly, to creating an interactive gaming environment over a computer network.
2. Description of the Related Art
Computer networks, such as local area networks and the Internet, are increasingly being used as the backbone for various transactions and interactions between parties. From online banking, where bank customers can initiate financial transactions over a computer network, to online gaming, where garners can participate in real-time gaming over the Internet, service providers are increasingly supporting a variety of services over computer networks. There are currently a variety of different computer network configurations that facilitate the transactions and interactions that take place.
Many of the online applications involve multi-user applications, which are computer programs that are executed on a computer system and which allow multiple geographically separated participants to interact with the computer program and other participating users in an application environment. For example, gaming is a popular multi-user application that is increasing in popularity. An aircraft simulation game can enable multiple participants to pilot their respective virtual aircraft within an airspace, and can enable the participants to interact with other participants in their aircraft in the same airspace. Thus, the online gaming application provides a single application environment or universe in which multiple participants maneuver.
To support multi-user applications, such as online gaming, with geographically dispersed application users, such as game participants, and to support real-time interaction among the users in the application environment, it has been necessary to share information about every participant in the environment. For example, in an aircraft simulation application, it becomes necessary to share information about the airplanes for each of the participants, including aircraft size, speed, altitude in three-dimensional space, appearance details, virtual environment details (such as buildings and terrain), and the like. Such information permits the computer at each participant to properly keep track of game developments and determine the actions being performed by each of the participants. This permits each participant to obtain properly rendered visual images on the participant's viewing display.
The amount of information that must be shared among all of the participants can become daunting and can result in bandwidth difficulties. The amount of information that must be shared among participants is so great that it has inhibited the development of online gaming and other online multi-user applications. A technique for distributing the management of online applications is described in U.S. Pat. No. 5,841,980 to R. Waters et al. entitled Distributed System for Communication Networks in Multi-User Applications.
The '980 patent describes a system configuration in which the functionality of a monolithic server is distributed across multiple servers, each of which services a number of local users. Thus, whereas a single server previously served as the source of all application information, such as game state, the '980 patent describes a situation in which the game server functionality is distributed across multiple computers. Users (on-line participants) are free to login to their most convenient server. In this way, there is no single “choke point” that might inhibit game play, and the bandwidth requirements for the online game community are reduced. Even with the reduction in overall bandwidth demands, the sheer volume of data that must be transmitted between users to support the online environment can result in local pockets of strained bandwidth capacity.
Other multi-user applications provide a somewhat cumbersome user interface and can be inefficient for operation of the application server. For example, some online gaming portals provide links to game sites of interest. The server that provides the gaming portal Web site only provides links to game pages or game Web sites. Thus, the gaming portal will redirect a user to the appropriate game server or host for information about ongoing games. This places additional operational burdens on the game servers.
Unfortunately, current multi-user applications are not configured for maximum efficiency of operation and cannot support a number of application users to make online gaming a viable opportunity. Thus, there is a need for an improved, more efficient online multi-user application environment. The present invention satisfies this need.
The present invention provides for creating an interactive gaming environment. In various embodiments, methods of the present invention may include initializing an interactive game application at a game server which is then characterized as having an active status, notifying a lobby server concerning the active status of the game server, registering the application with a universe management server via the lobby server, and allowing users to join the interactive gaming environment. The users joining the interactive gaming environment may be identified by a server key obtained from the game server.
System Construction
After an authentication server 104 authorizes a user 102 to continue, the user can participate in an online multi-user application by first communicating with lobby servers 110 to obtain application-level information. The application-level information can include information about an application and its participating users. In the context of an online game application, for example, the lobby server 110 can provide information about the game and about currently participating users. After selection of an online multi-user application, the user is redirected to an appropriate application server 112, from which the user receives information sufficient to permit the user to join the online environment of the multi-user application. Thus, application level information is maintained at a lobby server 110, rather than at each individual application server or host machine 112. Users can therefore learn about and select a desired application, such as an aircraft online game, through communication with the lobby server, leaving the application servers free to host their particular applications.
In
Thus, the functionality of the game server is split between the lobby server and the application server. The lobby server can therefore reduce the bandwidth requirements and other operating demands on the application server. The application can comprise, for example, a multi-user interactive gaming application. This improves efficiency of operation.
In accordance with the invention, cross-user communications as well as cross-application communications in real-time are facilitated through the lobby server concept. A user who is participating with one application can communicate with a user who is participating with a different application. Thus, a first user can be logged in to lobby server and can be participating in an aircraft online game environment through an application server, while a second user can be logged in to the same lobby server, but can be participating with a different application in a different programming environment, such as a financial package or a different online game. The first user and the second user can communicate with each other, if they wish, or they can choose to participate in their respective environments, isolated from each other in terms of communications.
The universe manager 108 acts in an overall supervisory role, maintaining information about the users (clients) 102 who are registered with the system and logged on, communicating with the users via the authorization servers 104, lobby servers 110, and application servers 112. The lobby servers 110 provide application level information to the users, thereby acting as an application portal and source of application information to the clients 102. For example, unlike typical game portal servers that merely provide links to game sites, the lobby servers provide information about games in progress and can provide game-level information, such as information about the players who are actively participating in a game. The application servers 112 provide the actual application environment. For example, in the situation where the online application is a game, the application servers provide the actual game play environment comprising player participants, audio and graphics information, and other data necessary for a client 102 to fully participate in the online gaming experience for the game administered by the particular application server 112. In this way, many tasks that must be performed to support system operation can be performed according to the most appropriate machine to perform the task.
As noted above, the authentication servers 104 communicate with database servers 106 for authentication, application information, and the like.
System Operation
In the first operation, represented by the flow diagram block 301, a user connects to a network domain name, such as a game portal or other Internet site to attempt access and login to a multi-user application, such as an online game. In the next operation, the user is redirected to one of the authentication servers. This operation (represented by block 302) can include operation through a load balancer or similar configuration for server workload management. At the next block 303, the user is assigned a session key by an authentication server. The session key will remain active during the current online session by the user and will be associated with a privilege level, thereby providing a means for the various system components (illustrated in
At the next block 307, the authentication data server communicates directly with the authentication database to determine whether the user's login should be accepted. This operation can involve, for example, checking the user's account history to ensure all appropriate fees have been paid and to ensure the user has all authorizations or qualifications to proceed. To maintain the user's history, this operation 307 also involves sending the transaction record (login attempt) to the transaction data server for non-volatile storage. This recording operation also can involve a load balancing operation.
The success or failure of the login attempt is reported back to the authentication server, at the next block 308. The login result is forwarded back to the user and also to the transaction data server. At the next block 309, similar processing operations are repeated for the user name login procedure. Yet another similar login sequence occurs for the user's screen name, along with an application identification, as indicated at the block 310. If the screen name login is successful, then the authentication server will assign the user to a lobby server and will also promote the session privilege level to the Universe Manager, so that the user will be granted all appropriate access during the session. It should be noted that the authentication server is aware of the lobby servers that are available corresponding to the application ID provided by the user, by requesting an appropriate application server from the Universe Manager. The Universe Manager keeps track of the available lobby servers via “heartbeat” reports that are sent by lobby servers to the Universe Manager continuously while the lobby servers are operational. This processing is represented by the next block 310.
Next, at the block 311, the user disconnects from the authentication server and establishes communication with the assigned lobby server. At the block 312, the user verifies the session key that was obtained from the authentication server at block 303 and also verifies the application ID with the assigned lobby server. The lobby server verifies the data, as well as the privilege level, with the Universe Manager. The user's privilege is upgraded upon successful verification.
In the next phase of system operation, at block 313, the user has successfully completed login with a lobby server and therefore is entitled to participate in system-wide functions. These functions can include, for example, chat, group or community management, player-matching activities such as team or clan tasks, and outcome or competitive standings and ladder progress. Any requests from the user for information regarding available chat channels, available games, location of other users, messaging functions, and the like, the request is forwarded from the lobby server to the Universe Manager. If a request for information involves the non-volatile storage, then the request is forwarded to the appropriate database server (
One of the system-wide functions that a user might want to participate in following successful connection with a lobby server can comprise using an application. In the context of an online gaming environment, that application is a game. Those skilled in the art will appreciate that other online multi-user applications can be involved. As noted above, the clients can participate in online gaming as either part of a client-server configuration or peer-to-peer configuration, or as part of an integrated application server and client configuration.
In
In the next block 416, the user is connected with the assigned application server, providing it with the server-specific key it received from block 415. The user will be disconnected from the application server if the server-specific key does not match the records at the application server. If there is a match, the user is allowed to remain connected with the application server. It should be noted that the user remains connected to a lobby server throughout use of the application, such as during a game playing session. At block 417, periodic user reports are sent from an application-participating user back to the user's lobby server. In addition, the application server who is hosting the application for all participants (such as the game host) sends periodic reports on the status of the application to the application host. The lobby server and application server do not directly communicate, thereby better managing the processing load on the lobby server.
At the conclusion of the application session (block 418), the user disconnects from the application server and returns to normal activities, including all available lobby functions through the lobby server. As noted, these functions can include chat, group or community management, messaging, and the like. It should be noted that these functions are available to the user at all times when the user is connected to the lobby server, including during application use (e.g., during game play).
If the user performs a logout procedure, or if the user is timed out from an active connection because of inactivity, the user's session is cleared from the active records of the Universe Manager. This is indicated at the next block, 419. If the user wishes to participate in another application, the user must go through the authentication process once again, including the login process.
Rather than operate in a network configuration in which applications are provided by dedicated application servers, the network can also operate in a configuration in which the multi-user application is provided by integrated servers. An integrated server refers to a user (client) machine that has been configured with an integrated server application that provides the user machine with application server functionality. A system that implements this method of operation is described in co-pending U.S. patent application Ser. No. 09/704,514 by C. Guy, G. Van Datta, and J. Fernandes entitled “Application Development Interface for Multi-User Applications Executable Over Communication Networks” filed Nov. 1, 2000. The disclosure of this application is hereby incorporated by reference. As noted above, when a user wants to join a game, the system operation moves from the description of
Turning now to
Upon successful authentication with the authentication server, the hosting user's integrated server application causes periodic server reports to be transmitted to a proxy application server. As noted above, the proxy application server is included within the application server cloud 112 of
In the next operation, block 516, the user notifies its assigned lobby server of its status as an active application server. This new executing application will now be available over the network. The lobby server then registers this new application with the Universe Manager, which adds the appropriate application information to its data collection. This operation is performed by the Universe Manager in a manner similar to what it would perform in response to any other server becoming available with a network application.
After the new application has been registered with the Universe Manager, the network nodes will become aware of the application through respective lobby servers. Therefore, the application becomes available for network users, who can join the program environment established by the integrated server. For example, if the application is a multi-user game, then other network users can join the on-going game, as managed by the hosting user's integrated server. The process of joining a game in progress involves the same operations as described above in conjunction with blocks 414, 415, 416, and 417 of
At the conclusion of the application session (block 518), a participating user can disconnect from the integrated server and return to normal activities, including all available lobby functions through the lobby server. As noted, these functions can include chat, group or community management, messaging, and the like. As noted above, these functions are available to the user at all times when the user is connected to the lobby server, including during application use (e.g., during game play). If a hosting user (the integrated server) wishes to withdraw from hosting the application, the network system (
If the user performs a logout procedure, or if the user is timed out from an active connection because of inactivity, the user's session is cleared from the active records of the Universe Manager. This is indicated at the next block, 519. If the user wishes to participate in another application, the user must go through the authentication process once again, including the login process.
Ladder Ranking
The application program interface that is shared in common with all the components illustrated in
The ladder ranking information is collected via functionality in each multi-user application that periodically reports the application status to the corresponding application server. The status can include information such as progress of players in the game. The application servers then store the information to a system database that is indexed according to a user's account information and application currently being used. This information is managed by a ladder engine that can operate at any location of the network, for example, at the Universe Manager, and the data can be stored at data storage of the Universe Manager or in the database servers (
The system interface preferably provides for any registered user to request a ladder ranking, which will be provided through the ladder ranking engine. The request can come from a user via an application with which the user is currently participating. This ensures that non-participants cannot falsely obtain the ladder ranking information. The ladder ranking requests can be received by a lobby server or application server from a user, and the request can be forwarded to the ladder ranking engine at the Universe Manager or whatever other network entity that manages the ladder rankings. When a ladder ranking list is requested, all of the user accounts for the specified application are sorted based on the stored user performance data. The application status information preferably includes multiple statistics, which can be stored simultaneously in the database. For example, a gaming application can track wins, losses, points scored, points allowed, and other performance statistics of interest. Each metric can be sorted on, thus generating a ladder ranking according to the metric chosen by the user who requests the ladder ranking. Moreover, the ladder ranking engine provides sorting and retrieving of a ladder ranking in ascending or descending order. For example, a ladder ranking can be provided in order from most points to least points, or from least points to most points.
The various servers and databases of the system have no knowledge about the nature of the statistics. That is, the servers do not examine the underlying data to understand the difference between wins and losses or points and goals. Rather, the various applications define the data set to be collected for that application, and the servers and databases simply store the collected data in the database. Thus, each application will define its own data collection format, which will be supported by the database servers.
The data can be included in a 256-byte data field that is assigned to each user's account for each application with which the system interfaces. For example, the application code can execute the ladder ranking function by specifying data parameters of sort order, start byte, end byte. Upon receiving a ladder ranking message with these parameters, a server or database of the system will retrieve all data fields for all accounts associated with the calling application. The data in each data record between the start byte location and the end byte location will be treated as an integer value. The sort operation will then be performed on the retrieved data, in ascending or descending order depending on the value of a user-supplied sort order parameter. The sorted integer numbers can then be displayed to a user in accordance with known headings for the integer data. For example, a particular application might store performance data as number of wins, followed by number of losses, followed by points scored, followed by points allowed. When the performance data is retrieved, the data can be parsed to extract the requested data for proper display. Other applications can store different performance parameters in a different order, which will be known to the corresponding application server. In this way, the ladder ranking engine provides a powerful generic, cross-application ladder rankings system.
Clans Engine
Another feature of the system described herein is a clans engine that allows a designated user of any trusted application, a user referred to as a “leader”, to name and create a clan. The leader can then issue invitations to other users for joining the clan. The system will queue up any invitations sent to registered users who are not online at the time the invitation is sent, for delivery at the invitee's next login. A user who receives a clan invitation can respond affirmatively or negatively and, if desired, can become a member of the clan.
The system supports a variety of clan features. Members of a clan can send private electronic messages to the members of the clan. The clan messages can be stored on the servers of the system until delivery, which occurs as each member completes the next login process. The system permits clans to elect new leaders and set up various organizational structures for their clan. Examples of organizational structures include dictatorships, where one leader is in charge of all decisions of the clan, or a democracy, where all members and the leader have equal votes in the clan decision making. The leader who initiates the clan can select which of these, or other, configurations will be utilized.
All of the various clan data, including the clan membership list, clan activity tracking, clan electronic messaging, and the like are saved by database servers of the system. The clan functionality is accessed through the program interface in accordance with the present invention, in a manner similar to that described above for the ladder ranking data. This permits many discrete functions to be provided and specified or deleted for each clan, making the composition rules and operation of each clan potentially exclusive. Moreover, the program interface permits the clan functionality to be used in a generic way for multiple applications. For example, in a gaining context, the same team or clan functionality can be applied whether the application is a flight simulator, car racing game, or action-shooter game.
In addition, multiple applications can share the same clans and membership servers and databases at the same time, without interfering with each other. User accounts can be associated with more than one clan in the same application or in clans that extend across multiple applications, without any impact to the user account or to the clan functionality.
The clan engine in accordance with the present invention manages the clan data using server-side processing, rather than relying on offline, Web-based clan management techniques or client-side arbitration, with nothing built into the actual application itself. Thus, any application developed for the program interface described herein can utilize the clan processing that is built into the interface specification, servers, and databases of the
Network Device Construction
The network computer devices (clients and servers) shown in the block diagram of
Each computer 600 can communicate with the others over a computer network 620 (such as the Internet or an intranet) through a network interface 618 that enables communication over a connection 622 between the network 620 and the computer. The network interface 618 typically comprises, for example, a Network Interface Card (NIC) or a modem that permits communications over a variety of networks.
The CPU 602 operates under control of programming steps that are temporarily stored in the memory 610 of the computer 600. When the programming steps are executed, the computer performs its functions. Thus, the programming steps implement the functionality of the respective client or server. The programming steps can be received from the DASD 608, through the program product storage device 614, or through the network connection 622. The program product storage drive 612 can receive a program product 614, read programming steps recorded thereon, and transfer the programming steps into the memory 610 for execution by the CPU 602. As noted above, the program product storage device can comprise any one of multiple removable media having recorded computer-readable instructions, including magnetic floppy disks and CD-ROM storage discs. Other suitable program product storage devices can include magnetic tape and semiconductor memory chips. In this way, the processing steps necessary for operation in accordance with the invention can be embodied on a program product.
Alternatively, the program steps can be received into the operating memory 610 over the network 620. In the network method, the computer receives data including program steps into the memory 610 through the network interface 618 after network communication has been established over the network connection 622 by well-known methods that will be understood by those skilled in the art without further explanation. The program steps are then executed by the CPU 602 thereby comprising a computer process.
It should be understood that all of the network computers of the network system 100 illustrated in
For example, with reference to
The video game console system 700 includes a central processing unit (CPU) 701 that is associated with a main memory 705. The CPU 701 operates under control of programming steps that are stored in the OS-ROM 760 or transferred from a game program storage medium to the main memory 705. The CPU 701 is configured to process information and execute instructions in accordance with the programming steps.
The CPU 701 is communicatively coupled to an input/output processor (IOP) 720 via a dedicated bus 725. The IOP 720 couples the CPU 701 to an OS ROM 760 comprised of a non-volatile memory that stores program instructions, such as an operating system. The instructions are preferably transferred to the CPU via the IOP 720 at start-up of the main unit 700.
The CPU 701 is communicatively coupled to a graphics processing unit (GPU) 710 via a dedicated bus 715. The GPU 710 is a drawing processor that is configured to perform drawing processes and formulate images in accordance with instructions received from the CPU 701. For example, the GPU 710 can render a graphics image based on display lists that are generated by and received from the CPU 701. The GPU can include a buffer for storing graphics data. The GPU 710 outputs images to an AV output device 790 that is connected to the console system 700.
The IOP 720 controls the exchange of data among the CPU 700 and a plurality of peripheral components in accordance with instructions that are stored in an IOP memory 730. The peripheral components can include one or more input controllers 722, a memory card 740, a USB 745, and an IEEE 1394 serial bus 750. Additionally, a bus 755 is communicatively coupled to the IOP 720. The bus 755 is linked to several additional components, including the OS ROM 760, a sound processor unit (SPU) 765, an optical disc control unit 775, and a hard disk drive (HDD) 780.
The SPU 765 is configured to generate sounds, such as music, sound effects, and voices, in accordance with commands received from the CPU 701 and the IOP 720. The SPU 765 can include a sound buffer in which waveform data is stored. The SPU 765 generates sound signals and transmits the signals to speakers.
The disc control unit 775 is configured to control a program reader, which can comprise, for example, an optical disk drive that accepts removable storage media such as a magnetic floppy disk, an optical CD-ROM disc, a CD-R disc, a CD-RW disc, a DVD disk, or the like.
The memory card 740 can comprise a storage medium to which the CPU 701 can write and store data. Preferably, the memory card 740 can be inserted and removed from the IOP 720. A user can store or save data using the memory card 740. In addition, the video game system 700 is preferably provided with at least one hard disk drive (HDD) 780 to which data can be written and stored.
A data I/O interface, such as an IEEE 1394 serial bus 750 or a universal serial bus (USB) 745 interface, is preferably communicatively coupled to the IOP 720 in order to allow data to be transferred into and out of the video game system 700, such as to the network illustrated in
The present invention has been described above in terms of a presently preferred embodiment so that an understanding of the present invention can be conveyed. There are, however, many configurations for the system and application not specifically described herein but with which the present invention is applicable. The present invention should therefore not be seen as limited to the particular embodiment described herein, but rather, it should be understood that the present invention has wide applicability with respect to multi-user applications generally. All modifications, variations, or equivalent arrangements and implementations that are within the scope of the attached claims should therefore be considered within the scope of the invention.
This application is a continuation and claims the priority benefit of U.S. patent application Ser. No. 12/218,581, filed Jul. 15, 2008, now U.S. Pat. No. 7,822,809 and entitled “Creating and Interactive Gaming Environment,” which is a divisional and claims the priority benefit of U.S. patent application Ser. No. 10/359,359, filed Feb. 4, 2003, now U.S. Pat. No. 7,711,847 and entitled “Managing Users in a Multi-User Network Game Environment.” U.S. patent application Ser. No. 10/359,359 claims the priority benefit of U.S. provisional patent application Ser. No. 60/376,115, filed Apr. 26, 2002 and entitled “Multi-User Application Program Interface.” The disclosure of each of the aforementioned applications is incorporated by reference.More than one reissue application has been filed for the reissue of U.S. Pat. No. 7,962,549. The reissue applications include application Ser. Nos. 13/918,809 (the parent reissue) and concurrently-filed continuation reissues 15/688,592 (the present continuation reissue) 15/688,610, and 15/688,565, all of which are reissues of U.S. Pat. No. 7,962,549; The present application is a continuation reissue of U.S. patent application Ser. No. 13/918,809 filed Jun. 14, 2013, which is an application for reissue of U.S. Pat. No. 7,962,549 filed Jul. 19, 2010 as U.S. patent application Ser. No. 12/839,311 and issued on Jun. 14, 2011; the '549 patent is a continuation of U.S. patent application Ser. No. 12/218,581 filed Jul. 15, 2008, which is a divisional of U.S. patent application Ser. No. 10/359,359 filed Feb. 4, 2003, which claims the priority benefit of U.S. provisional patent application number 60/376,115 filed on Apr. 26, 2002, the disclosures of which are incorporated by reference herein.
Number | Name | Date | Kind |
---|---|---|---|
5630757 | Gagin et al. | May 1997 | A |
5634129 | Dickinson | May 1997 | A |
5682139 | Pradeep | Oct 1997 | A |
5704032 | Badovinatz et al. | Nov 1997 | A |
5823879 | Goldberg | Oct 1998 | A |
5826085 | Bennet | Oct 1998 | A |
5838909 | Roy et al. | Nov 1998 | A |
5841980 | Waters | Nov 1998 | A |
5862339 | Bonnaure et al. | Jan 1999 | A |
5893106 | Brobst et al. | Apr 1999 | A |
5941947 | Brown | Aug 1999 | A |
5956485 | Perlman | Sep 1999 | A |
5984787 | Redpath | Nov 1999 | A |
5987376 | Olson et al. | Nov 1999 | A |
6038599 | Black et al. | Mar 2000 | A |
6041312 | Bickerton et al. | Mar 2000 | A |
6050898 | Vange | Apr 2000 | A |
6098091 | Kisor | Aug 2000 | A |
6106569 | Bohrer | Aug 2000 | A |
6108569 | Shen | Aug 2000 | A |
6142472 | Kliebisch | Nov 2000 | A |
6151632 | Chaddha et al. | Nov 2000 | A |
6152824 | Rothschild et al. | Nov 2000 | A |
6154782 | Kawaguchi et al. | Nov 2000 | A |
6203433 | Kume | Mar 2001 | B1 |
6219045 | Leahy et al. | Apr 2001 | B1 |
6247017 | Martin | Jun 2001 | B1 |
6311209 | Olson et al. | Oct 2001 | B1 |
6345297 | Grimm | Feb 2002 | B1 |
6352479 | Sparks | Mar 2002 | B1 |
6363416 | Naeimi | Mar 2002 | B1 |
6446113 | Ozzie et al. | Sep 2002 | B1 |
6470022 | Rochberger | Oct 2002 | B1 |
6487583 | Harvey | Nov 2002 | B1 |
6487678 | Briskey et al. | Nov 2002 | B1 |
6519629 | Harvey | Feb 2003 | B2 |
6530840 | Cuomo | Mar 2003 | B1 |
6539494 | Abramson et al. | Mar 2003 | B1 |
6549946 | Fisher | Apr 2003 | B1 |
6560636 | Cohen et al. | May 2003 | B2 |
6561811 | Rapoza et al. | May 2003 | B2 |
6577628 | Hejza | Jun 2003 | B1 |
6587874 | Golla | Jul 2003 | B1 |
6607444 | Takahashi et al. | Aug 2003 | B2 |
6631412 | Glasser et al. | Oct 2003 | B1 |
6654831 | Otterness et al. | Nov 2003 | B1 |
6676521 | La Mura et al. | Jan 2004 | B1 |
6704885 | Salas-Meza et al. | Mar 2004 | B1 |
6748420 | Quatrano et al. | Jun 2004 | B1 |
6755743 | Yamashita | Jun 2004 | B1 |
6761636 | Chung et al. | Jul 2004 | B2 |
6763371 | Jandel | Jul 2004 | B1 |
6766364 | Moyer et al. | Jul 2004 | B2 |
6769990 | Cohen | Aug 2004 | B2 |
6799255 | Blumenau | Sep 2004 | B1 |
6839435 | Lijima et al. | Jan 2005 | B1 |
6844893 | Miller et al. | Jan 2005 | B1 |
6931446 | Cox et al. | Aug 2005 | B1 |
7003550 | Cleasby et al. | Feb 2006 | B1 |
7016942 | Odom | Mar 2006 | B1 |
7018295 | Sakaguchi et al. | Mar 2006 | B2 |
7025675 | Fogel | Apr 2006 | B2 |
7035919 | Lee et al. | Apr 2006 | B1 |
7056217 | Pelkey | Jun 2006 | B1 |
7089301 | Labio et al. | Aug 2006 | B1 |
7107312 | Hackbarth et al. | Sep 2006 | B2 |
7155515 | Brown et al. | Dec 2006 | B1 |
7165107 | Pouyoul et al. | Jan 2007 | B2 |
7177950 | Narayan et al. | Feb 2007 | B2 |
7188145 | Lowery et al. | Mar 2007 | B2 |
7203755 | Zhu et al. | Apr 2007 | B2 |
7290264 | Powers et al. | Oct 2007 | B1 |
7366185 | Bush | Apr 2008 | B2 |
7454458 | Islam et al. | Nov 2008 | B2 |
7523163 | Zhu et al. | Apr 2009 | B2 |
7539216 | Johns et al. | May 2009 | B2 |
7587465 | Muchow | Sep 2009 | B1 |
7613800 | Dhupelia | Nov 2009 | B2 |
7640298 | Berg | Dec 2009 | B2 |
7680908 | Gates, III et al. | Mar 2010 | B2 |
7711847 | Dhupelia | May 2010 | B2 |
7720908 | Newson et al. | May 2010 | B1 |
7730206 | Newson et al. | Jun 2010 | B2 |
7792902 | Chatani | Sep 2010 | B2 |
7822809 | Dhupelia | Oct 2010 | B2 |
7831666 | Chatani et al. | Nov 2010 | B2 |
7877509 | Dhupelia | Jan 2011 | B2 |
7899017 | Yu et al. | Mar 2011 | B2 |
7908393 | Marr et al. | Mar 2011 | B2 |
7930345 | Dhupelia | Apr 2011 | B2 |
7962549 | Dhupelia | Jun 2011 | B2 |
8032619 | Kato et al. | Oct 2011 | B2 |
8050272 | Chaturvedi et al. | Nov 2011 | B2 |
8051180 | Mazzaferri et al. | Nov 2011 | B2 |
8131802 | Jacob | Mar 2012 | B2 |
8214489 | Ballette et al. | Jul 2012 | B2 |
8335813 | Sun et al. | Dec 2012 | B2 |
8402124 | Barillaud et al. | Mar 2013 | B1 |
8549150 | Roseman et al. | Oct 2013 | B1 |
8554842 | Maehiro | Oct 2013 | B2 |
8560707 | Jacob | Oct 2013 | B2 |
8719143 | Meijer et al. | May 2014 | B2 |
8719375 | Hildreth et al. | May 2014 | B2 |
8725874 | Keohane et al. | May 2014 | B2 |
8856233 | Lacapra et al. | Oct 2014 | B2 |
8965978 | Chandranmenon et al. | Feb 2015 | B2 |
8972548 | Jacob | Mar 2015 | B2 |
8990305 | Barkley et al. | Mar 2015 | B2 |
9032248 | Petty et al. | May 2015 | B1 |
9318003 | Nilsson et al. | Apr 2016 | B2 |
9369540 | Lowery et al. | Jun 2016 | B2 |
9516068 | Jacob | Dec 2016 | B2 |
9729621 | Jacob | Aug 2017 | B2 |
9762631 | Chatani | Sep 2017 | B2 |
10063631 | Jacob | Aug 2018 | B2 |
10547670 | Jacob | Jan 2020 | B2 |
10659500 | Chatani | May 2020 | B2 |
20010009868 | Sakaguchi et al. | Jul 2001 | A1 |
20010024974 | Cohen | Sep 2001 | A1 |
20010037466 | Fukutake et al. | Nov 2001 | A1 |
20010044339 | Cordero | Nov 2001 | A1 |
20020023117 | Bernardin et al. | Feb 2002 | A1 |
20020035604 | Cohen et al. | Mar 2002 | A1 |
20020042830 | Bose et al. | Apr 2002 | A1 |
20020049086 | Otsu | Apr 2002 | A1 |
20020062348 | Maehiro | May 2002 | A1 |
20020075844 | Hagen | Jun 2002 | A1 |
20020075940 | Haartsen | Jun 2002 | A1 |
20020082077 | Johnson | Jun 2002 | A1 |
20020082086 | Scallie | Jun 2002 | A1 |
20020086732 | Kirmse et al. | Jul 2002 | A1 |
20020107934 | Lowery et al. | Aug 2002 | A1 |
20020107935 | Lowery et al. | Aug 2002 | A1 |
20020115488 | Berry | Aug 2002 | A1 |
20020133707 | Newcombe | Sep 2002 | A1 |
20020142842 | Easley | Oct 2002 | A1 |
20020156917 | Nye | Oct 2002 | A1 |
20020169889 | C | Nov 2002 | A1 |
20020178260 | Chang | Nov 2002 | A1 |
20020184070 | Chen et al. | Dec 2002 | A1 |
20030018719 | Ruths | Jan 2003 | A1 |
20030073494 | Kalpakian et al. | Apr 2003 | A1 |
20030093669 | Morals et al. | May 2003 | A1 |
20030126245 | Feltin et al. | Jul 2003 | A1 |
20030167343 | Furuno | Sep 2003 | A1 |
20030190960 | Jokipii | Oct 2003 | A1 |
20030204566 | Dhupelia | Oct 2003 | A1 |
20030204593 | Brown et al. | Oct 2003 | A1 |
20030214943 | Engstrom et al. | Nov 2003 | A1 |
20030216181 | Daniell et al. | Nov 2003 | A1 |
20030217135 | Chatani | Nov 2003 | A1 |
20030217158 | van Datta | Nov 2003 | A1 |
20030233537 | Wohlgemuth et al. | Dec 2003 | A1 |
20040001476 | Islam et al. | Jan 2004 | A1 |
20040002384 | Multerer et al. | Jan 2004 | A1 |
20040024879 | Dingman | Feb 2004 | A1 |
20040030787 | Jandel | Feb 2004 | A1 |
20040031052 | Wannamaker et al. | Feb 2004 | A1 |
20040053690 | Fogel | Mar 2004 | A1 |
20040059711 | Jandel | Mar 2004 | A1 |
20040117443 | Barsness | Jun 2004 | A1 |
20040139228 | Takeda | Jul 2004 | A1 |
20050038836 | Wang | Feb 2005 | A1 |
20050068894 | Yu et al. | Mar 2005 | A1 |
20050105526 | Stiemerling | May 2005 | A1 |
20050144521 | Werner | Jun 2005 | A1 |
20050181878 | Danieli et al. | Aug 2005 | A1 |
20050245317 | Arthur et al. | Nov 2005 | A1 |
20050251577 | Guo | Nov 2005 | A1 |
20050259637 | Chu | Nov 2005 | A1 |
20050262411 | Vertes | Nov 2005 | A1 |
20060015560 | MacAuley et al. | Jan 2006 | A1 |
20060047836 | Rao et al. | Mar 2006 | A1 |
20060075127 | Juncker | Apr 2006 | A1 |
20060085792 | Traut | Apr 2006 | A1 |
20060092942 | Newson et al. | May 2006 | A1 |
20060100020 | Kasai | May 2006 | A1 |
20060142085 | Kim | Jun 2006 | A1 |
20060168107 | Balan et al. | Jun 2006 | A1 |
20060164974 | Ramalho et al. | Jul 2006 | A1 |
20060190540 | Chatani | Aug 2006 | A1 |
20060200551 | Bali et al. | Sep 2006 | A1 |
20060218274 | Labio et al. | Sep 2006 | A1 |
20060218275 | Labio et al. | Sep 2006 | A1 |
20060221856 | Quiroz | Oct 2006 | A1 |
20060247011 | Gagner | Nov 2006 | A1 |
20060248144 | Zhu et al. | Nov 2006 | A1 |
20060253595 | van Datta | Nov 2006 | A1 |
20060258463 | Cugno et al. | Nov 2006 | A1 |
20060288103 | Gobara | Dec 2006 | A1 |
20070058792 | Chaudhari | Mar 2007 | A1 |
20070061460 | Khan | Mar 2007 | A1 |
20070076729 | Takeda | Apr 2007 | A1 |
20070094325 | Ih et al. | Apr 2007 | A1 |
20070099702 | Tupper | May 2007 | A1 |
20070165629 | Chaturvedi | Jul 2007 | A1 |
20070174399 | Ogle et al. | Jul 2007 | A1 |
20070191109 | Crowder | Aug 2007 | A1 |
20070208748 | Li | Sep 2007 | A1 |
20070217436 | Markley | Sep 2007 | A1 |
20070233865 | Garbow et al. | Oct 2007 | A1 |
20070288598 | Edeker et al. | Dec 2007 | A1 |
20070291706 | Miller et al. | Dec 2007 | A1 |
20080049755 | Gannon et al. | Feb 2008 | A1 |
20080189365 | Narayanaswami et al. | Aug 2008 | A1 |
20080243953 | Wu et al. | Oct 2008 | A1 |
20080280686 | Dhupelia et al. | Nov 2008 | A1 |
20080291839 | Hooper et al. | Nov 2008 | A1 |
20090006545 | Dhupelia | Jan 2009 | A1 |
20090006604 | Dhupelia | Jan 2009 | A1 |
20090077245 | Smelyansky | Mar 2009 | A1 |
20090089363 | Keohane et al. | Apr 2009 | A1 |
20090094370 | Jacob | Apr 2009 | A1 |
20090113060 | Jacob | Apr 2009 | A1 |
20090138610 | Gobara | May 2009 | A1 |
20090157882 | Kashyap | Jun 2009 | A1 |
20090240821 | Juncker | Sep 2009 | A1 |
20090287828 | Wei et al. | Nov 2009 | A1 |
20100153496 | Heinla | Jun 2010 | A1 |
20100279767 | Dhupelia | Nov 2010 | A1 |
20100285872 | Dhupelia | Nov 2010 | A1 |
20100287239 | Chatani | Nov 2010 | A1 |
20120166651 | Jacob | Jun 2012 | A1 |
20130304931 | Jacob | Nov 2013 | A1 |
20140256449 | Chatani et al. | Sep 2014 | A1 |
20150180958 | Jacob | Jun 2015 | A1 |
20180013802 | Chatani | Jan 2018 | A1 |
20180013820 | Jacob | Jan 2018 | A1 |
20200329094 | Jacob | Oct 2020 | A1 |
Number | Date | Country |
---|---|---|
104069637 | Oct 2014 | CN |
1125617 | Aug 2001 | EP |
1499987 | Jan 2005 | EP |
2360874 | Aug 2011 | EP |
2360875 | Aug 2011 | EP |
2325543 | Nov 1998 | GB |
269863 | Dec 2015 | IN |
05-022346 | Jan 1993 | JP |
63-32725 | Sep 1998 | JP |
11-234326 | Aug 1999 | JP |
2000-124939 | Apr 2000 | JP |
2000-157724 | Jun 2000 | JP |
2001-187273 | Jul 2001 | JP |
2001-314657 | Nov 2001 | JP |
2002-011251 | Jan 2002 | JP |
2003-099337 | Apr 2003 | JP |
201347493 | Nov 2013 | TW |
I491229 | Jul 2015 | TW |
WO 200005854 | Feb 2000 | WO |
WO 200010099 | Feb 2000 | WO |
WO 200068864 | Nov 2000 | WO |
WO 200163423 | Aug 2001 | WO |
WO 200182678 | Nov 2001 | WO |
WO 200235769 | May 2002 | WO |
WO 2003091894 | Nov 2003 | WO |
WO 2003100643 | Dec 2003 | WO |
WO 2004063843 | Jul 2004 | WO |
WO 2005088466 | Sep 2005 | WO |
WO 2006023508 | Mar 2006 | WO |
WO 2009045475 | Apr 2009 | WO |
Entry |
---|
U.S. Appl. No. 15/702,580 Office Action dated Jan. 24, 2019. |
U.S. Appl. No. 15/672,113 Office Action dated Mar. 8, 2018. |
“Brief for Appellee,” in re Masayuki Chatani et al., U.S. Court of Appeals for the Federal Circuit (2007-1150) (May 21, 2007). |
“Brief of Appellants,” in re Masayuki Chatani et al., U.S. Court of Appeals for the Federal Circui (2007-1150) (Mar. 23, 2007). |
“In Re Masayuki Chatani and Glen Van Datta,” United States Court of Appeals for the Federal Circuit, 2007-1150 (U.S. Appl. No. 11/211,128), Nov. 19, 2007. |
“Petition for Panel Rehearing,” In Re Masayuki Chatani and Glen Van Datta, Appeal From the United States Patent and Trademark Office, Board of Patent Appeals and Interferences, In the United States Court of Appeals for the Federal Circuit, 2007-1150 (U.S. Appl. No. 10/211,128), Jan. 3, 2008. |
“Reply Brief of Appellants,” In re Masayuki Chatani et al., U.S. Court of Appeals for the Federal Circuit (2007-1150) (Jun. 4, 2007). |
“Technical Issues of establishing any-to-any 2-way real-time communications over the internet,” Apr. 24, 2005, URL http://web.archive.org/web/20050424081036/. |
Aronson, Jesse. “Using Groupings for Networked Gaming,” Gamasutra.com, Jun. 21, 2000. |
Audet, F. Nat Behavioral Requirements for Unicast UDP, Behave Internet-Draft, Jul. 15, 2005. |
Boulic, Ronan etl al. “Integration of Motion Control Techniques for Virtual Human and Avatar Real-Time Animation,” Swiss Fedl Inst. Of Tech., Lausanne, Switzerland, Sep. 1997. |
Chiueh, Tzi-cker, “Distributed Systems Support for Networked Games,” Computer Science Department, State University of New York at Stony Brook, Stony Brook, NY, May 1997. |
Cisco Systems Inc., “Network Flow Management: Resource Reservation for Multimedia Flows,” Mar. 19, 1999. |
Diot et al., “A Distributed Architecture for Multiplayer Interactive Applications on the Internet”, Aug. 1999, Network, IEEE, vol. 13, Issue 4, Jul.-Aug. 1999, pp. 6-15. |
ECC Report 50. “Technical Issues of Establishing Any-to-Any-2-Way Real-Time Communications over the Internet.” Electronic Communications Committee (ECC). Gothenburg, Jul. 2004. |
Festa and Borland, “Netscape alumni to launch P2P company”, Aug. 2, 2001, (avaiable at http://news.cnet.com/news/0/1005-202-6766377.html). |
Hagsand O: Interactive Multiuser Ves in the Dive System: IEEE Multimedia, IEEE Service Center, New York, NY, US vol. 3, No. 1, 21 Mar. 21, 1996, pp. 30-39, XP000582951 ISSN: 1070-986X. |
Hanada, S. “The Design of Network Game and DirectPlay,” Inside Windows, Softbank K.K., vol. 4, pp. 42-57, Apr. 1, 1998. |
Rosenberg, J. Interactive Connectivity Establishment (ICE): A Methodology for Network Address Translator (NAT) Traversal for Multimedia Session Establishment Protocols, Mmusic Internet-Draft, Jul. 19, 2004. |
Rosenberg, J. Interactive Connectivity Establishment (ICE): A Methodology for Network Address Translator (NAT) Traversal for Offer/Answer Protocols, Mmusic Internet—Draft, Jul. 17, 2005. |
Rosenberg, J. Interactive Connectivity Establishment (ICE): A Methodology for Network Address Translator (NAT) Traversal for Off/Answer Protocols, Mmusic Internet—Draft, Jan. 16, 2007. |
Rosenberg, J. “Simple Traversal of UDP Through Network Address Translators (NAT),” Behave Internet—Draft, Jul. 17, 2005. |
Rosenberg, J. STUN—Simple Traversal of User Datagram Protocols (UDP) Throught Network Address Translators (NATs), Network Working Group, Mar. 2003. |
Rosenberg, J. Traversal using Relay NAT (TURN), Midcom Internet—Draft, Oct. 20, 2003. |
Takeda, Y. Symmetric NAT Traversal Using STUN, Internet Engineering Task Force, Jun. 2003. |
PCT/US03/08682 International Search Report dated Oct. 14, 2003. |
PCT/US03/12668 International Search Report dated Jul. 17, 2003. |
PCT/US08/11415 Search Report and Written Opinion dated Dec. 5. 2008. |
EP 037211413, European Search Report dated Jun. 30, 2005. |
Chinese Application No. 03801033, Office Action dated Jun. 9, 2006. |
Chinese Application No. 03801033, Office Action dated Jul. 5, 2011. |
Chinese Application No. 03801033, Office Action dated Sep. 25, 2009. |
Chinese Application No. 201410266012.9, Office Action dated Jul. 27, 2016. |
European Application No. 03724201.3, Office Action dated Dec. 13, 2013. |
European Application No. 03724201.3, Office Action dated Jul. 3, 2012. |
Chinese Application No. 200810168739.8, Decision of Rejection dated Dec. 11, 2012. |
Chinese Application No. 200810168739.8, Office Action dated May 11, 2012. |
Chinese Application No. 200810168739.8, Office Action dated May 19, 2011. |
Chinese Application No. 20088011547.1, Decision of Rejection dated Jul. 5, 2013. |
Chinese Application No. 20088011547.1, Office Action dated Oct. 12, 2012. |
Chinese Application No. 20088011547.1, Office Action dated Mar. 7, 2012. |
Chinese Application No. 20088011547.1, Office Action dated Aug. 10, 2012. |
EP 08014892.7 Office Action dated Jul. 20, 2011. |
Taiwan Application No. 097138349, Office Action dated Mar. 26, 2014. |
Taiwan Application No. 097138349, Office Action dated Feb. 8, 2013. |
EP 08835745.4 Extended European Search Report dated Jul. 22, 2011. |
EP 11004182.9 Extended European Search Report dated Jul. 14, 2011. |
EP 11004181.1 Extended European Search Report dated Jul. 22, 2011. |
U.S. Application No. 10/211,128 Final Office Action dated Feb. 2, 2004. |
U.S. Appl. No. 10/211,128 Office Action dated Nov. 10, 2003. |
U.S. Appl. No. 11/375,526 Office Action dated Apr. 8, 2008. |
U.S. Appl. No. 11/375,526 Final Office Action dated Jul. 3, 2007. |
U.S. Appl. No. 11/375,526 Final Office Action dated Mar. 2, 2007. |
U.S. Appl. No. 11/375,526 Office Action dated Oct. 24, 2006. |
U.S. Appl. No. 11/403,623 Office Action dated Jun. 25, 2009. |
U.S. Appl. No. 11/403,623 Office Action dated Apr. 9, 2008. |
U.S. Appl. No. 11/403,623 Final Office Action dated Jul. 3, 2007. |
U.S. Appl. No. 11/403,623 Final Office Action dated Mar. 5, 2007. |
U.S. Appl. No. 11/403,623 Office Action dated Oct. 24, 2006. |
U.S. Appl. No. 12/840,977 Office Action dated Jul. 30, 2013. |
U.S. Appl. No. 12/840,977 Final Office Action dated Jun. 18, 2012. |
U.S. Appl. No. 12/840,977 Final Office Action dated Oct. 19, 2011. |
U.S. Appl. No. 12/840,977 Office Action dated May 16, 2011. |
U.S. Appl. No. 12/840,977 Final Office Action dated Dec. 3, 2010. |
U.S. Appl. No. 14/283,959 Office Action dated Jan. 11, 2017. |
U.S. Appl. No. 14/283,959 Final Office Action dated Jul. 19, 2016. |
U.S. Appl. No. 14/283,959 Office Action dated Feb. 4, 2016. |
U.S. Appl. No. 10/359,359 Final Office Action dated Nov. 27, 2009. |
U.S. Appl. No. 10/359,359 Office Action dated Mar. 31, 2009. |
U.S. Appl. No. 10/359,359 Office Action dated Aug. 27, 2007. |
U.S. Appl. No. 10/359,359 Final Office Action dated Feb. 9, 2007. |
U.S. Appl. No. 10/359,359 Office Action dated Aug. 8, 2006. |
U.S. Appl. No. 12/839,306 Office Action dated Nov. 12, 2010. |
U.S. Appl. No. 12/839,311 Office Action dated Nov. 12, 2010. |
U.S. Appl. No. 12/218,581 Office Action dated Sep. 2, 2010. |
U.S. Appl. No. 12/218,581 Office Action dated Feb. 1, 2010. |
U.S. Appl. No. 12/218,581 Office Action dated Oct. 2, 2009. |
U.S. Appl. No. 12/218,591 Office Action dated Feb. 25, 2009. |
U.S. Appl. No. 13/918,809 Final Office Action dated May 10, 2017. |
U.S. Appl. No. 13/918,809 Office Action dated Oct. 20, 2016. |
U.S. Appl. No. 13/918,809 Final Office Action dated Nov. 18, 2015. |
U.S. Appl. No. 13/918,809 Office Action dated Apr. 29, 2015. |
U.S. Appl. No. 13/918,809 Office Action dated Jun. 10, 2014. |
U.S. Appl. No. 12/049,954 Final Office Action dated Dec. 14, 2010. |
U.S. Appl. No. 12/049,954 Office Action dated Jun. 24, 2010. |
U.S. Appl. No. 12/235,438 Final Office Action dated Jan. 4, 2012. |
U.S. Appl. No. 12/235,438 Office Action dated Aug. 8, 2011. |
U.S. Appl. No. 12/235,438 Final Office Action dated Aug. 31, 2010. |
U.S. Appl. No. 12/235,438 Office Action dated Apr. 15, 2010. |
U.S. Appl. No. 13/412,361 Office Action dated Jun. 17, 2014. |
U.S. Appl. No. 13/412,361 Final Office Action dated Nov. 28, 2012. |
U.S. Appl. No. 13/412,361 Office Action dated Jul. 30, 2012. |
U.S. Appl. No. 13/941,436 Final Office Action dated Oct. 7, 2015. |
U.S. Appl. No. 13/941,436 Office Action dated Jun. 22, 2015. |
U.S. Appl. No. 14/637,182 Office Action dated Sep. 9, 2016. |
U.S. Appl. No. 15/702,580, filed Sep. 12, 2017, Masayuki Chatani, Managing Participants in an Online Session. |
U.S. Appl. No. 13/918,809, filed Jun. 14, 2013, Shekar V. Dhupelia, Method for Ladder Ranking in a Game. |
U.S. Appl. No. 15/672,113, filed Aug. 8, 2017, Mark L. Jacob, Systems and Methods for Seamless Host Migration. |
U.S. Appl. No. 16/048,065, filed Jul. 27, 2018, Mark L. Jacob, Systems and Methods for Seamless Host Migration. |
U.S. Appl. No. 13/918,809 Office Action dated Nov. 29, 2017. |
U.S. Appl. No. 15/702,580 Final Office Action dated May 13, 2019. |
U.S. Appl. No. 13/918,809 Office Action dated Jul. 12, 2019. |
U.S. Appl. No. 16/048,065 Office Action dated Jun. 27, 2019. |
U.S. Appl. No. 15/688,610, filed Aug. 28, 2017, Shekhar V. Dhupelia, Method for Ladder Ranking in a Game. |
U.S. Appl. No. 15/688,656, filed Aug. 28, 2017, Shekhar V. Dhupelia, Method for Ladder Ranking in a Game. |
U.S. Appl. No. 13/918,809 Office Action dated Apr. 3, 2020. |
U.S. Appl. No. 15/688,610 Office Action dated Jan. 30, 2020. |
PCT/US08/11415 International Preliminary Report on Patentability dated Apr. 7, 2010. |
U.S. Appl. No. 15/688,610 Final Office Action dated Sep. 29, 2020. |
U.S. Appl. No. 15/688,656 Final Office Action dated Oct. 14, 2020. |
U.S. Appl. No. 16/773,589 Office Action dated Oct. 6, 2020. |
U.S. Appl. No. 15/688,656 Office Action dated Apr. 27, 2021. |
U.S. Appl. No. 16/773,589 Office Action dated May 4, 2021. |
U.S. Appl. No. 15/702,580 Office Action dated Oct. 7, 2019. |
U.S. Appl. No. 15/688,656 Office Action dated Apr. 20, 2020. |
U.S. Appl. No. 13/918,809 Final Office Action dated Nov. 3, 2020. |
U.S. Appl. No. 16/773,589, filed Jan. 27, 2020, Mark L. Jacob, Systems and Methods for Seamless Host Migration. |
U.S. App. No. 16/878,437, filed May 19, 2020, Masayuki Chatani, Managing Participants in an Online Session. |
Hanada, S. “The Design of Network Game and DirectPlay,” Inside Windows, Softbank K.K., vol. 4, No. 4, pp. 42-57, Apr. 1, 1998. |
Number | Date | Country | |
---|---|---|---|
60376115 | Apr 2002 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10359359 | Feb 2003 | US |
Child | 12218581 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13918809 | Jun 2013 | US |
Child | 12839311 | US | |
Parent | 12218581 | Jul 2008 | US |
Child | 12839311 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12839311 | Jul 2010 | US |
Child | 15688592 | US | |
Parent | 12839311 | Jul 2010 | US |
Child | 13918809 | US |