Search

Saravanan Agasaveeran Phones & Addresses

  • 3980 Paul Ter, Fremont, CA 94538 (510) 498-4425
  • 36259 Enfield Dr, Newark, CA 94560 (510) 739-1779
  • Enfield Dr, Newark, CA 94560
  • 4159 El Camino Way, Palo Alto, CA 94306
  • Sunnyvale, CA
  • Santa Clara, CA
  • Detroit, MI
  • 36259 Enfield Dr, Newark, CA 94560

Skills

Video Streaming • Live Video Splitting • VOD • Windows Media • WMV • MPEG-4 • HLS • WAN optimization • Content Distribution Networks • Cloud Computing • Microsoft Exchange Protocols • MAPI • Embedded Systems • Linux • Cisco IOS • Multithreading • Socket Programming • Device Drivers • Platform Integration • Real-time Scheduling • RTOS • pSOS • Neutrino • Distributed Systems • Distributed Caching • Cluster Development • High Availability Clustering • Programmable networking • Parallel Processing • PowerPC • C • C++ • Java • HTML5 • TCP/IP • UDP • HTTP • SSL • RTSP • RTP

Industries

Computer Networking

Resumes

Resumes

Saravanan Agasaveeran Photo 1

Saravanan Agasaveeran

View page
Location:
San Francisco Bay Area
Industry:
Computer Networking
Skills:
Video Streaming
Live Video Splitting
VOD
Windows Media
WMV
MPEG-4
HLS
WAN optimization
Content Distribution Networks
Cloud Computing
Microsoft Exchange Protocols
MAPI
Embedded Systems
Linux
Cisco IOS
Multithreading
Socket Programming
Device Drivers
Platform Integration
Real-time Scheduling
RTOS
pSOS
Neutrino
Distributed Systems
Distributed Caching
Cluster Development
High Availability Clustering
Programmable networking
Parallel Processing
PowerPC
C
C++
Java
HTML5
TCP/IP
UDP
HTTP
SSL
RTSP
RTP

Publications

Us Patents

Apparatus And Methods For Scheduling And Performing Tasks

View page
US Patent:
6757897, Jun 29, 2004
Filed:
Feb 29, 2000
Appl. No.:
09/515198
Inventors:
Zhanhe Shi - San Jose CA
Qingming Ma - Santa Clara CA
Saravanan Agasaveeran - Sunnyvale CA
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
G06F 900
US Classification:
718102, 718100, 718104, 718103, 718107, 710240, 710243
Abstract:
The invention provides unique mechanisms and techniques for a computing device to perform various tasks in a multi-tasking or time sliced environment. A general task scheduling algorithm can select various time slices or priorities for task performance. However, in a dedicated device such as a data communications device, a primary task such as a data transfer task may be so heavily favored by the general task scheduling algorithm, such as in heavy network traffic conditions, that other tasks may be starved of processor time. As such, the system of the invention allows the primary task, to track a first time period Y, and upon expiration of this time period Y, to generate a yield signal to a yielding scheduler. The yielding scheduler can then disable performance of the primary task(s) and track a second time period X during which other tasks may be performed. At the expiration of the second time period X, the primary task(s) which were disabled upon the occurrence of the yield signal are then re-enabled for performance and the yielding scheduler selects a task for performance.

Packet Prioritization Processing Technique For Routing Traffic In A Packet-Switched Computer Network

View page
US Patent:
6798743, Sep 28, 2004
Filed:
Mar 22, 1999
Appl. No.:
09/274091
Inventors:
Qingming Ma - Santa Clara CA
Saravanan Agasaveeran - Sunnyvale CA
Zhanhe Shi - San Jose CA
Steven Berl - Piedmont CA
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
H04J 116
US Classification:
370235, 370413
Abstract:
A two-phase packet processing technique is provided for routing traffic in a packet-switched, integrated services network which supports a plurality of different service classes. During Phase I, packets are retrieved from the router input interface and classified in order to identify the associated priority level of each packet and/or to determine whether a particular packet is delay-sensitive. If it is determined that a particular packet is delay-sensitive, the packet is immediately and fully processed. If, however, it is determined that the packet is not delay-sensitive, full processing of the packet is deferred and the packet is stored in an intermediate data structure. During Phase II, packets stored within the intermediate data structure are retrieved and fully processes. The technique of the present invention significantly reduces packet processing latency, particularly with respect to high priority or delay-sensitive packets. It is easily implemented in conventional routing systems, imposes little computational overhead, and consumes only a limited amount of memory resources within such systems.

Methods And Apparatus For Moving Data Elements Within A Data Communications Device

View page
US Patent:
6832265, Dec 14, 2004
Filed:
Jan 7, 2000
Appl. No.:
09/479511
Inventors:
Qingming Ma - Santa Clara CA
Saravanan Agasaveeran - Sunnyvale CA
Satish Gannu - Bangalore, IN
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
G06F 1516
US Classification:
709250, 37039542
Abstract:
The invention is directed to techniques for moving data elements within a data communications device which prioritizes handling transmit interrupts over handling receive interrupts. Preferably, while attending to transmit interrupts, the device gives priority to the âhungriestâ interfaces. In one arrangement, the device includes multiple network interfaces which are capable of transmitting and receiving data elements with a network, and a controller, coupled to the interfaces. The controller is configured to perform a method comprising the steps of: assigning weights to the interfaces based on interface transmission capacities and/or the number of data elements ready for transmission through the interfaces; determining which of the interfaces indicates readiness to transmit a data element to the network and which of the interfaces indicates receipt of a data element from the network; exclusively running, for each interface indicating readiness to transmit a data element to the network, a transmit interrupt handler to load that interface with a data element for transmission if such a data element is available for transmission within the data communications device (the handling order of the interfaces being determined by the weights so that the âhungriestâ interfaces are handled first); and after the step of exclusively running transmit interrupt handlers, running, for at least one interface which indicates receipt of a data element from the network, a receive interrupt handler to process that data element and restricting the amount of time consumed running the receive interrupt handlers before handling transmit interrupts again. Since the device prioritizes handling transmit interrupts over receive interrupts in a weighted preferential manner, the device handles transmit interrupts as early as possible to move data elements quickly to the interfaces. Accordingly, it is less likely that interfaces will âstarveâ for data elements.

