Sciweavers

20 search results - page 4 / 4
» Dynamic Tree Bitmap for IP Lookup and Update
Sort
View
ICNP
2007
IEEE
13 years 11 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
ICCAD
2007
IEEE
109views Hardware» more  ICCAD 2007»
13 years 9 months ago
CacheCompress: a novel approach for test data compression with cache for IP embedded cores
Abstract-- In this paper, we propose a novel test data compression technique named CacheCompress, which combines selective encoding and dynamic dictionary based encoding. Depending...
Hao Fang, Chenguang Tong, Bo Yao, Xiaodi Song, Xu ...
NETWORKING
2008
13 years 6 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi
IJNSEC
2010
120views more  IJNSEC 2010»
13 years 3 days ago
Secure Group Key Management Scheme for Multicast Networks
This paper proposes a scheme to provide security to dynamic multicast VoIP systems efficiently. Security is usually provided by encrypting the media packets sent from a user to ot...
R. Srinivasan, V. Vaidehi, R. Rajaraman, S. Kanaga...
INFOCOM
2010
IEEE
13 years 3 months ago
Leaping Multiple Headers in a Single Bound: Wire-Speed Parsing Using the Kangaroo System
—More fundamental than IP lookups and packet classification in routers is the extraction of fields such as IP Dest and TCP Ports that determine packet forwarding. While parsing...
Christos Kozanitis, John Huber, Sushil Singh, Geor...