Method and apparatus for interactive routing

• US 8,717,933 B2
• Filed: 11/07/2007
• Issued: 05/06/2014
• Est. Priority Date: 05/25/2007
• Status: Active Grant

• Current Assignee: Tellabs Operations Incorporated (Infinera Corp.)
• Original Assignee: Tellabs Operations Incorporated (Infinera Corp.)
• Inventors: Fisher, Kenneth M., Jenkins, David W., Anand, Ramasubramanian, Desai, Abhishek J.
• Primary Examiner(s): Blanton, John
• Assistant Examiner(s): CRUTCHFIELD, CHRISTOPHER M
• Application Number:
  US11/936,379
• Publication Number:
  US 20080291925A1
• Time in Patent Office: 2,372 Days
• Field of Search: None
• US Class Current: 370/254
• CPC Class Codes: H04L 41/0806 for initial configuration or provisioning, e.g. plug-and-play
• CPC Class Codes: H04L 41/0823 characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability for optimising operational conditions of wireless networks H04W24/02
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 41/22 comprising specially adapted graphical user interfaces [GUI]
• 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/10 Routing in connection-oriented networks, e.g. X.25 or ATM
• CPC Class Codes: H04L 45/42 Centralised routing

Abstract

A method to provision routes in a network having a plurality of nodes and a plurality of links connecting various nodes. The method includes determining a route between a designated source node and a designated destination node based on a preselected routing algorithm and one of (i) a designated node of interest and (ii) a designated link of interest, and outputting information indicating the determined route.

Claims

1. A procedure to provision routes in a network having a plurality of nodes and a plurality of links connecting various nodes, comprising:

selecting a routing algorithm from at least two routing algorithms;

designating a source node, a destination node, and one of a node of interest and a link of interest;

determining on a computer a ring that includes the designated source node and the designated destination node based on the selected routing algorithm and the one of a node of interest and a link of interest, the selected routing algorithm being executed on the computer; and

outputting information to indicate the determined ring,

wherein the determining includes (i) determining a first ring, (ii) determining a second ring, (iii) combining the first ring and the second ring, and (iv) eliminating unnecessary links in the combination of the first ring and the second ring.

2. A procedure according to claim 1, wherein the designation of the source node, the destination node, and the one of a node of interest and a link of interest is performed on a graphical display, and the outputting includes outputting information to indicate the determined ring on the graphical display.

3. A procedure according to claim 1, wherein the determined ring excludes the one of a node of interest and a link of interest.

4. A procedure according to claim 1, wherein the determined ring includes the one of a node of interest and a link of interest.

5. A procedure according to claim 4, wherein the one of a node of interest and a link of interest is a link of interest, and

wherein the first ring includes the source node and a node at one end of the link of interest and the second ring includes a node at the other end of the link of interest and the destination node.

6. A procedure to provision routes in a network having a plurality of nodes and a plurality of links connecting various nodes, comprising:

determining on a computer an initial route between a source node and a destination node using a preselected routing algorithm, the preselected routing algorithm being executed on the computer;

displaying the initial route on a display;

designating one of a link of interest and a node of interest on the display;

revising the initial route between the source node and the destination node based on the one of a link of interest and a node of interest, the revising including (i) determining a first new route, (ii) determining a second new route, (iii) combining the first new route and the second new route, and (iv) eliminating unnecessary links in the combination of the first new route and the second new route; and

outputting information to indicate the revised route.

7. A procedure according to claim 6, wherein the one of a link of interest and a node of interest is a node of interest, and

wherein the revised route excludes the node of interest.

8. A procedure according to claim 6, wherein the one of a link of interest and a node of interest is a link of interest, and

wherein the revised route excludes the link of interest.

9. A procedure according to claim 6, wherein the one of a link of interest and a node of interest is a link of interest, and

wherein the revised route includes the link of interest.

10. A procedure according to claim 9, wherein the first new route includes the source node and a node at one end of the link of interest and the second new route includes a node at the other end of the link of interest and the destination node.

11. A procedure according to claim 10, wherein determining the revised route is performed using the preselected routing algorithm.

12. A procedure according to claim 9, wherein the first new route is based on the initial route and the second new route is based on the initial route.

13. A procedure according to claim 9, wherein determining the initial route includes determining a ring that includes the source node and the destination node, and

wherein the revised route is a ring that includes the source node, the destination node, and the designated link of interest.

14. A procedure according to claim 9, wherein determining the initial route includes determining a ring that includes the source node and the destination node,

wherein the first new route is a ring that includes source node and a node at one end of the link of interest, and

wherein the second new route is a ring that includes a node at the other end of the link of interest and the destination node.

15. A procedure to provision routes in a network having a plurality of nodes and a plurality of links connecting various nodes, comprising:

designating a source node on a display of network nodes;

designating a destination node on the display of network nodes;

inputting a command to determine an initial route between the source node and the destination node using a preselected routing algorithm;

displaying the initial route on the display of network nodes;

designating, on the display of network nodes, one of a node of interest and a link of interest; and

inputting a command to revise the initial route between the source node and the destination node based on the one of a node of interest and a link of interest, the command including instructions to (i) determine two new routes, (iii) combine the two new routes, and (iii) eliminate unnecessary links in the combination of the two new routes.

16. A procedure according to claim 15, further comprising:

selecting a preselected routing algorithm to be used in the determination of the initial route.

17. A procedure according to claim 15, further comprising:

selecting whether a revised route is to include the one of a node of interest and a link of interest or exclude the one of a node of interest and a link of interest.

18. An apparatus to provision routes in a network, comprising:

a memory to store information regarding a plurality of network nodes and links connecting network nodes;

a display to display information regarding the plurality of network nodes and the links connecting the network nodes;

a user interface to input user designations; and

a processor to control the apparatus to

(i) determine an initial route between a source node and a destination node using a preselected routing algorithm,

(ii) display the initial route on the display,

(iii) revise the initial route between the source node and the destination node based on one of a designated node of interest and a designated link of interest, the one of a designated node of interest and a designated link of interest being designated on the display, the revising including determining a first new route, determining a second new route, combining the first new route and the second new route, and eliminating unnecessary links in the combination of the first new route and the second new route, and

(iv) output information to the display to indicate the revised route.

19. An apparatus according to claim 18, wherein when the one of a designated node of interest and a designated link of interest is a designated link of interest, the first new route includes the source node and a node at one end of the designated link of interest and the second new route includes a node at the other end of the designated link of interest and the destination node.

20. An apparatus according to claim 18, wherein determining the initial route includes determining a first ring that includes the source node and the destination node, and

wherein revising the second route is a ring that includes the destination node and the one of a designated node of interest and a designated link of interest.

21. A non-transitory computer-readable medium embodying a computer program, the program comprising code to control an apparatus to:

determine an initial route between a source node and a destination node in a network having a plurality of nodes and a plurality of links connecting various nodes, using a preselected routing algorithm;

display the initial route on a display;

revise the initial route between the source node and the destination node based on one of a designated node of interest and a designated link of interest, the one of a designated node of interest and a designated link of interest being designated on the display, the revising including determining a first new route, determining a second new route, combining the first new route and the second new route, and eliminating unnecessary links in the combination of the first new route and the second new route; and

output information to indicate the revised route.