Abstract: A method of identifying within a database of node pairs, one or more complete paths connecting a start search node to a finish search node. The method includes sending a search query from a client terminal to a network: receiving the search query at a server, identifying node pairs having a finish node matching a start search node, sending a response from the server to the client terminal identifying any matching node pairs, and storing responses of any matching node pairs that have as a start node the finish search node. Further search queries are distributed across all servers, and node pairs having a finish node matching the start node contained in the query are identified.
Type:
Application
Filed:
April 3, 2009
Publication date:
February 9, 2012
Applicant:
NETCYCLER OY
Inventors:
Robert Jan Aarts, Juha Pekka Tapani Koponen, Jussi Viljami Koskinen