Juniper Networks, Inc.

Intermolecular, Inc.

Cisco Technology, Inc.

International Business Machines Corporation

Selector Software, Inc.

Lg Electronics Inc.

Nitin Kumar

Mankamana Prasad Mishra

Chi-I Lang

Tony P Chiang

Jinhong Tong

Zhi-Wen Sun

Zachary M Fresco

Nikhil D Kalyankar

Scott Mackie

Alex Baban

Anh Duong

Kireeti Kompella

Minh Anh Nguyen

Surya Chandra Sekhar Nimmagadda

Prashant B Phatak

Guizhen Zhang

Sandeep Bajaj

Sunanda L Kommula

Alok Khambatkone

Anuj Budhiraja

Murtuza S Attarwala

Siva Gaggara

Ali Sajassi

Sandra Guy Malhotra

Rajiv Asati

Keyur Patel

Thomas R Boussie

Kaushik Ghosh

Swamy Sadashivaiah Renu Kananda

James Washburn

Steven Lin

Sridhar Santhanam

Luc De Ghein

Ijsbrand Wijnands

Jean-Marc Frailong

Jian Li

Nischal Sheth

Rakesh Gandhi

Lukas Krattiger

Raghavendra Mallya

Robert Raszuk

Neeraj Malhotra

Babu Singarayan

Manoj Kumar Pandey

Swadesh Agrawal

Nayan S Patel

Satya Ranjan Mohanty

Dmitry A Shokarev

Andrzej Szyszko

Jamsheed R Wania

Satish Mynam

Fritz Budiyanto

Sangeeth Keeriyadath

Dongling Duan

Timothy L Patrick

Sunanda Kommula

Karthik Babu Harichandra Babu

Surya Nimmagadda

Anna Tsizelmon

Selma Yilmaz

Narasimha Prasad Salagame Nagaraj

Carlos M Pignataro

Nagendra Kumar Nainar

Krishna Narayanaswamy

Shyam N Kapadia

Frank Brockners

Liang Zhang

Basu Vaidyanathan

Robert W Kebler

Jonathan C Barth

Stig Ingvar Venaas

Kaliraj Vairavakkalai

Santosh Pallagatti Kotrabasappa

Javier Antich

Dongyi Jiang

Anil Lohiya

Peter Satitpunwaycha

Stephane Litkowski

Bob Kong

Colby Barth

Richard Endo

James Craig Hunter

Jeyananth Minto Jeganathan

Praveen Bhagwatula

Maciek Konstantynowicz

Kavana Nandikur Bhat

Jayashree Subramanian

Kenneth Alfred Williams

Srikanth Subramanian

Ramesh Kandula

Bhasker R Allam

Tsai-Zong Lin

Jiaxiang Su

Anand S Athreya

Qi-Zhong Cao

David Hahm

Sumit Gautam

Minh Anh Anh Nguyen

Sagar Vijay

Craig Hunter

This disclosure pertains to computer-assisted methods, apparatus, and systems for forecasting network performance responsive to network reconfigurations in large scale communication networks.

Methods and apparatus for network tracing, forecasting, and capacity planning

In an example method, a head node connected to a source device transmits a multicast data flow from the source device to receiving devices connected to tail nodes using Default MDT. The example method further includes determining that requirements have been met to begin transmitting the multicast data flow using Data MDT. The method may further include determining whether the tail nodes are able to receive the multicast data flow using Data MDT. In response to determining that all the tail nodes are able to receive the multicast data flow using Data MDT, switch to transmitting the multicast data flow to the tail nodes using Data MDT. In response to determining that at least one of the tail nodes is unable to receive the multicast data flow using the Data MDT, continue transmitting the multicast data flow using Data MDT.

Constraint-based underlay tree allocation for data centers

In some aspects, a computer-implemented method for performance monitoring in a multicast network, includes a controller causing a source router to originate a probe data packet. The controller may also originate, at the source router, the probe data packet, where the probe data packet is a data packet intended to measure performance data associated with one or more legs of a multicast distribution tree. Further, the source router may transmit the probe data packet through the multicast distribution tree using a probe identifier, where when received by a last hop router associated with the one or more legs of the multicast distribution tree, the last hop router redirects the probe data packet to a CPU of the last hop router configured to generate performance statistics. The source router may receive from the last hop router, the performance statistics.

Point-to-multipoint service assurance using performance measurement

In-band network telemetry for multicast is provided by injecting a synthetic telemetry packet into the multicast. Each first node of each branch replicates the synthetic packet and passes on copy to the next branch and sends one copy down the nodes in the branch sequentially. The synthetic telemetry packet can include flags with have values, including, for example, whether each node should hold or send data collected by the node according to the synthetic data packet, how long a node is to hold collected telemetry data, and what data to collect. The node sends a postcard to the originator with the telemetry data according to the instructions in the synthetic telemetry packet.

Multicast in-band telemetry system and method

In some aspects, a method for establishing a multicast-only Fast Re-Route (FRR) (MoFRR) path between a source node and a receiving node in a network, the method includes receiving, by a merged receiving node, a plurality of data packets in a data flow comprising an FRR indicator, wherein the merged receiving node is configured to identify an FRR path for data transmission to the source node, extracting, by the merged receiving node, from the FRR indicator, an identification of the source node as a destination of the data transmission, and a first identifier identifying a first data packet as part of a first flow of a MoFRR, and a second identifier identifying a second data packet as part of a second flow of a MoFRR, transmitting, by the receiving node, the first data packet along a primary data path and the second data packet along a secondary data path.

