# US 2015/0103844 A1 · Using PCE as SDN Controller

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0103844 A1
- Document ID: US20150103844A1
- Status: Published application
- Kind: A1
- Application number: 14/511,591
- Filed: 2014-10-10
- Published: 2015-04-16
- Earliest claimed: 2013-10-11
- Assignees: Futurewei Technologies, Inc.
- Applicants: Futurewei Technologies, Inc.
- Inventors: Qianglin Quintin Zhao; Katherine Zhao; Bisong Tao
- Web page: https://patentgrep.com/patent/US20150103844A1

## CPC

- H04L 45/50: using label swapping, e.g. multi-protocol label switch [MPLS]
- H04L 45/028: Dynamic adaptation of the update intervals, e.g. event-triggered updates
- H04L 45/42: Centralised routing
- H04L 45/507: {Label distribution}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Embodiments relate generally to systems and methods for transitioning a system from a tradition network to a Software Defined Network (SDN) enabled network. In some embodiments, the systems and methods may comprise the use of a Path Computation Element (PCE) as a central controller. Smooth transition between traditional network and the new SDN enabled network, especially from a cost impact assessment perspective, may be accomplished using the existing PCE components from the current network to function as the central controller of the SDN network is one choice, which not only achieves the goal of having a centralized controller to provide the functionalities needed for the central controller, but also leverages the existing PCE network components.

## Claims

### Claim 1

A Path Computation Element (PCE) comprising:
a receiver configured to receive a path computation request from a path computation client (PCC), the path computation request requesting a path initiating at the PCC;
a processor coupled to the receiver and configured to:
compute the path from the PCC to an egress node via an intermediate node in response to the path computation request; and
assign label information for a label switched path (LSP) from the PCC, the intermediate node, and the egress node; and
a transmitter coupled to the processor and configured to set up the LSP along the computed path by transmitting the label information directly to the PCC, the intermediate node, and the egress node for storage in a Forwarding Information Base (FIB).

### Claim 2 (depends on 1)

The PCE of claim 1, wherein the at least one of the PCC, the intermediate node, and the egress node is a Software Defined Network (SDN) compatible node, wherein the at least one of the PCC, the intermediate node, and the egress node is a non-SDN compatible node, and wherein the PCE is configured to transmit label information to both the SDN compatible node and the non-SDN compatible node via PCE protocol (PCEP).

### Claim 3 (depends on 2)

The PCE of claim 2, wherein the PCE is configured to negotiate with the non-SDN compatible node to obtain one or more labels from a local label pool, and wherein the label information assigned to the non-SDN compatible node is selected from the local label pool.

### Claim 4 (depends on 3)

The PCE of claim 3, wherein label information assigned to the SDN compatible node is selected from a global label pool.

### Claim 5 (depends on 1)

The PCE of claim 1, wherein the LSP is setup along the computed path without employing label distribution protocol (LDP) or resource reservation protocol (RSVP).

### Claim 6 (depends on 1)

The PCE of claim 1, wherein the path computation request is received from the PCC in a PCE protocol (PCEP) path computation state report (PCRpt) message.

### Claim 7 (depends on 1)

The PCE of claim 1, wherein the label information is transmitted directly to the PCC, the intermediate node, and the egress node in a plurality of PCE protocol (PCEP) path computation label forwarding information base download (PCLFIBDownload) messages, and wherein each PCLFIBDownload message indicates an identifier (ID) for the LSP and label information relevant to each node.

### Claim 8 (depends on 1)

The PCE of claim 1, wherein the receiver is further configured to receive a request from the PCC to delete the LSP, and wherein the transmitter is further configured to transmit a PCE protocol (PCEP) path computation label forwarding information base download (PCLFIBDownload) message to each node along the LSP, the PCLFIBDownload message comprising an identifier (ID) for the LSP and a reason (R) code indicating label information associated with the LSP is to be deleted.

### Claim 9 (depends on 1)

