Cisco Technology, Inc.

Juniper Networks, Inc.

Robert Raszuk

Keyur Patel

Jean-Philippe Vasseur

Stefano Benedetto Previdi

David Delano Ward

Clarence Filsfils

Jim Guichard

Stewart Frederick Bryant

Gargi Nalawade

Mike Shand

Nitin Kumar

Satish Mynam

Selma Yilmaz

James Neil Guichard

Abhay Kumar Roy

Alton Lo

Himanshu H Shah

Rex Emmanuel Fernando

Chandrashekhar Appanna

Anantha Ramaiah

Ryan Bickhart

Ruchi D Kapoor

Peter De Vriendt

Arjun Sreekantiah

Kris Michielsen

Clarence A M Filsfils

Jean Phillippe Vasseur

In an embodiment, a method comprises: receiving, at a data packet router, a path advertisement comprising information about an available path; determining whether the path advertisement comprises an originator identifier of an originator of the available path; in response to determining that the path advertisement comprises the originator identifier of the originator of the available path, determining whether the originator identifier of the available path is a router identifier of the data packet router, and in response to determining that the originator identifier of the available path is the router identifier of the data packet router, not accepting the path advertisement; wherein the method is performed by one or more processors of the data packet router.

Detecting and avoiding routing loops with BGP route server extensions

In an embodiment, a method comprises receiving a path advertisement comprising information about an available path and a well-known community value associated with the available path. A modified best path calculation is performed in response to receiving the available path either from a higher-ranked device or from a device that is not participating in diverse path calculation, resulting in creating a particular best path. The particular best path is advertised to other routers with or without a restriction indicator based on whether it is a client learned path or non-client iBGP peer learned path and based on whether the advertisement is directed to a client or a non-client iBGP peer.

Automatically detecting best paths from shadow route reflectors

Techniques are disclosed for providing fast convergence on Autonomous System Border Routers (ASBRs). In an embodiment, an ASBR receives first Virtual Private Network (VPN) route information including a first route target, a first route distinguisher, and a first network prefix and second VPN route information including a second route target, a second route distinguisher and a second network prefix. The second route distinguisher received by the ASBR is different than the first route distinguisher. The ASBR compares the first route target to the second route target and the first network prefix with the second network prefix. In response to determining that the first route target matches the second route target and the first network prefix matches the second network prefix, the ASBR associates, in a routing table, a first path based on the first VPN route information with a second path based on the second VPN route information.

Method for providing border gateway protocol fast convergence on autonomous system border routers

A method performed by a network device may include establishing performance-based Bidirectional Forwarding Detection (BFD) sessions for each link of a primary traffic engineering Label Switched Path (TE-LSP) and establishing performance-based BFD sessions for each link of a secondary TE-LSP. The method may also include, monitoring performance of the primary TE-LSP based on the performance-based BFD sessions for each link of the primary TE-LSP and monitoring performance of the secondary TE-LSP based on the performance-based BFD sessions for each link of the secondary TE-LSP. The method may further include determining that the performance of the primary TE-LSP is degraded based on the monitoring of the performance of the primary TE-LSP and automatically switching a flow of data unit traffic from the primary TE-LSP to the secondary TE-LSP when the performance of the primary TE-LSP is degraded.

Health probing detection and enhancement for traffic engineering label switched paths

A technique is provided for dynamically discovering shared risk node group (SRNG) memberships of a plurality of interconnected edge devices in a computer network. According to the technique, each edge device 'learns' the identities of its directly-attached peer devices situated in neighboring routing domains, e.g., by establishing an interior or exterior gateway routing protocol session with each peer. Thereafter, each edge device advertises the identities of its learned peers to the other interconnected edge devices. Preferably, the peer identities are distributed in novel 'peer-router' extended community attributes transported in Border Gateway Protocol (BGP) messages. After an edge device has learned the identity of its own peers and received the identities of the other edge devices' peers, the device can automatically detect SRNG memberships in the computer network. Specifically, edge devices that advertise the same peer are determined to participate in the same SRNG.

Dynamic shared risk node group (SRNG) membership discovery

An apparatus and method as described for constructing a repair path for use in the event of failure of an inter-routing domain connection between respective components in first and second routing domains of a data communications network. The apparatus is arranged to assign a propagatable repair address for use in the event of failure of the inter-routing domain connection and to propagate the repair address via data communications network components other than the inter-routing domain connection.

