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:
- 1404917
- Patent Number(s):
- 9798588
- Application Number:
- 13/870,814
- 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:
- SC0004400; SC0006343
- Resource Type:
- Patent
- Resource Relation:
- Patent File Date: 2013 Apr 25
- 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. Wed .
"Efficient packet forwarding using cyber-security aware policies". United States. https://www.osti.gov/servlets/purl/1404917.
@article{osti_1404917,
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 = {10}
}
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.
Works referenced in this record:
A practical automatic polyhedral parallelizer and locality optimizer
conference, January 2008
- Bondhugula, Uday; Hartono, Albert; Ramanujam, J.
- Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation - PLDI '08
Scalable Tensor Decompositions for Multi-aspect Data Mining
conference, December 2008
- Kolda, Tamara G.; Sun, Jimeng
- 2008 Eighth IEEE International Conference on Data Mining (ICDM)
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
Sparsity in higher order methods for unconstrained optimization
journal, April 2012
- Gundersen, Geir; Steihaug, Trond
- Optimization Methods and Software, Vol. 27, Issue 2
Solution and Optimization of Systems of Pseudo-Boolean Constraints
journal, October 2007
- Aloul, Fadi A.; Ramani, Arathi; Sakallah, Karem A.
- IEEE Transactions on Computers, Vol. 56, Issue 10
Efficient representation scheme for multidimensional array operations
journal, March 2002
- Chun-Yuan Lin,
- IEEE Transactions on Computers, Vol. 51, Issue 3
Scanning polyhedra with DO loops
journal, July 1991
- Ancourt, Corinne; Irigoin, François
- ACM SIGPLAN Notices, Vol. 26, Issue 7
Tiling Imperfectly-nested Loop Nests
conference, January 2000
- Ahmed, N.; Mateev, N.; Pingali, K.
- ACM/IEEE SC 2000 Conference (SC'00)
Configurable string matching hardware for speeding up intrusion detection
journal, March 2005
- Aldwairi, Monther; Conte, Thomas; Franzon, Paul
- ACM SIGARCH Computer Architecture News, Vol. 33, Issue 1
Towards automatic generation of vulnerability-based signatures
conference, January 2006
- Brumley, D.; Newsome, J.; Song, D.
- 2006 IEEE Symposium on Security and Privacy (S&P'06)
Automatic memory layout transformations to optimize spatial locality in parameterized loop nests
journal, March 2000
- Clauss, Philippe; Meister, Benoît
- ACM SIGARCH Computer Architecture News, Vol. 28, Issue 1
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(
journal, November 2006
- Nieuwenhuis, Robert; Oliveras, Albert; Tinelli, Cesare
- Journal of the ACM, Vol. 53, Issue 6
An accurate cost model for guiding data locality transformations
journal, September 2005
- Vera, Xavier; Abella, Jaume; Llosa, Josep
- ACM Transactions on Programming Languages and Systems, Vol. 27, Issue 5
Efficient data compression methods for multidimensional sparse array operations based on the ekmr scheme
journal, December 2003
- Chun-Yuan Lin,
- IEEE Transactions on Computers, Vol. 52, Issue 12
Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
journal, January 2012
- Buluç, Aydin; Gilbert, John R.
- SIAM Journal on Scientific Computing, Vol. 34, Issue 4
Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
journal, September 1978
- Gustavson, Fred G.
- ACM Transactions on Mathematical Software, Vol. 4, Issue 3