| Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
|---|---|---|---|---|---|
| Bush, S.F. | Volume III: Distributed Networks, Network Planning, Control, Management, and New Trends and Applications | 2007 | Vol. 3(0-471-78461-3), pp. 985-1011 |
inbook | URL |
| Abstract: Active networking is an exciting new paradigm in digital networking that has the potential to revolutionize the manner in which communication takes place. It is an emerging technology, one in which new ideas are constantly being formulated and new topics of research are springing up even as this book is being written. This technology is very likely to appeal to a broad spectrum of users from academia and industry. Therefore, this book was written in a way that enables all these groups to understand the impact of active networking in their sphere of interest. Information services managers, network administrators, and e-commerce developers would like to know the potential benefits of the new technology to their businesses, networks, and applications. The book introduces the basic active networking paradigm and its potential impacts on the future of information handling in general and on communications in particular. This is useful for forward-looking businesses that wish to actively participate in the development of active networks and ensure a head start in the integration of the technology in their future products, be they applications or networks. Areas in which active networking is likely to make significant impact are identified, and the reader is pointed to any related ongoing research efforts in the area. The book also provides a deeper insight into the active networking model for students and researchers, who seek challenging topics that define or extend frontiers of the technology. It describes basic components of the model, explains some of the terms used by the active networking community, and provides the reader with taxonomy of the research being conducted at the time this book was written. Current efforts are classified based on typical research areas such as mobility, security, and management. The intent is to introduce the serious reader to the background regarding some of the models adopted by the community, to outline outstanding issues concerning active networking, and to provide a snapshot of the fast-changing landscape in active networking research. Management is a very important issue in active networks because of its open nature. The latter half of the book explains the architectural concepts of a model for managing active networks and the motivation for a reference model that addresses limitations of the current network management framework by leveraging the powerful features of active networking to develop an integrated framework. It also describes a novel application enabled by active network technology called the Active Virtual Network Management Prediction (AVNMP) algorithm. AVNMP is a proactive management system; in other words, it provides the ability to solve a potential problem before it impacts the system by modeling network devices within the network itself and running that model ahead of real time. | |||||
BibTeX:
@inbook{Bush2007,
author = {Stephen F Bush},
title = {Volume III: Distributed Networks, Network Planning, Control, Management, and New Trends and Applications},
publisher = {John Wiley & Sons},
year = {2007},
volume = {3},
number = {0-471-78461-3},
pages = {985-1011},
url = {http://www.wiley.com/WileyCDA/Section/id-305685.html}
}
|
|||||
| Bush, S.F. | Sync and Swarm Behavior for Sensor Networks | 2005 | Joint IEEE Communications Society and Aerospace Chapter Presentation | inproceedings | URL |
| Abstract: A key component in efficient and intelligent sensor networking is inducing collaborative behavior. We examine collaboration from the point of view of synchronizing activity. Power consumption and pulse-coupled oscillation are explored in terms of low power time synchronization. More complex synchronous patterns are examined via Boolean Network state trajectories. Boolean Networks have the characteristic of simple components, namely Boolean functions, with localized sets of inter-connections. The result, even with a random density of interconnections, can be a stable self-regulating system whose state settles into organized patterns. Such systems can be analyzed for their basins of attraction, attractor state cycles, and stability. In fact, known systems can be reverse engineered as a Boolean Network. Boolean networks can also be constructed to solve arbitrary computational problems, such as K-SAT. The self-regulating group behavior exhibited by Boolean Networks and their localized interactions makes them an enticing model for studying self-organization and self-configuration in complex systems. | |||||
BibTeX:
@inproceedings{Bush2005d,
author = {Stephen F. Bush},
title = {Sync and Swarm Behavior for Sensor Networks},
booktitle = {Joint IEEE Communications Society and Aerospace Chapter Presentation},
year = {2005},
note = {Rochester, NY, USA},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Bush, S.F. | A Simple Metric for Ad Hoc Network Adaptation | 2005 | IEEE Journal on Selected Areas in Communications Journal Vol. 23(12), pp. 2272-2287 |
article | URL |
| Abstract: This paper examines flexibility in ad hoc networks and suggests that, even with cross-layer design as a mechanism to improve adaptation, a fundamental limitation exists in the ability of a single optimization function, defined a priori, to adapt the network to meet all quality-of-service requirements. Thus, code implementing multiple algorithms will have to be positioned within the network. Active networking and programmable networking enable unprecedented autonomy and flexibility for ad hoc communication networks. However, in order to best leverage the results of active and programmable networking, metrics that indicate the nature and location of required flexibility need to be developed. The primary contribution of this paper is to propose a metric that couples network topological rate of change with the ability of a generic service to move itself to an optimal location in concert with the changing network. This metric points to a fundamental tradeoff among adaptation (changing service location), performance (sophistication or estimated minimum code size of the service), and the network’s ability to tune itself to a changing ad hoc network topology. | |||||
BibTeX:
@article{Bush2005g,
author = {Stephen F. Bush},
title = {A Simple Metric for Ad Hoc Network Adaptation},
journal = {IEEE Journal on Selected Areas in Communications Journal},
year = {2005},
volume = {23},
number = {12},
pages = {2272-2287},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Bush, S.F. | Low-Energy Network Time Synchronization as an Emergent Property | 2005 | Proceedings of the Fourteenth International Conference on Computer Communications and Networks (IEEE ICCCN) | inproceedings | URL |
| Abstract: The primary contribution of this work is to examine the energy efficiency of pulse coupled oscillation for time synchronization in a realistic wireless network environment and to explore the impact of mobility on convergence rate. Energy coupled oscillation is susceptible to interference; this approach uses reception and decoding of short packet bursts to eliminate this problem. The energy efficiency of a commonly used timestamp broadcast algorithm is compared and contrasted with pulse-coupled oscillation. The emergent pulse coupled oscillation technique shows greater energy efficiency as well as robustness with mobility. The algorithm specifically includes the likelihood that some proportion of the sensors may include GPS receivers in order to obtain and propagate a master clock time. | |||||
BibTeX:
@inproceedings{Bush2005h,
author = {Stephen F. Bush},
title = {Low-Energy Network Time Synchronization as an Emergent Property},
booktitle = {Proceedings of the Fourteenth International Conference on Computer Communications and Networks (IEEE ICCCN)},
year = {2005},
note = {San Diego, California USA},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Bush, S.F. | Focus on Computer Science Research | 2004 | (1-59033-993-3), pp. 65-129 | inbook | |
| Abstract: The science of complexity theory, whose fundamentals have been developed over many decades, is poised to provide a new perspective to computer science and to computer networking in particular. An understanding of complexity theory will enable better system performance and add novel features as well as better security. A network of communicating nodes, each linked to its nearest neighbor and attempting to optimize performance based upon as local information in order to reduce overhead, is a tangible realization of a complex system. We examine how the tradeoff between computation and communication can be made in such a complex environment using Active Networking and Kolmogorov Complexity. We begin with a very brief overview of complexity theory and computer networking; a basic definition of complexity known as Kolmogorov Complexity is explained. Such information theoretic pioneers as Andre Kolmogorov, Raymond Solomonoff, and Gregory Chaitin developed Kolmogorov Complexity. In fact, Kolmogorov Complexity and Algorithmic Information Theory are sometimes referred to as Kolmogorov-Chaitin Complexity. The advantages and disadvantages of Kolmogorov Complexity are discussed, including its incomputable nature. The design of algorithms to obtain computable estimates of Kolmogorov Complexity is explored, as well as additional applications of Kolmogorov Complexity for communication networking. Once the concept of Kolmogorov Complexity is presented, we apply complexity theory, and Kolmogorov Complexity in particular, to active networks. Active networks form an ideal environment in which to study the effects of tradeoffs in algorithmic and static information representation because an active packet consists of both code and static data. The code can contain the protocol or a compressed form of the data to be transported. If the code is the protocol, then information about the complexity of the protocol can be gleaned from the active packet code. There are interesting relationships between Kolmogorov Complexity, prediction, compression and model size used in a particular predictive management system known as Active Virtual Network Management Prediction (AVNMP). | |||||
BibTeX:
@inbook{Bush2004a,
author = {Stephen F Bush},
title = {Focus on Computer Science Research},
publisher = {Nova Science Publishers, Inc},
year = {2004},
number = {1-59033-993-3},
pages = {65-129}
}
|
|||||
| Bush, S.F. | Extended Abstract: Complexity and Vulnerability Analysis | 2003 | Complexity and Inference | inproceedings | URL |
| Abstract: An active network allows packets to contain a mixture of code (algorithm) and data. The ratio of code to data can vary as the packet travels through the network. Such networks can also be vulnerable to attack via the transport of virus or worm code. A mitigation of this problem has been attempted via the use of active network probes to detect vulnerabilities in an active network. A complexity estimate of active protocols being transported within the network by active packets is obtained. In addition components within the active network contain probe points through which bit-level I/O can be collected. Kolmogorov Complexity estimates based upon simple inverse compression ratios have used to estimate vulnerability. The intent has been to experiment with better complexity measures as the research continues. [See the DIMACS presentation on "A new universal two part code for estimation of string Kolmogorov complexity and algorithmic minimum sufficient statistic" (Scott Evans) which discusses one of the estimators in further detail.] Consider the complexity of bit-level input and output strings concatenated together. That is, observe an input sequence to an arbitrary process (i.e. a potentially vulnerable process) at the bit-level and concatenate with an output sequence at the bit-level. This input/output concatenation can be applied to entire systems or to components of a system. If there is low complexity in the I/O observations, then it is likely to be easy for an attacker to "understand" and usurp that component. | |||||
BibTeX:
@inproceedings{Bush2003h,
author = {Stephen F. Bush},
title = {Extended Abstract: Complexity and Vulnerability Analysis},
booktitle = {Complexity and Inference},
year = {2003},
note = {DIMACS Center, Rutgers University, Piscataway, NJ},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Bush, S.F. | Extended Abstract: Complexity and Vulnerability Analysis | 2003 | Invited Paper: SFI Workshop: Resilient and Adaptive Defense of Computing Networks 2003 | inproceedings | URL |
| Abstract: An active network allows packets to contain a mixture of code (algorithm) and data. The ratio of code to data can vary as the packet travels through the network. Such networks can also be vulnerable to attack via the transport of virus or worm code. A mitigation of this problem has been attempted via the use of active network probes to detect vulnerabilities in an active network. A complexity estimate of active protocols being transported within the network by active packets is obtained. In addition components within the active network contain probe points through which bit-level I/O can be collected. Kolmogorov Complexity estimates based upon simple inverse compression ratios have used to estimate vulnerability. The intent has been to experiment with better complexity measures as the research continues. [See the DIMACS presentation on "A new universal two part code for estimation of string Kolmogorov complexity and algorithmic minimum sufficient statistic" (Scott Evans) which discusses one of the estimators in further detail.] Consider the complexity of bit-level input and output strings concatenated together. That is, observe an input sequence to an arbitrary process (i.e. a potentially vulnerable process) at the bit-level and concatenate with an output sequence at the bit-level. This input/output concatenation can be applied to entire systems or to components of a system. If there is low complexity in the I/O observations, then it is likely to be easy for an attacker to "understand" and usurp that component. | |||||
BibTeX:
@inproceedings{Bush2003i,
author = {Stephen F. Bush},
title = {Extended Abstract: Complexity and Vulnerability Analysis},
booktitle = {Invited Paper: SFI Workshop: Resilient and Adaptive Defense of Computing Networks 2003},
publisher = {DIMACS Center, Rutgers University, Piscataway, NJ},
year = {2003},
url = {http://dimacs.rutgers.edu/Workshops/Inference/abstracts.html}
}
|
|||||
| Bush, S.F. | Genetically Induced Communication Network Fault Tolerance | 2003 | Complexity Journal Vol. 9(2), pp. 19-33 |
article | URL |
| Abstract: This paper 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. | |||||
BibTeX:
@article{Bush2003n,
author = {Stephen F. Bush},
title = {Genetically Induced Communication Network Fault Tolerance},
journal = {Complexity Journal},
year = {2003},
volume = {9},
number = {2},
pages = {19-33},
note = {Special Issue on Resilient and Adaptive Defense of Computing Networks},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Bush, S.F. | Genetically Induced Communication Network Fault Tolerance | 2003 | Complexity Special Issue: "Resilient & Adaptive Defense of Computing Networks" Vol. 9(2), pp. 19-33 |
article | DOI URL |
| Abstract: This paper 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 preprogrammed 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. | |||||
BibTeX:
@article{Bush2004,
author = {Stephen F. Bush},
title = {Genetically Induced Communication Network Fault Tolerance},
journal = {Complexity Special Issue: "Resilient & Adaptive Defense of Computing Networks"},
publisher = {John Wiley & Sons, Inc.},
year = {2003},
volume = {9},
number = {2},
pages = {19--33},
url = {http://www.research.ge.com/~bushsf/pdfpapers/ComplexityJournal.pdf},
doi = {http://dx.doi.org/10.1002/cplx.20002}
}
|
|||||
| Bush, S.F. | Active Virtual Network Management Prediction: Complexity as a Framework for Prediction, Optimization, and Assurance | 2002 | IEEE Computer Society Press, Proceedings of the 2002 DARPA Active Networks Conference and Exposition (DANCE 2002), pp. 534-553 | inproceedings | |
| Abstract: Research into active networking has provided the incentive to re-visit what has traditionally been classified as distinct properties and characteristics of information transfer such as protocol versus service; at a more fundamental level this paper considers the blending of computation and communication by means of complexity. The specific service examined in this paper is network self-prediction enabled by Active Virtual Network Management Prediction. Computation/ communication is analyzed via Kolmogorov Complexity. The result is a mechanism to understand and improve the performance of active networking and Active Virtual Network Management Prediction in particular. The Active Virtual Network Management Prediction mechanism allows information, in various states of algorithmic and static form, to be transported in the service of prediction for network management. The results are generally applicable to algorithmic transmission of information. Kolmogorov Complexity is used and experimentally validated as a theory describing the relationship among algorithmic compression, complexity, and prediction accuracy within an active network. Finally, the paper concludes with a complexity-based framework for Information Assurance that attempts to take a holistic view of vulnerability analysis. | |||||
BibTeX:
@inproceedings{Bush2002,
author = {Stephen F. Bush},
title = {Active Virtual Network Management Prediction: Complexity as a Framework for Prediction, Optimization, and Assurance},
booktitle = {IEEE Computer Society Press, Proceedings of the 2002 DARPA Active Networks Conference and Exposition (DANCE 2002)},
year = {2002},
pages = {534--553},
note = {ISBN 0-7695-1564-9}
}
|
|||||
| Bush, S.F. | Active Virtual Network Management Prediction: Complexity as a Framework for Prediction, Optimization, and Assurance | 2002 | Proceedings of the 2002 DARPA Active Networks Conference and Exposition (DANCE) May 29-30, 2002, San Francisco, California, USA, pp. 534,553 | inproceedings | URL |
| Abstract: Research into active networking has provided the incentive to re-visit what has traditionally been classified as distinct properties and characteristics of information transfer such as protocol versus service; at a more fundamental level this paper considers the blending of computation and communication by means of complexity. The specific service examined in this paper is network self-prediction enabled by Active Virtual Network Management Prediction. Computation/ communication is analyzed via Kolmogorov Complexity. The result is a mechanism to understand and improve the performance of active networking and Active Virtual Network Management Prediction in particular. The Active Virtual Network Management Prediction mechanism allows information, in various states of algorithmic and static form, to be transported in the service of prediction for network management. The results are generally applicable to algorithmic transmission of information. Kolmogorov Complexity is used and experimentally validated as a theory describing the relationship among algorithmic compression, complexity, and prediction accuracy within an active network. Finally, the paper concludes with a complexitybased framework for Information Assurance that attempts to take a holistic view of vulnerability analysis. | |||||
BibTeX:
@inproceedings{Bush2002b,
author = {Stephen F. Bush},
title = {Active Virtual Network Management Prediction: Complexity as a Framework for Prediction, Optimization, and Assurance},
booktitle = {Proceedings of the 2002 DARPA Active Networks Conference and Exposition (DANCE) May 29-30, 2002, San Francisco, California, USA},
publisher = {Santa Fe Institute, Santa Fe, NM},
year = {2002},
pages = {534,553},
note = {ISBN 0-7695-1564-9},
url = {http://www.research.ge.com/~bushsf/ftn/005-FINAL.pdf}
}
|
|||||
| Bush, S.F. | Islands of Near-Perfect Self-Prediction | 2000 | Proceedings of VWsim'00: Virtual Worlds and Simulation Conference, WMC'00: 2000 SCS Western Multi-Conference, San Diego, SCS (2000) | inproceedings | URL |
| Abstract: In the course of efforts to more fully utilize the power of active networks to build a self-managing communications network, the nature of entanglement and the relationship between modeling and communication become of utmost importance. This paper provides a very brief introduction to Active Networks and the Active Virtual Network Management Prediction Project whose goal is a self-managing communications network. The focus of the paper is upon the effects of near-infinite resources; that is, how will such a self-predictive system behave as processing and bandwidth become ever larger and more powerful. An attempt is made to identify new theories required to understand such highly self-predictive systems. | |||||
BibTeX:
@inproceedings{Bush2000a,
author = {Stephen F. Bush},
title = {Islands of Near-Perfect Self-Prediction},
booktitle = {Proceedings of VWsim'00: Virtual Worlds and Simulation Conference, WMC'00: 2000 SCS Western Multi-Conference, San Diego, SCS (2000)},
year = {2000},
url = {http://www.research.ge.com/~bushsf/an/vwsim00.pdf}
}
|
|||||
| Bush, S.F. | Active Virtual Network Management Prediction | 1999 | PADS '99 | inproceedings | URL |
| Abstract: This paper introduces a novel algorithm, the Active Virtual Network Management Prediction (AVNMP), for predictive network management. It explains how the AVNMP facilitates the management of an active network by allowing future predicted state information within an active network to be available to network management algorithms. This is accomplished by coupling ideas from optimistic discrete event simulation with active networking. The optimistic discrete event simulation method used is a form of self-adjusting Time Warp. It is self-adjusting because the system adjusts for predictions which are inaccurate beyond a given tolerance. The concept of a streptichron and autoanaplasis are introduced as mechanisms which take advantage of the enhanced flexibility and intelligence of active packets. Finally, it is demonstrated that the AVNMP is a feasible concept. | |||||
BibTeX:
@inproceedings{Bush1999b,
author = {Stephen F. Bush},
title = {Active Virtual Network Management Prediction},
booktitle = {PADS '99},
year = {1999},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Bush, S.F. | The Design and Analysis of Virtual Network Configuration for a Wireless Mobile ATM Network | 1997 | School: University of Kansas | phdthesis | URL |
| Abstract: This research concentrates on the design and analysis of an algorithm referred to as Virtual Network Configuration (VNC) which uses predicted future states of a system for faster network configuration and management. VNC is applied to the configuration of a wireless mobile ATM network. VNC is built on techniques from parallel discrete event simulation merged with constraints from real-time systems and applied to mobile ATM configuration and handoff. Configuration in a mobile network is a dynamic and continuous process. Factors such as load, distance, capacity and topology are all constantly changing in a mobile environment. The VNC algorithm anticipates configuration changes and speeds the reconfiguration process by pre-computing and caching results. VNC propagates local prediction results throughout the VNC enhanced system. The Global Positioning System is an enabling technology for the use of VNC in mobile networks because it provides location information and accurate time for each node. This research has resulted in well defined structures for the encapsulation of physical processes within Logical Processes and a generic library for enhancing a system with VNC. Enhancing an existing system with VNC is straight forward assuming the existing physical processes do not have side effects. The benefit of prediction is gained at the cost of additional traffic and processing. This research includes an analysis of VNC and suggestions for optimization of the VNC algorithm and its parameters. |
|||||
BibTeX:
@phdthesis{Bush1997b,
author = {Stephen F. Bush},
title = {The Design and Analysis of Virtual Network Configuration for a Wireless Mobile ATM Network},
school = {University of Kansas},
year = {1997},
url = {http://www.ittc.ukans.edu/RDRN/documents/}
}
|
|||||
| Bush, S.F. & Barnett, B. | Information Warfare Strategy and Control Analysis | 1999 | unpublished | URL | |
| Abstract: This precis describes a tool for quantifying the vulnerability of a communications network. It is important that information warfare studies include both offensive and defensive strategies in an integrated manner since neither can be studied in isolation. It is assumed that an attacker has a finite amount of resources with which to discover faults in the network security of a data communications network and that each fault discovery consumes the attackers’ resources. Network security actions may be taken to increase security in strategic areas of the network and to actively deter an attack. Reactions such as these by network security in response to an attack have a both a monetary cost and a cost in terms of reduction of network resources and degradation of services to network consumers. An optimal course of action by network security in response to an attack is to minimize network access to an attacker while also minimizing the impact to legitimate network consumers. This requires precise assessment of network security vulnerability and quantification of effects on network consumers by actions taken by network security in response to an attack. This white paper proposes incorporating methods and algorithms into an existing proto-type tool that we have developed for using vulnerability information collected from an actual network and simulating the results of an attack so the command and control strategies can be studied. | |||||
BibTeX:
@unpublished{Bush,
author = {Stephen F. Bush and Bruce Barnett},
title = {Information Warfare Strategy and Control Analysis},
year = {1999},
note = {White Paper},
url = {http://www.research.ge.com/~bushsf/pdfpapers/nvaprecis.pdf}
}
|
|||||
| Bush, S.F. & Barnett, B. | A Security Vulnerability Assessment Technique and Model | 1998 | (98CRD028) | techreport | URL |
| Abstract: This paper presents a framework and a tool for quantifying the security of a communication network. The framework is compared to some aspects of the human immune system providing insights into methods of quantifying vulnerabilities, detecting an intruder, and fighting an attack. It is assumed that an attacker has a finite amount of resources with which to discover faults in the network security of a data communications network and that each fault discovery consumes the attackers' resources. Extensions of this method in light of knowledge of the operation of the human immune system are explored. Network security actions may be taken to increase security in strategic areas of the network and to actively pursue an attacker. Reactions such as these by network security in response to an attack have a cost in terms of network resources and degradation of services to network consumers. An optimal course of action by network security in response to an attack is to minimize network access to an attacker while also minimizing the impact to legitimate network consumers. The optimal course of action by network security personnel requires precise assessment of network security vulnerability, quantification of effects on network consumers by actions taken by network security in response to an attack, and a framework for applying the vulnerability assessment. | |||||
BibTeX:
@techreport{Bush1998,
author = {Stephen F. Bush and Bruce Barnett},
title = {A Security Vulnerability Assessment Technique and Model},
year = {1998},
number = {98CRD028},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Bush, S.F., Evans, J.B. & Frost, V. | Mobile ATM Buffer Capacity Analysis | 1996 | ACM-Baltzer Mobile Networks and Nomadic Applications (NOMAD) Vol. 1(1) |
article | URL |
| Abstract: This paper extends a stochastic theory for buffer fill distribution for multiple ``on'' and ``off'' sources to a mobile environment. Queue fill distribution is described by a set of differential equations assuming sources alternate asynchronously between exponentially distributed periods in ``on'' and ``off'' states. This paper includes the probabilities that mobile sources have links to a given queue. The sources represent mobile user nodes, and the queue represents the capacity of a switch. This paper presents a method of analysis which uses mobile parameters such as speed, call rates per unit area, cell area, and call duration and determines queue fill distribution at the ATM cell level. The analytic results are compared with simulation results. | |||||
BibTeX:
@article{Bush1996b,
author = {Stephen F. Bush and Joseph B. Evans and Victor Frost},
title = {Mobile ATM Buffer Capacity Analysis},
journal = {ACM-Baltzer Mobile Networks and Nomadic Applications (NOMAD)},
year = {1996},
volume = {1},
number = {1},
url = {http://www.crd.ge.com/people/bush}
}
|
|||||
| Bush, S.F. & Evans, S.C. | Kolmogorov Complexity for Information Assurance [BibTeX] |
2001 | (2001CRD148) | techreport | URL |
BibTeX:
@techreport{Bush2001b,
author = {Stephen F. Bush and Scott C. Evans},
title = {Kolmogorov Complexity for Information Assurance},
year = {2001},
number = {2001CRD148},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Bush, S.F. & Evans, S.C. | Complexity-Based Information Assurance | 2001 | (2001CRD084) | techreport | |
| Abstract: Unless vulnerabilities can be identified and measured, the information assurance of a system can never be properly designed or guaranteed. Results from a study on complexity evolving within an information system using Mathematica, Swarm, and a new Java complexity probe toolkit are presented in this paper. An underlying definition of information security is hypothesized based upon the attacker and defender as reasoning entities, capable of learning to outwit one another. This leads to a study of theevolution of complexity in an information system and the effects of the environment upon the evolution of information complexity. Understanding the evolution of complexity in a system enables a better understanding of how to measure and quantify the vulnerability of a system. Finally, the design of the Java complexity probe toolkit under construction for automated measurement of information assurance is presented. | |||||
BibTeX:
@techreport{Bush2001d,
author = {Stephen F. Bush and S. C. Evans},
title = {Complexity-Based Information Assurance},
year = {2001},
number = {2001CRD084}
}
|
|||||
| Bush, S.F., Frost, V.S. & Evans, J.B. | Network Management of Predictive Mobile Networks | 1999 | Journal of Network and Systems Management Vol. 7(2) |
article | URL |
| Abstract: There is a trend toward the use of predictive systems in communications networks. At the systems and network management level predictive capabilities are focused on anticipating network faults and performance degradation. Simultaneously, mobile communication networks are being developed with predictive location and tracking mechanisms. The interactions and synergies between these systems present a new set of problems. A new predictive network management framework is developed and examined. The interaction between a predictive mobile network and the proposed network management system is discussed. The Rapidly Deployable Radio Network is used as a specific example to illustrate these interactions. | |||||
BibTeX:
@article{Bush1999a,
author = {Stephen F. Bush and Victor S. Frost and Joseph B. Evans},
title = {Network Management of Predictive Mobile Networks},
journal = {Journal of Network and Systems Management},
year = {1999},
volume = {7},
number = {2},
url = {http://www.crd.ge.com/people/bush}
}
|
|||||
| Bush, S.F. & Goel, S. | Graph Spectra of Carbon Nanotube Networks | 2006 | 1st International Conference on Nano-Networks | conference | URL |
| Abstract: Sensor coverage will benefit from finding better ways to communicate among smaller sensors. Also, as development in nanotechnology progresses, the need for low-cost, robust, reliable communication among nano-machines will become apparent. Communication and signaling within newly engineered inorganic and biological nano-systems will allow for extremely dense and efficient distributed operation. This paper examines these potential benefits from the perspective of using individual nanotubes within random carbon nanotube networks (CNT) to carry information. One may imagine small CNT networks with functionalized nanotubes sensing multiple elements inserted into a cell in vivo. The information from each nanotube sensor can be fused within the network. This is clearly distinct from traditional, potentially less efficient, approaches of using CNT networks to construct transistors. The CNT network and routing of information is an integral part of the physical layer. Single-walled carbon nanotubes (SWNT) are modeled as linear tubes positioned in two dimensions via central coordinates with a specified angle. A network graph is extracted from the layout of the tubes and the ability to route information at the level of individual nanotubes is considered. The impact of random tube characteristics, such as location and angle, upon the corresponding network graph and its impacts are examined. |
|||||
BibTeX:
@conference{Bush2006d,
author = {Stephen F. Bush and Sanjay Goel},
title = {Graph Spectra of Carbon Nanotube Networks},
booktitle = {1st International Conference on Nano-Networks},
year = {2006},
url = {http://www.research.ge.com/~bushsf/pdfpapers/04152817_GraphSpectra.pdf}
}
|
|||||
| Bush, S.F. & Goel, S. | An Active Model-Based Prototype for Predictive Network Management | 2005 | IEEE Journal on Selected Areas in Communications Journal Vol. 23(10), pp. 2040-2057 |
article | URL |
| Abstract: If current trends continue, the next generation of enterprise networks is likely to become a more complex mixture of hardware, communication media, architectures, protocols, and standards. One approach toward reducing the management burden caused by growing complexity is to integrate management support into the inherent function of network operation. In this paper, management support is provided in the form of network components that, simultaneously with their network function, collaboratively project and adjust projections of future state based upon actual network state. It is well known that more accurate predictions over a longer time horizon enables better control decisions. This paper focuses upon improving prediction; the many potential uses of predictive capabilities for predictive network control will be addressed in future work. | |||||
BibTeX:
@article{Bush2005m,
author = {Stephen F. Bush and Sanjay Goel},
title = {An Active Model-Based Prototype for Predictive Network Management},
journal = {IEEE Journal on Selected Areas in Communications Journal},
year = {2005},
volume = {23},
number = {10},
pages = {2040-2057},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Bush, S.F. & Goel, S. | Kolmogorov Complexity Estimates For Detection Of Viruses In Biologically Inspired Security Systems: A Comparison With Traditional Approaches | 2003 | Complexity Journal Vol. 9(2), pp. 54-73 |
article | URL |
| Abstract: 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. | |||||
BibTeX:
@article{Bush2003o,
author = {Stephen F. Bush and Sanjay Goel},
title = {Kolmogorov Complexity Estimates For Detection Of Viruses In Biologically Inspired Security Systems: A Comparison With Traditional Approaches},
journal = {Complexity Journal},
year = {2003},
volume = {9},
number = {2},
pages = {54-73},
note = {Special Issue on Resilient & Adaptive Defense of Computing Networks},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Bush, S.F., Gopala, P.K. & Imer, O. | Enhancing Reliable Multicast Transport to Mitigate the Impact of Blockage | 2006 | 11th International Workshop on Computer-Aided, Modeling, Analysis and Design of Communication Links and Networks | conference | URL |
| Abstract: Mobile wireless communication is susceptible to signal blockage, which is loss of signal, typically due to physical obstruction, over a longer duration relative to fading. Measurements indicate that blockage has a significant impact on reliability in both open and rural areas. Reliable multicast, a transport layer mechanism, attempts to gain networkperformance by eliminating duplicate packets transmitted from a sender to multiple receivers along common paths while providing guaranteed packet delivery to all receivers. The gain achieved by multicasting places limits on the ability to optimize transmission to heterogeneous receiver channel characteristics in an individualized manner at the multicast transport layer. A simple, low overhead protocol extension to mitigate the impact of blockage upon reliable multicast is proposed by piggybacking on reliable multicast congestion control feedback. | |||||
BibTeX:
@conference{Bush2006e,
author = {Stephen F. Bush and Praveen Kumar Gopala and Orhan Imer},
title = {Enhancing Reliable Multicast Transport to Mitigate the Impact of Blockage},
booktitle = {11th International Workshop on Computer-Aided, Modeling, Analysis and Design of Communication Links and Networks},
year = {2006},
url = {http://www.research.ge.com/~bushsf/pdfpapers/bush_camadfinalv3.pdf}
}
|
|||||
| Bush, S.F., Hershey, J. & Vosburgh, K. | Brittle System Analysis | 1999 | article | URL | |
| Abstract: The goal of this paper is to define and analyze systems which exhibit brittle behavior. This behavior is characterized by a sudden and steep decline in performance as the system state changes. This can be due to input parameters which exceed a specified input, or environmental conditions which exceed specified operating boundaries. | |||||
BibTeX:
@article{Bush1999,
author = {Stephen F. Bush and John Hershey and Kirby Vosburgh},
title = {Brittle System Analysis},
year = {1999},
note = {http://xxx.lanl.gov/},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Bush, S.F. & Hughes, T. | On The Effectiveness of Kolmogorov Complexity Estimation to Discriminate Semantic Types | 2003 | Proceedings of the SFI Workshop on Resilient and Adaptive Defense of Computing Networks 2003 | inproceedings | URL |
| Abstract: We present progress on the experimental validation of a fundamental and universally applicable vulnerability analysis framework that is capable of identifying new types of vulnerabilities before attackers innovate attacks. This new framework proactively identifies system components that are vulnerable based upon their Kolmogorov Complexity estimates and it facilitates prediction of previously unknown vulnerabilities that are likely to be exploited by future attack methods. A tool that utilizes a growing library of complexity estimators is presented. This work is an incremental step towards validation of the concept of complexity-based vulnerability analysis. In particular, results indicate that data types (semantic types) can be identified by estimates of their complexity. Thus, a map of complexity can identify suspicious types, such as executable data embedded within passive data types, without resorting to predefined headers, signatures, or other limiting a priori information | |||||
BibTeX:
@inproceedings{Bush2003a,
author = {Stephen F. Bush and Todd Hughes},
title = {On The Effectiveness of Kolmogorov Complexity Estimation to Discriminate Semantic Types},
booktitle = {Proceedings of the SFI Workshop on Resilient and Adaptive Defense of Computing Networks 2003},
year = {2003},
note = {Santa Fe Institute, Santa Fe, NM},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Bush, S.F., Jagannath, S., Evans, J.B. & Frost, V. | A Control and Management Network for Wireless ATM Systems | 1996 | Proceedings of the International Communications Conference '96, pp. 459,463 | inproceedings | URL |
| Abstract: This work provides the results of the on-going design and implementation of a control and management network (an orderwire) for a mobile wireless ATM system. There are novel uses for an orderwire which receives time and position from the Global Positioning System (GPS). Position information is used for such things as beam steering and determination of switch to host associations. The accurate time provided by the GPS is used by the network configuration system for a proposed rapid configuration algorithm. | |||||
BibTeX:
@inproceedings{Bush1996,
author = {Stephen F. Bush and Sunil Jagannath and Joseph B. Evans and Victor Frost},
title = {A Control and Management Network for Wireless ATM Systems},
booktitle = {Proceedings of the International Communications Conference '96},
year = {1996},
pages = {459,463},
url = {http://www-ee.uta.edu/organizations/commsoc/commsoft.html}
}
|
|||||
| Bush, S.F., Jagannath, S., Evans, J.B., Frost, V., Minden, G. & Shanmugan, K.S. | A Control and Management Network for Wireless ATM Systems | 1997 | ACM-Baltzer Wireless Networks (WINET) Vol. 3, pp. 267,283 |
article | URL |
| Abstract: This paper describes the design of a control and management network (orderwire) for a mobile wireless Asynchronous Transfer Mode (ATM) network. This mobile wireless ATM network is part of the Rapidly Deployable Radio Network (RDRN). The orderwire system consists of a packet radio network which overlays the mobile wireless ATM network, each network element in this network uses Global Positioning System (GPS) information to control a beamforming antenna subsystem which provides for spatial reuse. This paper also proposes a novel Virtual Network Configuration (VNC) algorithm for predictive network configuration. A mobile ATM Private Network-Network Interface (PNNI) based on VNC is also discussed. Finally, as a prelude to the system implementation, results of a Maisie simulation of the orderwire system are discussed. | |||||
BibTeX:
@article{Bush1997a,
author = {Stephen F. Bush and Sunil Jagannath and Joseph B. Evans and Victor Frost and Gary Minden and K. Sam Shanmugan},
title = {A Control and Management Network for Wireless ATM Systems},
journal = {ACM-Baltzer Wireless Networks (WINET)},
year = {1997},
volume = {3},
pages = {267,283},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Bush, S.F., Kulkarni, A., Evans, S. & Galup, L. | Active Jitter Control | 2000 | 7th International IS&N Conference, Intelligence in Services and Networks (ISN) '00, Kavouri, Athens, Greece | inproceedings | URL |
| Abstract: This study is the first known implementation of jitter control in an active network. Jitter control is performed by active packets in a distributed packet by packet basis within an active network rather than on a per flow basis as in today's passive networks. This provides many new benefits and challenges. The concept and results of an experimental validation of this method are presented. | |||||
BibTeX:
@inproceedings{Bush2000,
author = {Stephen F. Bush and Amit Kulkarni and Scott Evans and Luiz Galup},
title = {Active Jitter Control},
booktitle = {7th International IS&N Conference, Intelligence in Services and Networks (ISN) '00, Kavouri, Athens, Greece},
year = {2000},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Bush, S.F. & Kulkarni, A.B. | Active Networks and Active Network Management: A Proactive Management Framework | 2001 | (ISBN 0-306-46560-4) | book | URL |
| Abstract: Active networking is an exciting new paradigm in digital networking that has the potential to revolutionize the manner in which communication takes place. It is an emerging technology, one in which new ideas are constantly being formulated and new topics of research are springing up even as this book is being written. This technology is very likely to appeal to a broad spectrum of users from academia and industry. Therefore, this book was written in a way that enables all these groups to understand the impact of active networking in their sphere of interest. Information services managers, network administrators, and e-commerce developers would like to know the potential benefits of the new technology to their businesses, networks, and applications. The book introduces the basic active networking paradigm and its potential impacts on the future of information handling in general and on communications in particular. This is useful for forward-looking businesses that wish to actively participate in the development of active networks and ensure a head start in the integration of the technology in their future products, be they applications or networks. Areas in which active networking is likely to make significant impact are identified, and the reader is pointed to any related ongoing research efforts in the area. The book also provides a deeper insight into the active networking model for students and researchers, who seek challenging topics that define or extend frontiers of the technology. It describes basic components of the model, explains some of the terms used by the active networking community, and provides the reader with taxonomy of the research being conducted at the time this book was written. Current efforts are classified based on typical research areas such as mobility, security, and management. The intent is to introduce the serious reader to the background regarding some of the models adopted by the community, to outline outstanding issues concerning active networking, and to provide a snapshot of the fast-changing landscape in active networking research. Management is a very important issue in active networks because of its open nature. The latter half of the book explains the architectural concepts of a model for managing active networks and the motivation for a reference model that addresses limitations of the current network management framework by leveraging the powerful features of active networking to develop an integrated framework. It also describes a novel application enabled by active network technology called the Active Virtual Network Management Prediction (AVNMP) algorithm. AVNMP is a proactive management system; in other words, it provides the ability to solve a potential problem before it impacts the system by modeling network devices within the network itself and running that model ahead of real time. | |||||
BibTeX:
@book{Bush2001,
author = {Stephen F. Bush and Amit B. Kulkarni},
title = {Active Networks and Active Network Management: A Proactive Management Framework},
publisher = {Kluwer Academic/Plenum Publishers},
year = {2001},
number = {ISBN 0-306-46560-4},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Bush, S.F. & Kulkarni, A.B. | Thought Communication [BibTeX] |
2001 | Workshop on New Visions for Large-Scale Networks: Research and Applications | inproceedings | URL |
BibTeX:
@inproceedings{Bush2001a,
author = {Stephen F. Bush and Amit B. Kulkarni},
title = {Thought Communication},
booktitle = {Workshop on New Visions for Large-Scale Networks: Research and Applications},
year = {2001},
note = {Vienna, Virginia},
url = {http://www.hpcc.gov/iwg/lsn/lsn-workshop-12mar01/}
}
|
|||||
| Bush, S.F. & Li, Y. | Nano-Communications: A New Field? An Exploration into a Carbon Nanotube Communication Network | 2006 | (2006GRC066) | techreport | URL |
| Abstract: Imagine a communication network constructed at a nanometer scale. This paper examines the potential benefits from the perspective of using individual nanotubes within random carbon nanotube networks (CNT) to carry information. This is distinct from traditional, potentially less efficient, approaches of using CNT networks to construct transistors. The traditional networking protocol stack is inverted in this approach because, rather than the network layer being logically positioned above the physical and link layers, the CNT network and routing of information is an integral part of the physical layer. Single-walled carbon nanotubes (SWNT) are modelled as linear tubes positioned in two dimensions via central coordinates with a specified angle. A distribution of lengths and angles may be specified. A network graph is extracted from the layout of the tubes and the unprecedented ability to route information close to the level of individual nanotubes is considered. The impact of random tube characteristics, such as location and angle, upon the corresponding network graph and its impacts are examined. | |||||
BibTeX:
@techreport{Bush2006,
author = {Stephen F. Bush and Yun Li},
title = {Nano-Communications: A New Field? An Exploration into a Carbon Nanotube Communication Network},
year = {2006},
number = {2006GRC066},
url = {http://www.research.ge.com/~bushsf/pdfpapers/2006GRC066_Final_ver.pdf}
}
|
|||||
| Bush, S.F. & Li, Y. | Characteristics of Carbon Nanotube Networks: The Impact of a Metallic Nanotube on a CNT Network | 2006 | (2006GRC397) | techreport | URL |
| Abstract: The impact of metallic carbon nanotubes on a carbon nanotube (CNT) network structure is evaluated. Metallic tubes reduce the mobility of CNT networks, thus reducing their switching speed in electronic devices. It is anticipated that certain CNT network layouts or topologies will be more resilient to the impact of metallic tubes. Classes of networks have been identified such as regular, random, and scale-free. This study considers the performance of a variety of network classes in the presence of a metallic tube. Mathematica commands are included in this report to demonstrate the operation of the software tool implementing the analysis as well as the theory behind its operation. While these results provide direction for possible nanotube topology design rules, more work needs to be done to verify and extend these results. | |||||
BibTeX:
@techreport{Bush2006a,
author = {Stephen F. Bush and Yun Li},
title = {Characteristics of Carbon Nanotube Networks: The Impact of a Metallic Nanotube on a CNT Network},
year = {2006},
number = {2006GRC397},
url = {http://www.research.ge.com/~bushsf/pdfpapers/2006GRC397_final_ver.pdf}
}
|
|||||
| Bush, S.F. & Li, Y. | Network Characteristics of Carbon Nanotubes: A Graph Eigenspectrum Approach and Tool Using Mathematica | 2006 | (2006GRC023) | techreport | URL |
| Abstract: This paper reports advances in analyzing the network structure of carbon nanotube (CNT) networks. CNT devices continue to receive attention for a variety of applications. Unfortunately, understanding the characteristics of random networks formed by such tubes has stymied progress. With respect to transistors constructed from CNT networks, electron and hole mobility provide a measure of the rate of current flow as a gate voltage is applied. The higher the mobility, the faster the gate can switch; this leads to faster computation and faster processors, e.g. faster routers, wireless links, computers, etc. Mobility is relatively easy to predict for a single carbon nanotube. Unfortunately, mobility becomes extremely complex for networks of tubes. The performance of pure carbon nanotube networks and networks with impurities has been complicated by their random network structures. A model to predict CNT network device performance based on randomized tube layout and metallic tube characteristics has been needed in order to explore CNT network performance. This report develops a mathematical network model, implemented in Mathematica, based upon the eigenspectrum of the graph laplacian of the network. This technique allows the impact of individual tube characteristics on the entire network structure to be analyzed in detail rather than requiring aggregate and often-inaccurate estimates. The analytically derived values using the eigenspectrum approach are shown to match trends obtained from experimental measurements. Future technical reports will use this model to provide guidance in identifying methods to improve performance based upon such characteristics as distributions of tube angles and tube lengths. Mathematica commands are included in this report to demonstrate the operation of the software tool implementing the analysis as well as the theory behind its operation. | |||||
BibTeX:
@techreport{Bush2006b,
author = {Stephen F. Bush and Yun Li},
title = {Network Characteristics of Carbon Nanotubes: A Graph Eigenspectrum Approach and Tool Using Mathematica},
year = {2006},
number = {2006GRC023},
url = {http://www.research.ge.com/~bushsf/pdfpapers/2006GRC023_Final_ver.pdf}
}
|
|||||
| Bush, S.F. & Li, Y. | Graph Spectra of Carbon Nanotube Networks: Molecular Communication | 2006 | (0951-E04-06)Materials Research Society 2006 Fall Proceedings | inproceedings | |
| Abstract: The integrated application within random carbon nanotube networks (CNT) to carry and fuse information, as well as perform simple sensing, is explored. One may imagine small CNT networks with functionalized nanotubes simultaneously sensing multiple targets in-vivo for unprecedented understanding of biological pathways. This is clearly distinct from the traditional convoluted approach of using CNT networks to construct transistors that are in turn used to construct communication networks. With random CNT network layouts, routing of information is an integral part of the physical layer. A Mathematica analysis for evaluating random CNT networks has been developed and used to verify design characteristics. The graph spectrum of the CNT network is used to determine resistance and electron mobility characteristics. Thus, we have been able to find relationships among CNT network structure and electron mobility. The nanotube density allows for an increase in the number of bits per square meter of information transfer compared to wireless communication. Consider a wireless network; a typical bit-meters/second capacity is limited in a traditional wireless network. The maximum wireless capacity approximation in a wireless broadcast media is contrasted with a CNT network; we look at the efficiency of CNT networks to carry information and compare with theoretical limits. | |||||
BibTeX:
@inproceedings{Bush2006c,
author = {Stephen Francis Bush and Yun Li},
title = {Graph Spectra of Carbon Nanotube Networks: Molecular Communication},
booktitle = {Materials Research Society 2006 Fall Proceedings},
year = {2006},
number = {0951-E04-06}
}
|
|||||
| Bush, S.F. & Smith, N. | The Limits of Motion Prediction Support for Ad hoc Wireless Network Performance | 2005 | Proceedings of the 2005 International Conference on Wireless Networks (ICWN-05) | inproceedings | URL |
| Abstract: A fundamental understanding of gain provided by motion prediction in wireless ad hoc routing is currently lacking. This paper examines benefits in routing obtainable via prediction. A theoretical best-case non-predictive routing model is quantified in terms of both message overhead and update time for non-predictive routing. This best- case model of existing routing performance is compared with predictive routing. Several specific instances of predictive improvements in routing are examined. The primary contribution of this paper is quantification of predictive gain for wireless ad hoc routing. | |||||
BibTeX:
@inproceedings{Bush2005a,
author = {Stephen F. Bush and Nathan Smith},
title = {The Limits of Motion Prediction Support for Ad hoc Wireless Network Performance},
booktitle = {Proceedings of the 2005 International Conference on Wireless Networks (ICWN-05)},
year = {2005},
note = {Monte Carlo Resort, Las Vegas, Nevada, USA},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Galtier, V., Mills, K., Carlinet, Y., Bush, S. & Kulkarni, A. | Predicting Resource Demand In Heterogeneous Active Networks | 2001 | Proceedings of MILCOM 2001 | inproceedings | URL |
| Abstract: Recent research, such as the Active Virtual Network Management Prediction (AVNMP) system, aims to use simulation models running ahead of real time to predict resource demand among network nodes. If accurate, such predictions can be used to allocate network capacity and to estimate quality of service. Future deployment of active-network technology promises to complicate prediction algorithms because each ``active'' message can convey its own processing logic, which introduces variable demand for processor (CPU) cycles. This paper describes a means to augment AVNMP, which predicts message load among active-network nodes, with adaptive models that can predict the CPU time required for each ``active'' message at any active- network node. Typical CPU models cannot adapt to heterogeneity among nodes. This paper shows improvement in AVNMP performance when adaptive CPU models replace more traditional non-adaptive CPU models. Incorporating adaptive CPU models can enable AVNMP to predict active-network resource usage farther into the future, and lowers prediction overhead. | |||||
BibTeX:
@inproceedings{Galtier2001,
author = {V. Galtier and K. Mills and Y. Carlinet and S. Bush and A. Kulkarni},
title = {Predicting Resource Demand In Heterogeneous Active Networks},
booktitle = {Proceedings of MILCOM 2001},
year = {2001},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Galtier, V., Mills, K., Carlinet, Y., Bush, S. & Kulkarni, A. | Prediction and controlling resource usage in a heterogenous active network | 2001 | Third Annual International Workshop on Active Middleware Services | inproceedings | URL |
| Abstract: Active network technology envisions deployment of virtual execution environments within network elements, such as switches and routers. As a result, inhomogeneous processing can be applied to network traffic. To use such technology safely and efficiently, individual nodes must provide mechanisms to enforce resource limits. This implies that each node must understand the varying resource requirements for specific network traffic. This paper presents an approach to model the CPU time requirements of active applications in a form that can be interpreted among heterogeneous nodes. Further, the paper demonstrates how this approach can be used successfully to control resources consumed at an active-network node and to predict load among nodes in an active network, when integrated within the Active Virtual Network Management Prediction system. | |||||
BibTeX:
@inproceedings{Galtier2001a,
author = {V. Galtier and K. Mills and Y. Carlinet and S. Bush and A. Kulkarni},
title = {Prediction and controlling resource usage in a heterogenous active network},
booktitle = {Third Annual International Workshop on Active Middleware Services},
year = {2001},
note = {http://www.crd.ge.com/~bushsf/ftn},
url = {http://www.research.ge.com/~bushsf/an/nist-ge-ams2001.pdf}
}
|
|||||
| Goel, S. & Bush, S.F. | Biological Models of Security for Virus Propagation in Computer Networks | 2004 | ;Login; Vol. 29(6), pp. 49-56 |
article | URL |
| Abstract: This aricle discusses the similarity between the propagation of pathogens (viruses and worms) on computer networks and the proliferation of pathogens in cellular organisms (organisms with genetic material contained within a membrane-encased nucleus). It introduces several biological mechanisms which are used in these organisms to protect against such pathogens and presents security models for networked computers inspired by several biological paradigms, including genomics (RNA interference), proteomics (pathway mapping), and physiology (immune system). In addition, the study of epidemiological models for disease control can inspire methods for controlling the spread of pathogens across multiple nodes of a network. It also presents results based on the authors’ research in immune system modeling. | |||||
BibTeX:
@article{Goel2004a,
author = {Sanjay Goel and Stephen F. Bush},
title = {Biological Models of Security for Virus Propagation in Computer Networks},
journal = {;Login;},
year = {2004},
volume = {29},
number = {6},
pages = {49-56},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Goel, S. & Bush, S.F. | Kolmogorov Complexity Estimates For Detection Of Viruses In Biologically Inspired Security Systems: A Comparison With Traditional Approaches | 2003 | Invited Paper: SFI Workshop: Resilient and Adaptive Defense of Computing Networks 2003 | inproceedings | URL |
| Abstract: 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. | |||||
BibTeX:
@inproceedings{Goel2003,
author = {Sanjay Goel and Stephen F. Bush},
title = {Kolmogorov Complexity Estimates For Detection Of Viruses In Biologically Inspired Security Systems: A Comparison With Traditional Approaches},
booktitle = {Invited Paper: SFI Workshop: Resilient and Adaptive Defense of Computing Networks 2003},
publisher = {Santa Fe Institute, Santa Fe, NM},
year = {2003},
url = {http://www.research.ge.com/~bushsf/pdfpapers/ImmunoComplexity.pdf}
}
|
|||||
| Hershey, J. & Bush, S.F. | On Respecting Interdependence Between Queuing Policy and Message Value | 1999 | (99CRD151) | techreport | URL |
| Abstract: Dynamic reprioritization of a message based on simple heuristics and the knowledge of already sent messages, messages in queue, and, perhaps, messages expected should be a element of consideration for intelligent networks supporting those endeavors that may well expect stressed and degraded communications capacity. Additionally, the use of simple computational heuristics may serve well in effecting admittedly suboptimal but highly efficacious queuing policies. The discipline of active networks is suggested as an appropriate superfield for cabining these activities. | |||||
BibTeX:
@techreport{Hershey1999,
author = {John Hershey and Stephen F. Bush},
title = {On Respecting Interdependence Between Queuing Policy and Message Value},
year = {1999},
number = {99CRD151},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Kulkarni, A.B. & Bush, S.F. | Active Network Management and Kolmogorov Complexity | 2001 | Proceedings of IEEE OpenArch 2001 | inproceedings | URL |
| Abstract: This paper seeks to describe new and better ways to represent network health and thus attempts to explore concepts other than those based on network topology-based representations of network management. It examines the manner in which active network management can benefit from Algorithmic Information Theory. Due to the new paradigm and enhanced capabilities of active networks, this work proceeds along the lines that a new perspective that incorporates Algorithmic Information Theory can provide superior, innovative solutions for network management. | |||||
BibTeX:
@inproceedings{Kulkarni2001b,
author = {Amit B. Kulkarni and Stephen F. Bush},
title = {Active Network Management and Kolmogorov Complexity},
booktitle = {Proceedings of IEEE OpenArch 2001},
year = {2001},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Kulkarni, A.B. & Bush, S.F. | Active Network Management, Kolmogorov Complexity, and Streptichrons | 2000 | (2000CRD107) | techreport | URL |
| Abstract: This report discusses the goals and requirements that drive the architecture for an active network. The active network management framework refers to the minimum model that describes components and interactions necessary to support management via an active network. An overview of the management architecture for today's passive networks is discussed as a prelude to the presenting a new active network management model. Finally, the new active network management model is developed a step further into the initial exploration of emergent behavior within an active network. | |||||
BibTeX:
@techreport{Kulkarni2000,
author = {Amit B. Kulkarni and Stephen F. Bush},
title = {Active Network Management, Kolmogorov Complexity, and Streptichrons},
year = {2000},
number = {2000CRD107},
url = {http://www.research.ge.com/~bushsf}
}
|
|||||
| Kulkarni, A.B., Bush, S.F. & Evans, S.C. | Detecting Distributed Denial-of-Service Attacks using Kolmogorov Complexity Metrics | 2001 | (2001CRD176) | techreport | URL |
| Abstract: This paper describes an approach to detecting distributed denial of service (DDoS) attacks that is based on fundamentals of information theory, specifically Kolmogorov complexity. The algorithm is based on a concept of Kolmogorov complexity that states that the joint complexity measure of random strings is lower than the sum of the complexities of the individual strings if the strings exhibit some correlation. Furthermore, the joint complexity measure varies inversely with the amount of correlation. The proposed algorithm exploits this feature to correlate traffic flows in the network and detect possible denial-of-service attacks. One of the strengths of this algorithm is that it does not require special filtering rules and hence it can be used to detect any type of DDoS attack. This algorithm is shown to perform better than simple packet-counting or load-measuring approaches. | |||||
BibTeX:
@techreport{Kulkarni2001a,
author = {Amit B. Kulkarni and Stephen F. Bush and Scott C. Evans},
title = {Detecting Distributed Denial-of-Service Attacks using Kolmogorov Complexity Metrics},
year = {2001},
number = {2001CRD176},
url = {http://www.research.ge.com/~bushsf/ftn/2001crd176.pdf}
}
|
|||||
Created by JabRef on 25/12/2008.