METHOD FOR ROUTING INFORMATION OVER A NETWORK EMPLOYING CENTRALIZED CONTROL
First Claim
Patent Images
1. A method for adding a path in a network, wherein said network comprises a plurality of nodes, comprising:
- performing path discovery at a master node, wherein each of said nodes is communicatively coupled to another of said nodes by at least one of a plurality of optical links, said path discovery is performed by a route processor associated with said master node, said path discovery is performed to identify said path, and said path is between a source node of said nodes and a destination node of said nodes; and
if said path is successfully discovered, adding said path to a topology database, and sending an update message to a backup node, said update message comprising information regarding said path.
0 Assignments
0 Petitions
Accused Products
Abstract
A method and apparatus for centralized control of a network is described. The network includes a number of nodes. The method includes creating a database and storing the database on a master node of the network. The database contains topology information regarding a topology of the network. Each of the nodes is coupled to at least one other of the nodes, with the master node being one of the nodes.
44 Citations
28 Claims
-
1. A method for adding a path in a network, wherein said network comprises a plurality of nodes, comprising:
-
performing path discovery at a master node, wherein each of said nodes is communicatively coupled to another of said nodes by at least one of a plurality of optical links, said path discovery is performed by a route processor associated with said master node, said path discovery is performed to identify said path, and said path is between a source node of said nodes and a destination node of said nodes; and
if said path is successfully discovered, adding said path to a topology database, and sending an update message to a backup node, said update message comprising information regarding said path. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A method for deleting a path in a network, wherein said network comprises a plurality of nodes, comprising:
-
receiving a deletion request at a route processor of a master node, wherein said deletion request comprises a connection identifier, said connection identifier identifies said path, said path is between a source node of said nodes and a destination node of said nodes, said path comprising a plurality of said nodes, said plurality of said nodes comprises said source and said destination nodes,and each of said nodes is communicatively coupled to another of said nodes by at least one of a plurality of optical links;
communicating a reconfiguration message to each of said plurality of said nodes; and
deleting said path from a topology database, if said path is successfully deleted. - View Dependent Claims (11, 12, 13, 14, 15, 16)
-
-
17. A method for changing a path in a network, wherein said network comprises a plurality of nodes, comprising:
-
receiving a connectivity change request at a master node, wherein said path is between a source node of said nodes and a destination node of said nodes, said path comprising a plurality of said nodes, said plurality of said nodes comprises said source and said destination nodes, and each of said nodes is communicatively coupled to another of said nodes by at least one of a plurality of optical links;
determining if ones of said nodes affected by said connectivity change request can be configured to effect said connectivity change request; and
updating a topology database to reflect a change in said path effected by said connectivity change request, if said ones of said nodes affected by said connectivity change request can be configured to effect said connectivity change request. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28)
-
Specification