Cisco Technology, Inc.

Stefano Benedetto Previdi

Clarence Filsfils

Jean-Philippe Vasseur

David Delano Ward

Stewart Frederick Bryant

Robert Raszuk

Muthurajah Sivabalan

Ian Michael Charles Shand

Carlos M Pignataro

Ijsbrand Wijnands

Keyur Patel

John Galen Scudder

Ahmed Refaat Bashandy

James Neil Guichard

Dino Farinacci

Jim Guichard

Jan Medved

Arjen Boers

Gargi Nalawade

Steven Vincent Luong

Peter Psenak

Mike Shand

Shmuel Shaffer

Nagendra Kumar Nainar

Jonathan W Hui

Ali Sajassi

Sami Boutros

George Swallow

Abhay Kumar Roy

Chandrashekhar Appanna

Benoit Claise

Reshad Rahman

Manish Bhardwaj

Jining Tian

Pierre Jean Rene Francois

Rodolphe Figaro

John T Chapman

William Mark Townsley

Aeneas Sean Dodd-Noble

Toerless Eckert

Alon Shlomo Bernstein

Zafar Ali

Tarek Saad

Andre Surcouf

John H W Bettink

Jonathan C Barth

Warren Scott Wainner

Thomas David Nadeau

Pradosh Mohapatra

Bruce Stuart Davie

Earl Hardin Booth, Iii

Eric G Vyncke

Robert Goguen

Christopher Metz

Ketan Jivan Talaulikar

Emmanuel P Tychon

Stefano Novello

Olivier Bonaventure

Mahesh Chakravarthy Vittal Viveganandhan

Anca Zamfir

Robert Marcin Raszuk

Christian E Hopps

Nagendra Kumar

Arjun Sreekantiah

Kevin George Miles

Pierre Francois

Clarence A M Filsfils

Pierre Jean Rene François

Raffaele Gigantino

Zhunian Zhang

Steven W Ulrich

Christopher Losack

Jean Philippe Vasseur

An apparatus and method for path creation element driven dynamic setup of forwarding adjacencies and explicit path. In one embodiment of the method, a node receives an instruction to create a tunnel between the node and another node. The node creates or initiates the creation of the tunnel in response to receiving the instruction, wherein the tunnel comprises a plurality of nodes in data communication between the node and the other node. The node maps a first identifier (ID) to information relating to the tunnel. The node advertises the first ID to other nodes in a network of nodes.

Segment routing: PCE driven dynamic setup of forwarding adjacencies and explicit path

A system and method are disclosed for using segment routing (SR) in native IP networks. The method involves receiving a packet. The packet is an IP packet and includes an IP header. The method also involves updating the packet. Updating the packet involves writing information, including a segment routing segment identifier, to the destination address of the packet.

Segment routing extension headers

In one embodiment, a traffic engineering (TE) label switched path (LSP) is established between a head-end node in a local domain and a tail-end node in a remote domain. The TE-LSP spans one or more intervening domains located between the local domain and the remote domain. The head-end node sends a routing information request over the TE-LSP to a target node on the TE-LSP that is in the remote domain. The head end node receives routing information from the target node. The received routing information includes a list of address prefixes reachable by the target node. The head end node uses the received routing information to calculate routes reachable via the TE-LSP to the target node. The calculated routes have a next-hop interface set to be the TE-LSP. The calculated routes are inserted into a routing table of the head-end node.

Propagation of routing information in RSVP-TE for inter-domain TE-LSPS

Embodiments include generating an error message based on an error associated with a packet, adding to the error message an address of a node in a segment routing domain of a network to serve as a destination address of the error message, and adding a new segment routing header to the error message. Embodiments also include rewriting the packet where the rewriting includes replacing a destination address in the packet with a final destination address associated with the packet. Embodiments further include adding the rewritten packet to the error message, and forwarding the error message to the destination address of the error message. In specific embodiments, the rewriting the packet includes removing a segment routing header of the packet. More specific embodiments include deriving the new segment routing header from information in the packet.

