Scheduled network layer programming within a multi-topology computer network
First Claim
1. A method comprising:
- receiving, by a path computation element, topology information for a base network layer of a multi-topology network, the multi-topology network comprising the base network layer having a plurality of network switches interconnected by base network layer three (L3) links in a base network topology and also comprising an overlay network layer having a plurality of overlay switches interconnected by overlay network links in an overlay network topology;
receiving, by the path computation element from a client and via a client interface, a path request that specifies two endpoints and a requested bandwidth;
computing, by the path computation element in response to receiving the path request and using the topology information for the base network layer and the topology information for the overlay network layer, a computed path to transport network traffic between the two endpoints, wherein at least a portion of the computed path traverses the base network layer, and wherein a network switch of the plurality of network switches is an ingress network switch for the portion of the computed path;
by the path computation element and after computing the computed path, receiving additional topology information for at least one of the overlay network layer and the base network layer;
receiving, by the path computation element from the network switch via a communication session, a failure event message indicating a failure of the portion of the computed path;
computing, by the path computation element in response to the failure event message and using the additional topology information, a new computed path that does not include the portion of the computed path;
sending, by the path computation element, new forwarding information for the new computed path to the network switch when the path computation element successfully computes the new computed path; and
sending, by the path computation element to the client via the client interface, a path rejection when the path computation element is not able to compute the new computed path.
0 Assignments
0 Petitions
Accused Products
Abstract
In general, techniques are described for dynamically scheduling and establishing paths in a multi-layer, multi-topology network to provide dynamic network resource allocation and support packet flow steering along paths prescribed at any layer or combination of layers of the network. In one example, a multi-topology path computation element (PCE) accepts requests from client applications for dedicated paths. The PCE receives topology information from network devices and attempts to identify paths through a layer or combination of layers of the network that can be established at the requested time in view of the specifications requested for the dedicated paths and the anticipated bandwidth/capacity available in the network. The PCE schedules the identified paths through the one or more layers of the network to carry traffic for the requested paths. At the scheduled times, the PCE programs path forwarding information into network nodes to establish the scheduled paths.
40 Citations
18 Claims
-
1. A method comprising:
-
receiving, by a path computation element, topology information for a base network layer of a multi-topology network, the multi-topology network comprising the base network layer having a plurality of network switches interconnected by base network layer three (L3) links in a base network topology and also comprising an overlay network layer having a plurality of overlay switches interconnected by overlay network links in an overlay network topology; receiving, by the path computation element from a client and via a client interface, a path request that specifies two endpoints and a requested bandwidth; computing, by the path computation element in response to receiving the path request and using the topology information for the base network layer and the topology information for the overlay network layer, a computed path to transport network traffic between the two endpoints, wherein at least a portion of the computed path traverses the base network layer, and wherein a network switch of the plurality of network switches is an ingress network switch for the portion of the computed path; by the path computation element and after computing the computed path, receiving additional topology information for at least one of the overlay network layer and the base network layer; receiving, by the path computation element from the network switch via a communication session, a failure event message indicating a failure of the portion of the computed path; computing, by the path computation element in response to the failure event message and using the additional topology information, a new computed path that does not include the portion of the computed path; sending, by the path computation element, new forwarding information for the new computed path to the network switch when the path computation element successfully computes the new computed path; and sending, by the path computation element to the client via the client interface, a path rejection when the path computation element is not able to compute the new computed path. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A path computation element comprising:
-
one or more programmable processors operably coupled to a memory; a multi-topology traffic engineering database to store topology information for a base network layer of a multi-topology network, the multi-topology network comprising the base network layer having a plurality of network switches interconnected by base network layer three (L3) links in a base network topology and also comprising an overlay network layer having a plurality of overlay switches interconnected by overlay network links in an overlay network topology; a topology server interface configured to receive topology information for the base network layer; an overlay controller interface configured to receive topology information for the overlay network layer; a client interface configured to receive, from a client, a path request that specifies two endpoints and a requested bandwidth; a service path engine configured to compute, in response to receiving the path request and using the topology information for the base network layer and the topology information for the overlay network layer, a computed path to transport network traffic between the two endpoints, wherein at least a portion of the computed path traverses the base network layer, and wherein a network switch of the plurality of network switches is an ingress network switch for the portion of the computed path, wherein the topology server interface and overlay controller interface are further configured to receive, after the service path engine computes the computed path, additional topology information for at least one of the overlay network layer and the base network layer; a network switch interface configured to receive from the network switch via a communication session, a failure event message indicating a failure of the portion of the computed path, wherein the service path engine is configured to compute, in response to the failure event message and using the additional topology information, a new computed path that does not include the portion of the computed path, wherein the network switch interface is configured to send new forwarding information for the new computed path to the network switch when the path computation element successfully computes the new computed path, and wherein the client interface is configured to send, to the client, a path rejection when the path computation element is not able to compute the new computed path. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17)
-
-
18. A non-transitory computer-readable medium comprising instructions for causing one or more programmable processors of a path computation element to:
-
receive topology information for a base network layer of a multi-topology network, the multi-topology network comprising the base network layer having a plurality of network switches interconnected by base network layer three (L3) links in a base network topology and also comprising an overlay network layer having a plurality of overlay switches interconnected by overlay network links in an overlay network topology; receive, from a client and via a client interface of the path computation element, a path request that specifies two endpoints and a requested bandwidth; compute, in response to receiving the path request and using the topology information for the base network layer and the topology information for the overlay network layer, a computed path to transport network traffic between the two endpoints, wherein at least a portion of the computed path traverses the base network layer, and wherein a network switch of the plurality of network switches is an ingress network switch for the portion of the computed path; after computation of the computed path, receive additional topology information for at least one of the overlay network layer and the base network layer; receive, from the network switch via a communication session, a failure event message and using the additional topology information indicating a failure of the portion of the computed path; compute, in response to the failure event message, a new computed path that does not include the portion of the computed path; send new forwarding information for the new computed path to the network switch when the path computation element successfully computes the new computed path; and send, to the client via the client interface, a path rejection when the path computation element is not able to compute the new computed path.
-
Specification