公开(公告)号：US20060106977A1

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

申请号：US11321918

申请日：2005-12-28

Applicant: William Eatherton ,  Jaushin Lee ,  Bangalore Priyadarshan ,  Priyank Warkhede ,  Fusun Ertemalp ,  Hugh Holbrook ,  Dileep Devireddy ,  Bhushan Kanekar ,  Venkateshwar Pullela

Inventor： William Eatherton ,  Jaushin Lee ,  Bangalore Priyadarshan ,  Priyank Warkhede ,  Fusun Ertemalp ,  Hugh Holbrook ,  Dileep Devireddy ,  Bhushan Kanekar ,  Venkateshwar 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: 公开了用于使用关联存储器执行查找操作的方法和装置，包括但不限于基于修改映射修改关联存储器内的搜索关键字，响应于最高优先级的匹配条目来响应不受限制的条件，包括力 - 指示，在确定查找结果中选择各种组或存储器中的关联存储器条目，以及检测和传播错误条件。 在一个实现中，每个块从本地存储器检索修改映射，并且基于映射和接收到的修改数据修改接收到的搜索密钥。 在一个实现中，每个关联存储器条目包括用于指示条目上的成功匹配应该或不应该强制无命中结果的字段。 在一个实现中，从存储器检索在特定查找操作中使用的哪些关联存储器块或条目集合的指示。

公开(公告)号：US20060095960A1

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

申请号：US11084311

申请日：2005-03-17

Applicant: Mauricio Arregoces ,  Maurizio Portolani ,  Pere Monclus ,  Anurag Kahol ,  Venkateshwar Pullela ,  Saravanakumar Rajendran ,  Dileep Devireddy

Inventor： Mauricio Arregoces ,  Maurizio Portolani ,  Pere Monclus ,  Anurag Kahol ,  Venkateshwar Pullela ,  Saravanakumar Rajendran ,  Dileep Devireddy

IPC: G06F15/16

CPC classification number: H04L63/0254 ,  H04L67/1002

Abstract: A data center topology routes traffic between internal sub-nets and between a sub-net and an outside network through a common chain of services. The data center topology employs transparent layer 7 and layer 4 services on a common chassis or platform to provide routing, load balancing and firewall services while reducing the number of devices necessary to implement the data center and simplifying configuration.

Abstract translation: 数据中心拓扑通过公共服务链路在内部子网之间以及子网与外部网络之间路由流量。 数据中心拓扑在通用机箱或平台上采用透明层7和第4层服务，以提供路由，负载平衡和防火墙服务，同时减少实现数据中心所需的设备数量并简化配置。

公开(公告)号：US20070002862A1

公开(公告)日：2007-01-04

申请号：US11497171

申请日：2006-08-01

Applicant: Bhushan Kanekar ,  Venkateshwar Pullela ,  Dileep Devireddy ,  Gyaneshwar Saharia ,  Dipankar Bhattacharya ,  Qizhong Chen

Inventor： Bhushan Kanekar ,  Venkateshwar Pullela ,  Dileep Devireddy ,  Gyaneshwar Saharia ,  Dipankar Bhattacharya ,  Qizhong Chen

IPC: H04L12/28

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. In one exemplary implementation, multiple associative memories or associative memory banks are configured to substantially simultaneously generate a plurality of lookup results based on a lookup value. Multiple memories are each configured to generate a corresponding result based on the lookup result generated by its corresponding associative memory or associative memory bank. A combiner is configured to receive and merge these corresponding results generated substantially simultaneously in order to identify the merged lookup result.

Abstract translation: 公开了用于合并诸如来自一个或多个关联存储体和/或存储器装置的查找结果的方法，装置和其它机制。 在一个示例性实现中，多个关联存储器或关联存储器组被配置为基于查找值基本上同时生成多个查找结果。 多个存储器被配置为基于由其相应的关联存储器或关联存储体生成的查找结果来产生相应的结果。 组合器被配置为接收并合并基本同时生成的这些对应结果，以便识别合并的查找结果。

公开(公告)号：US20060233173A1

公开(公告)日：2006-10-19

申请号：US11122612

申请日：2005-05-05

Applicant: Venkateshwar Pullela ,  Ambarish Kenghe ,  Ramesh Ponnapalli ,  Dileep Devireddy ,  Suresh Gurajapu

Inventor： Venkateshwar Pullela ,  Ambarish Kenghe ,  Ramesh Ponnapalli ,  Dileep Devireddy ,  Suresh Gurajapu

IPC: H04L12/28

CPC classification number: H04L12/4641

Abstract: Disclosed are, inter alia, methods, apparatus, data structures, computer-readable media, and mechanisms, for policy-based processing of packets, including mechanisms for managing the policies. A user is authenticated and its user group identifier is identified. A packet is received and is associated with the user group identifier, and one or more fields (typically other than the source address field) of the packet are used to identify a second group identifier. A lookup operation is then performed on a policy based on the first and second group identifiers to identify a packet processing action to be performed on the packet. These identifiers are typically not network addresses, which disassociates the policy from physical network addresses (which often are dynamically assigned and may also vary based on the access point into the network of a user), and allows a switching device to process packets based on a policy stated using group identifiers.

Abstract translation: 公开了用于分组的基于策略的处理的方法，装置，数据结构，计算机可读介质和机制，包括用于管理策略的机制。 用户被认证，并且其用户组标识符被识别。 接收到分组并与用户组标识符相关联，并且使用分组的一个或多个字段（通常不是源地址字段）来标识第二组标识符。 然后基于第一组标识符和第二组标识符对策略执行查找操作，以识别要对分组执行的分组处理动作。 这些标识符通常不是网络地址，其将策略与物理网络地址（其通常被动态地分配，并且还可以基于到用户的网络的接入点）而变化），并且允许交换设备基于 政策声明使用组标识符。