Sciweavers

11 search results - page 1 / 3
» HEXA: Compact Data Structures for Faster Packet Processing
Sort
View
ICNP
2007
IEEE
14 years 1 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...
INFOCOM
2012
IEEE
11 years 10 months ago
Origin-destination flow measurement in high-speed networks
—An origin-destination (OD) flow between two routers is the set of packets that pass both routers in a network. Measuring the sizes of OD flows is important to many network man...
Tao Li, Shigang Chen, Yan Qiao
ICNP
2009
IEEE
14 years 2 months ago
Scalable IP Lookups using Shape Graphs
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
DASFAA
2008
IEEE
190views Database» more  DASFAA 2008»
14 years 2 months ago
Analysis of Time Series Using Compact Model-Based Descriptions
Abstract. Recently, we have proposed a novel method for the compression of time series based on mathematical models that explore dependencies between different time series. This r...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
EUROGRAPHICS
2010
Eurographics
14 years 3 months ago
Fast Ray Sorting and Breadth-First Packet Traversal for GPU Ray Tracing
We present a novel approach to ray tracing execution on commodity graphics hardware using CUDA. We decompose a standard ray tracing algorithm into several data-parallel stages tha...
Kirill Garanzha and Charles Loop