System for intrusion detection

Information security – Monitoring or scanning of software or data including attack... – Intrusion detection

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C726S022000, C726S004000

Reexamination Certificate

active

07409716

ABSTRACT:
A system a wireless ad hoc network. The system includes a plurality of nodes and a plurality of protocols for governing transmission of data between the plurality of nodes. The operation of the protocols is quantified by a complexity metric for determining whether an external source has altered the operation of the system.

REFERENCES:
patent: 6046988 (2000-04-01), Schenkel et al.
patent: 6088452 (2000-07-01), Johnson et al.
patent: 6301660 (2001-10-01), Benson
patent: 6321338 (2001-11-01), Porras et al.
patent: 6324654 (2001-11-01), Wahl et al.
patent: 6411997 (2002-06-01), Dawes et al.
patent: 6446200 (2002-09-01), Ball et al.
patent: 6484203 (2002-11-01), Porras et al.
patent: 2002/0002686 (2002-01-01), Vange et al.
patent: 2002/0032880 (2002-03-01), Poletto et al.
patent: 2002/0035628 (2002-03-01), Gil et al.
patent: 2002/0052942 (2002-05-01), Swildens et al.
patent: 2002/0095492 (2002-07-01), Kaashoek et al.
patent: 2002/0099816 (2002-07-01), Quarterman et al.
patent: 2002/0103916 (2002-08-01), Chen et al.
patent: 2002/0120727 (2002-08-01), Curley et al.
patent: 2002/0138762 (2002-09-01), Horne
patent: 2002/0161755 (2002-10-01), Moriarty
patent: 2003/0009699 (2003-01-01), Gupta et al.
patent: 2003/0051032 (2003-03-01), Schenkel et al.
US 5,748,741, 05/1998, Johnson et al. (withdrawn)
Evans, S., Bush, S.F., and Hershey, J., Information Assurance through Kolmogorov Complexity, DARPA Information Survivability Conference & Exposition II, 2001, Proceedings vol. 2, pp. 322-331. 12.
Quantum Kolmogorov complexity based on classical descriptions Vitanyi, P.M.B.; Information Theory, IEEE Transactions on vol. 47, Issue 6, Sep. 2001 pp. 2464-2479.
Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity Muller, M.; Information Theroy, IEEE Transactions on vol. 54, Issue 2, Feb. 2008 pp. 763-780.
Computational power of neural networks: a characterization in terms of Kolmogorov complexity Balcazar, J.L.; Gavalda, R.; Siegelmann, H.T.; Information Theory, IEEE Transactions on vol. 43, Issue 4, Jul. 1997 pp. 1175-1183.
“Computational Power of Neural Networks: A Characterization in Terms of Kolmogorov Complexity”, J. L. Balcazar, R. Gavalda & H. T. Siegelmann, 1997 IEEE.
“A Complexity Theoretic Approach to Randomness”, M. Sipser, M.I.T., 1983 ACM.
“Approximating the Smallest Grammar: Kolmogorov Complexity in Natural Models”, M. Charikar, E. Lehman, D. Liu, R. Panigraphy, M. Prabhakaran, A. Rasala, A. Sahai & A. Shelat, 2002 ACM.
“Kolmogorov Learning for Feedforward Networks”, R. Neruda, A. Stedry, J. Drksova, Institute of Computer Science of the Czech Republic, 2001 IEEE.
“Statistical Traffic Modeling for Network Intrusion Detection”, J.B. D. Cabrera, B. Ravichandran & R. K. Mehra, Scientific Systems Company, 2000 IEEE.
“Kolmogorov Networks and Process Characteristic Input-Output Modes Decomposition”, G. Dimirovski & Y Jing, 2002 IEEE.
Active Virtual Network Management Prediction: Complexity as a Framework for Prediction, Optimization and Assurance, S. Bush, General Electric Corporate Research & Development, 2002 IEEE.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

System for intrusion detection does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System for intrusion detection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System for intrusion detection will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4010180

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.