Abstract: A series of unique records may be published to establish and maintain ad hoc or online meetings on a peer-to-peer network. The published records include a creator record, a presentation record, a file sharing record, a friendly name record, and invitation status record, a capabilities record, and a presence record. Each of the published records has a global unique identifier (GUID) a uniquely and universally identifies each of the record types.

Abstract: An application program interface (API) for sending and receiving endpoint registration data and peer-to-peer network cloud data has a registration call for adding endpoint data to a peer-to-peer network. The API may receive explicit data regarding address information or may be instructed to select and maintain suitable address information as the topology of the peer-to-peer network changes. Blocking and non-blocking calls are exposed for retrieving information peer-to-peer network endpoint data.

Abstract: The claimed system is a service support framework for a multicast programming system implemented on top of a service oriented framework, specifically a service oriented messaging system.

Abstract: The claimed system is a multicast programming model for implementation on top of a service oriented framework, specifically a service oriented messaging system. It provides application-layer multicast capability without requiring an IP multicast infrastructure.

Abstract: The claimed method and system is an API set to support a multicast programming or implementation on top of a service oriented framework, specifically a service messaging system.

Abstract: A shared concept of time, called “graph time,” is agreed upon by all nodes within a graph. Each node maintains its own local delta representative of a difference in the node's system clock and graph time. Upon connecting to a neighbor node in a graph, a node is sent graph time as perceived by the neighbor node. In accordance with an embodiment, the node assumes that the lag time in receiving the graph time from the neighbor node is one-half of the lag time between the request for the connection and the receipt of the graph time. Graph time as sent by the neighbor node is added to one-half of the total delay and the sum is subtracted from the node's system time to calculate the delta for the node requesting connection.