Active Virtual Network Management Prediction: Complexity as a Framework
for Prediction, Optimization, and Assurance
S. Bush. IEEE Computer Society Press, Proceedings of the 2002 DARPA Active
Networks Conference and Exposition (DANCE 2002), page 534--553. San Francisco, CA, (May 2002)ISBN 0-7695-1564-9.
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.
%0 Conference Paper
%1 Bush2002
%A Bush, Stephen F.
%B IEEE Computer Society Press, Proceedings of the 2002 DARPA Active
Networks Conference and Exposition (DANCE 2002)
%C San Francisco, CA
%D 2002
%K active networks
%P 534--553
%T Active Virtual Network Management Prediction: Complexity as a Framework
for Prediction, Optimization, and Assurance
%X 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.
@inproceedings{Bush2002,
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.},
added-at = {2007-06-20T15:45:52.000+0200},
address = {San Francisco, CA},
author = {Bush, Stephen F.},
biburl = {https://www.bibsonomy.org/bibtex/2cfd66f731df3bf4c2230e59172d1fbc4/bushsf},
booktitle = {IEEE Computer Society Press, Proceedings of the 2002 DARPA Active
Networks Conference and Exposition (DANCE 2002)},
interhash = {0ffcedb917b4d1af971a7078c5425ee2},
intrahash = {cfd66f731df3bf4c2230e59172d1fbc4},
keywords = {active networks},
month = May,
note = {ISBN 0-7695-1564-9},
owner = {200004965},
pages = {534--553},
timestamp = {2007-06-20T15:50:15.000+0200},
title = {Active Virtual Network Management Prediction: Complexity as a Framework
for Prediction, Optimization, and Assurance},
year = 2002
}