ASHWATH NAGARAJ
Pilots at Elena Rd, Los Altos, CA

6988106, Jan 17, 2006

Jul 9, 2003

10/616737

Thomas Jeffrey Enderwick - San Jose CA, US
Henry Kin-Chuen Kwok - Fremont CA, US
Ashwath Nagaraj - Los Altos CA, US

Cisco Technology, Inc. - San Jose CA

G06F 17/30

707100

Mechanisms for storing and searching a hierarchy of items are disclosed which may be particularly useful for implementing security policies and security associations, such as, but not limited to Internet Protocol security (IPsec). A hierarchy of items is stored in a search priority order. Multiple element definitions and groups of elements are identified. Representations of the element definitions and elements are stored in a prioritized searchable data structure in decreasing search priority such that representations of each particular element definition is stored after representations of a set of particular elements associated with the particular element definition and before representations of lower priority element definitions and their associated elements. The element definitions may include Internet Protocol security policies and the elements may include Internet Protocol security associations. The searchable data structure may include an associative memory or a plurality of associative memory entries.

2011027, Nov 10, 2011

May 4, 2010

12/773031

Ajit Gupta - Fremont CA, US
Ashwath Nagaraj - Los Altos Hills CA, US
Rajeev Bharadhwaj - Saratoga CA, US

ARYAKA NETWORKS, INC., - Newark CA

G06F 15/173, G06Q 20/00, G06Q 10/00, G06Q 50/00, G06F 21/00, G06Q 30/00

705 34, 726 1, 705317, 709239, 709224

A method and system of a heterogeneous service provider model through pay-for-performance based transit settlements are disclosed. In one embodiment, a system includes a plurality of Point of Presence (POP) locations between a head office and a branch office in a heterogeneous computer network configured to communicate data through a pay-per-performance peering relationship between different entities of the heterogeneous computer network. In this embodiment, the system implements a debit-credit mechanism configured to handle payments as well as penalties associated with violation of a pair-wise mutual agreement between independent for-profit entities providing network services in a segment of the heterogeneous computer network.

7434045, Oct 7, 2008

Apr 21, 2003

10/420568

Thomas Enderwick - San Jose CA, US
Ashwath Nagaraj - Los Altos CA, US
Ramakrishna Rao - San Jose CA, US
Benjamin Tseng - Palo Alto CA, US

Cisco Technology, Inc. - San Jose CA

H04L 9/00

713158, 726 2

Processes are disclosed in which an index value is generated for locating a security association in a security association database, such as an inbound SAD associated with the IPsec set of protocols. The index value is specified for insertion into a Security Parameter Index (SPI) field of a packet header, such as an IPsec header. For packets that are to be secured according to the policies and protocols identified in the header and the security association and that are transmitted to a particular network device or host, the index value is inserted into the SPI field of the packets by a packet sender. The packet is then parsed by a packet receiver, the index value determined from the SPI and used to identify the security association in the SAD, based solely on the index value determined from the SPI. Hence, a simple and efficient mechanism is provided for fast inbound security association lookups.

7493328, Feb 17, 2009

Nov 13, 2005

11/273289

Thomas Jeffrey Enderwick - San Jose CA, US
Henry Kin-Chuen Kwok - Fremont CA, US
Ashwath Nagaraj - Los Altos CA, US

Cisco Technology, Inc. - San Jose CA

G06F 7/00

707100, 711101

Mechanisms for storing and searching a hierarchy of policies and associations thereof are disclosed which may be particularly useful for implementing security protocols, such as, but not limited to Internet Protocol security (IPsec). For example, a hierarchy of policies is stored in a search priority order in an associative memory, with each association of a particular policy stored higher in the search priority than its associated policy and after any other policy. Therefore, a lookup operation on the associative memory will identify a matching association, if one, else its matching policy. A match of a policy instead of an association may result in a corresponding association being added in the appropriate location. For IPsec implementations, the lookup word is typically derived from the packet, with this packet being typically processed based on the identified policy or association.

6717946, Apr 6, 2004

Oct 31, 2002

10/284759

Yoichi Hariguchi - Menlo Park CA
Rina Panigrahy - Sunnyvale CA
Samar Sharma - Sunnyvale CA
Ashwath Nagaraj - Los Altos CA

Cisco Technology Inc. - San Jose CA

H04L 1228

370392, 370389

Methods and apparatus are disclosed for maintaining one or more ranges and identifying whether a value matches one of the ranges and optionally which range is matched. One implementation includes a range programming engine for generating one or more mapped subtrie values identifying each range, each of the mapped subtrie values identifying a different subset of the range. An associative memory stores the mapped subtrie ranges. A mapping engine receives a particular value and generates a lookup word including a mapped representation of the particular value. The associative memory performs a lookup operation to identify whether or not the particular value is within one of the ranges. In this manner, only a small number of associative memory entries are required to identify whether a mapped particular value falls within the range. The particular range matched can be identified such as by a read operation in an adjunct memory based on the address of the matching entry.

