Figure 6 - uploaded by Stephen Bush
Content may be subject to copyright.
Source publication
Page Title Complexity-Based Information Assurance Author(s) S.F. Bush Phone (518)387-6827 S.C. Evans 8*833-6827 Component Electronic Systems Laboratory Report Number 2001CRD084 Date October 2001 Number of Page 18 Class 1 Key Words Kolmogorov Complexity, Information Assurance, Network Security, Network Management, Information Theory, Evolution of Co...
Contexts in source publication
Context 1
... system used for experimental study of complexity should mirror a large scale, highly dynamic, yet easily controlled environment that is representative of actual information exchange and evolution in a variety of real world information systems. The approach taken in this effort to understand the evolution of complexity is illustrated in Figure 6. A Swarm (http://www.swarm.org) ...
Context 2
... Swarm emulation has been programmed with three types of entities: Turing Machines, programs, and data bit-strings. Multiple entities of each type exist and are represented in Figure 6. The program is represented by a set of states connected by transitions, the bit-string data by binary digits within a rectangular array, and the chip labeled "CPU" represents the Turing Machine. ...
Citations
... The compressibility of a string can be quantitatively linked to complexity. Bush and Evans used Inverse Compression Ratios (ICR) as estimates of Kolmogorov's Complexity, considering them to be apparent or approximate complexity, recognizing error is implicit in complexity determination [15]. Random strings have higher complexity approximation as compared to a non-random string on the order of their length, as patterns cannot be discerned to reduce the size of a program generating such a string [12]. ...
... In the book An Introduction to Kolmogorov Complexity and its Applications, Li and Vitányi stated that Shannon's Information Theory focuses on how to express limits of processing such as compressing data or reliably storing or transmitting data [6]. Bush and Evans recognized the need to remove redundant information to get to the smallest representation of an entity and introduced the concept of developing a Kolmogorov Complexity Map of a system [15]. Essentially, the input stream was based on the complexity of bit streams. ...
... However, in spite of the problem difficulty, measurement systems can greatly help. As stated by Bush et al. [5] the better one understands a phenomenon, the more concisely the phenomenon can be described, so description's efficiency improves. In fact, the simple act to measure can improve the efficiency, we could just recall the axiom, circulating in software engineering field, when performance is measured, it improves [6] A metric is not only important for its own sake, but as part of a more wide schema. ...
No doubt that computer security is a hot topic nowadays: given the importance of computer-assisted activities, protection
of computer system is of the utmost importance. However we have insofar failed to evaluate the actual security level of a
system and thus to justify (either in technical or economical terms) the investments in security. This paper highlights the
motivations to improve security measurement techniques, analyses the existing approaches, and discusses whether their are
appropriate or some new directions should be explored.
... Other papers from the Imperishable Networks Project have developed complexity-based techniques for fault detection and identification as discussed in [26] and [9]. The focus of this report is on progress towards self-composition of solutions assuming that other techniques, particularly complexity-based techniques, have identified faults. ...
This article presents the architecture and initial feasibility results of a proto-type communication network that utilizes genetic programming to evolve services and protocols as part of network operation. The network evolves responses to environmental conditions in a manner that could not be pre-programmed within legacy network nodes a priori. A priori in this case means before network operation has begun. Genetic material is exchanged, loaded, and run dynamically within an active network. The transfer and execution of code in support of the evolution of network protocols and services would not be possible without the active network environment. Rapid generation of network service code occurs via a genetic programming paradigm. Complexity and algorithmic information theory play a key role in understanding and guiding code evolution within the network. © 2004 Wiley Periodicals, Inc. Complexity 9: 19–33, 2004
This paper presents results in two mutually complementary areas: distributed immunological information assurance and a new signature matching technique based upon Kolmogorov Complexity. This paper introduces a distributed model for security based on biological paradigms of Epidemiology and Immunology. In this model each node in the network has an immune system that identifies and destroys pathogens in the incoming network traffic as well as files resident on the node. The network nodes present a collective defense to the pathogens by working symbiotically and sharing pathogen information with each other. Each node compiles a list of pathogens that are perceived as threats by using information provided from all the nodes in the network. The signatures for these pathogens are incorporated into the detector population of the immune systems to increase the probability of detection. Critical to the success of this system is the detection scheme, which should not only be accurate but also efficient. Three separate schemes for detecting pathogens are examined, namely, Contiguous string matching, Hamming Distance, and Kolmogorov Complexity. This work provides a model of the system and examines the efficiency of different detection schemes. A simulation model is built to study the sensitivity of model parameters, such as signature length, sampling rate, network topology, etc. to detection of pathogens.
We present a simple distributed concept that appears to insinuate SWARM behavior in a collection of mobile platforms. The control is based on the inter-mobile platform communication links’ signal-to-noise ratio. This double use of communications is a natural linkage for SWARM behavior.
We present how to assess the network routing logical security policy of an Internet Service Provider network, through a reverse-engineering process performed on the network router configurations. The paper covers the definition of a network routing logical security policy and how to implement it in the network router configurations. In addition, it details the algorithms and their asymptotic time complexity required to assess this security policy.
Two approaches are proposed for revolutionary gains in MEMS device communication. The first is to view all network devices as computational or active devices. Computation can take many forms. The amount of computation may vary, but every device has some type of computation, either programmed or ambient. Use of computation in an optimal manner is the same challenge faced by active networks. Thus, advances in active networks and networks of MEMS devices are mutually beneficial. The second approach is to optimize networks of MEMS devices via exploiting emergence. Understanding emergence requires understanding complexity; this relationship is explored relative to networking. The results lead toward emergence that can be precisely engineered to achieve desired characteristics. The purpose of the research proposed in this white paper is to understand and develop a theory for basic emergent protocols using computer science formalisms and simulation techniques for higher order emergent protocols. Emergence is a concept or property in the macroscopic behavior of a system that is not contained within the microscopic description (Figure 1). It is a natural phenomenon in which structured collective behavior appears from the interaction of simple subsystems, such as MEMS devices. The research proposed in this white paper will integrate emergent protocols in network service protocols to create a new class of featherweight, survivable protocols called "emergent protocols." The challenge will be to identify emergent protocols that arise from the operation of the device and its interaction with other MEMS devices, especially in an environment of suboptimal connectivity where messages can be lost and the system must operate with only a partial knowledge of its environment. By understand...
