# US 2018/0026874 A1 · End point scaling on segment routing fabrics

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

- Number: US 2018/0026874 A1
- Document ID: US20180026874A1
- Status: Published application
- Kind: A1
- Application number: 15/217,819
- Filed: 2016-07-22
- Published: 2018-01-25
- Earliest claimed: 2016-07-22
- Assignees: Cisco Technology, Inc.
- Applicants: Cisco Technology, Inc.
- Inventors: Malick Mohamed Usman; Srinivasan Ramabadran; Raghava Sivaramu; Sriram Srinivasan; Srini Ananthakrishnan
- Web page: https://patentgrep.com/patent/US20180026874A1

## CPC

- H04L 45/24: Multipath
- H04L 12/4633: {Interconnection of networks using encapsulation techniques, e.g. tunneling}
- H04L 45/124: {using a combination of metrics}
- H04L 45/50: using label swapping, e.g. multi-protocol label switch [MPLS]
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Disclosed are systems and methods for scaling Massively Scalable Data Center (MSDC) networks with a large number of end-point tunnels utilizing Equal-cost multi-path routing (ECMP). The systems and methods can use the NO-OP label operations to maintain single ECMP objects to switch a set of segment routing tunnels that share the same ECMP links. The forwarding engine can determine the use of the NO-OP label operation and update a received packet to enable the use of the single ECMP objects of the set of segment routing tunnels.

## Claims

### Claim 1

A method for end-point scaling on a segment routing network, the method comprising:
receiving, at a node of the segment routing tunnel, a packet and a label;
pushing, to the label, a no-op label;
determining a best next node of a plurality of nodes along the path of the segment routing tunnel corresponding to the label; and
transmitting the packet with the no-op label to the best next node.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
receiving, at the best next node, the packet with the no-op label, wherein the best next node is not configured as a no-op node;
ignoring label operations for the packet;
determining another best next node of the plurality of nodes along the path of the segment routing tunnel corresponding to the label; and
forwarding, without altering the label, the packet to the another best next node.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
receiving, at the best next node, the packet and the label, wherein the best next node is configured as a no-op node;
ignoring label operations for altering the label; and
transmitting the packet to another best next node along the path of the segment routing tunnel based on the label and the equal cost multipath routing object.

### Claim 4 (depends on 1)

The method of claim 1, wherein the node utilizes equal cost multipath routing.

### Claim 5 (depends on 2)

The method of claim 2, wherein each of the node and best next nodes utilize equal cost multipath routing.

### Claim 6 (depends on 1)

The method of claim 1, wherein the no-op label operation is configured over an entire massively scalable data center network.

### Claim 7 (depends on 1)

The method of claim 1, wherein the no-op label operation is distributed by a control plane protocol for each segmented routed tunnel.

### Claim 8 (depends on 1)

The method of claim 1, wherein the node maintains a single equal cost multipath routing object configured to switch a set of segment routing tunnels that share equal cost multipath routing links in a massively scalable data center network.

### Claim 9 (depends on 1)

The method of claim 1, wherein the label is unique for the segmented tunnel.

### Claim 10

A method for end point scaling on a segment routing network, the method comprising:
receiving, at a node of the segment routing tunnel, a packet and a label;
ignoring label operations for altering the label;
determining a best next node of a plurality of nodes along the path of the segment routing tunnel corresponding to the label and the equal cost multipath routing object; and
transmitting, the packet and the label to a best next node along the path of the segment routing tunnel.

### Claim 11 (depends on 10)

The method of claim 10, further comprising:
receiving, at the best next node, the packet and the label, wherein the best next node is configured as a no-op node;
ignoring label operations for altering the label; and
transmitting the packet to another best next node along the path of the segment routing tunnel based on the label and the equal cost multipath routing object.

### Claim 12 (depends on 10)

The method of claim 10, further comprising:
receiving, at the best next node, the packet with the label, wherein the best next node is not configured as a no-op node;
pushing, to the label, a no-op label;
determining another best next node of the plurality of nodes along the path of the segment routing tunnel corresponding to the label; and
forwarding the packet to the another best next node.

### Claim 13 (depends on 10)

The method of claim 10, wherein each of the node and best next nodes utilize equal cost multipath routing.

### Claim 14 (depends on 11)

The method of claim 11, wherein the node utilizes equal cost multipath routing.

### Claim 15 (depends on 10)

The method of claim 10, wherein the no-op label operation is configured over an entire massively scalable data center network.

### Claim 16 (depends on 10)

The method of claim 10, wherein the no-op label operation is distributed by a control plane protocol for each segment routing tunnel.

### Claim 17 (depends on 10)

The method of claim 10, wherein the node maintains the equal cost multipath routing object is configured to switch a set of segment routing tunnels that share equal cost multipath routing links in a massively scalable data center network.

### Claim 18 (depends on 10)

The method of claim 10, wherein the label is unique for the segmented routed tunnel.

### Claim 19

A method for negotiation a no-op segment routing tunnel, the method comprising: receiving, at a node, a segment ID;
determining a local range;
calculating a label;
determining the node can perform no-op operations;
configuring the node for no-op operations; and
transmit the segment ID to next nodes of the node;

### Claim 20 (depends on 19)

The method of claim 19 further comprising:
receiving at a next node, the segment ID;
determining a local range;
calculating a label;
determining the next node cannot perform no-op operations;
configuring the next node for null operations; and
transmit the segment ID to other next nodes of the next node;