7240149, Jul 3, 2007

Nov 6, 2003

10/703915

Ashwath Nagaraj - Los Altos CA, US
Thomas Jeffrey Enderwick - San Jose CA, US
Henry Kin-Chuen Kwok - Fremont CA, US
Surya Prakash Jonnavithula - Santa Clara CA, US

Cisco Technology, Inc. - San Jose CA

G06F 12/02

711108, 711202, 711213, 365 49

Multiple branch operations using one or more associative memories are performed, which may be of particular use for, but is not limited to implementing security classification and access control lists. One embodiment generates a first lookup value including a first branch search level indication. A first lookup operation is performed on a set of associative memory entries based on the first lookup value to identify a first associative memory result, with each of associative memory entries including a branch level indication. The associative memory result is used to identify an adjunct memory result associated with a second branch level indication. A second lookup value is derived based on the second branch level indication. A second lookup operation is then performed on the associative memory entries based on the second lookup value to identify a second associative memory result.

7305519, Dec 4, 2007

Mar 29, 2004

10/813210

Ashwath Nagaraj - Los Altos CA, US

Cisco Technology, Inc. - San Jose CA

G06F 12/16

711108, 365 49, 714 6, 714763

Error protection is provided for associative memory entries and lookup operations performed thereon. Protected associative memory entries are determined which include one or more protection bits. These protected entries are programmed into an associative memory, typically with each protected entry being programmed into two or more consecutive locations. Corresponding protected lookup words are generated and used to perform lookup operations in the associative memory. For binary content-addressable memories (CAMs) and ternary content-addressable memory (TCAMs), one or more error detection bits are used per entry to prevent or at least reduce the possibility of a lookup error. For example, a single parity bit or multiple error-correction code (ECC) bits may be used per entry. The use of the protection bits reduces the possibility of a false matching of a corrupted entry, and the duplicate entries reduce the possibility of not matching an entry that should be matched as all copies of the entry must be corrupt in order to not match one of the entries during a lookup operation.

8396954, Mar 12, 2013

Jun 24, 2010

12/822366

Ashwath Nagaraj - Los Altos Hills CA, US
Rajeev Bharadhwaj - Saratoga CA, US
Ajit Gupta - Fremont CA, US

Aryaka Networks, Inc. - Newark CA

G06F 15/173

709223, 709224, 709227, 709229, 37039521, 37039541

Disclosed are a system, a method and an apparatus of reduction of routing and service performance management in an application acceleration environment. In one embodiment, a system includes a branch site that includes a branch client. In addition, the system includes a headquarters site that includes a headquarters server. The headquarters site including a headquarters server includes the branch site. The headquarters site is communicatively coupled over a link via transmission media. The link is identified through a link identifier. The headquarters site including a headquarters server also includes the branch client and the headquarters server being communicatively coupled over a network connection via the transmission media. The network connection is identified through a connection identifier. The system also includes a first point of presence (POP) communicatively coupled with the branch site over a first segment of the link.

2013028, Oct 24, 2013

Jun 17, 2013

13/919018

Rajeev Bharadhwaj - Saratoga CA, US
Ajit Gupta - Fremont CA, US
Ashwath Nagaraj - Los Altos Hills CA, US

H04L 29/08

709205

Disclosed are systems and methods to provide application acceleration as a service. In one embodiment, a system includes a head office to serve an enterprise application comprised of a collaborative document. The system also includes a branch office to request the collaborative document from the head office. The enterprise application may also include a computed document and/or a static document. In addition, the system also includes a set of Point of Presence (POP) locations between the head office and the branch office to communicate the collaborative document, the computed document and the static document on behalf of the head office from a closest POP location to the head office to a closest POP location to the branch office and then onward to the branch office.

8489685, Jul 16, 2013

Aug 31, 2009

12/550409

Rajeev Bharadhwaj - Saratoga CA, US
Ajit Gupta - Fremont CA, US
Ashwath Nagaraj - Los Altos Hills CA, US

Aryaka Networks, Inc. - Newark CA

G06F 15/16

709205

Disclosed are systems and methods to provide application acceleration as a service. In one embodiment, a system includes a head office to serve an enterprise application comprised of a collaborative document. The system also includes a branch office to request the collaborative document from the head office. The enterprise application may also include a computed document and/or a static document. In addition, the system also includes a set of Point of Presence (POP) locations between the head office and the branch office to communicate the collaborative document, the computed document and the static document on behalf of the head office from a closest POP location to the head office to a closest POP location to the branch office and then onward to the branch office.