|
The objective of the Imperishable Networks project is to develop the
fundamental science of Complexity Theory to design communication networks
capable of self-healing. Imperishable Networks degrade gracefully, adapt to
attack, and reconstitute automatically -- growing stronger with each fault.
|
|
|
|
Approach
The approach for building Imperishable Networks will be enabled by building
upon advances in complexity theory and Active Networks. A brief overview of
the approach can be found in Active
Network Management and Kolmogorov Complexity.
Features
Features of Imperishable Networks include the following:
- Complexity-based
representation of network state
- Faults and solutions
are viewed in a unified, integrated manner.
- Solution and repair
entities are optimally allocated.
- Complexity-based
vulnerability view
- Attack/fault is
based on inherent characteristics of the data itself.
- It is less brittle
than current techniques for information assurance.
- Self-prediction and
self-composition
- Network
reconstitution is based on complexity.
- Optimal mechanism
for reconstitution.
Advantages/impact
Advantages of Imperishable Networks include the following:
- Enhanced security that
evolves to thwart attacks
- Complexity managed to
benefit the system
- Better integration of
computation and communication with a system
- Improved predictive
capabilities
- Self-management
and reconstitution
|
|
|
|
|
Publications
Publications related to Imperishable Networks include the following:
- Extended
Abstract: Complexity and Vulnerability Analysis, Stephen F.
Bush, Complexity
and Inference, June 2-5, 2003, DIMACS Center, Rutgers University,
Piscataway, NJ, Organizers: Mark Hansen, Paul Vitányi, Bin Yu.
- Genetically Induced
Communication Network Fault Tolerance (Presentation) Stephen F. Bush and
Amit B. Kulkarni, Invited Paper: SFI Workshop: Resilient and Adaptive Defense
of Computing Networks 2002, Santa Fe Institute, Santa Fe, NM, Oct 30-31,
2002.
- FTN PI Briefing Newport, RI,
July 23-26, 2002.
- Active Virtual Network Management
Prediction: Complexity as a Framework for Prediction, Optimization, and
Assurance by Stephen F. Bush, Proceedings of the 2002 DARPA
Active Networks Conference and Exposition (DANCE 2002), IEEE Computer
Society Press, pp. 534-553, ISBN 0-7695-1564-9, May 29-30, 2002, San
Francisco, California, USA.
- Complexity
Theory and Its Applications to Systems, Networks and Information
Assurance Conference: Session Closed. See conference
proceedings for relevant papers.
- Network Security Through Conservation of
Complexity by Scott Evans and Bruce Barnett, MILCOM 2002, The
Disneyland Resort, Anaheim, CA, USA, October 7-10, 2002.
- Detecting Distributed Denial-of-Service
Attacks using Kolmogorov Complexity Metrics by Amit B. Kulkarni,
Stephen F. Bush, and Scott C. Evans, GE CRD Technical Report 2001CRD176,
December 2001.
- Symbol Compression Ratio for String Compression
and Estimation of Kolmogorov Complexity by S.C. Evans and
Stephen F. Bush, 2001CRD159, November 2001.
- Complexity-Based Information Assurance by
Stephen F. Bush and S.C. Evans 2001CRD084, October 2001.
- Active
Network Management and Kolmogorov Complexity by Amit B. Kulkarni
and Stephen F. Bush, OpenArch 2001,
Anchorage Alaska, April 27-28, 2001
- Active
Network Management, Kolmogorov Complexity, and Streptichrons by
Amit B. Kulkarni and Stephen F. Bush,
GE CRD Technical Report 2000CRD107, December 2000
Milestones
Three milestones define the Imperishable Networks project:
- Self-composition for
active network services and active network fault mitigation
modules
- Detection of
fault/attack using complexity-based analyses
- Evaluation of
fault/attack using complexity-based analyses
|
|
|
Go to other graphics: