Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A method and apparatus that allows the user to escape from unwanted Java modal dialog boxes displayed by an applet, even though the Java modal dialog box does not contain a user interface designed to cancel or remove the dialog box from the display. The described embodiment allows the user to use so-called “escape” keys to indicate that the Java modal dialog box should be removed and/or closed. In general, these escape keys have other purposes in addition to removing the Java modal dialog box. A first escape key is a “back” key. Although the back key is typically used within a web browser to return to a previously viewed web page, in dialog box mode, the effect of the back key is to remove the dialog box from the display (under certain circumstances, as discussed below). A second escape key in the described embodiment is the “goto” key.