Kun Suk Kim

15 papers B 1C 2Journal 7Unranked 4
YearRankTypeTitle / Venue / Authors
2007 J jnl
Efficient Construction of Pipelined Multibit-Trie Router-Tables.
IEEE Trans. Computers
Kun Suk Kim, Sartaj Sahni
2005 J jnl
Prefix and Interval-Partitioned Dynamic IP Router-Tables.
IEEE Trans. Computers
Haibin Lu, Kun Suk Kim, Sartaj K. Sahni
2004 J jnl
An O(log n) Dynamic Router-Table Design.
IEEE Trans. Computers
Sartaj Sahni, Kun Suk Kim
2004 J jnl
Efficient Dynamic Lookup For Bursty Access Patterns.
Int. J. Found. Comput. Sci.
Sartaj Sahni, Kun Suk Kim
2004 — ch.
IP Router Tables.
Handbook of Data Structures and Applications
Sartaj Sahni, Kun Suk Kim, Haibin Lu
2004 B conf
Prefix- and interval-partitioned router-tables [IP routing].
GLOBECOM
Haibin Lu, Kun Suk Kim, Sartaj Sahni
2003 J jnl
Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching.
Int. J. Found. Comput. Sci.
Sartaj Sahni, Kun Suk Kim, Haibin Lu
2003 J jnl
Efficient construction of multibit tries for IP lookup.
IEEE/ACM Trans. Netw.
Sartaj Sahni, Kun Suk Kim
2003 C conf
IP Lookup By Binary Search On Prefix Length.
ISCC
Kun Suk Kim, Sartaj Sahni
2002 — conf
Data Structures For One-Dimensional Packet Classification Using Most-Specific-Rule Matching.
ISPAN
Sartaj Sahni, Kun Suk Kim, Haibin Lu
2002 — conf
Efficient Construction of Variable-Stride Multibit Tries for IP Lookup.
SAINT
Sartaj Sahni, Kun Suk Kim
2002 J jnl
IP Lookup by Binary Search on Prefix Length.
J. Interconnect. Networks
Kun Suk Kim, Sartaj Sahni
2002 C conf
O(log n) dynamic packet routing.
ISCC
Sartaj Sahni, Kun Suk Kim
2001 — conf
Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup.
FTDCS
Sartaj Sahni, Kun Suk Kim
1997 — conf
Performance Evaluation of Communications Module in PSTN Access Subsystem for Interworking with PSDN.
ICC (2)
Kun Suk Kim, Tae Man Han, Pyung Dong Cho