Global to push GA events into
skip to main content

Title: Efficient packet forwarding using cyber-security aware policies

For balancing load, a forwarder can selectively direct data from the forwarder to a processor according to a loading parameter. The selective direction includes forwarding the data to the processor for processing, transforming and/or forwarding the data to another node, and dropping the data. The forwarder can also adjust the loading parameter based on, at least in part, feedback received from the processor. One or more processing elements can store values associated with one or more flows into a structure without locking the structure. The stored values can be used to determine how to direct the flows, e.g., whether to process a flow or to drop it. The structure can be used within an information channel providing feedback to a processor.
Issue Date:
OSTI Identifier:
Patent Number(s):
Application Number:
Contract Number:
SC0006343; SC0004400
Resource Relation:
Patent File Date: 2015 Nov 12
Research Org:
Sponsoring Org:
Country of Publication:
United States

Works referenced in this record:

On the (Im)possibility of Obfuscating Programs
book, January 2001
  • Barak, Boaz; Goldreich, Oded; Impagliazzo, Rusell
  • Advances in Cryptology — CRYPTO 2001
  • DOI: 10.1007/3-540-44647-8_1

Putting Polyhedral Loop Transformations to Work
book, January 2004
  • Bastoul, Cédric; Cohen, Albert; Girbal, Sylvain
  • Languages and Compilers for Parallel Computing
  • p. 209-225
  • DOI: 10.1007/978-3-540-24644-2_14

Flow-insensitive interprocedural alias analysis in the presence of pointers
book, June 2005
  • Burke, Michael; Carini, Paul; Choi, Jong-Deok
  • Languages and Compilers for Parallel Computing, p. 234-250
  • DOI: 10.1007/BFb0025882

Parallel Sparse Supports for Array Intrinsic Functions of Fortran 90
journal, March 2001
  • Chang, Rong-Guey; Chuang, Tyng-Ruey; Lee, Jenq Kuen
  • The Journal of Supercomputing, Vol. 18, Issue 3, p. 305-339
  • DOI: 10.1023/A:1008113800183

Some efficient solutions to the affine scheduling problem. I. One-dimensional time
journal, October 1992
  • Feautrier, Paul
  • International Journal of Parallel Programming, Vol. 21, Issue 5, p. 313-347
  • DOI: 10.1007/BF01407835

Dataflow analysis of array and scalar references
journal, February 1991
  • Feautrier, Paul
  • International Journal of Parallel Programming, Vol. 20, Issue 1, p. 23-53
  • DOI: 10.1007/BF01407931

Compiler Transformation of Pointers to Explicit Array Accesses in DSP Applications
book, January 2001

Forward Communication Only Placements and Their Use for Parallel Program Construction
book, January 2005
  • Griebl, Martin; Feautrier, Paul; Größlinger, Armin
  • Languages and Compilers for Parallel Computing, p. 16-30
  • DOI: 10.1007/11596110_2

Space–time mapping and tiling: a helpful combination
journal, January 2004
  • Griebl, Martin; Faber, Peter; Lengauer, Christian
  • Concurrency and Computation: Practice and Experience, Vol. 16, Issue 23, p. 221-246
  • DOI: 10.1002/cpe.772

Verifying safety properties of a class of infinite-state distributed algorithms
book, January 1995

Precise Data Locality Optimization of Nested Loops
journal, January 2002
  • Loechner, Vincent; Meister, Benoit; Clauss, Philippe
  • The Journal of Supercomputing, Vol. 21, Issue 1, p. 37-76
  • DOI: 10.1023/A:1013535431127

Generation of Efficient Nested Loops from Polyhedra
journal, October 2000
  • Quillere, Fabien; Rajopadhye, Sanjay; Wilde, Doran
  • International Journal of Parallel Programming, Vol. 28, Issue 5, p. 469-498
  • DOI: 10.1023/A:1007554627716

The mapping of linear recurrence equations on regular arrays
journal, October 1989
  • Quinton, Patrice; van Dongen, Vincent
  • Journal of VLSI signal processing systems for signal, image and video technology, Vol. 1, Issue 2, p. 95-113
  • DOI: 10.1007/BF02477176

Adaptive array beamforming with fixed-point arithmetic matrix inversion using Givens rotations
conference, November 2001

Generation of high-performance protocol-aware analyzers with applications in intrusion detection systems
conference, April 2010

A Compiler Framework for Tiling Imperfectly-Nested Loops
book, January 2000
  • Song, Yonghong; Li, Zhiyuan; Goos, Gerhard
  • Languages and Compilers for Parallel Computing
  • DOI: 10.1007/3-540-44905-1_12

Early Control of Register Pressure for Software Pipelined Loops
book, January 2003

Polyhedral Code Generation in the Real World
book, January 2006
  • Vasilache, Nicolas; Bastoul, Cedric; Cohen, Albert
  • Compiler Construction, p. 185-201
  • DOI: 10.1007/11688839_16

An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages
book, January 2002