Dennis W. Lee
Engineering at 4 St, Saratoga, CA
License number
Louisiana EI.0006491
Issued Date
Jan 1, 1900
Category
Civil Engineer
Address
Address
20700 4Th St APT 8, Saratoga, CA 95070
Professional information
Corporate Attorney
Location:
Saratoga, California
Industry:
Law Practice
Work:
Kim Quang Inc.
- San Diego, CA May 2012 - Sep 2012
-
Contract Attorney
University of San Diego School of Law
- Greater San Diego Area Sep 2011 - Jan 2012
-
Research Assistant
Sony Electronics
Jan 2011 - May 2011
-
In-House, Law Clerk
Alliant Insurance Services
Sep 2010 - Dec 2010
-
In-House, Legal Intern
University of San Diego School of Law
Jun 2010 - Dec 2010
-
Legal Intern, Entrepreneurship Clinic
Legal Aid Society of San Diego, Inc.
Aug 2009 - Jun 2010
-
Volunteer, Domestic Violence and Unlawful Detainer Clinics
King & Wood
Jun 2009 - Aug 2009
-
Summer Associate
H.G. Fenton Company
Jan 2008 - May 2008
-
Business Consultant
Education:
University of San Diego School of Law 2008 - 2011
Juris Doctor San Diego State University-California State University 2006 - 2008
Masters of Business Administration, Concentration in Entrepreneurship University of California, Berkeley 2000 - 2004
Bachelor of Arts, Legal Studies and Asian Studies (China)
Juris Doctor San Diego State University-California State University 2006 - 2008
Masters of Business Administration, Concentration in Entrepreneurship University of California, Berkeley 2000 - 2004
Bachelor of Arts, Legal Studies and Asian Studies (China)
Skills:
Legal Research, Legal Writing
Link Aggregation Path Selection Method
US Patent:
6535504, Mar 18, 2003
Filed:
Jan 15, 1999
Appl. No.:
09/231968
Inventors:
Brian Weatherred Johnson - Lucas TX 75002
Steve H. S. Kim - Fremont CA 94539
Dennis Lee - Saratoga CA 95070
Steve H. S. Kim - Fremont CA 94539
Dennis Lee - Saratoga CA 95070
International Classification:
H04L 1228
US Classification:
370351, 370238
Abstract:
A communication path selection method for sending messages between a sending communication device and a receiving communication device in a communication network chooses a best communication path for each message based on available message parameters. An index generator computes an index into a path selection table from the message parameters. Each index is assigned an entry which corresponds to one of the available communication paths. An entry generator assigns the best available communication path to each index produced from the message parameters. The method assures that messages belonging to a same conversation are sent by a same communication path to ensure that such messages are received in the proper order, and globally optimizes the distribution of messages among the available communication paths.
Low Cost Link Aggregation Method And System
US Patent:
6532229, Mar 11, 2003
Filed:
Jan 15, 1999
Appl. No.:
09/231967
Inventors:
Brian Weatherred Johnson - Lucas TX 75002
Steve H. S. Kim - Fremont CA 94539
Dennis Lee - Saratoga CA 95070
Steve H. S. Kim - Fremont CA 94539
Dennis Lee - Saratoga CA 95070
International Classification:
H04L 1228
US Classification:
370351, 370238
Abstract:
A communication path selection method for sending a message between a sending communication device and a receiving communication device in a communication network includes a link aggregation group bitmap, identifying all communication paths belonging to a link aggregation group, and a trial destination bitmap, identifying all communication paths identified as trial destination paths by a routing mechanism in the sending communication device. The link aggregation group communication paths are compared to the trial destination communication paths and if at least one path belongs to both groups, a path selection table is enabled to provide a path number identifying the selected communication path by which the message is to be sent.
Balanced Linked Lists For High Performance Data Buffers In A Network Device
US Patent:
6754744, Jun 22, 2004
Filed:
Sep 10, 2002
Appl. No.:
10/237612
Inventors:
Hyung Won Kim - San Jose CA
Dennis S. Lee - Saratoga CA
Dennis S. Lee - Saratoga CA
Assignee:
Broadcom Corporation - Irvine CA
International Classification:
G06F 506
US Classification:
710 56, 710 52
Abstract:
A process of handling packet data in a packet buffer is disclosed. Free pointers are stored in a plurality of free pointer queues, with each of the plurality free pointer queues in a form of a linked list and the free pointers are retrieved from each of the plurality of free pointer queues and storing in a prefetch memory to provide a throughput of one free pointer per clock cycle. When an initial portion of a data packet is received, two free pointers are retrieved from the prefetch memory. One of the two free pointers is stored in a start pointer register connoting a start of the data packet and one free pointer is supplied for data elements of the data packet. One free pointer per middle data element is supplied, while no new pointer is needed for the end of packet data element. The start of the data packet is linked with an end of packet portion of a previously received packet in an output queue memory and a data element is read out of the data packet from the output queue memory when selected by a transmission scheduler and releasing a pointer of the data element to one of the plurality of free pointer queues in a way that balances the lengths of all free pointer queues. Additionally, all pointers of a packet are released to one of the plurality of free pointer queues within one cycle when the packet is dropped.
Method And Apparatus For High Speed Table Search
US Patent:
6678678, Jan 13, 2004
Filed:
Mar 8, 2001
Appl. No.:
09/800784
Inventors:
Dennis Sungik Lee - Saratoga CA
Michael Veng-Chong Lau - San Jose CA
Pei-Feng Adrian Wang - San Jose CA
Chuen-Shen Bernard Shung - San Jose CA
Michael Veng-Chong Lau - San Jose CA
Pei-Feng Adrian Wang - San Jose CA
Chuen-Shen Bernard Shung - San Jose CA
Assignee:
Braodcom Corporation - Irvine CA
International Classification:
G06F 1700
US Classification:
707 3, 707200, 707100
Abstract:
A table searching system for facilitating high speed linear searching of a table of information by a plurality of searching agents is provided. The system includes: a memory unit for storing a table of information including a plurality of data entries each having data contents; a plurality of searching agents each being communicatively coupled with the memory unit, and having a port for receiving an associated search key value; and a memory controller unit providing a centralized interface between the memory unit and each of the agents, the controller unit being operative to control the memory unit to provide the contents of a current one of the table entries to each of the agents during each of a plurality of cycles of operation. Each of the searching agents is operative to determine an associated best matching one of the data entries based on comparisons between the associated key value and the contents of the data entries provided by the memory unit.
Method And Apparatus For High Speed Table Search
US Patent:
7260565, Aug 21, 2007
Filed:
Jan 5, 2004
Appl. No.:
10/750960
Inventors:
Dennis Sungik Lee - Saratoga CA, US
Michael Veng-Chong Lau - San Jose CA, US
Pei-Feng Adrian Wang - San Jose CA, US
Chuen-Shen Bernard Shung - San Jose CA, US
Michael Veng-Chong Lau - San Jose CA, US
Pei-Feng Adrian Wang - San Jose CA, US
Chuen-Shen Bernard Shung - San Jose CA, US
Assignee:
Broadcom Corporation - Irvine CA
International Classification:
G06F 15/16, G06F 17/00
US Classification:
707 3, 709217, 709218
Abstract:
A table searching system for facilitating high speed linear searching of a table of information by a plurality of searching agents is provided. The system includes: a memory unit for storing a table of information including a plurality of data entries each having data contents; a plurality of searching agents each being communicatively coupled with the memory unit, and having a port for receiving an associated search key value; and a memory controller unit providing a centralized interface between the memory unit and each of the agents, the controller unit being operative to control the memory unit to provide the contents of a current one of the table entries to each of the agents during each of a plurality of cycles of operation. Each of the searching agents is operative to determine an associated best matching one of the data entries based on comparisons between the associated key value and the contents of the data entries provided by the memory unit.
Method And Apparatus For Flexible Frame Processing And Classification Engine
US Patent:
7719980, May 18, 2010
Filed:
Feb 19, 2002
Appl. No.:
10/076367
Inventors:
Dennis S. Lee - Saratoga CA, US
Yongbum Kim - Cupertino CA, US
Hyungwon Kim - San Jose CA, US
Yongbum Kim - Cupertino CA, US
Hyungwon Kim - San Jose CA, US
Assignee:
Broadcom Corporation - Irvine CA
International Classification:
H04L 12/26
US Classification:
370235, 370230, 370401, 709225
Abstract:
A method of handling data packets in a network device and an apparatus for handling data packets in a network device are disclosed. The method includes receiving an incoming data packet and the incoming data packet is parsed to obtain a portion of the incoming data packet. That portion is compared with rules stored in a rule table, where each rule specifies a set of actions. A match between the portion and a particular rule of the rules is selected and a particular set of actions, specified by that particular rule is executed. Each rule includes a mask, a selection flag and a validity check that are used in the comparison of the portion with each rule. The rules may be compared with the packet portion serially or in a parallel fashion and if more than one rule matches the portion, the highest priority is selected as the matching rule.