A computer gaming system and method of operation thereof are provided that both drastically reduce the cost of gaming stations and allow contemporaneous access to multiple game programs from a single gaming station. The computer gaming system of the present invention allows for transparent modifications and upgrades to the gaming programs by executing gaming programs on a server/host computer connected to a plurality of client/terminal computers via communication pathways. Each client/terminal computer comprises a client/terminal program that allows input and output streams of the gaming program executed on the server/host computer to be separated and redirected to the client/terminal computers. Since the gaming programs are executed entirely on the server/host computer, with only wagering input and display output operations being executed on the client/terminal computers, the cost of the hardware and software required for each client/terminal computer is greatly reduced. A patron of a client/terminal computer can access any of the gaming programs executed on the server/host computer. Modifications and upgrades of the gaming programs only need to be performed on the server/host computer. By using a stereo head-mounted display together with a joystick input device and wireless communication pathways, the present invention allows a patron to participate in a mobile gaming environment.

Slim terminal gaming system

The present solution provides a spillover management technique for virtual servers of an appliance based on bandwidth. A network administrator may configure a bandwidth threshold for one or more virtual servers, such as virtual servers providing acceleration or load balancing for one or more services. The bandwidth threshold may be specified as a number of bytes transferred via the virtual server. The bandwidth threshold may also be specified as a round trip time or derivative thereof. A user may specify the bandwidth threshold via a configuration interface. Otherwise, the appliance may establish the bandwidth threshold. The appliance monitors the bandwidth used by a first virtual server. In response to detecting the bandwidth reaching or exceeding the bandwidth threshold, the appliance dynamically directs client requests to a second virtual server.

Systems and methods for providing dynamic spillover of virtual servers based on bandwidth

A system and method of serverless peer-to-peer group management and maintenance is presented. Group formation and discovery of private, public, and enumerated groups are provided, as is a method of joining such a peer-to-peer group. Group information management provided by the present invention ensures that each node maintains a current database from the initial joining of the group through the run phase of membership. Group graph maintenance utilizes a group signature to ensure that partitions in a graph may be detected and repaired. The utility of connections within the graph are also monitored so that non-productive connections may be dropped to increase the efficiency of the group. The diameter of the graph is also monitored and adjusted to ensure rapid information transfer throughout the group. A disconnect procedure is used to maintain the graph integrity and prevent partitions resulting from the departure of a group member.

Peer-to-peer group management and method for maintaining peer-to-peer graphs

A method for improving the performance and availability of a distributed application includes providing a distributed application configured to run on one or more origin server nodes located at an origin site. Next, providing a networked computing environment comprising one or more server nodes. The origin site and the computing environment are connected via a network. Next, providing replication means configured to replicate the distributed application and replicating the distributed application via the replication means thereby generating one or more replicas of the distributed application. Next, providing node management means configured to control any of the server nodes and then deploying the replicas of the distributed application to one or more server nodes of the computing environment via the node management means. Next, providing traffic management means configured to direct client requests to any of the server nodes and then directing client requests targeted to access the distributed application to optimal server nodes running the distributed application via the traffic management means. The optimal server nodes are selected among the origin server nodes and the computing environment server nodes based on certain metrics.

System and method for performance acceleration, data protection, disaster recovery and on-demand scaling of computer applications

Disclosed is a method for creating a real-time search engine over the Internet which provides a search response containing data object descriptions and server descriptions of data objects that are currently available for transfer from a provider server directly to a recipient client in response to a recipient client search request The method comprises the provider server connecting to a Real-time search engine through the Internet, the provider server providing the Real-time search engine with data object descriptions of data objects residing on the provider server, and the Real-time search engine indexing data object descriptions associated with the data object of the provider server, wherein the data object descriptions provided by the provider server are purged from the Real-time search engine when the provider server is disconnected from the Real-time search engine

Real-time search engine

A method and system for determining network latency between clients in a computer network, such as in a gaming zone environment. Each client determines the network latency between each other client via a ping, response, and response-response protocol. To this end, a first client places first time information such as a timestamp into a (ping) data packet and sends the packet to the second client, who places second time information into the packet, and sends the packet as a response packet back to the first client. The first client determines a first network latency based on its current time and the first time information returned in the response packet. The first client then sends the packet back to the second client as a response to the response packet. The second client determines a second latency based on the current time information at the second client and the second time information received in the response-response packet. For multiple clients such as in a gaming zone environment, each local client sorts the IP addresses of the other remote clients into sets of clients, and pings the remote client or clients in each set once per predetermined period, thereby distributing the pinging operation to balance incoming and outgoing network traffic.

Method and system for peer-to-peer network latency measurement

A method and system for distributing work load in a cluster of at least two service resources. Depending upon the configuration, a service resource may be an individual process, such as a single instance of a computer game, or a node on which multiple processes are executing, such as a Server. Initial connection requests from new clients are directed to a single entry-point service resource in the cluster, called an intake. A separate intake is designated for each type of service provided by the cluster. The clients are processed in a group at the service resource currently designated as the intake to which clients initially connected, for the duration of the session. Based upon its loading, the current intake service resource determines that another service resource in the cluster should become a new intake for subsequent connection requests received from new clients. Selection of another service resource to become the new intake is based on the current work load of each resource in the cluster. All resources in the cluster are periodically informed of the resource for each service being provided that was last designated as the intake, and of the current load on each resource in the cluster. Subsequently, new clients requesting a service are directed to the newly designated intake for that service and processed on that resource for the duration of the session by those clients.

Distributed load balancing for single entry-point systems

A system and method are provided for producing one or more unique account names in response to a user request, or in response to a user attempting to adopt another name that is unavailable. When performed in response to a user request, the method includes the steps of combining a randomly selected word element, such as an affix or adjective, and a randomly selected stem, such as a noun, to produce a random account name, and comparing the name with a list of existing account names to determine if it is unique. If so, the unique name is provided to the user for acceptance. Additional unique names can be produced by the same or a different method so that the user is presented with a plurality of unique names for consideration. For example, if the user attempts to adopt a name that is unavailable, a unique modified account name can be produced that is based on the name entered by the user. The modified name is produced by combining the requested name or a stem thereof with a randomly generated word element or a numerical seed to produce an alternate account name, comparing the name with the list of existing account names to determine if it is unique and, if so, providing it to the user for acceptance.

Craig A. Link

Papers

Method and system for peer-to-peer network latency measurement

Distributed load balancing for single entry-point systems

System and method for producing unique account names