Arrcus Inc.

Cisco Technology, Inc.

Derek Man-Kit Yeung

Keyur Patel

Nalinaksh Pai

Kalyani Rajaraman

Neeraj Malhotra

Lawrence Rolfe Kreeger

Vikram Ragukumar

Pushpasis Sarkar

Alpesh Patel

Ali Sajassi

Lalit Kumar

Samir D Thoria

Tetsuya Murakami

Ravindra Nandalal Rathi

Ravindra Vaishampayan

Matthew Anderson

Alfred C Lindem, Iii

Anthony Joseph Li

Abhay Kumar Roy

Rex Emmanuel Fernando

Hong Zhang

Dheerendra Talur

Nair Venugopal

Avneesh Sachdev

Christian E Hopps

Shitanshu Shah

Systems, methods, and devices for offloading network data to a datastore. A system includes a plurality of instances of a datastore node in a single networking device, each of the plurality of instances of the datastore node comprising: a datastore; a publisher independent of the datastore for publishing data to the datastore; a subscriber independent of the datastore for receiving information from the datastore; a replicator agent configured to connect to the datastore as a publisher or a subscriber; and a persistent storage agent configured to connect to the datastore as a publisher or a subscriber.

Single node and multiple node datastore architecture in a network routing environment

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a first switch and a second switch in a network topology. The system includes a host virtual machine in communication with at least one of the first switch and the second switch. The system includes a routed peer link connecting the first switch to the second switch. The system is such that the first switch and the second switch have the same Internet protocol (IP) address and media access control (MAC) address.

First hop gateway redundancy in a network computing environment

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a network topology comprising a plurality of spine nodes and a plurality of leaf nodes, wherein a link between a first spine node and a first leaf node is inactive. The first spine node includes one or more processors configurable to execute instructions stored in non-transitory computer readable storage media. The instructions include receiving a packet to be transmitted to the first leaf node. The instructions include identifying an alternative spine node at a same level in the network topology. The instructions include attaching a tunnel label to the packet, wherein the tunnel label indicates the packet should be transmitted to the alternative spine node.

Loop conflict avoidance in a network computing environment

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a network topology comprising a spine node and a plurality of leaf nodes. The system is such that at least one of the plurality of leaf nodes is associated with one or more networking prefixes. The spine node stores a prefix table. The prefix table includes a listing of networking prefixes in the network topology. The prefix table includes an indication of at least one equal-cost multipath routing (ECMP) group associated with each of the networking prefixes in the network topology. The prefix table includes an indication of at least one leaf node of the plurality of leaf nodes associated with each of the networking prefixes in the network topology.

Routing optimizations in a network computing environment

A segment identifier (SID) manager interfaces with clients by way of a library. Clients implementing network services and needing SIDs according to internet SRv6, are allocated blocks by the SID manager using the library. Clients assign SIDs from the block independent of the SID manager using the library. Where a threshold portion of the block is assigned, the library requests an additional block of SIDs from the SID manager. Clients transmit context mappings of assigned SIDs to the SID manager for use by administrators and to enable recovery in the event of failure.

SID allocation

Systems, methods, and devices for offloading network data to a datastore. A system includes a publisher device in a network computing environment. The system includes a subscriber device in the network computing environment. The system includes a datastore independent of the publisher device and the subscriber device, the datastore comprising one or more processors in a processing platform configurable to execute instructions stored in non-transitory computer readable storage media. The instructions includes receiving data from the publisher device. The instructions include storing the data across one or more of a plurality of shared storage devices. The instructions include providing the data to the subscriber device.

Independent datastore in a network routing environment

Systems, methods, and devices for routing operations in a network computing environment. A system includes a network topology comprising a plurality of spine nodes and a plurality of leaf nodes, wherein a link between a first spine node and a first leaf node is inactive. The first spine node includes one or more processors configurable to execute instructions stored in non-transitory computer readable storage media. The instructions include receiving a packet to be transmitted to the first leaf node. The instructions include identifying an alternative spine node at a same level in the network topology. The instructions include attaching a tunnel label to the packet, wherein the tunnel label indicates the packet should be transmitted to the alternative spine node.

Loop conflict avoidance in a spine-and-leaf network topology

Aspects of the embodiments are directed to synchronizing at least a portion of a link-state database. A network element can lose an adjacency. The network element can transmit a request to a neighboring network element for synchronization of a link-state database. The request can include a version number of a last synchronized link-state database from the neighboring network element. The neighboring network element can determine whether the version of the link-state database is greater than or less than a copy of the link-state database stored by the neighboring network element. If the requested version number is less than the neighboring network element's link-state database version number, then the neighboring network element can send changes to the link-state database since the requested link-state database version number.

Delta database synchronization

Message summarization and flood suppression may be provided. A proxy (e.g., an IGMP Proxy) process may be used to reduce the flooding of messages (e.g., IGMP messages) over a network (e.g., an EVPN network). A triggering process may also be provided for provider edge (PE) devices to setup their underlay multicast tunnels. The proxy may comprise two components: i) a proxy for reports (e.g., IGMP reports); and ii) a proxy for queries (e.g., IGMP Queries).

Summarizing and flood suppressing messages

In one embodiment, a method is provided for congestion mitigation. In this method, a congestion level of data flows along a path is monitored relative to a threshold. Here, each data flow is associated with a flow identifier. Based on detection that the congestion level exceeds the threshold, the flow identifier of a number (e.g., one or more) of the data flows is changed to a different flow identifier. This change results in the number of the data flows redirected to a different path. In an alternate embodiment, another method is provided for congestion avoidance. In this method, a data flow transmitted along a single path is received, and the data flow is split into multiple micro data flows. A different flow identifier is then assigned to each micro data flow. This change results in the multiple micro data flows distributed along multiple different paths.

Growing community of inventors

Fremont, CA, United States of America

Derek Man-Kit Yeung