Heeloo L Chung

age ~63

from Burlingame, CA

Also known as:
  • Heeloo Loo Chung
  • Hee Loo Chung
  • Hee L Chung
  • Chung Chan Heeloo
  • Heelo Chung
  • Loo Chung Heeloo
  • Heeloo Loo Chunghee
  • Carol Ehlers
  • Caroline Ehlers

Heeloo Chung Phones & Addresses

  • Burlingame, CA
  • 421 Hazelwood Ave, San Francisco, CA 94127 • 4153338860
  • 508 Miramar Ave, San Francisco, CA 94112 • 4153334330
  • Kennesaw, GA
  • 421 Hazelwood Ave, San Francisco, CA 94127 • 4152187969

Emails

Resumes

Heeloo Chung Photo 1

Independent Consultant

view source
Location:
San Francisco, CA
Industry:
Computer Hardware
Work:
Glorytech 2010 - 2013
Technology Consultant and Chief Technology Officer

2010 - 2013
Independent Consultant

Force10 Networks Nov 1999 - Jul 2010
Senior Director of Silicon

Artx 1997 - 1999
Mts

Rendition 1995 - 1997
Mts
Education:
Stanford University
Master of Science In Computer Science, Masters, Architecture, Computer Graphics
San Jose State University
Bachelors, Bachelor of Science In Electrical Engineering, Engineering
Heeloo Chung Photo 2

Heeloo Chung

view source
Location:
San Francisco, CA

