Method and apparatus for performing routing operations in a communications network

• US 7,580,401 B2
• Filed: 10/22/2003
• Issued: 08/25/2009
• Est. Priority Date: 10/22/2003
• Status: Active Grant

• Current Assignee: Ciena Corporation
• Original Assignee: Nortel Networks Limited (Nortel Networks Corporation)
• Inventors: Penney, Donald, Shew, Stephen D.
• Primary Examiner(s): Chan; Wing F
• Assistant Examiner(s): Jones; Prenell P
• Application Number:
  US10/689,605
• Publication Number:
  US 20050102418A1
• Time in Patent Office: 2,134 Days
• Field of Search: 370/396, 370/395, 370/260, 370/357, 370/401, 370/410, 370/230, 370/468, 370/218, 370/231, 370/236, 370/397, 370/256, 370/405, 370/331, 370/310, 370/399, 370/380, 370/400, 370/389, 370/229, 370/412, 370/428, 370352-356, 370/465, 370/238, 370/351, 370/467, 370/335, 709/228, 709/238, 709/203, 709/217, 709231-235, 709/226, 709/225, 709/229, 709/249, 709/223, 709/254, 709/351, 709/213, 709/224, 709/219, 398/58, 398/56, 359/118, 455/331, 455/435, 455/436, 455/445, 718/105, 375/222, 710/52
• US Class Current: 370/351
• CPC Class Codes: H04L 41/024 using relational databases for representation of network management data, e.g. managing via structured query language [SQL]
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/03 by updating link state protocols
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 45/42 Centralised routing
• CPC Class Codes: H04L 45/62 Wavelength based optical switching H04Q11/0062
• CPC Class Codes: H04L 67/63 Routing a service request depending on the request content or context
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

A server for use in a communications network implementing a routing function that serves multiple client NEs. The server interacts with a database storing true topology information corresponding to the client NEs. The routing function uses the true topology information in performing routing operations on behalf of the client NEs.

Claims

1. A method for upgrading a communications network having a plurality of NEs which are not equipped with a routing function, comprising:

a) providing in the communications network a server;

b) implementing on the server a single instance of a routing function for controlling routing functions for said plurality of NEs such that said plurality of NEs can perform routing functions without upgrading the NEs to include routing functions themselves.

2. A method as defined in claim 1, including implementing said routing function by running a single instance of a routing protocol.

3. A method as defined in claim 2, wherein the routing protocol is a distributed routing protocol.

4. A method as defined in claim 3, wherein said routing protocol is selected in the group consisting of OSPF, IS-IS and PNNI and a routing protocol based on either one of OSPF, IS-IS and PNNI.

5. A method as defined in claim 2, wherein the implementing of the routing function includes computing a path through the communications network for transporting data, wherein the path includes at least one of the plurality NEs as a source node for the path.

6. A method as defined in claim 2, wherein the implementing of the routing function includes advertising the existence of each of the plurality of NEs to a peer routing instance in the communications network.

7. A method as defined in claim 2, wherein the implementing of the routing function includes advertising link resources associated with each of the plurality of NEs to a peer routing instance in the communications network.

8. A method as defined in claim 2, wherein the implementing of the routing function includes receiving advertisements from a peer routing instance in the communications network about existence of NEs, other than the plurality of NEs.

9. A method as defined in claim 2, wherein the implementing of the routing function includes receiving advertisements from a peer routing instance in the communications network about link resources associated with NEs, other than the plurality of NEs.

10. A method as defined in claim 2, wherein the implementing of the routing function includes acquiring information from the client NEs about link resources associated with each client NE.

11. A method as defined in claim 1, comprising providing a database including true topology information about the plurality of NEs and allowing the routing function to interact with said database.

12. A method as defined in claim 11, comprising providing the database in the server.

13. A method for providing a control plane to a communications network that does not have a control plane, said method comprising:

a) providing a server in the communications network that can exchange control messages with a plurality of NEs of the communications network, the NEs being part of a bearer plane of the communications network not previously controlled by a control plane;

b) implementing on the server a routing function providing routing resources to the plurality of NEs without requiring the addition of a routing function to the NEs.

14. A method as defined in claim 13, wherein the bearer plane excludes the server.