End-to-end dynamic multicast-only fast re-route (MoFRR)

This disclosure pertains to computer assisted methods, apparatus, and systems for determining a path that a data packet would have traversed through a communication network at a particular point in time, which may be used, for instance, to determine the sources of connectivity failures in a large scale communication network.

Methods and apparatus for determining a path that a data packet would traverse through a communication network at a time of interest

A system and method for handling multicast traffic in Ethernet Virtual Private Network multi-homed networks includes receiving a first route table for a first route, determining that the first route table is associated with another peer device in the multi-home network, generating a second route table for a second route, determining a route to transmit data and the determined route is the first route or the second route based on the first preference value and the second preference value, and transmitting the data using the determined route.

System and method for EVPN multicast optimization for source handling

In an example method, a network administrative device receives an indication that a multicast data flow is experiencing traffic loss. The administrative device transmits instructions to a last hop to begin monitoring incoming traffic, if the last hop is receiving expected traffic, the last hop sends it location to the administrative device. If the last hop is not receiving expected traffic, it sends instruction to a next upstream device to start monitoring incoming traffic. Based on receiving a message indicating the location of the last hop, the administrative device determines a network fault is occurring at a location of the last hop. Based on receiving a message indicating a location of an upstream device, the administrative device determines a network fault is occurring at the location of the upstream device.

Platform independent on demand network management and monitoring

In one embodiment, a device may receive a multicast path trace request for a multicast tree, wherein the device is a mid-node in the multicast tree. The device may perform, based on the device being a mid-node in the multicast tree, an upstream trace of network topology of the multicast tree from the device to a head-node of the multicast tree and a downstream trace of network topology of the multicast tree from the device to at least one tail-node. The device may generate an end-to-end visible topology of the multicast tree based on the upstream trace and the downstream trace. The device may provide the end-to-end visible topology of the multicast tree to an observability manager.

Multicast path traces

A method is performed by a network controller that is configured to control routers configured to forward a multicast flow downstream from a first hop router that is a root of a multicast tree formed by the routers to last hop routers that terminate branches of the multicast tree, respectively. The method includes collecting operational configuration information from the routers and constructing a topological view of the multicast tree based on the operational configuration information; causing the routers to forward multicast probes downstream from the first hop router along all of the branches toward the last hop routers to trace the multicast tree; receiving, from particular ones of the last hop routers that received the multicast probes, indications that the multicast probes were received; and detecting failures in the multicast tree based on the indications and the topological view.

In-situ operations, administration, and maintenance extension to trace multicast tree and identify failure node

A system and associated methods provide solutions for reducing a volume of traffic through a multicast network attributed to repeated maintenance messages, which are required in order to maintain a multicast connection. The system configures provider edge devices to generate and send maintenance messages on behalf of members of a multicast group to establish and maintain the multicast connection and provides options for determining unknown locations of sources and/or subscribers, thereby reducing the overall volume of traffic transmitted over the multicast network.

PIM proxy over EVPN fabric

A system and associated methods provide a scalable solution for managing multiple multicast flows within a multicast group of a multicast network. The system groups redundant sources of the multicast group according to their associated multicast flows, assigns flow identifiers to each redundant source indicative of their associated multicast flows, and facilitates Single Forwarder election to select a Single Forwarder that belongs to the appropriate multicast flow. The system provides control plane extensions that enable signaling of which redundant source belongs to which multicast flow.

Multicast redundancy in EVPN networks

A method is performed at a router on a multicast configured to forward a multicast flow. The method comprises: in response to receiving, from a controller connected to the multicast path or the multicast path, an enable command to enable statistics tracing for the multicast flow, determining whether the router has sufficient resources to perform statistics tracing; and when the router has the sufficient resources: responsive to the enable command, enabling statistics tracing to collect statistics for the multicast flow; generating a first request to include the enable command and the statistics; and forwarding the first request towards the controller.

On-demand hardware resource allocation to debug multicast network at high scale

Techniques for connectivity issue remediation are provided. A first link trace message is transmitted from a source end point to a destination end point. A first topology graph for a network is generated based on the first link trace message, and a presence of a connectivity issue in the network is detected. A second link trace message is transmitted from the source end point to the destination end point. A second topology graph for the network is automatically generated based on second link trace message, and a component in the network that caused the connectivity issue is identified based on comparing the first and second topology graphs.

Identifying network connectivity issues using topology graphs

Techniques and mechanisms for a control plane approach for dense topologies that focusses on discovering shared ECMP groups in the control plane independent of per-prefix learning and then learning prefixes via these shared ECMP groups instead of learning prefixes via one next-hop at a time. In dense topologies, this approach helps minimize BGP path scale, corresponding signaling and enables control plane scaling that is an order of magnitude higher than a traditional eBGP control plane. During link and node topology changes, the described control plane approach enables control plane signaling that is prefix independent and an order of magnitude lower. A control plane approach to path-list sharing and prefix independent signaling on link and node topology changes enables prefix independent convergence (PIC) in scenarios that would not be possible otherwise with traditional FIB driven path-list sharing and PIC.

Hierarchical ECMP control plane for dense topologies

Growing community of inventors

Fremont, CA, United States of America

Nitin Kumar