Constructing a repair path in the event of failure of an inter-routing domain system link

In one embodiment, a node receives traffic sent from one or more sources toward one or more destinations (e.g., Multipoint-to-Point, MP2P traffic). The node may detect a burst of received traffic based on one or more characteristics of the burst traffic, and, in response, may dynamically apply traffic shaping to the burst traffic. The traffic shaping is adapted to forward burst traffic received below a configurable threshold at a configurable pace and to drop burst traffic received above the configurable threshold. In addition, the node may also store the burst traffic dropped by traffic shaping, and forwards the stored burst traffic toward its destination after a configurable delay.

Dynamic response to traffic bursts in a computer network

A system receives a packet at a first node. The packet is destined for a second node. The system identifies a full routing node from a plurality of network devices. The full routing node is capable of providing routing information for each of the nodes within the plurality of network devices. The plurality of network devices comprises a subset of nodes, and a subset of full routing nodes. The subset of nodes is not capable of providing routing information for each of the nodes within the plurality of network devices. The system transmits the packet to the full routing node for future transmission to the second node.

Methods and apparatus providing two stage tunneling

An apparatus for providing reachability in a routing domain of a data communications network having as components nodes and links therebetween for a routing domain external destination address is provided. The apparatus is arranged to advertise destination address reachability internally to nodes in the routing domain and associate a reachability category with the internal advertisement of the destination address reachability.

Providing reachability information in a routing domain of an external destination address in a data communications network

An ability to compress packets is announced from a customer edge router (CE) to other CEs through a routing protocol packet. An announcement of that ability is received from another CE through a routing protocol packet. A compression technique is then matched. The CE receives compression information from the other CE in a routing protocol packet, and determines that a compression technique identified therein matches any compression technique the CE is programmed to use. The CE then flags packets transmitted from/received by the CE to be compressed/decompressed according to the matched compression technique. Alternatively, the CE may match by transmitting compression information identifying a compression technique to the another CE in a routing protocol packet; the another CE receives the routing protocol packet and determines that a compression technique identified in the compression information of the routing protocol packet matches any compression technique the another CE is programmed to use.

Signaling compression information using routing protocols

In one embodiment, an apparatus comprises logic for optimizing network resources usage. The logic is operable to store IGP information, where the IGP information includes a set of attribute values associated with each of a set of content servers. When the logic receives a request for content from a remote peer, the logic determines one or more content servers that can provide the requested content. The logic then retrieves, from the IGP information, a plurality of attribute values associated with a non-looping path from each of the one or more content servers. For each of the one or more content servers, the retrieved attribute values include: one or more capacity values indicating capacities of one or more communication links on the non-looping path from that content server; and one or more utilization values indicating utilizations of the one or more communication links on the non-looping path from that content server. The logic then selects a content server based on the retrieved attribute values, and causes the request for the content to be sent to the selected content server.

Optimizing network resources usage within an administrative boundary

In one embodiment, an apparatus and method are described for constructing a repair path in the event of non-availability of a routing domain component of a routing domain comprising, as components, links and nodes. The apparatus is arranged to receive respective network repair addresses from each of the far-side and near-side advertising node for use in the event of non-availability of a routing domain component between the advertising node. The apparatus is further arranged to advertise the near-side advertising node network repair address to one or more far-side nodes via a path external to the routing domain.

Constructing a repair path in the event of non-availability of a routing domain

Devices executing routing protocols can mark routing protocol messages as urgent so that peer devices are signaled to consume the messages on an expedited basis. Performance of routing protocols improves as a result; for example, Border Gateway Protocol convergence time is reduced. An example router comprises a network interface, a processor, a transport layer protocol module that implements a transport layer network protocol, a routing protocol module that implements a network packet routing protocol and sends peering session messages over transport layer connections, and instructions to perform providing a first routing protocol message to the transport layer protocol module that comprises urgent data at least in part; requesting the transport layer protocol module to mark, as urgent, one or more data segments that carry the first routing protocol message; marking, as urgent, one or more segments that carry the first routing protocol message; and sending the segments to peer devices over the connections.

Growing community of inventors

Komorow, Poland

Robert Raszuk