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.
Inventors:
Issue Date:
OSTI Identifier:
1349673
Assignee:
SIGNIFICS AND ELEMENTS, LLC CHO
Patent Number(s):
9,613,163
Application Number:
14/939,881
Contract Number:
SC0006343; SC0004400
Resource Relation:
Patent File Date: 2015 Nov 12
Research Org:
SIGNIFICS AND ELEMENTS, LLC, New York, NY (United States)
Sponsoring Org:
USDOE
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING

Other works cited in this record:

Searching for patterns in encrypted data
patent, August 1995

Latency tolerant risc-based multiple processor with event driven locality managers resulting from variable tagging
patent, August 1995

Locality manager having memory and independent code, bus interface logic, and synchronization components for a processing element for intercommunication in a latency tolerant multiple processor
patent, March 1997

Background memory allocation for multi-dimensional signal processing
patent, April 1998

Real-time document collection search engine with phrase indexing
patent, July 1999

Method of, system for, and computer program product for minimizing loop execution time by optimizing block/tile sizes
patent, September 1999

Method and system for reordering the instructions of a computer program to optimize its execution
patent, December 1999

Non-literal textual search using fuzzy finite-state linear non-deterministic automata
patent, January 2000

Method and apparatus for improving performance of a program using a loop interchange, loop distribution, loop interchange sequence
patent, March 2000

System and method for identifying matches of query patterns to document text in a document textbase
patent, October 2000

Dynamic signature inspection-based network intrusion detection
patent, August 2001

Whole program path profiling
patent, December 2001

Information management and retrieval
patent, January 2002

Loop allocation for optimizing compilers
patent, November 2003

System and method for regular expression matching using index
patent, June 2004

Loop optimization with mapping code on an architecture
patent, August 2004

Method for execution of query to search strings of characters that match pattern with a target string utilizing bit vector
patent, August 2004

Intrusion detection signature analysis using regular expressions and logical operators
patent, September 2004

Binary state machine system and method for REGEX processing of a data stream in an intrusion detection system
patent, April 2005

Search apparatus and method using order pattern including repeating pattern
patent, June 2005

Full regular expression search of network traffic
patent, October 2005

Method and system for memory management optimization
patent, October 2005

Method and apparatus for using ternary and binary content-addressable memory stages to classify packets
patent, February 2006

Programmable packet processor with flow resolution logic
patent, July 2006

System and method for creating systolic solvers
patent, August 2006

System and method for optimizing operations via dataflow analysis
patent, February 2007

System and method for performing regular expression matching with high parallelism
patent, May 2007

Simultaneously searching for a plurality of patterns definable by complex expressions, and efficiently generating data for such searching
patent, August 2007

Distribution of flows in a flow-based multi-processor system
patent, May 2008

Network surveillance using long-term and short-term statistical profiles to determine suspicious network activity
patent, September 2009

Arrangement in a network for passing control of distributed data between network nodes for optimized client access based on locality
patent, December 2009

Generating efficient parallel code using partitioning, coalescing, and degenerative loop and guard removal
patent, July 2010

Stateful packet content matching mechanisms
patent, August 2010

Systems and methods for processing data flows
patent, August 2011

Selective code generation optimization for an advanced dual-representation polyhedral loop transformation framework
patent, December 2011

Parallel programming computing system to dynamically allocate program portions
patent, January 2012

Execution of hardware description language (HDL) programs
patent, July 2012

Parallel processing of distributed arrays and optimum data distribution
patent, August 2012

Media for performing parallel processing of distributed arrays
patent, August 2012

Collecting and analyzing graphical data flow web application results from multiple users
patent, November 2012

Methods and apparatus for joint parallelism and locality optimization in source code compilation
patent, October 2013

Systems and methods for detecting malicious network content
patent, September 2014

System and method for controlling updates of a data structure
patent, November 2014

System, methods and apparatus for program optimization for multi-threaded processor architectures
patent, January 2015

Fast and robust classification algorithm for vein recognition using infrared images
patent, March 2015

System, apparatus and methods to implement high-speed network analyzers
patent, November 2015

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

Similar records in DOepatents and OSTI.GOV collections: