skip to main content
DOE Patents title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Efficient packet forwarding using cyber-security aware policies

Abstract

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:
Research Org.:
Significs and Elements, LLC, New York, NY (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1349673
Patent Number(s):
9613163
Application Number:
14/939,881
Assignee:
Significs and Elements, LLC (New York, NY)
Patent Classifications (CPCs):
H - ELECTRICITY H04 - ELECTRIC COMMUNICATION TECHNIQUE H04L - TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
DOE Contract Number:  
SC0006343; SC0004400
Resource Type:
Patent
Resource Relation:
Patent File Date: 2015 Nov 12
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING

Citation Formats

Ros-Giralt, Jordi. Efficient packet forwarding using cyber-security aware policies. United States: N. p., 2017. Web.
Ros-Giralt, Jordi. Efficient packet forwarding using cyber-security aware policies. United States.
Ros-Giralt, Jordi. Tue . "Efficient packet forwarding using cyber-security aware policies". United States. https://www.osti.gov/servlets/purl/1349673.
@article{osti_1349673,
title = {Efficient packet forwarding using cyber-security aware policies},
author = {Ros-Giralt, Jordi},
abstractNote = {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.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2017},
month = {4}
}

Patent:

Save / Share:

Works referenced in this record:

A Compiler Framework for Tiling Imperfectly-Nested Loops
book, January 2000


Normalised Givens rotations for recursive least squares processing
conference, January 1995


Flow-insensitive interprocedural alias analysis in the presence of pointers
book, June 2005


Array-data flow analysis and its use in array privatization
conference, January 1993

  • Maydan, Dror E.; Amarasinghe, Saman P.; Lam, Monica S.
  • Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93
  • https://doi.org/10.1145/158511.158515

Maximizing parallelism and minimizing synchronization with affine transforms
conference, January 1997


Polyhedral Code Generation in the Real World
book, January 2006


Enabling Loop Fusion and Tiling for Cache Performance by Fixing Fusion-Preventing Data Dependences
conference, January 2005


Fuzzy Array Dataflow Analysis
journal, February 1997


Optimal weighted loop fusion for parallel programs
conference, January 1997


Register tiling in nonrectangular iteration spaces
journal, July 2002


The Z-polyhedral model
conference, January 2007


Conversion of control dependence to data dependence
conference, January 1983

  • Allen, J. R.; Kennedy, Ken; Porterfield, Carrie
  • Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '83
  • https://doi.org/10.1145/567067.567085

Sparsity in higher order methods for unconstrained optimization
journal, April 2012


Manufacturing cheap, resilient, and stealthy opaque constructs
conference, January 1998

  • Collberg, Christian; Thomborson, Clark; Low, Douglas
  • Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98
  • https://doi.org/10.1145/268946.268962

Putting Polyhedral Loop Transformations to Work
book, January 2004


Scanning polyhedra with DO loops
journal, July 1991


The program dependence graph and its use in optimization
journal, July 1987


Automatic mapping of nested loops to FPGAS
conference, January 2007


Some efficient solutions to the affine scheduling problem. I. One-dimensional time
journal, October 1992


Parallel Sparse Supports for Array Intrinsic Functions of Fortran 90
journal, March 2001


Tiling Imperfectly-nested Loop Nests
conference, January 2000


A Library for Doing Polyhedral Operations
journal, December 2000


An experimental evaluation of tiling and shackling for memory hierarchy management
conference, January 1999


Towards automatic generation of vulnerability-based signatures
conference, January 2006


Distributed Microarchitectural Protocols in the TRIPS Prototype Processor
conference, December 2006

  • Sankaralingam, Karthikeyan; Nagarajan, Ramadass; McDonald, Robert
  • 2006 39th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'06)
  • https://doi.org/10.1109/MICRO.2006.19

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


A unified approach to global program optimization
conference, January 1973


Efficiently computing static single assignment form and the control dependence graph
journal, October 1991


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


Generation of Efficient Nested Loops from Polyhedra
journal, October 2000


Dataflow analysis of array and scalar references
journal, February 1991


Synthesizing transformations for locality enhancement of imperfectly-nested loop nests
conference, January 2014


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
  • https://doi.org/10.1007/BF02477176

Precise Data Locality Optimization of Nested Loops
journal, January 2002


Value dependence graphs: representation without taxation
conference, January 1994

  • Weise, Daniel; Crew, Roger F.; Ernst, Michael
  • Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94
  • https://doi.org/10.1145/174675.177907

Scalable Tensor Decompositions for Multi-aspect Data Mining
conference, December 2008


Operator strength reduction
journal, September 2001


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
  • https://doi.org/10.1002/cpe.772

Code generation for multiple mappings
conference, January 1994


Constant propagation with conditional branches
journal, April 1991


Solution and Optimization of Systems of Pseudo-Boolean Constraints
journal, October 2007


Blocking and array contraction across arbitrarily nested loops using affine partitioning
journal, July 2001


Efficient representation scheme for multidimensional array operations
journal, March 2002


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


Symbolic array dataflow analysis for array privatization and program parallelization
conference, January 1995


On the (Im)possibility of Obfuscating Programs
book, January 2001


Forward Communication Only Placements and Their Use for Parallel Program Construction
book, January 2005


Configurable string matching hardware for speeding up intrusion detection
journal, March 2005


The Omega test: a fast and practical integer programming algorithm for dependence analysis
conference, January 1991


A data locality optimizing algorithm
journal, June 1991


Scaling to the end of silicon with EDGE architectures
journal, July 2004


Automatic memory layout transformations to optimize spatial locality in parameterized loop nests
journal, March 2000


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


Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
journal, January 2012


Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
journal, September 1978