Method and system for symmetrically distributed adaptive matching of partners of mutual interest in a computer network

A method for enhancing the locality of distributed mutual-interest matching in a cluster containing a plurality of nodes by measuring and tracking inter-node latencies, wherein at least one node is capable of undergoing a transition from a first node state to a second node state, the cluster further containing at least one extent, wherein each extent is a subset of the plurality of nodes, the cluster further containing at least one cache storage, wherein each cache storage corresponds to one of the extents, the cluster further containing a plurality of caches, wherein at least one cache storage contains at least two caches and wherein each cache is operative to containing data images of secondary nodes having a mutual interest with a primary node, the method comprising the steps of:

• (i) detecting a transition of a primary node;
• (ii) performing an operation selected from the group including:
• a) saving a cache corresponding to a first node state in a cache storage, and
• b) retrieving a cache corresponding to a second node state from a cache storage;
• and
• (iii) utilizing the data images contained in a cache for locating a secondary node having a mutual interest with the primary node.

A method for distributed mutual-interest matching in a cluster containing a plurality of nodes, wherein at least one node is capable of undergoing a transition from a first node state to a second node state, the cluster further containing at least one extent, wherein each extent is a subset of the plurality of nodes, the cluster further containing at least one cache storage, wherein each cache storage corresponds to one of the extents, the cluster further containing a plurality of caches, wherein at least one cache storage contains at least two caches, wherein each cache is operative to containing data images of secondary nodes having a mutual interest with a primary node, and wherein each node within the plurality of nodes has a node address, the method comprising the steps of:

• (i) detecting a transition of a primary node, wherein said primary node establishes a session with a remote client and wherein the cluster makes a reply to said remote client;
• (ii) performing an operation selected from the group including:
• a) saving a cache corresponding to a first node state in a cache storage, and
• b) retrieving a cache corresponding to a second node state from a cache storage;
• (iii) utilizing the data images contained in a cache for locating a secondary node having a mutual interest with the primary node;
• and
• (iv) substituting the node address of said primary node for the node address of said secondary node in said reply to said remote client.

A method for distributed mutual-interest matching in a cluster containing a plurality of nodes, wherein at least one node is capable of undergoing a transition from a first node state to a second node state, the cluster further containing at least one extent, wherein each extent is a subset of the plurality of nodes, the cluster further containing at least one cache storage, wherein each cache storage corresponds to one of the extents, the cluster further containing a plurality of caches, wherein at least one cache storage contains at least two caches, wherein each cache is operative to containing data images of secondary nodes having a mutual interest with a primary node, and wherein the cluster receives requests from a plurality of remote clients, the method comprising the steps of:

• (i) detecting a transition of a primary node;
• (ii) performing an operation selected from the group including:
• a) saving a cache corresponding to a first node state in a cache storage, and
• b) retrieving a cache corresponding to a second node state from a cache storage;
• and
• (iii) utilizing the data images contained in a cache for locating a secondary node having a mutual interest with the primary node, wherein said locating has an adjustable frequency;
• (iv) providing a plurality of priority queues, each of said priority queues having a priority level;
• (v) tracking the number of requests for a priority queue;
• and
• (vi) adjusting said adjustable frequency.