J. Turner

Publications
Influence

OpenFlow: enabling innovation in campus networks

N. McKeown, T. Anderson, +5 authors J. Turner
Computer Science
CCRV
31 March 2008

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

ClassBench: a packet classification benchmark

D. E. Taylor, J. Turner
Computer Science
IEEE/ACM Trans. Netw.
2007

Overcoming the Internet impasse through virtualization

T. Anderson, L. Peterson, S. Shenker, J. Turner
Computer Science
Computer
1 April 2005

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

Scalable high speed IP routing lookups

M. Waldvogel, G. Varghese, J. Turner, B. Plattner
Computer Science
SIGCOMM '97
1 October 1997

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

Algorithms to accelerate multiple regular expressions matching for deep packet inspection

S. Sushanth Kumar, Sarang Dharmapurikar, F. Yu, P. Crowley, J. Turner
Computer Science
SIGCOMM
11 August 2006

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

QUANTIFICATION OF UNCERTAINTY IN COMPUTATIONAL FLUID DYNAMICS

J. Turner, M. Worster
2006

This review covers Verification, Validation, Confirmation and related subjects for computational fluid dynamics (CFD), including error taxonomies, error estimation and banding, convergence rates,… Expand

Fast hash table lookup using extended bloom filter: an aid to network processing

Haoyu Song, Sarang Dharmapurikar, J. Turner, J. Lockwood
Computer Science
SIGCOMM '05
22 August 2005

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

Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia

S. Sushanth Kumar, B. Chandrasekaran, J. Turner, G. Varghese
Computer Science
ANCS '07
3 December 2007

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

ClassBench: A Packet Classification Benchmark

D. E. Taylor, J. Turner
Computer Science
IEEE/ACM Transactions on Networking
1 June 2007

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

Recommended Authors