• Publications
  • Influence
OpenFlow: enabling innovation in campus networks
This whitepaper proposes OpenFlow: a way for researchers to run experimental protocols in the networks they use every day. Expand
  • 7,538
  • 1088
  • PDF
Terabit burst switching
  • J. Turner
  • Computer Science
  • J. High Speed Networks
  • 11 March 1999
This paper presents an architecture for Burst Switching Systems designed to switch data among WDM links, treating each link as a shared resource rather than just a collection of independent channels. Expand
  • 948
  • 78
  • PDF
ClassBench: a packet classification benchmark
  • 206
  • 69
Overcoming the Internet impasse through virtualization
The Internet architecture has proven its worth by the vast array of applications it now supports and the wide variety of network technologies over which it currently runs. Expand
  • 967
  • 50
  • PDF
Scalable high speed IP routing lookups
This paper describes a new algorithm for best matching prefix using binary search on hash tables organized by prefix lengths for IPv4 and IPv6 routing lookup. Expand
  • 740
  • 47
  • PDF
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
In this paper, we introduce a new representation for regular expressions, called the Delayed Input DFA (D2FA), which substantially reduces space equirements as compared to a DFA. Expand
  • 307
  • 39
This review covers Verification, Validation, Confirmation and related subjects for computational fluid dynamics (CFD), including error taxonomies, error estimation and banding, convergence rates,Expand
  • 222
  • 38
  • PDF
Fast hash table lookup using extended bloom filter: an aid to network processing
We present a novel hash table data structure and lookup algorithm which improves the performance over a naive hash table by reducing the number of memory accesses needed for the most time-consuming lookups. Expand
  • 372
  • 36
  • PDF
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
In this paper, we argue that the traditional DFA based NIDS has three main limitations: first they fail to exploit the fact that normal data streams rarely match any virus signature; second, DFAs are extremely inefficient in following multiple partially matching signatures and explodes in size, and third, finite automaton are incapable of efficiently keeping track of counts. Expand
  • 192
  • 27
  • PDF
ClassBench: A Packet Classification Benchmark
We present ClassBench, a suite of tools for benchmarking packet classification algorithms and devices that produces synthetic filter sets that accurately model the characteristics of real filter sets. Expand
  • 270
  • 26
  • PDF