Patent ID: 8661080
Filing Date: 2014-02-25
Classification: G06F

Abstract:
1. A method comprising: connecting N processes on a K-connected overlay network of K nodes connected by a plurality of bi-directional links, said K-connected overlay network is in operative association with a computer network, said K nodes and said plurality of bi-directional links respectively correspond with a plurality of vertexes and a plurality of edges of a K-connected graph wherein the result of deleting any set of k−1 or fewer vertexes is a connected graph; monitoring subscription and un-subscription of at least some of the processes into or from topics; determining an update of subscription statuses and un-subscription statuses of at least some of the processes; generating update messages reflecting the subscription statuses and the un-subscription statuses, the update messages comprise differences between previous update and current update; propagating the update messages through the plurality of bi-directional of the K-connected overlay network, from node to node of said K nodes, such the update is transferred or received by each of said K nodes; and applying at least one hash function to actual names of the topics such that names of subscribed and unsubscribed topics are stored as hashed values to reduce size of statuses update messages: wherein at least one of the connecting, the monitoring, the generating, and the propagating is executed by at least one processor; wherein in the propagating the update is initiated whenever the subscription statuses and the un-subscription statuses exceed a specified threshold.