公开(公告)号：US07177978B2

公开(公告)日：2007-02-13

申请号：US10630174

申请日：2003-07-29

Applicant: Bhushan Mangesh Kanekar ,  Venkateshwar Rao Pullela ,  Dileep Kumar Devireddy ,  Gyaneshwar S. Saharia ,  Dipankar Bhattacharya ,  Qizhong Chen

Inventor： Bhushan Mangesh Kanekar ,  Venkateshwar Rao Pullela ,  Dileep Kumar Devireddy ,  Gyaneshwar S. Saharia ,  Dipankar Bhattacharya ,  Qizhong Chen

IPC: G06F12/00

CPC classification number: H04L45/00 ,  G06F17/30982 ,  H04L45/54 ,  H04L45/7453 ,  H04L47/2441

Abstract: Methods, apparatus, and other mechanisms are disclosed for merging lookup results, such as from one or more associative memory banks and/or memory devices. An access list is identified. A first set of entries corresponding to a first feature of the access control list entries and a second set of entries corresponding to a second feature of the access control list entries are identified. First and second associative memory banks are programmed respectively based on the first and second sets of entries. Lookup operations are then typically performed substantially simultaneously on the first and second sets of associative memory entries programmed in the associative memory banks to generate multiple lookup results, with these results typically being identified directly, or via a lookup operation in an adjunct memory or other storage mechanism. These lookup results are then combined to generate a merged lookup result.

Abstract translation: 公开了用于合并诸如来自一个或多个关联存储体和/或存储器装置的查找结果的方法，装置和其它机制。 识别访问列表。 识别对应于访问控制列表条目的第一特征的第一组条目和与访问控制列表条目的第二特征相对应的第二组条目。 基于第一和第二组条目分别对第一和第二关联存储体进行编程。 然后，通常在关联存储器组中编程的第一组和第二组关联存储器条目上基本上同时执行查找操作，以生成多个查找结果，这些结果通常直接被识别，或者经由辅助存储器或其他存储器中的查找操作 机制。 然后将这些查找结果组合以生成合并的查找结果。

公开(公告)号：US08625592B2

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

申请号：US12037525

申请日：2008-02-26

Applicant: Saravanakumar Rajendran ,  Michael Smith ,  Dileep Kumar Devireddy ,  Pradeep K. Kathail ,  Chandrashekhar Appanna ,  Jeffrey Ym Wang ,  Prashant P. Gandhi

Inventor： Saravanakumar Rajendran ,  Michael Smith ,  Dileep Kumar Devireddy ,  Pradeep K. Kathail ,  Chandrashekhar Appanna ,  Jeffrey Ym Wang ,  Prashant P. Gandhi

IPC: H04L12/54

CPC classification number: H04L45/60 ,  H04L45/00 ,  H04L45/583 ,  H04L47/24 ,  H04L49/40 ,  H04L49/45 ,  H04L49/602 ,  H04L49/70

Abstract: A blade switch for increased interface scalability is provided. The blade switch may address interface scalability by having each of the switch linecards manage its interfaces locally and may use the concept of virtual and local interfaces for intelligent forwarding. The blade switch may appear as a single network switch having a single bridge ID from the network perspective during operation and from the customer perspective during configuration.

Abstract translation: 提供了一种用于增加接口可扩展性的刀片式交换机。 刀片交换机可以通过使每个交换机线路卡在本地管理其接口来解决接口可扩展性，并且可以使用虚拟和本地接口的概念进行智能转发。 在操作期间，刀片交换机可以从网络的角度出发，具有单个桥接ID，并且在配置期间从客户的角度出发。

公开(公告)号：US07689485B2

公开(公告)日：2010-03-30

申请号：US10630178

申请日：2003-07-29

Applicant: Bhushan Mangesh Kanekar ,  Venkateshwar Rao Pullela ,  Dileep Kumar Devireddy ,  Suresh Gurajapu ,  Gyaneshwar S. Saharia ,  Atul Rawat

Inventor： Bhushan Mangesh Kanekar ,  Venkateshwar Rao Pullela ,  Dileep Kumar Devireddy ,  Suresh Gurajapu ,  Gyaneshwar S. Saharia ,  Atul Rawat

IPC: G06Q99/00

CPC classification number: G06F17/30982 ,  G06Q40/00 ,  G06Q40/12

Abstract: Methods, apparatus, and other mechanisms are disclosed for generating accounting or other data based on that indicated in access control lists or other specifications, and typically using associative memory entries in one or more associative memory banks and/or memory devices. One implementation identifies an access control list including multiple access control list entries, with a subset of these access control list entries identifying accounting requests. Accounting mechanisms are associated with each of said access control list entries in the subset of access control list entries identifying accounting requests. An item is identified, and a corresponding accounting mechanism is updated. In one implementation, the item includes at least one autonomous system number. In one implementation, at least one of the accounting mechanisms is associated with at least two different access control list entries in the subset of access control list entries identifying accounting requests.

