Method for Efficiently Retrieving Topology-Specific Data for Point-to-Point Networks

• US 20140328212A1
• Filed: 07/15/2014
• Published: 11/06/2014
• Est. Priority Date: 10/26/2005
• Status: Abandoned Application

• Current Assignee: Memory Integrity LLC
• Original Assignee: Memory Integrity LLC
• Inventors: Bemont, James Wesley
• Application Number:
  US14/332,335
• Publication Number:
  US 20140328212A1
• Time in Patent Office: Days
• US Class Current: 370/254
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/02 Topology update or discovery

Abstract

Network topology codes are computed and used as keys to retrieve topology-specific information for isomorphic networks.

Claims

1. A method of providing topology-specific data for a point-to-point network, comprising:

storing a collection of topology-specific data for a plurality of point-to-point networks in computer memory;

calculating for one or more of the point-to-point networks a topology code that identifies the topology of that one or more point-to-point networks wherein the topology code is calculated using a node-ordering algorithm applied to a model representing that one or more point-to-point networks; and

using the calculated topology code as a key to provide associated topology-specific data from the collection of topology-specific data.

2. The method of claim 1, further comprising calculating a new topology code in response to a change in the one or more point-to-point networks and using the new topology code as a key to look up one or more new adjacency matrices for the new changed topology.

3. The method of claim 1, further comprising ignoring redundant elements in the model while the node-ordering algorithm is applied to the model.

4. The method of claim 1, further comprising filling in bits in the topology code using a bit ordering scheme while calculating the topology code.

5. The method of claim 1, wherein the topology code is computed by evaluating different traversals through the one or more point-to-point networks and storing node orders with the topology codes.

6. The method of claim 1, further comprising reconstructing the model from the topology code.

7. A computer readable medium comprising program instructions to determine the optimal routing matrix for a selected topology of one or more point-to-point networks, comprising:

pre-computing one or more adjacency matrices representing graph topologies;

storing the one or more adjacency matrices in association with one or more topology codes; and

looking up the one or more adjacency matrices based on runtime-computed topology codes.

8. The computer readable medium of claim 7, further comprising calculating a new topology code in response to a change in the one or more point-to-point networks and using the new topology code as a key to look up one or more new adjacency matrices for the new changed topology.

9. The computer readable medium of claim 7, further comprising ignoring redundant elements in the adjacency matrix and using the adjacency matrix as an optimal routing matrix.

10. The computer readable medium of claim 7, further comprising filling in bits in the topology code using a bit ordering scheme.

11. The computer readable medium of claim 7, wherein the topology codes are computed by evaluating different traversals through the one or more point-to-point networks and storing node orders with the topology codes.

12. The computer readable medium of claim 7, further comprising reconstructing a graph topology with the topology code.

13. The computer readable medium of claim 7, further comprising retrieving topology specific information from the graph topology that represents one of the point-to-point networks.