US20140328212A1 - Method for Efficiently Retrieving Topology-Specific Data for Point-to-Point Networks - Google Patents
Method for Efficiently Retrieving Topology-Specific Data for Point-to-Point Networks Download PDFInfo
- Publication number
- US20140328212A1 US20140328212A1 US14/332,335 US201414332335A US2014328212A1 US 20140328212 A1 US20140328212 A1 US 20140328212A1 US 201414332335 A US201414332335 A US 201414332335A US 2014328212 A1 US2014328212 A1 US 2014328212A1
- Authority
- US
- United States
- Prior art keywords
- topology
- point
- code
- networks
- new
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
Definitions
- the present invention relates generally to providing topology-specific information, and more particularly to identifying and using topology codes to store and retrieve pre-computed topology-specific information for a point-to-point network.
- routing tables have been recalculated whenever a network topology was changed. If the number of nodes in the network is very small, then the optimal routing matrix could be computed directly by analyzing every possible routing matrix, eliminating those that are invalid or that would allow deadlocks to occur, and choosing the one with the best statistics (such as minimum hop count or shortest longest path). Optimal message routing matrices for even relatively small point-to-point networks may take hours or more to compute using modern computing equipment.
- the present invention provides a method, given a graph describing the connections between communicating entities, to quickly calculate a topology code that can be used as a key to efficiently look up pre-computed message routing matrices or other topology-specific information.
- the invention also provides a method for determining whether two given graphs are isomorphic.
- the invention computes a topology code for a point-to-point network by ordering the nodes of the graph representing the network in such a way that an adjacency matrix representation of the graph, when encoded into a topology code, yields a maximum value.
- the invention provides a means to quickly retrieve any sort of pre-computed topology-specific information, thereby circumventing the run-time cost that would be incurred were the information computed on demand.
- FIGS. 1 a and 1 b show graphs of two point-to-point networks which are apparently dissimilar yet are isomorphic to each other;
- FIG. 2 shows an example point-to-point network
- FIG. 3 lists all possible orderings of nodes in BFS traversals of the FIG. 2 network
- FIGS. 4 a and 4 b graphically represent trees of the two BFS traversals listed in FIG. 3 column 4 row 7 and row 3, respectively;
- FIG. 5 t is a tree graphic representation of the BFS traversal of connected nodes “a
- FIG. 5 m is an adjacency matrix for the network of FIG. 2 , using the node ordering specified by the BFS tree traversal of FIG. 5 t;
- FIG. 6 t is a tree graphic representation of the BFS traversal of connected nodes “e
- FIG. 6 m is an adjacency matrix for the network of FIG. 2 , using the node ordering specified by the BFS tree traversal of FIG. 6 t ;
- FIG. 7 shows schemes to derive a topology code from an adjacency matrix.
- the present invention enables promptly providing topology-specific information for large point-to-point networks. It is assumed that such information has been pre-computed and stored in association with a topology code in such a way as to allow the information to be retrieved by supplying an identical topology code as a key (e.g., in an STL map or a hash table). For each selected network and each newly encountered network the invention calculates a topology code that uniquely identifies the topology of that network. If two graphs have identical topology codes, then they have the same topology and are isomorphic. For instance, although not readily apparent from the drawings, the FIG. 1 a and FIG. 1 b graphs have the same topology. The FIGS.
- 1 a and 1 b graphs can be reconciled by swapping label pairs ( 4 , 5 ) and ( 6 , 7 ) and redrawing either graph. Since the graphs have the same topology, they are isomorphic and have the same topology code.
- Topology codes computed for newly encountered networks are used as keys to look up and retrieve stored topology-specific information.
- Examples of topology-specific information are performance statistics and other data that might be prohibitive to calculate on demand or that accumulate over time.
- topology codes can be used as keys to look up any sort of stored topology-specific data.
- topology-specific information is an optimal routing matrix describing how to most efficiently route messages between two nodes in a point-to-point network. Because all networks having the same topology implicitly have identical optimal routing matrices except for possible node labeling differences, the optimal routing matrix for a selected topology can be pre-computed and cached.
- the invention enables providing routing matrices for topologies of 8 nodes and more which require hours or longer to complete, by pre-computing the matrices, storing them in association with their topology codes, and looking them up based on runtime-computed topology codes.
- a network's topology is changed (say, by adding another node)
- its topology code can be quickly recalculated and used as a key to look up the cached optimal routing matrix for the new topology (assuming an optimal routing matrix for the new topology has been pre-computed and stored in the cache).
- the invention first applies a node ordering algorithm to the graph representing the network. Any algorithm may be employed that visits each node exactly once, and that is guaranteed to produce the same set of orderings for isomorphic graphs. Because the computed topology code is affected by the choice of node ordering algorithm, the algorithm employed when computing a topology code key used to look up stored topology-specific data must be the same algorithm that was employed to generate the topology code key associated with the stored data.
- BFS breadth first search
- the chosen node ordering algorithm considers all possible BFS traversal orderings.
- the FIG. 2 graph represents a 6-node network for which a topology code will be computed.
- the chosen node ordering algorithm yields the BFS traversals of trees listed in the FIG. 3 table. In each traversal, the root node appears first and groups of nodes having the same parent node are separated by ‘
- FIGS. 4 a and 4 b show two BFS trees having their root at node “d” and traversing the FIG. 2 network as in FIG. 3 column 4 row 7 and row 3 respectively.
- FIG. 5 t is the BFS tree for the FIG. 3 column 1 row 6 traversal
- FIG. 6 t is the BFS tree for the FIG. 3 column 5 row 4 traversal.
- a topology code is computed from a node ordering by first using the given ordering to construct an adjacency matrix representation of the graph.
- the elements of the adjacency matrix have a value of 1 if the vertices indicated by the intersecting column and row are directly connected neighbors in the graph representing the network, or 0 otherwise. Because the values of the elements of an adjacency matrix for simple undirected graphs are mirrored about the matrix's diagonal, more than half the elements are redundant and can be ignored. The remaining elements are mapped to bits in the topology code.
- FIG. 7 shows four ways to map adjacency matrix elements to topology code bits. As can be seen from FIG. 7 , methods 1 and 2 are equivalent, as are methods 3 and 4 .
- the bits in the candidate topology codes are filled in from most significant bit to least significant bit. This is indicated by the direction of the arrows in FIG. 7 .
- the scheme employed when computing a topology code key used to look up stored topology-specific data must be the same scheme that was employed to generate the topology code key associated with the stored data.
- the following examples use the row-major topology code bit ordering scheme considering the lower-left adjacency matrix values (method 3 in FIG. 7 ). Using this scheme, the FIG. 5 t node ordering gives the adjacency matrix shown in FIG. 5 m and the FIG. 6 t node ordering gives the adjacency matrix shown in FIG. 6 m.
- the candidate topology code associated with FIG. 5 m is (“b” for binary) 0b′111 1000 1010 0111 (or in hexadecimal 0x78A7).
- the candidate topology code associated with FIG. 6 m is 0b′110 1100 1100 0111 (or in hexadecimal 0x6CC7).
- the candidate topology code with the maximum binary numerical value is taken to be the topology code representing the graph, and the node ordering used represents a canonical labeling for the graph.
- the row 6 traversal gives the node ordering for the FIG. 5 m matrix to produce a new candidate maximum value topology code of b′111 1000 1010 0111, or in hexadecimal 0x78A7, which will at least temporarily be considered the topology code for the FIG. 2 network.
- every node being connected to exactly three others reduces the test for producing the maximum code to: a traversal in which the first and second nodes connected to the root are also connected to each other. Each node has two such tree traversals, for a total of 12 out of the 48 possible traversals from FIG. 3 .
- the FIG. 4 a traversal is among those yielding the maximum code.
- the topology code for both the FIGS. 1 a and 1 b graphs is 0x0D19448D using the chosen node ordering algorithm and bit mapping scheme.
- a preferred embodiment of the invention combines these steps for efficiency.
- adjacency matrices can be filled in as the node orderings are generated, and the maximum candidate topology code computed so far can be remembered. If the matrix that produced the current maximum candidate topology code has a connection between a pair of vertices but the node ordering currently being used to fill in a candidate matrix has no connection between that pair of vertices, then, since the adjacency matrix is filled in order of bits from most significant to least significant, it immediately becomes evident that the currently-filling matrix can only produce a non-maximal topology code. For example, once the FIG. 5 m current maximum code has been calculated, then upon processing the FIG. 6 m matrix to the third bit, row f column c where FIG.
- FIG. 6 m having a 0 value dooms it to produce a less-than-maximum value. If this situation were encountered, computation with the node ordering currently filling the doomed matrix would better be abandoned and the algorithm should move on to the next node ordering. This eliminates a large number of calculations and vastly improves efficiency.
- a topology code constructed in this manner contains all information necessary to reconstruct a graph that is isomorphic to all other graphs having the same topology code.
- the most significant bit of the topology code will always have a value of 1.
- stored topology-specific data is dependent on node ordering, then its node ordering should be stored and retrieved along with the data itself.
- a routing table for a specific network would contain references to nodes within the network.
- the new network's node labeling may be different from the stored network. Having access to the stored network's node ordering allows the stored routing table's node references to be mapped to the node labeling of the new network.
- the invention can be used to retrieve any sort of topology-specific information given any network whose topology can be described by a simple graph. While the preferred embodiment is directed specifically to simple graphs (having at most a single edge connecting any two vertices), the ideas apply equally well to graphs where there may be multiple edges (or equivalently, single edges with weight values) connecting vertices. The difference would be that the adjacency matrices would contain values other than just 0 or 1, and these numbers would map to more than one bit in the topology code.
Abstract
Network topology codes are computed and used as keys to retrieve topology-specific information for isomorphic networks.
Description
- This application is a Continuation of U.S. application Ser. No. 13/783,190 filed Mar. 1, 2013, which is a Continuation of U.S. application Ser. No. 12/365,838 filed Feb. 4, 2009, now U.S. Pat. No. 8,411,591 which is a Continuation of U.S. application Ser. No. 11/258,782 filed Oct. 26, 2005, now U.S. Pat. No. 7,492,716, which is hereby incorporated by reference in its entirety.
- 1. Field of the Invention
- The present invention relates generally to providing topology-specific information, and more particularly to identifying and using topology codes to store and retrieve pre-computed topology-specific information for a point-to-point network.
- 2. Discussion of Prior Art
- Operation of certain networks requires routing tables. Conventionally, routing tables have been recalculated whenever a network topology was changed. If the number of nodes in the network is very small, then the optimal routing matrix could be computed directly by analyzing every possible routing matrix, eliminating those that are invalid or that would allow deadlocks to occur, and choosing the one with the best statistics (such as minimum hop count or shortest longest path). Optimal message routing matrices for even relatively small point-to-point networks may take hours or more to compute using modern computing equipment.
- However, if the number of nodes in a simple graph topology exceeds typically 6 nodes, an exhaustive search would become prohibitively time-consuming. A typical 8-node configuration would require analysis of almost 2 quadrillion matrices. This makes on-demand calculation of routing matrices infeasible in environments where users may change a topology and request a routing matrix for the new topology at will. One approach to solving this problem is to artificially restrict the user to pick a network topology from a small set of several allowed topologies, for which the routing tables are already known/computed. Another approach would be to use faster heuristic rules to compute the routing tables upon request. This might reduce the time required to compute the solution, but such heuristic rules might apply only to a small set of simple topologies, and would not guarantee an optimal solution.
- It remains therefore difficult and prohibitively time-consuming to calculate some topology-specific information and hence there is a need for a method of more promptly providing topology-specific information for large point-to-point networks.
- The present invention provides a method, given a graph describing the connections between communicating entities, to quickly calculate a topology code that can be used as a key to efficiently look up pre-computed message routing matrices or other topology-specific information. The invention also provides a method for determining whether two given graphs are isomorphic.
- The invention computes a topology code for a point-to-point network by ordering the nodes of the graph representing the network in such a way that an adjacency matrix representation of the graph, when encoded into a topology code, yields a maximum value.
- Among the advantages of the invention is that it provides a means to quickly retrieve any sort of pre-computed topology-specific information, thereby circumventing the run-time cost that would be incurred were the information computed on demand.
- These and other advantages of the invention will become apparent to those skilled in the art upon reading the following detailed description of the preferred embodiment as shown in the several figures of the drawing.
-
FIGS. 1 a and 1 b show graphs of two point-to-point networks which are apparently dissimilar yet are isomorphic to each other; -
FIG. 2 shows an example point-to-point network; -
FIG. 3 lists all possible orderings of nodes in BFS traversals of theFIG. 2 network; -
FIGS. 4 a and 4 b graphically represent trees of the two BFS traversals listed inFIG. 3 column 4row 7 androw 3, respectively; -
FIG. 5 t is a tree graphic representation of the BFS traversal of connected nodes “a|ceb|d|f” listed inFIG. 3 column 1row 6; -
FIG. 5 m is an adjacency matrix for the network ofFIG. 2 , using the node ordering specified by the BFS tree traversal ofFIG. 5 t; -
FIG. 6 t is a tree graphic representation of the BFS traversal of connected nodes “e|cfa|d|b” listed inFIG. 3 column 5row 4; -
FIG. 6 m is an adjacency matrix for the network ofFIG. 2 , using the node ordering specified by the BFS tree traversal ofFIG. 6 t; and -
FIG. 7 shows schemes to derive a topology code from an adjacency matrix. - The present invention enables promptly providing topology-specific information for large point-to-point networks. It is assumed that such information has been pre-computed and stored in association with a topology code in such a way as to allow the information to be retrieved by supplying an identical topology code as a key (e.g., in an STL map or a hash table). For each selected network and each newly encountered network the invention calculates a topology code that uniquely identifies the topology of that network. If two graphs have identical topology codes, then they have the same topology and are isomorphic. For instance, although not readily apparent from the drawings, the
FIG. 1 a andFIG. 1 b graphs have the same topology. TheFIGS. 1 a and 1 b graphs can be reconciled by swapping label pairs (4,5) and (6,7) and redrawing either graph. Since the graphs have the same topology, they are isomorphic and have the same topology code. - Topology codes computed for newly encountered networks are used as keys to look up and retrieve stored topology-specific information. Examples of topology-specific information are performance statistics and other data that might be prohibitive to calculate on demand or that accumulate over time. In general, topology codes can be used as keys to look up any sort of stored topology-specific data.
- An important example of topology-specific information is an optimal routing matrix describing how to most efficiently route messages between two nodes in a point-to-point network. Because all networks having the same topology implicitly have identical optimal routing matrices except for possible node labeling differences, the optimal routing matrix for a selected topology can be pre-computed and cached. The invention enables providing routing matrices for topologies of 8 nodes and more which require hours or longer to complete, by pre-computing the matrices, storing them in association with their topology codes, and looking them up based on runtime-computed topology codes. Then, if a network's topology is changed (say, by adding another node), its topology code can be quickly recalculated and used as a key to look up the cached optimal routing matrix for the new topology (assuming an optimal routing matrix for the new topology has been pre-computed and stored in the cache).
- The invention first applies a node ordering algorithm to the graph representing the network. Any algorithm may be employed that visits each node exactly once, and that is guaranteed to produce the same set of orderings for isomorphic graphs. Because the computed topology code is affected by the choice of node ordering algorithm, the algorithm employed when computing a topology code key used to look up stored topology-specific data must be the same algorithm that was employed to generate the topology code key associated with the stored data. The examples in the remainder of this document use a breadth first search (BFS) algorithm with the additional step of considering all possible orderings of child nodes. Typically in BFS traversals, one is interested in visiting all nodes and visiting parent nodes before child nodes, but is not interested in the order in which the child nodes are visited. In contrast, the present invention is interested in the order of child node visits because this can affect the topology code value. The chosen node ordering algorithm considers all possible BFS traversal orderings. The
FIG. 2 graph represents a 6-node network for which a topology code will be computed. The chosen node ordering algorithm yields the BFS traversals of trees listed in theFIG. 3 table. In each traversal, the root node appears first and groups of nodes having the same parent node are separated by ‘|’.FIGS. 4 a and 4 b show two BFS trees having their root at node “d” and traversing theFIG. 2 network as inFIG. 3 column 4row 7 androw 3 respectively.FIG. 5 t is the BFS tree for theFIG. 3 column 1row 6 traversal, andFIG. 6 t is the BFS tree for theFIG. 3 column 5row 4 traversal. - A topology code is computed from a node ordering by first using the given ordering to construct an adjacency matrix representation of the graph. The elements of the adjacency matrix have a value of 1 if the vertices indicated by the intersecting column and row are directly connected neighbors in the graph representing the network, or 0 otherwise. Because the values of the elements of an adjacency matrix for simple undirected graphs are mirrored about the matrix's diagonal, more than half the elements are redundant and can be ignored. The remaining elements are mapped to bits in the topology code.
FIG. 7 shows four ways to map adjacency matrix elements to topology code bits. As can be seen fromFIG. 7 ,methods methods FIG. 7 . Because the computed topology code is affected by the choice of bit ordering scheme, the scheme employed when computing a topology code key used to look up stored topology-specific data must be the same scheme that was employed to generate the topology code key associated with the stored data. The following examples use the row-major topology code bit ordering scheme considering the lower-left adjacency matrix values (method 3 inFIG. 7 ). Using this scheme, theFIG. 5 t node ordering gives the adjacency matrix shown inFIG. 5 m and theFIG. 6 t node ordering gives the adjacency matrix shown inFIG. 6 m. - The candidate topology code associated with
FIG. 5 m is (“b” for binary) 0b′111 1000 1010 0111 (or in hexadecimal 0x78A7). The candidate topology code associated withFIG. 6 m is 0b′110 1100 1100 0111 (or in hexadecimal 0x6CC7). The candidate topology code with the maximum binary numerical value is taken to be the topology code representing the graph, and the node ordering used represents a canonical labeling for the graph. - In a process of evaluating traversals from
FIG. 3 starting downcolumn 1, therow 6 traversal, as represented in theFIG. 5 t tree, gives the node ordering for theFIG. 5 m matrix to produce a new candidate maximum value topology code of b′111 1000 1010 0111, or in hexadecimal 0x78A7, which will at least temporarily be considered the topology code for theFIG. 2 network. - After finding the
FIG. 5 m candidate maximum value topology code, continuing the search will ultimately find 11 other BFS trees yielding the same maximum topology code, but none higher. In the simple example network ofFIG. 2 , every node being connected to exactly three others reduces the test for producing the maximum code to: a traversal in which the first and second nodes connected to the root are also connected to each other. Each node has two such tree traversals, for a total of 12 out of the 48 possible traversals fromFIG. 3 . TheFIG. 4 a traversal is among those yielding the maximum code. - The topology code for both the
FIGS. 1 a and 1 b graphs is 0x0D19448D using the chosen node ordering algorithm and bit mapping scheme. - A preferred embodiment of the invention combines these steps for efficiency. For example, adjacency matrices can be filled in as the node orderings are generated, and the maximum candidate topology code computed so far can be remembered. If the matrix that produced the current maximum candidate topology code has a connection between a pair of vertices but the node ordering currently being used to fill in a candidate matrix has no connection between that pair of vertices, then, since the adjacency matrix is filled in order of bits from most significant to least significant, it immediately becomes evident that the currently-filling matrix can only produce a non-maximal topology code. For example, once the
FIG. 5 m current maximum code has been calculated, then upon processing theFIG. 6 m matrix to the third bit, row f column c whereFIG. 5 m has a 1 value,FIG. 6 m having a 0 value dooms it to produce a less-than-maximum value. If this situation were encountered, computation with the node ordering currently filling the doomed matrix would better be abandoned and the algorithm should move on to the next node ordering. This eliminates a large number of calculations and vastly improves efficiency. - A topology code constructed in this manner contains all information necessary to reconstruct a graph that is isomorphic to all other graphs having the same topology code. The most significant bit of the topology code will always have a value of 1. The redundancy in an adjacency matrix representation of a graph indicates that the number of nodes N in the graph is related to the number of significant bits B in the topology code by the following formula: B=N(N−1)/2. Once the number of nodes N are known, an N×N adjacency matrix can be populated directly with the bit values of the topology code according to the bit mapping scheme used to create the topology code. A graph can then be drawn from inspection of the adjacency matrix.
- If stored topology-specific data is dependent on node ordering, then its node ordering should be stored and retrieved along with the data itself. For example, a routing table for a specific network would contain references to nodes within the network. When a topology code is computed for a new network that is isomorphic to the stored network, the new network's node labeling may be different from the stored network. Having access to the stored network's node ordering allows the stored routing table's node references to be mapped to the node labeling of the new network.
- The invention can be used to retrieve any sort of topology-specific information given any network whose topology can be described by a simple graph. While the preferred embodiment is directed specifically to simple graphs (having at most a single edge connecting any two vertices), the ideas apply equally well to graphs where there may be multiple edges (or equivalently, single edges with weight values) connecting vertices. The difference would be that the adjacency matrices would contain values other than just 0 or 1, and these numbers would map to more than one bit in the topology code.
- While the present invention is described in terms of a preferred embodiment, it will be appreciated by those skilled in the art that this embodiment may be modified without departing from the essence of the invention. It is therefore intended that the following claims be interpreted as covering any modifications falling within the true spirit and scope of the invention.
Claims (13)
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.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/332,335 US20140328212A1 (en) | 2005-10-26 | 2014-07-15 | Method for Efficiently Retrieving Topology-Specific Data for Point-to-Point Networks |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/258,782 US7492716B1 (en) | 2005-10-26 | 2005-10-26 | Method for efficiently retrieving topology-specific data for point-to-point networks |
US12/365,838 US8411591B2 (en) | 2005-10-26 | 2009-02-04 | Method for efficiently retrieving topology-specific data for point-to-point networks |
US13/783,190 US8811232B2 (en) | 2005-10-26 | 2013-03-01 | Method for efficiently retrieving topology-specific data for point-to-point networks |
US14/332,335 US20140328212A1 (en) | 2005-10-26 | 2014-07-15 | Method for Efficiently Retrieving Topology-Specific Data for Point-to-Point Networks |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/783,190 Continuation US8811232B2 (en) | 2005-10-26 | 2013-03-01 | Method for efficiently retrieving topology-specific data for point-to-point networks |
Publications (1)
Publication Number | Publication Date |
---|---|
US20140328212A1 true US20140328212A1 (en) | 2014-11-06 |
Family
ID=40349351
Family Applications (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/258,782 Expired - Fee Related US7492716B1 (en) | 2005-10-26 | 2005-10-26 | Method for efficiently retrieving topology-specific data for point-to-point networks |
US12/365,838 Expired - Fee Related US8411591B2 (en) | 2005-10-26 | 2009-02-04 | Method for efficiently retrieving topology-specific data for point-to-point networks |
US13/783,190 Active US8811232B2 (en) | 2005-10-26 | 2013-03-01 | Method for efficiently retrieving topology-specific data for point-to-point networks |
US14/332,335 Abandoned US20140328212A1 (en) | 2005-10-26 | 2014-07-15 | Method for Efficiently Retrieving Topology-Specific Data for Point-to-Point Networks |
Family Applications Before (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/258,782 Expired - Fee Related US7492716B1 (en) | 2005-10-26 | 2005-10-26 | Method for efficiently retrieving topology-specific data for point-to-point networks |
US12/365,838 Expired - Fee Related US8411591B2 (en) | 2005-10-26 | 2009-02-04 | Method for efficiently retrieving topology-specific data for point-to-point networks |
US13/783,190 Active US8811232B2 (en) | 2005-10-26 | 2013-03-01 | Method for efficiently retrieving topology-specific data for point-to-point networks |
Country Status (1)
Country | Link |
---|---|
US (4) | US7492716B1 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109347680A (en) * | 2018-11-08 | 2019-02-15 | 深圳大学 | A kind of network topology reconstructing method, device and terminal device |
WO2020093291A1 (en) * | 2018-11-08 | 2020-05-14 | 深圳大学 | Network topology reconstruction method and apparatus, and terminal device |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10394778B2 (en) | 2010-09-03 | 2019-08-27 | Robert Lewis Jackson, JR. | Minimal representation of connecting walks |
US8856386B2 (en) * | 2012-08-21 | 2014-10-07 | Cisco Technology, Inc. | Cloud resource placement using placement pivot in physical topology |
WO2014074088A1 (en) * | 2012-11-06 | 2014-05-15 | Hewlett-Packard Development Company, L.P. | Enhanced graph traversal |
AU2015360415A1 (en) * | 2014-12-10 | 2017-06-29 | Kyndi, Inc. | Apparatus and method for combinatorial hypermap based data representations and operations |
US9794805B1 (en) * | 2016-06-21 | 2017-10-17 | International Business Machines Corporation | Robustness of a cellular network by using synergistic shapley values to identify censorious macrocells |
US10693737B1 (en) * | 2017-09-29 | 2020-06-23 | Charter Communications Operating, Llc | Universal alias and dependency models and network analysis |
Citations (21)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5093824A (en) * | 1990-03-27 | 1992-03-03 | Bell Communications Research, Inc. | Distributed protocol for improving the survivability of telecommunications trunk networks |
US5572640A (en) * | 1994-12-01 | 1996-11-05 | Hewlett-Packard Company | Batch transfer system and method for high performance graphic display of network topology |
US5684967A (en) * | 1995-09-13 | 1997-11-04 | International Business Machines Corporation | System and method for generalized network topology representation |
US5848243A (en) * | 1995-11-13 | 1998-12-08 | Sun Microsystems, Inc. | Network topology management system through a database of managed network resources including logical topolgies |
US6031528A (en) * | 1996-11-25 | 2000-02-29 | Intel Corporation | User based graphical computer network diagnostic tool |
US6216132B1 (en) * | 1997-11-20 | 2001-04-10 | International Business Machines Corporation | Method and system for matching consumers to events |
US20020124079A1 (en) * | 2001-03-02 | 2002-09-05 | Pulsipher Eric A. | System for inference of presence of network infrastructure devices |
US6463065B1 (en) * | 1998-11-17 | 2002-10-08 | Cisco Technology, Inc. | Mixed topology data switching system |
US6535227B1 (en) * | 2000-02-08 | 2003-03-18 | Harris Corporation | System and method for assessing the security posture of a network and having a graphical user interface |
US6542473B1 (en) * | 1996-12-05 | 2003-04-01 | Telefonaktiebolaget Lm Ericsson (Publ) | Arrangement and a method relating to transmission systems |
US6833850B1 (en) * | 2000-08-28 | 2004-12-21 | Sanavigator, Inc. | Method for simplifying display of complex network connections through partial overlap of connections in displayed segments |
US20050015511A1 (en) * | 2003-07-02 | 2005-01-20 | Nec Laboratories America, Inc. | Accelerated large data distribution in overlay networks |
US20050063318A1 (en) * | 2003-09-19 | 2005-03-24 | Zhichen Xu | Providing a notification including location information for nodes in an overlay network |
US20050088965A1 (en) * | 2003-10-03 | 2005-04-28 | Avici Systems, Inc. | Rapid alternate paths for network destinations |
US20050259637A1 (en) * | 2004-05-21 | 2005-11-24 | Chu Thomas P | Method for optimal path selection in traversal of packets through network address translators |
US20060126534A1 (en) * | 2004-12-10 | 2006-06-15 | Huibregtse Thomas P | Method and mechanism for identifying an unmanaged switch in a network |
US20060149782A1 (en) * | 2005-01-05 | 2006-07-06 | Microsoft Corporation | Prescribed navigation using topology metadata and navigation path |
US7224362B2 (en) * | 2003-01-30 | 2007-05-29 | Agilent Technologies, Inc. | Systems and methods for providing visualization and network diagrams |
US7315985B1 (en) * | 2002-12-31 | 2008-01-01 | Emc Corporation | Methods and apparatus for managing network resources using a network topology view |
US7562132B2 (en) * | 2001-06-29 | 2009-07-14 | International Business Machines Corporation | Method and system for restricting and enhancing topology displays for multi-customer logical networks within a network management system |
US8040905B2 (en) * | 2006-07-21 | 2011-10-18 | Huawei Technologies Co., Ltd. | Method and system for establishing emergency call |
Family Cites Families (45)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE3687400T2 (en) * | 1985-11-04 | 1993-07-15 | Ibm | DIGITAL NEWS TRANSMISSION NETWORKS AND STRUCTURE OF TRANSMISSION WAYS IN THESE NETWORKS. |
US5276789A (en) * | 1990-05-14 | 1994-01-04 | Hewlett-Packard Co. | Graphic display of network topology |
US6115393A (en) * | 1991-04-12 | 2000-09-05 | Concord Communications, Inc. | Network monitoring |
US5481674A (en) * | 1994-06-20 | 1996-01-02 | Mahavadi; Manohar R. | Method and apparatus mapping the physical topology of EDDI networks |
US5737319A (en) * | 1996-04-15 | 1998-04-07 | Mci Corporation | Dynamic network topology determination |
US5910803A (en) * | 1996-08-14 | 1999-06-08 | Novell, Inc. | Network atlas mapping tool |
US5948055A (en) * | 1996-08-29 | 1999-09-07 | Hewlett-Packard Company | Distributed internet monitoring system and method |
US6256295B1 (en) * | 1997-09-25 | 2001-07-03 | Nortel Networks Limited | Method and apparatus for determining multiple minimally-overlapping paths between nodes in a network |
US6154212A (en) * | 1997-11-06 | 2000-11-28 | Lucent Technologies Inc. | Method and apparatus for constructing network interfaces |
US6377987B1 (en) * | 1999-04-30 | 2002-04-23 | Cisco Technology, Inc. | Mechanism for determining actual physical topology of network based on gathered configuration information representing true neighboring devices |
US6714936B1 (en) * | 1999-05-25 | 2004-03-30 | Nevin, Iii Rocky Harry W. | Method and apparatus for displaying data stored in linked nodes |
US6526044B1 (en) * | 1999-06-29 | 2003-02-25 | Wandel & Goltermann Technologies, Inc. | Real-time analysis through capture buffer with real-time historical data correlation |
US6697334B1 (en) * | 2000-01-18 | 2004-02-24 | At&T Corp. | Method for designing a network |
US6873600B1 (en) * | 2000-02-04 | 2005-03-29 | At&T Corp. | Consistent sampling for network traffic measurement |
US6636239B1 (en) * | 2000-02-24 | 2003-10-21 | Sanavigator, Inc. | Method of operating a graphical user interface to selectively enable and disable a datapath in a network |
US6798777B1 (en) * | 2000-04-17 | 2004-09-28 | Juniper Networks, Inc. | Filtering and route lookup in a switching device |
US7027448B2 (en) * | 2000-04-21 | 2006-04-11 | At&T Corp. | System and method for deriving traffic demands for a packet-switched network |
US6885644B1 (en) * | 2000-05-30 | 2005-04-26 | International Business Machines Corporation | Topology propagation in a distributed computing environment with no topology message traffic in steady state |
US6836275B1 (en) * | 2000-08-28 | 2004-12-28 | Sanavigator, Inc. | Method for distinguishing between single and multiple connections in a network topology |
US7031308B2 (en) * | 2000-10-30 | 2006-04-18 | The Regents Of The University Of California | Tree-based ordered multicasting method |
US6701459B2 (en) * | 2000-12-27 | 2004-03-02 | Egurkha Pte Ltd | Root-cause approach to problem diagnosis in data networks |
NL1017388C2 (en) * | 2001-02-16 | 2002-08-19 | Marc Van Oldenborgh | Organic data network with a dynamic topology. |
US8135815B2 (en) * | 2001-03-27 | 2012-03-13 | Redseal Systems, Inc. | Method and apparatus for network wide policy-based analysis of configurations of devices |
US6754753B2 (en) * | 2001-04-27 | 2004-06-22 | International Business Machines Corporation | Atomic ownership change operation for input/output (I/O) bridge device in clustered computer system |
US20020198994A1 (en) * | 2001-05-15 | 2002-12-26 | Charles Patton | Method and system for enabling and controlling communication topology, access to resources, and document flow in a distributed networking environment |
US7139823B2 (en) * | 2001-08-23 | 2006-11-21 | International Business Machines Corporation | Dynamic intelligent discovery applied to topographic networks |
US20030112958A1 (en) * | 2001-12-13 | 2003-06-19 | Luc Beaudoin | Overlay view method and system for representing network topology |
US7096228B2 (en) * | 2002-03-27 | 2006-08-22 | Microsoft Corporation | Method and system for managing data records on a computer network |
US7379428B2 (en) * | 2002-10-31 | 2008-05-27 | Hewlett-Packard Development Company, L.P. | Autonomous system topology based auxiliary network for peer-to-peer overlay network |
US7450524B2 (en) * | 2003-06-30 | 2008-11-11 | Kontiki, Inc. | Method and apparatus for determining network topology in a peer-to-peer network |
US7788400B2 (en) * | 2003-09-19 | 2010-08-31 | Hewlett-Packard Development Company, L.P. | Utilizing proximity information in an overlay network |
US20050141706A1 (en) * | 2003-12-31 | 2005-06-30 | Regli William C. | System and method for secure ad hoc mobile communications and applications |
US7502333B2 (en) * | 2004-03-23 | 2009-03-10 | Hewlett-Packard Development Company, L.P. | Pre-configured topology with connection management |
JP4373271B2 (en) * | 2004-05-14 | 2009-11-25 | 富士通株式会社 | Method and program for grasping network configuration of virtual LAN in node network |
US20060048077A1 (en) * | 2004-08-31 | 2006-03-02 | International Business Machines Corporation | Method, system, program product and user interface for displaying a topology |
US7222149B2 (en) * | 2004-09-17 | 2007-05-22 | Microsoft Corporation | Ordering decision nodes in distributed decision making |
US7710898B2 (en) * | 2005-01-31 | 2010-05-04 | Hewlett-Packard Development Company, L.P. | Method and apparatus for automatic verification of a zone configuration of a plurality of network switches |
JP4335157B2 (en) * | 2005-02-01 | 2009-09-30 | 富士通株式会社 | Network configuration management apparatus, network configuration management program, and network configuration management method |
US7640339B1 (en) * | 2005-02-14 | 2009-12-29 | Sun Microsystems, Inc. | Method and apparatus for monitoring a node in a distributed system |
US7808971B2 (en) * | 2005-07-01 | 2010-10-05 | Miller John L | Routing cache for distributed hash tables |
US8266272B2 (en) * | 2005-11-07 | 2012-09-11 | Hewlett-Packard Development Company, L.P. | Methods for IT network representation and associated computer program products |
US7587675B2 (en) * | 2006-02-28 | 2009-09-08 | Microsoft Corporation | Network map |
US7613829B2 (en) * | 2006-05-22 | 2009-11-03 | Nokia Corporation | Proximity enforcement in heterogeneous network environments |
US7821936B2 (en) * | 2007-07-27 | 2010-10-26 | Avaya Inc. | Systems and methods for partitioning end-to-end performance effects using network tomography |
US8040906B2 (en) * | 2009-06-23 | 2011-10-18 | Nortel Networks Limited | Utilizing betweenness to determine forwarding state in a routed network |
-
2005
- 2005-10-26 US US11/258,782 patent/US7492716B1/en not_active Expired - Fee Related
-
2009
- 2009-02-04 US US12/365,838 patent/US8411591B2/en not_active Expired - Fee Related
-
2013
- 2013-03-01 US US13/783,190 patent/US8811232B2/en active Active
-
2014
- 2014-07-15 US US14/332,335 patent/US20140328212A1/en not_active Abandoned
Patent Citations (21)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5093824A (en) * | 1990-03-27 | 1992-03-03 | Bell Communications Research, Inc. | Distributed protocol for improving the survivability of telecommunications trunk networks |
US5572640A (en) * | 1994-12-01 | 1996-11-05 | Hewlett-Packard Company | Batch transfer system and method for high performance graphic display of network topology |
US5684967A (en) * | 1995-09-13 | 1997-11-04 | International Business Machines Corporation | System and method for generalized network topology representation |
US5848243A (en) * | 1995-11-13 | 1998-12-08 | Sun Microsystems, Inc. | Network topology management system through a database of managed network resources including logical topolgies |
US6031528A (en) * | 1996-11-25 | 2000-02-29 | Intel Corporation | User based graphical computer network diagnostic tool |
US6542473B1 (en) * | 1996-12-05 | 2003-04-01 | Telefonaktiebolaget Lm Ericsson (Publ) | Arrangement and a method relating to transmission systems |
US6216132B1 (en) * | 1997-11-20 | 2001-04-10 | International Business Machines Corporation | Method and system for matching consumers to events |
US6463065B1 (en) * | 1998-11-17 | 2002-10-08 | Cisco Technology, Inc. | Mixed topology data switching system |
US6535227B1 (en) * | 2000-02-08 | 2003-03-18 | Harris Corporation | System and method for assessing the security posture of a network and having a graphical user interface |
US6833850B1 (en) * | 2000-08-28 | 2004-12-21 | Sanavigator, Inc. | Method for simplifying display of complex network connections through partial overlap of connections in displayed segments |
US20020124079A1 (en) * | 2001-03-02 | 2002-09-05 | Pulsipher Eric A. | System for inference of presence of network infrastructure devices |
US7562132B2 (en) * | 2001-06-29 | 2009-07-14 | International Business Machines Corporation | Method and system for restricting and enhancing topology displays for multi-customer logical networks within a network management system |
US7315985B1 (en) * | 2002-12-31 | 2008-01-01 | Emc Corporation | Methods and apparatus for managing network resources using a network topology view |
US7224362B2 (en) * | 2003-01-30 | 2007-05-29 | Agilent Technologies, Inc. | Systems and methods for providing visualization and network diagrams |
US20050015511A1 (en) * | 2003-07-02 | 2005-01-20 | Nec Laboratories America, Inc. | Accelerated large data distribution in overlay networks |
US20050063318A1 (en) * | 2003-09-19 | 2005-03-24 | Zhichen Xu | Providing a notification including location information for nodes in an overlay network |
US20050088965A1 (en) * | 2003-10-03 | 2005-04-28 | Avici Systems, Inc. | Rapid alternate paths for network destinations |
US20050259637A1 (en) * | 2004-05-21 | 2005-11-24 | Chu Thomas P | Method for optimal path selection in traversal of packets through network address translators |
US20060126534A1 (en) * | 2004-12-10 | 2006-06-15 | Huibregtse Thomas P | Method and mechanism for identifying an unmanaged switch in a network |
US20060149782A1 (en) * | 2005-01-05 | 2006-07-06 | Microsoft Corporation | Prescribed navigation using topology metadata and navigation path |
US8040905B2 (en) * | 2006-07-21 | 2011-10-18 | Huawei Technologies Co., Ltd. | Method and system for establishing emergency call |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109347680A (en) * | 2018-11-08 | 2019-02-15 | 深圳大学 | A kind of network topology reconstructing method, device and terminal device |
WO2020093291A1 (en) * | 2018-11-08 | 2020-05-14 | 深圳大学 | Network topology reconstruction method and apparatus, and terminal device |
Also Published As
Publication number | Publication date |
---|---|
US8811232B2 (en) | 2014-08-19 |
US20090147703A1 (en) | 2009-06-11 |
US8411591B2 (en) | 2013-04-02 |
US20130182612A1 (en) | 2013-07-18 |
US7492716B1 (en) | 2009-02-17 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8811232B2 (en) | Method for efficiently retrieving topology-specific data for point-to-point networks | |
Xiang et al. | Scalable maximum clique computation using mapreduce | |
US7072304B2 (en) | Network path selection based on bandwidth | |
KR100748771B1 (en) | Method and apparatus for longest match address lookup | |
US6434144B1 (en) | Multi-level table lookup | |
US6173384B1 (en) | Method of searching for a data element in a data structure | |
US7664040B2 (en) | Method of accelerating the shortest path problem | |
Peleg | Proximity-preserving labeling schemes and their applications | |
US8325721B2 (en) | Method for selecting hash function, method for storing and searching routing table and devices thereof | |
US20090046724A1 (en) | Method for compressing route data in a router | |
US20100135305A1 (en) | Recursively Partitioned Static IP Router Tables | |
US20090150603A1 (en) | Low power ternary content-addressable memory (tcams) for very large forwarding tables | |
US20040105422A1 (en) | Dynamic IP router tables using highest-priority matching | |
US20090327316A1 (en) | Dynamic Tree Bitmap for IP Lookup and Update | |
CN103051543B (en) | A kind of process of route prefix, search, increase and delet method | |
EP2544414A1 (en) | Method and device for storing routing table entry | |
CN108874987B (en) | Table entry management method and device and exchange chip | |
CN105141525A (en) | IPv6 routing lookup method and IPv6 routing lookup device | |
Abraham et al. | Compact routing for graphs excluding a fixed minor | |
Kant | Augmenting outerplanar graphs | |
US20070025346A1 (en) | System and method for creating a routing table | |
Lu | Improved compact routing tables for planar networks via orderly spanning trees | |
US20060288020A1 (en) | Method and data structure for indexed storage of hierarchically interrelated information in a relational database | |
Avresky | Embedding and reconfiguration of spanning trees in faulty hypercubes | |
CN106709045B (en) | Node selection method and device in distributed file system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |