Sciweavers

6 search results - page 1 / 2
» Fast Packet Classification Using Bit Compression with Fast B...
Sort
View
58
Voted
JISE
2008
85views more  JISE 2008»
14 years 9 months ago
Fast Packet Classification Using Bit Compression with Fast Boolean Expansion
Chien Chen, Chia-Jen Hsu, Chi-Chia Huang
GLOBECOM
2006
IEEE
15 years 3 months ago
Fast Packet Classification using Group Bit Vector
—Packet classification is important in fulfilling the requirements of new services such as policy-based routing in next generation networks. In this paper, we propose a novel bit...
Tong Liu, Huawei Li, Xiaowei Li, Yinhe Han
INFOCOM
2012
IEEE
12 years 12 months ago
Block permutations in Boolean Space to minimize TCAM for packet classification
Packet classification is one of the major challenges in designing high-speed routers and firewalls as it involves sophisticated multi-dimensional searching. Ternary Content Address...
Rihua Wei, Yang Xu, H. Jonathan Chao
MM
1995
ACM
100views Multimedia» more  MM 1995»
15 years 28 days ago
Fast Lossy Internet Image Transmission
Images are usually transmitted across the Internet using a lossless protocol such as TCP/IP. Lossless protocols require retransmission of lost packets, which substantially increas...
John M. Danskin, Geoffrey M. Davis, Xiyong Song
SAC
2002
ACM
14 years 9 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...