The PCE of claim 1, wherein the receiver is configured to receive a request from the PCC to modify the LSP, wherein the modification request indicates a first identifier (ID) for the LSP, wherein the processor is configured to assign a second ID for the LSP, and wherein the transmitter is configured to:
transmit a PCE protocol (PCEP) path computation label forwarding information base download (PCLFIBDownload) message to each node along the LSP indicating the second ID for the LSP; and
transmit a PCEP path computation state report (PCRpt) message comprising the first ID and a reason (R) code indicating label information associated with the first ID is to be deleted.

### Claim 10 (depends on 1)

The PCE of claim 1, wherein the PCC is located in an access network, wherein the egress node is located in an aggregation network, wherein the intermediate node is located in an access control gateway (ACG) positioned on the border of the access network and the aggregation network, and wherein the LSP spans a plurality of network domains.

### Claim 11 (depends on 1)

The PCE of claim 1, wherein the PCE is a child PCE positioned in a first domain, and wherein the PCE is further configured to:
forward the path computation to a parent PCE responsible for computing paths across a plurality of domains including the first domain;
receive a path computation response from the parent PCE indicating a second domain between the PCC and a path termination point; and
select the egress node based on the path computation response from the parent PCE.

### Claim 12

A method of managing a mixed domain of Software Defined Network (SDN) compatible nodes and non-SDN compatible nodes with a Path Computation Element (PCE), the method comprising:
receiving a path computation request from an SDN compatible ingress node, the path computation request requesting a path to a non-SDN compatible egress node;
computing a path from the ingress to the egress node in response to the path computation request;
assigning label information for each node along the computed path; and
setting up a label switched path (LSP) along the computed path by transmitting the label information directly to the SDN compatible ingress node and the non-SDN compatible egress node.

### Claim 13 (depends on 12)

The method of claim 12, wherein labels assigned to the SDN compatible ingress node are assigned from a global label pool, and wherein labels assigned to the non-SDN compatible egress node are assigned from a local label pool specific to the non-SDN compatible egress node.

### Claim 14 (depends on 12)

The method of claim 12, wherein the LSP is setup along the computed path without employing label distribution protocol (LDP) or resource reservation protocol (RSVP).

### Claim 15

A method for using a path computation element (PCE) as a central controller in a network comprising:
receiving, by the PCE, a pathway request from a path computation client (PCC);
performing, by the PCE, route computations in response to the request from the PCC; and
directly controlling, by the PCE, the PCC and a plurality of nodes in communication with the PCC to set up a pathway based on the route computations.

### Claim 16 (depends on 15)

The method of claim 15, further comprising:
collecting, by the PCE, Multiprotocol Label Switching (MPLS) label capability of the PCC and the nodes;
calculating, by the PCE, a shared MPLS global label range for the nodes; and
communicating a common global label range to all the nodes when the shared global label range is negotiated across multiple domains.

### Claim 17 (depends on 16)

The method of claim 16, further comprising:
receiving, by the PCE, a global label allocation request from a first of the nodes;
allocating, by the PCE, a global label for the pathway from the shared global label range;
sending a reply to the first node containing the allocated global label; and
notifying, by the PCE, all nodes within the domain of the allocated global label.

### Claim 18 (depends on 15)

The method of claim 15, further comprising:
allocating adjacency segment identities (IDs) for each link between the nodes from a local label pool; and
allocating node segment IDs for the nodes from a global label pool;
distributing the node segment IDs and adjacency segment IDs.

### Claim 19 (depends on 18)

The method of claim 18, further comprising allocating the node segment IDs and adjacency IDs without calculating an explicit path for a segmented route (SR) path, wherein the nodes forward a packet based on the node segment IDs.

### Claim 20 (depends on 18)

The method of claim 18, further comprising:
calculating an explicit path for a segmented route (SR) path; and
passing the explicit path represented with a sequence of node segment IDs and adjacency IDs.
