Method and apparatus for re-establishing anonymous data transfers

Abstract

One embodiment of the present method and apparatus for re-establishing anonymous data transfers between a first endpoint and a second endpoint in a network includes receiving, from a first node, the identity of a second node connected to the first node, where at least the first node is a neighbor node. A third node (a neighbor node) is then selected, and instructed to connect to the second node in order to establish a link for the path. In this manner, the first endpoint and the second endpoint remain unknown at least to each other (e.g., where “unknown” means that neither endpoint knows any identifying information, such as network address, about the other endpoint), and likely to all other nodes in the path as well. In another embodiment, a failure is detected at a neighbor node, where the neighbor node is part of an original path between the first endpoint and the second endpoint. The neighbor node's repair server is contacted for a repair node associated with the neighbor node, and a connection to the repair node is made such that the path is established in a manner that maintains anonymity of the first endpoint and the second endpoint relative to each other.

1 . A method for re-establishing a path for the transfer of data between a first endpoint and a second endpoint in a network, said method comprising the steps of: 
 receiving, from a first node, the identity of a second node connected to said first node, where at least the first node is a neighbor node;    selecting a third node, said third node being a neighbor node; and    instructing said third node to connect to said second node in order to establish a link for said path, where said first endpoint and said second endpoint are unknown at least to each other.    
   
   
       2 . The method of  claim 1 , further comprising: 
 informing a fourth node of the selection of said third node, said fourth node being a neighbor node.    
   
   
       3 . The method of  claim 1 , wherein said first endpoint is unknown to at least one of: said first node, said second node and said third node.  
   
   
       4 . The method of  claim 1 , wherein said second endpoint is unknown to at least one of: said first node, said second node and said third node.  
   
   
       5 . The method of  claim 1 , wherein said path replaces an original path between said first endpoint and said second endpoint.  
   
   
       6 . The method of  claim 5 , wherein said path uses at least one link of said original path.  
   
   
       7 . The method of  claim 5 , wherein at least said first node is part of said original path.  
   
   
       8 . The method of  claim 1 , wherein said path requires re-establishment due to unexpected termination of said path by a node in said path, before completion of said transfer of data.  
   
   
       9 . The method of  claim 1 , wherein said path requires re-establishment due to at least one of said first endpoint and said second endpoint learning an identity of the other, before completion of said transfer of data.  
   
   
       10 . A computer program product stored on a computer readable medium ram for re-establishing a path for the transfer of data between a first endpoint and a second endpoint in a network, the computer readable medium comprising program code for causing a computer system to perform the steps of: 
 receiving, from a first node, the identity of a second node connected to said first node, where at least the first node is a neighbor node;    selecting a third node, said third node being a neighbor node; and    instructing said third node to connect to said second node in order to establish a link for said path, where said first endpoint and said second endpoint are unknown at least to each other.    
   
   
       11 . The computer readable medium of  claim 10 , further comprising: 
 informing a fourth node of the selection of said third node, said fourth node being a neighbor node.    
   
   
       12 . The computer readable medium of  claim 10 , wherein said path replaces an original path between said first endpoint and said second endpoint.  
   
   
       13 . Apparatus for re-establishing a path for the transfer of data between a first endpoint and a second endpoint in a network, said apparatus comprising: 
 means for receiving, from a first node, the identity of a second node connected to said first node, where at least the first node is a neighbor node; and    means for selecting a third node, said third node being a neighbor node;    means for instructing said third node to connect to said second node in order to establish a link for said path, where said first endpoint and said second endpoint are unknown at least to each other.    
   
   
       14 . A method for re-establishing a path for the transfer of data between a first endpoint and a second endpoint in a network, said method comprising the steps of: 
 detecting a failure of a neighbor node, said neighbor node being part of an original path between said first endpoint and said second endpoint;    receiving, from a repair server associated with said neighbor node, a repair node for said neighbor node; and    connecting to said repair node such that said path is established in a manner that maintains anonymity of said first endpoint and said second endpoint relative to each other.    
   
   
       15 . The method of  claim 14 , wherein each node in said original path is associated with a weight value, said weight value increasing monotonically along said original path from node to node.  
   
   
       16 . The method of  claim 15 , wherein said repair node is associated with a weight value that facilitates node ordering of said path.  
   
   
       17 . The method of  claim 14 , wherein each node in said original path is associated with a common repair node.  
   
   
       18 . The method of  claim 14 , wherein each node in said original path is associated with a different repair node.  
   
   
       19 . The method of  claim 14 , wherein said path requires re-establishment due to unexpected termination of said path by a node in said path, before completion of said transfer of data.  
   
   
       20 . The method of  claim 14 , wherein said path requires re-establishment due to at least one of said first endpoint and said second endpoint learning an identity of the other, before completion of said transfer of data.