Imperishable Networks: Complexity Theory and Communication Networking-Bridging the Gap Between Algorithmic Information Theory and Communication Networking
Explore this paper's citation graph
Summary
The most significant result from this project has been experimental validation that complexity plays a critical role in information assurance and can be broadly applied as the basis for security analysis and fault tolerant network design.
- Type
- article
- Published
- 2003-04-01
- Cited by
- 0
- References
- 41
- OpenAlex
- https://openalex.org/W226945275
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:60230218
Keywords
Computer science, Network packet, Information theory, Bridging (networking), Theoretical computer science
References
- Evolution of Emergent Computation
- Discovering simple DNA sequences by compression.
- Complexity, Entropy and the Physics of Information
- Information Theory: 1948-1998 - Guest Editorial
- Active Networks and Active Network Management
- MULTOPS: A Data-Structure for Bandwidth Attack Detection
- Introduction to the theory of automata
- The Universal Turing Machine: A Half-Century Survey
- The Design and Analysis of Computer Algorithms
- The Limits of Mathematics
- An Architecture for Describing SNMP Management Frameworks
- Introduction to Version 3 of the Internet-standard Network Management Framework
- On the composition of security properties
- Agent Extensibility (AgentX) Protocol Version 1
- Heat capacity in bits
- A method for obtaining digital signatures and public-key cryptosystems
- Minimum Message Length and Kolmogorov Complexity
- The calculi of emergence: computation, dynamics and induction
- Detecting Distributed Denial-of-Service Attacks Using Kolmogorov Complexity Metrics
- Genetic algorithms: a survey
Cited by
No citing papers recorded for this paper.
Related papers
- Measuring the Complexity of C~3I Network
- COMPLEXITY AND INFORMATION TECHNOLOGY IN DYNAMIC SYSTEMS
- Fundamentals of Large Sensor Networks: Connectivity, Capacity, Clocks and Computation
- Design and analysis of network codes
- Fully-decentralized computation of importance measures in dynamic evolving networks