Abstract translation: 公开了用于基于访问控制列表或其他规范中指示的并且通常在一个或多个关联存储器组和/或存储器件中使用关联存储器条目来生成计帐或其他数据的方法，装置和其他机制。 一个实现标识包括多个访问控制列表条目的访问控制列表，其中这些访问控制列表条目的子集标识记帐请求。 计帐机制与识别计费请求的访问控制列表条目的子集中的每个所述访问控制列表条目相关联。 识别项目，并更新相应的计帐机制。 在一个实现中，该项目包括至少一个自主系统号码。 在一个实现中，至少一个计帐机制与识别计费请求的访问控制列表条目的子集中的至少两个不同的访问控制列表条目相关联。

公开(公告)号：US07103708B2

公开(公告)日：2006-09-05

申请号：US10215719

申请日：2002-08-10

Applicant: William N. Eatherton ,  Jaushin Lee ,  Bangalore L. Priyadarshan ,  Priyank Ramesh Warkhede ,  Fusun Ertemalp ,  Hugh Weber Holbrook ,  Dileep Kumar Devireddy ,  Bhushan Mangesh Kanekar ,  Venkateshwar Rao Pullela

Inventor： William N. Eatherton ,  Jaushin Lee ,  Bangalore L. Priyadarshan ,  Priyank Ramesh Warkhede ,  Fusun Ertemalp ,  Hugh Weber Holbrook ,  Dileep Kumar Devireddy ,  Bhushan Mangesh Kanekar ,  Venkateshwar Rao Pullela

IPC: G06F12/00

CPC classification number: G06F17/30982

Abstract: Methods and apparatus are disclosed for performing lookup operations using associative memories, including, but not limited to modifying search keys within an associative memory based on modification mappings, forcing a no-hit condition in response to a highest-priority matching entry including a force no-hit indication, selecting among various sets or banks of associative memory entries in determining a lookup result, and detecting and propagating error conditions. In one implementation, each block retrieves a modification mapping from a local memory and modifies a received search key based on the mapping and received modification data. In one implementation, each of the associative memory entries includes a field for indicating that a successful match on the entry should or should not force a no-hit result. In one implementation, an indication of which associative memory blocks or sets of entries to use in a particular lookup operation is retrieved from a memory.

Abstract translation: 公开了用于使用关联存储器执行查找操作的方法和装置，包括但不限于基于修改映射来修改关联存储器内的搜索关键字，以响应于包括力不在的最高优先级匹配条目来强制无命中条件 - 指示，在确定查找结果中选择各种组或存储器中的关联存储器条目，以及检测和传播错误条件。 在一个实现中，每个块从本地存储器检索修改映射，并且基于映射和接收到的修改数据修改接收到的搜索密钥。 在一个实现中，每个关联存储器条目包括用于指示条目上的成功匹配应该或不应该强制无命中结果的字段。 在一个实现中，从存储器检索在特定查找操作中使用的哪些关联存储器块或条目集合的指示。

公开(公告)号：US07082492B2

公开(公告)日：2006-07-25

申请号：US10630176

申请日：2003-07-29

Applicant: Venkateshwar Rao Pullela ,  Dileep Kumar Devireddy ,  Bhushan Mangesh Kanekar ,  Stephen Francis Scheid

Inventor： Venkateshwar Rao Pullela ,  Dileep Kumar Devireddy ,  Bhushan Mangesh Kanekar ,  Stephen Francis Scheid

IPC: G06F12/00

CPC classification number: G06F17/30982

Abstract: Methods and apparatus are disclosed for defining and using associative memory entries with force no-hit and priority indications of particular use in implementing policy maps in communication devices. In one use, a set of entries is determined based on a policy map with a force no-hit indication being associated with one or more of the entries. Additionally, programmable priority indications may be associated with one or more of the entries, or with the associative memory devices, associative memory banks, etc. The force no-hit indications are often used in response to identified deny instructions in an access control list or other policy map. A lookup operation is then performed on these associative memory entries, with highest matching result or results identified based on the programmed and/or implicit priority level associated with the entries, or with the associative memory devices, associative memory banks, etc.

Abstract translation: 公开了用于定义和使用具有强制无命中的关联记忆条目和在通信装置中实现策略图中特别有用的优先指示的方法和装置。 在一次使用中，基于具有与一个或多个条目相关联的强制无命中指示的策略图来确定一组条目。 此外，可编程的优先级指示可以与一个或多个条目，或者与关联存储器设备，关联存储器组等相关联。强制无命中指示经常用于响应于访问控制列表中的标识的拒绝指令或 其他政策图。 然后对这些关联存储器条目执行查找操作，具有最高匹配结果或基于与条目相关联的已编程和/或隐式优先级级别或与关联存储器设备，关联存储器组等相关联的结果。