Sun Microsystems, Inc.

Oracle America, Inc.

Juan C Soto

Kuldipsingh A Pabla

Mohamed M Abdelaziz

Charu V Chaubal

Wolfgang G Gentzsch

Gregory Shirin

Miha Ahronovitz

Bernard A Traversat

Eric Pouyoul

William J Yeager

James Andrew Clark

Rita Y Chen

Kenneth Clark

A multi-grid mechanism using peer-to-peer (P2P) platform protocols. An autonomic grid computing mechanism may be used to implement a multi-grid grid computing system. In the multi-grid grid computing system, there may be multiple master nodes, and thus multiple smaller grids (or grid cells) each including one or more compute nodes, in a single (larger) grid. A job submitter node may use one or more P2P platform protocols to discover the master nodes and to obtain information about the grid cells, including information that may be used by the job submitter to automatically select one of the grid cells that is suitable to execute a particular job. After selecting the grid cell, the job submitter may submit the particular job to the master node of the grid cell using the P2P platform protocols.

Multi-grid mechanism using peer-to-peer protocols

A self-healing grid mechanism using peer-to-peer platform protocols. In one embodiment, two or more nodes on a grid may be configured as master nodes. One of the configured master nodes may serve as the actual master node, and one may be backup or 'shadow' master node, not actively serving as a master node. If the active master node goes down, the peer-to-peer protocols may be used to detect that the master node is not active and the backup master node may take over the master node operations for the grid. The backup master node may 'shadow' the master node, keeping updated information about the grid configuration and operations via the peer-to-peer platform protocols, so that it can assume grid management operations seamlessly.

Self-healing grid mechanism

A method, device and computer accessible medium for an adaptive contact list. An adaptive contact list may maintain one or more contact entries for corresponding identities. An adaptive contact list may detect context information for a user and may identify context appropriate contact entries according to the current context information and may supply the context appropriate contact entries. Context appropriate contact entries may be supplied to other applications or processes. Further, an adaptive contact list may detect, either periodically or on demand, a change in context information for the user, identify different context appropriate contact entries according to the changed context information, and supply the different context appropriate contact entries. Maintained contact entries may be stored in shared identity objects and an adaptive contact list may request and receive contact entries from an identity framework.

Adaptive contact list

A resource discovery and description mechanism for decentralized device and service description and discovery in networking environments is described that generates advertisements in a uniform description format to describe resources on a network. The mechanism may translate resource descriptions from other resource description and discovery protocols to generate the advertisements. The advertisements may be used for cross-network discovery and access of the resources. An advertisement may include, but is not limited to, physical endpoints, virtual endpoints, user-extensible metadata, location information, and a universal unique identifier (UUID) for the associated resource. If a resource cannot provide a UUID, the mechanism generates a UUID for the resource. One embodiment may support proxy nodes for generating advertisements for resources that cannot participate directly in the resource discovery and description mechanism. These proxy nodes may also serve as a proxy between local subnetwork discovery and cross-network discovery of the advertisements.

Method and apparatus for decentralized device and service description and discovery

An autonomic grid computing mechanism. In embodiments, peer-to-peer platform protocols may be integrated with a grid computing system. Embodiments may use peer-to-peer platform protocols as the transport for the grid computing system. Embodiments may provide one or more of, but not limited to, the following capabilities to grid computing systems: self-deployment and self-configuration, self-updating, self-healing, node removal, master node backup, monitoring, administration, load balancing, grid brokering, decentralized grid, and multi-grid support. Peer-to-peer platform protocols may be used to automatically configure compute nodes. When a node comes up, the node searches for a master node using the peer-to-peer platform. When the node finds a master node, it provides node information to the master node using the peer-to-peer platform. The master node may send the node grid configuration information using the peer-to-peer platform and the node may self-configure as a compute node.

Autonomic grid computing mechanism

Method and apparatus for multiplexed data communication tunneling channels. Embodiments of the tunneling mechanism may provide tunnel sockets between networking environments that allow a node in one networking environment to interconnect with network resources in other networking environments. A tunnel socket is a proxy or bridge across a peer-to-peer network between different networking environments. Using the tunneling mechanism, descriptions of network resources in one format may be translated to advertisements in a uniform description format, which may then be published on the network. The published advertisements may be discovered by entities in other networking environments and translated into formats of the other networking environments for access by the entities. To the entities, the resources appear to be in their local networking environment.

Method and apparatus for data communication tunneling channels

System and method for decentralized entity presence are described. Presence services may collaborate to form a presence service view on the network. A node providing an entity on the network may provide an entity advertisement to a presence service to advertise the entity's presence on the network. The presence information may be indexed locally by a presence service, and the indexes may be shared with one or more other presence services within the presence service view. A presence service may accept queries from nodes for a specific entity, and walk the query within the presence service view to locate the target entity. The query may then be forwarded to the node advertising the presence entity. The node providing the entity may respond directly to the querying node without going through the presence service. A presence contract may then be negotiated between the nodes without going through the presence service.

Mechanism for decentralized entity presence

A mobile agent may be provided for collaborative content control in peer-to-peer networks. A peer may launch a mobile agent including an itinerary of peers to be visited and indications of one or more documents that the peers are collaboratively editing. The mobile agent may visit peers indicated by the itinerary to collect version information for the document(s). The mobile agent may return the version information to the initiating peer, which may coordinate each of the document(s) on the peer to a most recent version in accordance with the version information provided by the mobile agent. Visited peers may use the payload to determine if their version of the document(s) are up to date and, if not, may add a version update request to the payload. The initiating peer may send the most recent version information to peers that added version update requests to the payload.

Collaborative content coherence using mobile agents in peer-to-peer networks

A method and system allows any peer to efficiently distribute content to all other peers in a peer group using existing propagation mechanisms. According to the invention, binary contents are broadcast over existing propagation mechanisms such as propagation pipes using a generic capability that can be used by any application that wants to multicast binary contents. According to the invention, the binary contents are broken up into file blocks that are then sent over existing propagation mechanisms such as propagation pipes. According to the present invention, the receiving peers negotiate among themselves to make up any file blocks they may have missed from the original broadcast. When each peer has all the file blocks associated with a given parent file, they store the content.

Growing community of inventors

San Francisco, CA, United States of America

Juan C Soto