Enhanced error signaling and error handling in a network environment with segment routing

Disclosed is an apparatus and method for segment routing using a remote forwarding adjacency identifier. In one embodiment, a first node in a network receives a packet, wherein the packet is received with a first segment-ID and another segment ID attached thereto. The first node detaches the first and the other segment IDs from the packet. Then the first node attaches a first label to the packet. Eventually, the first node forwards the packet with the attached first label directly to a second node in the network. In one embodiment, the other segment ID corresponds to a forwarding adjacency or tunnel label switched path between the first node and another node.

Segment routing using a remote forwarding adjacency identifier

A method is performed at a source node in a network of nodes configured with a link state protocol, and in which at least some of the nodes are enabled for multiprotocol label switching (MPLS). The node discovers and stores a link state topology representing the nodes of the network, links between the nodes, path-costs for the links, and whether each link is enabled or not enabled for MPLS. The node determines one or more shortest paths from the source node to a destination node among the nodes based on traversing the link state topology and, while the node traverses the link state topology, detects whether each shortest path supports or does not support MPLS end-to-end dataplane continuity. The node programs an IP dataplane with each shortest path, and programs an MPLS dataplane with ones of the one or more shortest paths that support the end-to-end MPLS continuity.

Segment-routing multiprotocol label switching end-to-end dataplane continuity

Content distribution system cache management may be provided. First, a sync packet may be received by a cache server from a first server. The sync packet may include a list indicating a cache server where a chunk is to be stored and the address for the chunk. Next, an address for the chunk may be obtained by the cache server by parsing the sync packet. The cache server may then determine that the chunk is not stored on the cache server by using the address for the chunk. Next, in response to determining that the chunk is not stored on the cache server, a connection may be opened between the first server and the cache server. The cache server may then receive the chunk over the connection and cache the chunk on the cache server.

Content distribution system cache management

Embodiments of the present disclosure provide a set of extensions to enable BGP to setup and maintain flexible Segment Routed Traffic Engineered (SR-TE) policies. Embodiments of the present disclosure further propose a new approach for steering traffic onto SR-TE paths on a per-prefix basis without deploying the existing complex mechanisms.

Creating and maintaining segment routed traffic engineering policies via border gateway protocol

In one embodiment, a device in a network receives a packet that includes a forwarding label for a service in a service chain. The packet encapsulates a service chain header for the service chain. The device swaps the forwarding label for the service in the packet for a reserved label that identifies the packet as encapsulating the service chain header. The device forwards the packet with the reserved label to the service.

Forwarding packets with encapsulated service chain headers

Utilizing the systems disclosed herein, a network element (in a network) controls, within another network, the constraints of a service, timing of the creation of the service, and selection a service on which a packet is transmitted. For example, a first network element (located in a first network) receives a request associated with initiating a service. The request is received from a second network element located in a second network and includes at least one path constraint. The first network element controls creation of the service in the first network on behalf of the second network element located in the second network by, e.g., identifying a path based, at least in part, on the at least one path constraint; and binding an identifier and an interface to the path, wherein the interface is associated with one or more operation to perform on any traffic that is labeled with the identifier.

Generating segment routing conduit in service provider network for routing packets

In one embodiment, packets are forwarded in a network according to a Segment Routing-based (SR-based) multicast distribution tree identified by a Tree Segment Identifier (Tree-SID). This packet forwarding includes packet replication to cause multiple copies of a same packet to be forwarded to different nodes of the SR-based multicast distribution tree. The Tree-SID is typically a same global value used within the network to identify the SR-based multicast distribution tree. As each packet is being routed through the network according to the SR-based multicast distribution tree, the packet includes the Tree-SID in a Segment List of the packet, with the Segment List being an ordered list of SID's identifying information for forwarding the packet in the network. The Tree-SID provides a lookup key for efficient forwarding of packets by packet switching devices making forwarding decisions, which may including forwarding multiple copies of the packet.

Segment routing of packets according to a multicast distribution tree in a network

Growing community of inventors

Rome, Italy

Stefano Benedetto Previdi