Search

Ponnappa B Palecanda

from Roseville, CA
Age ~68

Ponnappa Palecanda Phones & Addresses

  • 1921 Branding Iron Way, Roseville, CA 95661 (916) 782-7177
  • Sacramento, CA
  • Carrollton, TX
  • Plano, TX
  • Bloomington, IN
  • 1921 Branding Iron Way, Roseville, CA 95661 (916) 765-9888

Work

Position: Executive, Administrative, and Managerial Occupations

Education

Degree: Associate degree or higher

Emails

Resumes

Resumes

Ponnappa Palecanda Photo 1

Software Engineer

View page
Location:
1321 east Cooper Dr, Palatine, IL 60074
Industry:
Computer Networking
Work:
Hewlett Packard since Jan 2007
R&D Section manager (ProCurve)

Hewlett Packard's Jan 2002 - Jan 2007
R&D Project Manager (ProCurve)

HP ProCurve Jan 1998 - Jan 2002
Senior Software Engineer

Hewlett Packard Jan 1993 - Jan 1998
Software Engineer

HP Enterprise Services Jan 1984 - Jan 1990
Software engineer
Education:
Indiana University 1991 - 1993
M.Sc, Computer Science
West Texas A&M University 1979 - 1981
MBA, Management Information Systems
The University of Agricultural Sciences 1974 - 1979
B.Sc, Agriculture
Skills:
Switches
Unix
Software Development
Routing
Tcp/Ip
Embedded Systems
Networking
Ospf
Routers
Linux
C
Debugging
Device Drivers
Ip
Ethernet
Software Engineering
Cloud Computing
Shell Scripting
Operating Systems
Bgp
Snmp
System Architecture
Dns
Perl
Virtualization
Firmware
Clearcase
Vlan
Distributed Systems
Engineering
Client/Server
Hp Openview
Network Security
Hp Ux
Wireless Networking
Network Architecture
Storage
Dhcp
Spanning Tree
Recruiting
Data Center
Insurance
Cisco Technologies
Hardware
Rip
Firewalls
Ponnappa Palecanda Photo 2

Ponnappa Palecanda

View page

Publications

Us Patents

Packet Handling On A Network Device

View page
US Patent:
7859997, Dec 28, 2010
Filed:
May 26, 2005
Appl. No.:
11/139168
Inventors:
Ponnappa Palecanda - Roseville CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
H04L 12/26
US Classification:
370230
Abstract:
Methods for handling packets received at a network device are described. The packets are placed into a queue that contains packets of a first type and packets of a second type. The packets of the first type include protocol packets, and the packets of the second type include packets other than protocol packets. A first count is incremented when the queue is full. A packet of the second type is forwarded for processing provided that the first count satisfies a condition; otherwise, the packet of the second type is discarded.

Secure Information Distribution Between Nodes (Network Devices)

View page
US Patent:
8209537, Jun 26, 2012
Filed:
Mar 30, 2004
Appl. No.:
10/812607
Inventors:
Michael Roeder - La Jolla CA, US
Ponnappa Palecanda - Roseville CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
H04L 9/32
US Classification:
713171, 713150, 713153, 713163, 713168, 713169, 713170, 713189, 726 1, 726 4, 709201, 380277
Abstract:
In an embodiment, a method of secure information distribution between nodes, includes: performing a handshake process with an adjacent node to determine membership in a secure group; and distributing secure information to the adjacent node, if the adjacent node is a member of the secure group. In another embodiment, an apparatus for secure information distribution between nodes, includes: a node configured to performing a handshake process with an adjacent node to determine membership in a secure group, and distribute secure information to the adjacent node, if the adjacent node is a member of the secure group.

Efficient Data Storage

View page
US Patent:
20070016752, Jan 18, 2007
Filed:
Jul 18, 2005
Appl. No.:
11/184295
Inventors:
Ponnappa Palecanda - Roseville CA, US
International Classification:
G06F 12/00
US Classification:
711171000
Abstract:
One embodiment in accordance with the invention is a method for enabling efficient data storage. The method can include determining a maximum value for an element of a data structure, wherein the element can be stored. Also, a minimal bit number is determined that can represent the maximum value. A minimum amount of memory is determined for storing the minimal bit number. The minimum amount of memory is allocated. A determination is made as to where to store the element within the minimum amount of allocated memory.

Secure Information Distribution Between Nodes (Network Devices)

View page
US Patent:
20120240209, Sep 20, 2012
Filed:
May 29, 2012
Appl. No.:
13/482295
Inventors:
Michael Roeder - La Jolla CA, US
Ponnappa Palecanda - Roseville CA, US
International Classification:
G06F 21/20
US Classification:
726 7
Abstract:
In an embodiment, a method of secure information distribution between nodes, includes: performing a handshake process with an adjacent node to determine membership in a secure group; and distributing secure information to the adjacent node, if the adjacent node is a member of the secure group. In another embodiment, an apparatus for secure information distribution between nodes, includes: a node configured to performing a handshake process with an adjacent node to determine membership in a secure group, and distribute secure information to the adjacent node, if the adjacent node is a member of the secure group.
Ponnappa B Palecanda from Roseville, CA, age ~68 Get Report