Paul Seungkyu Min

US Patent:

6614789, Sep 2, 2003

Filed:

Dec 29, 1999

Appl. No.:

09/474452

Inventors:

Nasser Yazdani - Creve Coeur MO 63146
Paul Seungkyu Min - Clayton MO 63105

International Classification:

H04L 1228

US Classification:

370392, 370401

Abstract:

A method and apparatus is provided for comparing and sorting data strings of different lengths, in a given character set, and modifying the data such that queries can be run using different search trees. Three different search trees are provided, including: a binary prefix tree and two m_way tree structures, a static m_way prefix tree and a dynamic m_way prefix tree. The data strings may be prefixes of addresses in TCP/IP protocols and searching may be performed using a host address of a computer network. The method further provides for transmitting packet information associated with the network address. Additionally, switching packets in layer and of the TCP/IP protocol and sending the packets to designated ports of a device is provided. The method may also provide differentiated service or data protection, such as a firewall, based on packet classification information.

US Patent:

6859455, Feb 22, 2005

Filed:

Nov 10, 2000

Appl. No.:

09/710193

Inventors:

Nasser Yazdani - Creve Coeur MO, US
Paul Seungkyu Min - Clayton MO, US

International Classification:

H04L012/28

US Classification:

370392, 370401

Abstract:

A method and apparatus are provided for building a searchable multi-dimensional index tree that indexes a plurality of data objects. In one aspect of the invention, the index tree divides dataspace into three subspaces and indexes the data objects using a single dimension. If too many data objects map to the same point in that dimension, the dimension is switched to a new dimension of the data object and the data object is indexed using the new dimension. A split node having a split value is used to keep track of the indexing. In another aspect of the invention, the index tree divides dataspace into two subspaces, and equal bits are used in the split nodes to track the content of the data objects in the subspaces. If too many data objects sharing the same key within the same dimension map to a single point, then the dimension is switched to a new dimension and the data objects are indexed using the new dimension. Also disclosed is the multi-dimensional index tree itself as well as a router that uses the multi-dimensional index tree of the present invention to provide packet classification functions.

US Patent:

7106738, Sep 12, 2006

Filed:

Apr 6, 2001

Appl. No.:

09/828703

Inventors:

Hossein Saidi - Lake Oswego OR, US
Chunhua Hu - St. Louis MO, US
Peter Yifey Yan - St. Louis MO, US
Paul Seungkyu Min - Clayton MO, US

Assignee:

Erlang Technologies, Inc. - Webster Groves MO

International Classification:

H04L 12/28
H04L 12/56

US Classification:

370392, 37039571

Abstract:

Disclosed herein is a system architecture capable of processing fixed length and/or variable length data packets. Under the method of the invention, incoming data packets are queued together according to their corresponding switch processing parameters (SPPs), and then the commonly-queued data packets are processed through a switch fabric as a single unit. In one aspect of the invention, the commonly-queued data packets are processed by the switch fabric as a single train packet. In another aspect of the invention, the commonly-queued data packets are sliced into a set of subtrain packets. A switch fabric then processes the set of subtrain packets in parallel using a plurality of switch planes. Both aspects of the invention can be implemented with a plurality of packet formatters and deformatters linked to a switch fabric in various configurations, including multi-path and hierarchical switching systems. a multichannel switching system.

US Patent:

7110411, Sep 19, 2006

Filed:

Mar 25, 2002

Appl. No.:

10/105515

Inventors:

Hossein Saidi - Maryland Heights MO, US
Chunhua Hu - St. Louis MO, US
Peter Yifey Yan - St. Louis MO, US
Paul Seungkyu Min - Clayton MO, US

Assignee:

Erlang Technology, Inc. - Webster Groves MO

International Classification:

H04L 12/56

US Classification:

3703954, 370412

Abstract:

A method and apparatus is provided for scheduling access to a common resource for a plurality of objects queued in a plurality of connection queues. Tokens associated with the connection queues are stored in scheduling queues. Each scheduling queue has a scheduling weight assigned thereto. Each connection queue has a connection weight value assigned thereto. A serving value is used to determine which scheduling queue to select. When a scheduling queue is selected, an object stored in a connection queue having an associated token stored in the selected scheduling queue is provided to the common resource. Tokens are moved among the scheduling queues as a function of the connection weight values, scheduling weights, and serving value. The objects queued in the connection queues may be fixed length cells or variable length packets. When the objects are variable length packets, a residual weight value is also maintained for each connection queue, the residual weight values being useful to prevent the connection queues from receiving an undue amount of service relative to their connection weights during each serving cycle.

US Patent:

20200044977, Feb 6, 2020

Filed:

Mar 18, 2019

Appl. No.:

16/356886

Inventors:

- Wildwood MO, US
Paul Seungkyu Min - Clayton MO, US

International Classification:

H04L 12/851
G06K 9/62
H04L 9/06

Abstract:

A network device includes a substring indicator memory and a signature search module for detecting a signature pattern within a stream of network traffic. The signature search module is configured to receive the stream of network traffic, identify a first subject substring from the stream of network traffic, generate a first substring indicator for the first subject substring using a first bitmask on the first subject substring, the first bitmask identifying a plurality of masked bits of the first subject substring, identify a first counter using the first substring indicator as an address into the substring indicator memory, and generate an indication that the signature pattern may be present in the stream of network traffic based on a value of the first counter.