Us Patents

  • Interleaved Weighted Fair Queuing Mechanism And System

    view source
  • US Patent:
    6975638, Dec 13, 2005
  • Filed:
    Oct 13, 2000
  • Appl. No.:
    09/687762
  • Inventors:
    Yao-Min Chen - San Jose CA, US
    Heeloo Chung - San Francisco CA, US
    Zhijun Tong - Fremont CA, US
    Eugene Lee - San Jose CA, US
  • Assignee:
    Force10 Networks, Inc. - Milpitas CA
  • International Classification:
    H04L012/26
    H04J001/16
    G08C015/00
    G06F011/00
  • US Classification:
    370412, 370232, 370395, 709235
  • Abstract:
    Methods and apparatus for interleaved weighted fair data packet queue sequencing are disclosed. An interleaving table specifies a queue sequence. A queue sequencer follows the table order on an epoch-by-epoch basis, selecting a queue for each epoch based on the table order. If the selected queue does not have enough data to fill its epoch, the sequencer can step to the next queue in the table order. Because the table is interleaved, higher-priority queues can be visited frequently, improving jitter and latency for packets associated with these queues. The table structure allows all queues at least some portion of the available output bandwidth, and can be organized to afford some queues a much larger portion without having those queues monopolize the output stream for inordinate amounts of time. In some embodiments, each table entry has a programmable epoch value associated with it. The epoch value can be used to weight each table entry respective to the other entries.
  • High Efficiency Data Buffering In A Computer Network Device

    view source
  • US Patent:
    7346067, Mar 18, 2008
  • Filed:
    Nov 16, 2001
  • Appl. No.:
    09/990753
  • Inventors:
    Heeloo Chung - San Francisco CA, US
    Eugene Lee - San Jose CA, US
  • Assignee:
    Force 10 Networks, Inc. - San Jose CA
  • International Classification:
    H04L 12/28
    H04L 12/56
  • US Classification:
    370412, 370413, 370429
  • Abstract:
    A network processing device stores and aligns data received from an input port prior to forwarding the data to an output port. Data packets arrive at various input ports already having an output queue or virtual output queue assigned. A buffer manager groups one or more packets destined for the same output queue into blocks, and stores the blocks in a buffer memory. A linked list is created of the trunks, which is an ordered collection of blocks. The trunks are sent to a high speed second memory and stored together as a unit. In some embodiments the trunks are split on boundaries and stored in a high speed memory. Once the trunks are stored in the high speed second memory, the corresponding data is erased from the write combine buffer memory and the pointers that made up the linked list are returned to a free block pointer pool. The data can then be read from the high speed second memory very quickly, passed through a switching fabric, and placed back on the computer network for its next destination. In other embodiments, the trunk data is stored after passing through the switching fabric, before being placed back on the computer network.
  • Resilient Retransmission Of Epoch Data

    view source
  • US Patent:
    7843830, Nov 30, 2010
  • Filed:
    May 5, 2005
  • Appl. No.:
    11/122603
  • Inventors:
    Krishnamurthy Subramanian - Mountain View CA, US
    Heeloo Chung - San Francisco CA, US
    Glenn Poole - Fremont CA, US
  • Assignee:
    Force 10 Networks, Inc - San Jose CA
  • International Classification:
    H04J 3/14
    H04J 1/16
    H04L 1/00
    H04L 12/26
    G08C 15/00
    G06F 11/00
    G01R 31/08
  • US Classification:
    370235, 370229, 714776
  • Abstract:
    Apparatus and methods for epoch retransmission in a packet network device are described. In at least one embodiment, epoch receivers check received epoch data for errors. When an error is detected, a receiver is allowed to request that the entire epoch be retransmitted. All epoch senders retain transmitted epoch data until the time for requesting a retransmission of that data is past. If retransmission is requested by any receiver, the epoch is “replayed. ” This approach mitigates the problem of dropping multiple packets (bundled in a large epoch) due to an intraswitch error with the epoch. Other embodiments are also described and claimed.
  • Congestion Avoidance Profiles In A Packet Switching System

    view source
  • US Patent:
    6904015, Jun 7, 2005
  • Filed:
    Sep 1, 2000
  • Appl. No.:
    09/653467
  • Inventors:
    Yao-Min Chen - San Jose CA, US
    Heeloo Chung - San Francisco CA, US
  • Assignee:
    Force10 Networks, Inc. - Milpitas CA
  • International Classification:
    G01R031/08
    H04L012/28
    H04L012/54
  • US Classification:
    370235, 370429, 370412, 370389
  • Abstract:
    Methods and apparatus for an improvement on Random Early Detection (RED) router congestion avoidance are disclosed. A traffic conditioner stores a drop probability profile as a collection of configurable profile segments. A multi-stage comparator compares an average queue size (AQS) for a packet queue to the segments, and determines which segment the AQS lies within. This segment is keyed to a corresponding drop probability, which is used to make a packet discard/admit decision for a packet. In a preferred implementation, this computational core is surrounded by a set of registers, allowing it to serve multiple packet queues and packets with different discard priorities. Each queue and discard priority can be keyed to a drop probability profile selected from a pool of such profiles. This provides a highly-configurable, inexpensive, and fast RED solution for a high-performance router.
  • Method And Apparatus For Performing A Weighted Queue Scheduling Using A Set Of Fairness Factors

    view source
  • US Patent:
    20160142333, May 19, 2016
  • Filed:
    Nov 14, 2014
  • Appl. No.:
    14/542298
  • Inventors:
    - San Jose CA, US
    Heeloo CHUNG - San Francisco CA, US
  • International Classification:
    H04L 12/863
  • Abstract:
    A computer-implemented medium using a scheduler for processing requests by receiving packet data from multiple source ports and then classifying, the received packet data based upon the source port received and a destination port the data being sent. Next, sorting, the classified packet data into multiple queues in a buffer, and updating, a static component of one or more of the multiple queues upon the queue receiving the sorted classified data packet. Further, scheduling, using the scheduler based upon the destination port availability and a set of fairness factors including priority weights and positions, for selecting a dequeuing of data packets from a set of corresponding queues of the multiple queues, and then updating the static of the dequeued queue upon the data packet being outputted from the dequeued queue.
  • Packet Segmentation With Different Segment Sizes For A Switch Fabric

    view source
  • US Patent:
    20150372896, Dec 24, 2015
  • Filed:
    Sep 1, 2015
  • Appl. No.:
    14/842473
  • Inventors:
    - San Jose CA, US
    Brad DANOFSKY - Reno NV, US
    David HADDAD - San Jose CA, US
    Ann GUI - Cupertino CA, US
    Heeloo CHUNG - San Francisco CA, US
    Joanna LIN - San Jose CA, US
  • International Classification:
    H04L 12/755
    H04L 12/861
  • Abstract:
    An epoch-based network processor internally segments packets for processing and aggregation in epoch payloads. FIFO buffers interact with a memory management unit to efficiently manage the segmentation and aggregation process.
  • Fifo Buffer With Multiple Stream Packet Segmentation

    view source
  • US Patent:
    20140321281, Oct 30, 2014
  • Filed:
    Jul 8, 2014
  • Appl. No.:
    14/325872
  • Inventors:
    - Round Rock TX, US
    Brad DANOFSKY - Reno NV, US
    David HADDAD - San Jose CA, US
    Ann GUI - Cupertino CA, US
    Heeloo CHUNG - San Francisco CA, US
    Joanna LIN - San Jose CA, US
  • International Classification:
    H04L 12/805
  • US Classification:
    370235
  • Abstract:
    An epoch-based network processor internally segments packets for processing and aggregation in epoch payloads. FIFO buffers interact with a memory management unit to efficiently manage the segmentation and aggregation process.

Get Report for Heeloo L Chung from Burlingame, CA, age ~63
Control profile