| Patent application number | Description | Published |
| 20080215734 | Gracefully Changing a Node in a Distributed Computing Network - In one embodiment, a method includes determining to change a number of objects controlled by a particular node in a network. Each object is a resource provided by the network and has a unique object position in a coordinate space of N dimensions. Each node has a unique node position in the coordinate space of N dimensions. Each node controls operation of objects in a control set of zero or more objects which are closest to the node using an agreed definition of scalar distance between two positions. A different N+1 dimension from the N dimensions is added. The N+1 dimension has a zero value for the plurality of objects. A particular value is determined for the N+1 dimension for the particular node such that a change in a number of objects in a particular control set of the particular node is not greater than a threshold change. | 09-04-2008 |
| 20080239997 | Distributed Real-time Data Mixing for Conferencing - In one embodiment, a method includes receiving data that indicates a maximum number of end nodes with which to set up real-time data sessions that is less than a conference number of nodes whose data is mixed in a single real-time data conference. Real-time data sessions are established with a connected set of a connected number of nodes not greater than the maximum number. A mix of the real-time data received from the connected set is presented to a user of the first node. Local real-time data is received from a user. The received real-time data is distributed by mixing and sending. This includes, for each individual node in the connected set, mixing received local real-time data with real-time data received from other nodes in the connected set different from the individual node to form individual mixed real-time data, and sending the individual mixed real-time data to the individual node. | 10-02-2008 |
| 20090251457 | REACTIVE VIRTUAL ENVIRONMENT - A system (and corresponding method) is provided that enables virtual spaces to be created based upon user activity and populated with users associated with, interested in or active within the same areas as the user, thus facilitating serendipitous interactions and exchange of knowledge. The system dynamically binds user representations (e.g., avatars, links) into a virtual space that is associated with an activity or topic. Essentially, the system is capable of dynamically gathering or generating representations of users associated with a workflow or tasks within an activity, project or topic thereby enhancing collaboration between users with regard to communications as well as generation and sharing of data. | 10-08-2009 |
| 20090276492 | SUMMARIZATION OF IMMERSIVE COLLABORATION ENVIRONMENT - A system (and corresponding method) that enables automatic (and/or manual) summarization of significant events that occur within a collaborative discussion is provided. The summarization promotes efficient review and asynchronous participation where a user can trigger playback of a series of events that occurred within a discussion. The system can automatically summarize ‘high points’ or significant events from within an immersive collaborative environment. ‘World-marks’ or other tags can be employed to mark, locate and/or render the summarized content. | 11-05-2009 |
| 20090287825 | DISTRIBUTED CLIENT SERVICES BASED ON EXECUTION OF SERVICE ATTRIBUTES AND DATA ATTRIBUTES BY MULTIPLE NODES IN RESOURCE GROUPS - A network provides distributed client services based on participation in respective resource groups by computing nodes, each resource group including a corresponding resource requirement for any computing node that joins the corresponding resource group for execution of the corresponding distributed client service. Each computing node, in response to determining its corresponding available node capacity, is configured for selectively creating and joining at least one new resource group for execution of a corresponding distributed client service having a corresponding resource requirement, and/or selectively joining at least one of the available resource groups, based on the corresponding available node capacity satisfying the corresponding resource requirement. Each distributed client service also includes service attributes that define parameters for execution of the distributed client service, and data attributes that define the attributes required for data to be used in the distributed client service. | 11-19-2009 |
| 20090307189 | ASYNCHRONOUS WORKFLOW PARTICIPATION WITHIN AN IMMERSIVE COLLABORATION ENVIRONMENT - A system (and corresponding method) that enables establishment of a record associated with an immersive collaborative environment is provided. The record represents events and actions that occur within the virtual environment. Additionally, the system enables a user to modify the record following the initial capture. Upon modification, the record is ‘time-shifted’ such that the resultant record is a seamless chronological rendition of events and actions that occurred within the immersive collaborative environment or virtual workspace. | 12-10-2009 |
| 20100228841 | GRACEFULLY CHANGING A NODE IN A DISTRIBUTED COMPUTING NETWORK - In one embodiment, a method includes determining to change a number of objects controlled by a particular node in a network. Each object is a resource provided by the network and has a unique object position in a coordinate space of N dimensions. Each node has a unique node position in the coordinate space of N dimensions. Each node controls operation of objects in a control set of zero or more objects which are closest to the node using an agreed definition of scalar distance between two positions. A different N+1 dimension from the N dimensions is added. The N+1 dimension has a zero value for the plurality of objects. A particular value is determined for the N+1 dimension for the particular node such that a change in a number of objects in a particular control set of the particular node is not greater than a threshold change. | 09-09-2010 |
| 20100250668 | ARRANGEMENT FOR SELECTING A SERVER TO PROVIDE DISTRIBUTED SERVICES FROM AMONG MULTIPLE SERVERS BASED ON A LOCATION OF A CLIENT DEVICE - A selection resource executed within the network is configured for selecting from among a plurality of servers, distributed throughout the network at respective network-based server locations and each configured for providing a specified service, a selected server for providing the specified service for a client device at a network-based client location. The selection resource selects the selected server based on the corresponding server location relative to the client location, and causes a request having been generated by the client device to be sent to the selected server. Hence, the selection resource optimizes client-server interactions in a distributed computing network, based on the client location and the server location. | 09-30-2010 |
| 20110016351 | ARRANGEMENT FOR RECOVERY OF DATA BY NETWORK NODES BASED ON RETRIEVAL OF ENCODED DATA DISTRIBUTED AMONG THE NETWORK NODES - Distributed data, having been stored in a distributed storage system as a collection of distributed data elements, is recovered based on connection of multiple user nodes, each user node having stored selected distributed data elements as a corresponding portion of the distributed data during replication of the distributed data elements throughout the distributed storage system. Each distributed data element is identifiable by a corresponding unique object identifier (OID). Each user node includes a discovery resource for discovering reachable user nodes, a local cache configured for identifying at least the corresponding portion of the distributed data based on the respective OIDs, and an identification service module configured for resolving a data object to a corresponding OID, via the corresponding local cache, or based on sending a query to the reachable user nodes. Hence, user nodes can recover distributed data based on exchanging resolution information and OID information. | 01-20-2011 |