Learn More
The continual growth of Internet traffic necessitates a high-capacity transmission platform and also highlights the importance of a multi-granularity transport network due to the flexible bitrates of Internet traffic. To meet these challenges, a spectrum-flexible optical network based on orthogonal frequency-division multiplexing (OFDM) transmission(More)
—Accelerating multi-pattern matching is a critical issue in building high-performance deep packet inspection systems. Achieving high-throughputs while reducing both memory-usage and memory-bandwidth needs is inherently difficult. In this paper, we propose a pattern (string) matching algorithm that achieves high throughput while limiting both memory-usage(More)
We propose a novel approach of traffic grooming in Spectrum-Elastic Optical Path Networks. Higher spectrum efficiency is achieved by our approach comparing with non-traffic-grooming scenario. 1. Introduction As the traffic load of the optical networks grows rapidly annually, how to properly utilize the bandwidth of optical networks becomes one major(More)
Error estimating coding (EEC) has recently been established as an important tool to estimate bit error rates in the transmission of packets over wireless links, with a number of potential applications in wireless networks. In this paper, we present an in-depth study of error estimating codes through the lens of Fisher information analysis and find that the(More)
In this paper, we present an exact active statistics counter architecture called BRICK (Bucketized Rank Indexed Counters) that can efficiently store per-flow variable-width statistics counters entirely in SRAM while supporting both fast updates and lookups (e.g., 40 Gb/s line rates). BRICK exploits statistical multiplexing by randomly bundling counters into(More)
Bloom filter and its variants have found widespread use in many networking applications. For these applications, minimizing storage cost is paramount as these filters often need to be implemented using scarce and costly (on-chip) SRAM. Besides supporting membership queries, Bloom filters have been generalized to support deletions and the encoding of(More)
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data structures for this problem, and show that the tug-of-war sketch gives an asymptotically optimal solution. The optimality of our algorithms are proved using communication complexity(More)