Apparatus And Method For Rate-Based Polling Of Input Interface Queues In Networking Devices

View page
US Patent:
6977895, Dec 20, 2005
Filed:
Mar 23, 2000
Appl. No.:
09/533517
Inventors:
Zhanhe Shi - San Jose CA, US
Qingming Ma - Cupertino CA, US
Saravanan Agasaveeran - Sunnyvale CA, US
Steven H. Berl - Piedmont CA, US
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
H04J001/16
US Classification:
370235, 370401, 370412, 370449
Abstract:
The congestion control in a networking device having a plurality of input interface queues includes (a) estimating the data arrival rate on each of the plurality of input interface queues, and (b) determining, for each polling round, the sequence in which the plurality of input interface queues should be polled and the quantity of data to be processed from each of the plurality of input interface queues each time the input interface queue is polled, using the estimated data arrival rate on each of the plurality of input interface queues.

Methods And Apparatus For Moving Data Elements Within A Data Communications Device

View page
US Patent:
7395356, Jul 1, 2008
Filed:
Nov 5, 2004
Appl. No.:
10/981815
Inventors:
Qingming Ma - Santa Clara CA, US
Saravanan Agasaveeran - Sunnyvale CA, US
Satish Gannu - Bangalore, IN
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
G06F 15/16
G06F 15/173
H04L 12/56
US Classification:
709250, 709240, 709241, 709251, 370412, 370419, 37039542
Abstract:
A method includes a step of (A) determining which of multiple network interfaces indicates readiness to transmit a data element to a network and which of the multiple network interfaces indicates receipt of a data element from the network. The method further includes a step of (B) running, for each network interface indicating readiness to transmit a data element to the network, a transmit interrupt handler to load that network interface with a data element for transmission if such a data element is available for transmission within the data communications device, in response to giving higher priority to handling transmit interrupts relative to handling receive interrupts. The method further includes a step of (C) after step B, running, for at least one network interface which indicates receipt of a data element from the network, a receive interrupt handler to process that data element.

Apparatus And Method For Rate Limiting And Filtering Of Http(S) Server Connections In Embedded Systems

View page
US Patent:
7484011, Jan 27, 2009
Filed:
Oct 8, 2003
Appl. No.:
10/681870
Inventors:
Saravanan Agasaveeran - Newark CA, US
Anantha Ramaiah - Sunnyvale CA, US
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
G06F 15/16
US Classification:
709250
Abstract:
A system for filtering transport layer connections with application layer connection outcomes provides a connection database to store information about connection requests and associated application layer outcomes. The system further includes a throttle filter populated with data from the connection database. The throttle filter is a list of connection requestor identifier, such as IP addresses or port numbers, to be used to identify connection requests to be blocked based on previous connection requests from the connection requesters. The system provides attack and overload protection and load balancing in embedded systems.

Apparatus And Method For Rate-Based Polling Of Input Interface Queues In Networking Devices

View page
US Patent:
7558278, Jul 7, 2009
Filed:
Nov 1, 2005
Appl. No.:
11/264883
Inventors:
Zhanhe Shi - San Jose CA, US
Qingming Ma - Cupertino CA, US
Saravanan Agasaveeran - Sunnyvale CA, US
Steven H. Berl - Piedmont CA, US
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
H04L 12/56
US Classification:
370412, 370235
Abstract:
Controlling congestion in a networking device having a plurality of input interface queues comprises estimating, in each of one or more sampling states, a data arrival rate for each of the plurality of input interface queues with respect to incoming data packets received on corresponding input interfaces, obtaining a set of estimated arrival rates for the plurality of the input interface queues, determining, for each polling state associated with a respective sampling state, the sequence in which the plurality of input interface queues should be polled using the set of estimated data arrival rates of the plurality of input interface queues, and polling the plurality of interface queues in accordance with the determined sequence. The sequence indicates when, during a single polling cycle, each of the input interface queues should be polled in relation to every other of the input interface queues.

Mechanism To Prevent Escaped Associations In Multi-Association Rpc Based Protocols

View page
US Patent:
20120124430, May 17, 2012
Filed:
Nov 17, 2010
Appl. No.:
12/948457
Inventors:
Srinivas Dharmasanam - San Jose CA, US
Eitan Ben-Nun - San Jose CA, US
Saravanan Agasaveeran - Fremont CA, US
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
G06F 15/16
G06F 11/07
US Classification:
714 48, 709227, 709238, 714E11025
Abstract:
Consistent with embodiments of the present invention, a method may be provided comprising sending a first bind request with an association group ID of zero. A first association group with a first association group ID may then be created. The first association group ID may be switched to a second association group ID in an acknowledgement message. A second bind request may then be sent with the second association group ID. The second association group ID may be switched to the first association group ID in the second bind request after the bind request has been sent. After receiving the second bind request, it may be determined whether the association group ID in the second bind request is the same as the first association group ID. A failure message may be sent if the association group ID in the second bind request is not the same as the first association group ID.
Saravanan Agasaveeran from Fremont, CA, age ~59 Get Report