公开(公告)号：US10530662B2

公开(公告)日：2020-01-07

申请号：US15977082

申请日：2018-05-11

Applicant: Cisco Technology, Inc.

Inventor： Ankan Ghosh ,  Apurup Reddy Chevuru

IPC: G06F15/177 ,  H04L12/24

Abstract: A computer-implemented method includes: obtaining platform dependent data and platform independent data from each of a plurality of first network devices for a computer network environment. The received platform dependent data and platform independent data are converted to key-value pairs. Sequences of the key-value pairs representing the configurations and states of the respective first network device are created. Vectors for the sequences of the key-value pairs are generated in a vector space. The vectors are supplied to a model to train the model to learn relationships of the platform dependent data and platform independent data of each of the plurality of first network devices. Platform dependent data and platform independent data from one or more second network devices are supplied to the trained software model to determine consistency of configurations and states of the one or more second network devices.

公开(公告)号：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.

公开(公告)号：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.

公开(公告)号：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.