METHOD AND SYSTEM FOR IDENTIFYING NETWORK PATHS

• US 20100061264A1
• Filed: 09/11/2008
• Published: 03/11/2010
• Est. Priority Date: 09/11/2008
• Status: Active Grant

• Current Assignee: Verizon Patent and Licensing Incorporated (Verizon Communications Inc.)
• Original Assignee: Verizon Business Network Services, Inc. (Verizon Communications Inc.)
• Inventors: CAMPBELL, Gary L., Mathews, Oommen
• Granted Patent: US 8,155,026 B2
• Time in Patent Office: Days
• US Class Current: 370/253
• CPC Class Codes: H04L 41/0233 Object-oriented techniques, for representation of network management data, e.g. common object request broker architecture [CORBA]
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 43/0852 Delays
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• CPC Class Codes: H04L 45/121 by minimising delays
• CPC Class Codes: H04L 45/122 by minimising distances, e.g. by selecting a route with minimum of number of hops
• CPC Class Codes: H04L 45/124 using a combination of metrics

Abstract

A method and system of an embodiment may include receiving network information associated with one or more network links, one or more network nodes, and a network hub, identifying at least two network paths from at least one of the one or more network nodes to the network hub based on the network information. Identifying at least two network paths from at least one of the one or more network nodes to the network hub based on the network information may include determining a number of hops for each identified network path, determining a latency of each link for each identified network path, summing the latencies of each link for each identified network path to calculate a total network path latency, and determining a ranking of the network paths based at least in part on the number of hops and the total network path latency.

Claims

1. A method, comprising:

receiving network information associated with one or more network links, one or more network nodes, and a network hub;

identifying at least two network paths from at least one of the one or more network nodes to the network hub based on the network information;

determining a number of hops for each identified network path;

determining a latency of each link for each identified network path;

summing the latencies of each link for each identified network path to calculate a total network path latency; and

determining a ranking of the network paths based at least in part on the number of hops and the total network path latency.

2. The method of claim 1, further comprising, for each network path,:

comparing the number of hops with a specified number of hops; and

removing the network path from a ranking determination in the event the number of hops exceeds the specified number of hops.

3. The method of claim 1, further comprising, for each network path,:

comparing the latency with a specified latency; and

removing the network path from a ranking determination in the event the latency exceeds the specified latency.

4. The method of claim 1, wherein each network path comprises a private network backbone.

5. The method of claim 1, wherein the number of network paths identified is less than or equal to a specified maximum number of network paths.

6. The method of claim 1, wherein identifying a network path comprises identifying a first node and identifying a network link coupling the first node to the network hub to identify a single hop network path.

7. The method of claim 1, wherein identifying a network path further comprises analyzing one or more portions of the network information to determine a network path with a fewest number of hops between a first node and the network hub.

8. The method of claim 7, further comprising identifying one or more network paths with a second fewest number of hops between a first node the network hub.

9. The method of claim 1, wherein determining the latency of the one or more links of each network path further comprises multiplying a distance of each network path by a specified multiplier.

10. The method of claim 9, further comprising calculating the distance of the network path utilizing a grid system of vertical and horizontal coordinates to identify locations of network components to determine a grid distance;

and

multiplying the grid distance by a specified multiplier to determine a network path distance.

11. The method of claim 1, wherein determining a ranking comprising summing latencies of the one or more links and combining the summed latency with the product of the number of hops times a specified multiplier.

12. The method of claim 1, wherein determining a latency of a link ensures a specified minimum amount of latency.

13. The method of claim 1, further comprising generating a report listing the ranking of one or more network paths.

14. The method of claim 1, further comprising utilizing the ranking to generate a routing table for one or more nodes.

15. A computer readable media comprising code to perform the acts of the method of claim

16. A system, comprising:

a database for storing network information; and

a processor configured to;

receive network information associated with one or more network links, one or more network nodes, and a network hub;

identify at least two network paths from at least one of the one or more network nodes to the network hub utilizing the network information;

determine a number of hops for each identified network path;

determine a latency of one or more links of each identified network path; and

determine a ranking of each identified network path based at least in part on the number of hops and the latency of each identified network path.

17. The system of claim 16, wherein the processor is further configured to, for each network path:

compare the number of hops with a specified number of hops; and

remove the network path from the ranking in the event the number of hops exceeds the specified number of hops.

18. The system of claim 16, wherein the processor is further configured to, for each network path:

compare the latency with a specified latency; and

remove the network path from the ranking in the event the latency exceeds the specified latency.

19. The system of claim 16, wherein each network path comprises a private network backbone.

20. The system of claim 16, wherein the processor is further configured to, for each network path:

identify a network path by analyzing one or more portions of the network information to determine a network path with a fewest number of hops between a first node and the network hub.

21. The system of claim 16, wherein the processor is further configured to, for each network path:

determine the latency of the one or more links of the network path by multiplying a distance of the network path by a specified multiplier.

22. The system of claim 21, wherein the processor is further configured to, for each network path:

calculate the distance of the network path utilizing a grid system of vertical and horizontal coordinates to identify locations of network components to determine a grid distance; and

multiply the grid distance by a specified multiplier to determine a network path distance.

23. The system of claim 16, wherein the processor is further configured to generate a report listing the ranking of one or more network paths.