Active virtual network management prediction: complexity as a framework for prediction, optimization, and assurance

The paper considers the blending of computation and communication by means of complexity. The specific service examined 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.

[1]  Stephen F. Bush,et al.  Predicting resource demand in heterogeneous active networks , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

[2]  Stephen F. Bush,et al.  Active Networks and Active Network Management: A Proactive Management Framework , 2001 .

[3]  Stephen F. Bush,et al.  Active Network Management and Kolmogorov Complexity , 2001 .

[4]  Stephen F. Bush,et al.  Active Virtual Network Management Prediction , 2001 .

[5]  David L. Dowe,et al.  Minimum Message Length and Kolmogorov Complexity , 1999, Comput. J..

[6]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[7]  Stephen F. Bush,et al.  Information assurance through Kolmogorov complexity , 2001, Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01.

[8]  Paul M. B. Vitányi,et al.  The miraculous universal distribution , 1997 .

[9]  Stephen F. Bush,et al.  Symbol Compression Ratio for String Compression and Estimation of Kolmogorov Complexity , 2001 .

[10]  Proceedings DARPA Active Networks Conference and Exposition , 2002, Proceedings DARPA Active Networks Conference and Exposition.

[11]  Stephen F. Bush,et al.  Predicting and controlling resource usage in a heterogeneous active network , 2001, Proceedings Third Annual International Workshop on Active Middleware Services.

[12]  A. Barabasi,et al.  Parasitic computing , 2001, Nature.

[13]  Stephen F. Bush,et al.  Active Networks and Active Network Management , 2002, Network and Systems Management.

[14]  Gerald Q. Maguire,et al.  A predictive mobility management algorithm for wireless mobile computing and communications , 1995, Proceedings of ICUPC '95 - 4th IEEE International Conference on Universal Personal Communications.

[15]  S. F. Bush,et al.  Active Network Management, Kolmogorov Complexity, and Streptichrons , 2000 .