Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Heeyeol Yu"'
Autor:
Rabi N. Mahapatra, Heeyeol Yu
Publikováno v:
IEEE Transactions on Computers. 60:1182-1193
Packet processing is a critical operation in a high-speed router, and in order for this router to achieve memory efficient and fast O(1) lookup operations, Bloom filters (BFs) have been widely used as a packet classifier to reduce expensive hash tabl
Publikováno v:
Computer Communications. 26:1764-1774
In this paper, we present an 'emulation environment' for the design and planning of QoS-enabled IP networks. Specifically, QoS support for real-time traffic in future IP networks require 'fault tolerance' for mission-critical applications such as tel
Publikováno v:
ANCS
TCP/IP, the most commonly used network protocol, consumes a significant portion of time in Internet servers. While a wide spectrum of studies has been done to reduce its processing overhead such as TOE and Direct Cache Access, most of them did studie
Publikováno v:
DAC
IP lookup is in the critical data path in a high speed router. In this paper, we propose a new on-chip IP cache architecture for a high performance IP lookup. We design the IP cache along two important axes: cache indexing and cache replacement polic
Autor:
null Heeyeol Yu
Publikováno v:
2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010).
Publikováno v:
ICNP
Several challenges in the IP lookup architecture must be addressed for a high-speed forwarding in a large scale routing table: power, memory, and lookup complexity. Hash-based architectures have lookup schemes that are recognized for being both power
Autor:
Rabi N. Mahapatra, Heeyeol Yu
Publikováno v:
INFOCOM
Hash tables (HTs) are poorly designed for multiple off-chip memory accesses during packet classification and critically affect throughput in high-speed routers. Therefore, an HT with fast on-chip memory and high-capacity off-chip memory for predictab
Autor:
Rabi N. Mahapatra, Heeyeol Yu
Publikováno v:
IPDPS
Hash tables (HTs) are poorly designed for multiple memory accesses during IP lookup and this design flow critically affects their throughput in high-speed routers. Thus, a high capacity HT with a predictable lookup throughput is desirable. A recently
Autor:
Rabi N. Mahapatra, Heeyeol Yu
Publikováno v:
GLOBECOM
Packet classification is a critical data path in a highspeed router. Due to memory efficiency and fast lookup, Bloom filters (BFs) have been widely used for packet classification in a high-speed router. However, in a parallel packet classifier (PPC)
Publikováno v:
GLOBECOM
Along with energy conservation, it has been a critical issue to maintain a desired degree of coverage in wireless sensor networks (WSNs), especially in a mobile environment. By enhancing a variant of random waypoint (RWP) model, we propose mobility r