公开(公告)号：US10999199B2

公开(公告)日：2021-05-04

申请号：US16557298

申请日：2019-08-30

Applicant: Cisco Technology, Inc.

Inventor： Ankan Ghosh ,  Nataraj Bacthu ,  Apurup Reddy Chevuru ,  Laxmi Kant Agrawal ,  Swaminathan Narayanan

IPC: H04L12/743 ,  G06F3/06 ,  H04L12/701

Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

公开(公告)号：US10284472B2

公开(公告)日：2019-05-07

申请号：US15414589

申请日：2017-01-24

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Nataraj Bacthu ,  Ayan Banerjee ,  Raghava Sivaramu ,  Ankan Ghosh

IPC: H04L12/745 ,  H04L12/743

Abstract: In one embodiment, a method includes receiving a request to add a prefix to memory for a route lookup at a forwarding device, the memory comprising a plurality of pivot tiles for storing pivot entries, each of the pivot entries comprising a plurality of prefixes and a pointer to a trie index, searching at the forwarding device, a dynamic pool of the pivot tiles based on a base-width associated with the prefix, allocating at least a portion of the pivot tile to the base-width and creating a pivot entry for the prefix and other prefixes with a corresponding base-width, and dynamically updating prefixes stored on the pivot tiles based on route changes to optimize storage of prefixes on the pivot tiles. An apparatus and logic are also disclosed herein.

公开(公告)号：US20190386920A1

公开(公告)日：2019-12-19

申请号：US16557298

申请日：2019-08-30

Applicant: Cisco Technology, Inc.

Inventor： Ankan Ghosh ,  Nataraj Bacthu ,  Apurup Reddy Chevuru ,  Laxmi Kant Agrawal ,  Swaminathan Narayanan

IPC: H04L12/743 ,  G06F3/06

Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

公开(公告)号：US09706016B2

公开(公告)日：2017-07-11

申请号：US14051896

申请日：2013-10-11

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Harsha Bharadwaj ,  Prabesh Babu Nanjundaiah ,  Sumanth Sindiri ,  Ankan Ghosh ,  Kishan Kumar Kotari Uppunda

IPC: H04L12/26 ,  H04L29/06 ,  H04L12/24 ,  H04L12/707 ,  H04L29/08 ,  H04L29/14 ,  H04L12/751

CPC classification number: H04L69/22 ,  H04L29/14 ,  H04L41/082 ,  H04L43/10 ,  H04L45/02 ,  H04L45/22 ,  H04L67/34

Abstract: In one example embodiment, a time unconstrained fabric switch software upgrade function is described for an in-switch-software-upgrade/downgrade (ISSU) in a network switch. Prior to an ISSU, Hello protocol data unit (PDU) information is stored for relevant control protocols of associated interfaces of the switch. The Hello PDU information comprises information on messages and data exchanged by the control protocols that may be used to maintain communications links of the switch. During the configuring of the ISSU, and while the control plane of the switch is, at least partially, dysfunctional, Hello PDUs are sent on the interfaces according to the stored PDU information in order to maintain the communication links. The Hello PDU information may include a time interval value for each relevant protocol that determines when Hello PDUs are sent.

公开(公告)号：US11570105B2

公开(公告)日：2023-01-31

申请号：US17244936

申请日：2021-04-29

Applicant: Cisco Technology, Inc.

Inventor： Ankan Ghosh ,  Nataraj Bacthu ,  Apurup Reddy Chevuru ,  Laxmi Kant Agrawal ,  Swaminathan Narayanan

IPC: H04L45/7453 ,  G06F3/06 ,  H04L45/00

Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

公开(公告)号：US20210250296A1

公开(公告)日：2021-08-12

申请号：US17244936

申请日：2021-04-29

Applicant: Cisco Technology, Inc.

Inventor： Ankan Ghosh ,  Nataraj Bacthu ,  Apurup Reddy Chevuru ,  Laxmi Kant Agrawal ,  Swaminathan Narayanan

IPC: H04L12/743 ,  G06F3/06 ,  H04L12/701

Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

公开(公告)号：US10404596B2

公开(公告)日：2019-09-03

申请号：US15723713

申请日：2017-10-03

Applicant: Cisco Technology, Inc.

Inventor： Ankan Ghosh ,  Nataraj Bacthu ,  Apurup Reddy Chevuru ,  Laxmi Kant Agrawal ,  Swaminathan Narayanan

IPC: G06F3/06 ,  H04L12/743

Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

公开(公告)号：US20190104067A1

公开(公告)日：2019-04-04

申请号：US15723713

申请日：2017-10-03

Applicant: Cisco Technology, Inc.

Inventor： Ankan Ghosh ,  Nataraj Bacthu ,  Apurup Reddy Chevuru ,  Laxmi Kant Agrawal ,  Swaminathan Narayanan

IPC: H04L12/743 ,  G06F3/06

CPC classification number: H04L45/7453 ,  G06F3/061 ,  G06F3/0638 ,  G06F3/0673 ,  H04L45/00

Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

公开(公告)号：US20180212876A1

公开(公告)日：2018-07-26

申请号：US15414589

申请日：2017-01-24

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Nataraj Bacthu ,  Ayan Banerjee ,  Raghava Sivaramu ,  Ankan Ghosh

IPC: H04L12/745 ,  H04L29/12 ,  H04L12/743

CPC classification number: H04L45/748 ,  H04L45/7457

Abstract: In one embodiment, a method includes receiving a request to add a prefix to memory for a route lookup at a forwarding device, the memory comprising a plurality of pivot tiles for storing pivot entries, each of the pivot entries comprising a plurality of prefixes and a pointer to a trie index, searching at the forwarding device, a dynamic pool of the pivot tiles based on a base-width associated with the prefix, allocating at least a portion of the pivot tile to the base-width and creating a pivot entry for the prefix and other prefixes with a corresponding base-width, and dynamically updating prefixes stored on the pivot tiles based on route changes to optimize storage of prefixes on the pivot tiles. An apparatus and logic are also disclosed herein.

公开(公告)号：US11348023B2

公开(公告)日：2022-05-31

申请号：US16281405

申请日：2019-02-21

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Ayan Banerjee ,  Nataraj Batchu ,  Ankan Ghosh

IPC: H04L12/24 ,  G06N7/00 ,  G06N20/10 ,  H04L41/142 ,  H04L41/147 ,  H04L41/0677

Abstract: Customized feature vectors are used to train a machine learning algorithm to automatically identify a network component where a network fault has occurred. A database comprising network components and associated network faults is analyzed to select a set of network components associated with the largest quantity of network faults. Customized features associated with the network faults are identified and selected for use in a feature vector as input to a machine learning algorithm. The features are selected based upon analysis of consistency checks, component configuration limits, and network wide configurations.