Zhanshan (Sam) Ma
ABSTRACT
The study of the First Passage Time (FPT) problem (also known as first passage problem, FPP) started more than a century ago, but its diverse applications in science and engineering mostly emerged in the last two to three decades. Assuming that X(t) is a one-dimensional stochastic process, the First Passage Time is defined as the time (T) when X(t) first crosses a threshold. Engineering reliability is obviously a suitable application domain, and indeed applications such as optimal dam design in hydrology and analysis of structural failure in civil and mechanical engineering are typical examples. Although we envision that the FPT problem has great potential in network and software reliability, it should be more useful for network security and survivability because the approaches developed for the FPT problem are mostly analytical. The assumption for this inference is that in reliability analysis, experimental or historical data are often more readily available, which makes statistical approaches such as survival analysis more convenient and likely more realistic. In contrast, data is generally more difficult to obtain in security and survivability analyses, and analytical approaches can be leveraged to play more important roles. Furthermore, security and survivability often have to deal with malicious actions that may be driven by sophisticated cognition and behavioral processes, which are highly variable over time and very difficult to detect with short term data. If the behavior of an intruder can be characterized with some stochastic process such as Brownian motion, then the FPT approach may be applied to find the closed-form solution of the probability density function (PDF) of the first passage time, which can be the time when the system breaks down or when the hacker is successful in compromising a network. In addition, the solutions to FPT depend on boundary and initial conditions of the corresponding partial differential equations, and they also describe the evolution of PDF over time. This may suggest that it is possible to model the behavior changes of an intruder over time and circumstances. Another advantage of FPT analysis is that it may help solve some non-Markov stochastic process problems in reliability analysis and survival analysis. In this article, we first briefly introduce the FPT problem with Brownian motion as an example, and then suggest its potential applications in software reliability and network security.
- Argyrakisa, P.&G. H. Weiss. A first-passage time problem for many random walkers. Physica A 363 (2006) 343--347.Google Scholar
- Aytug H., G. J. Koehler. 2000. New stopping criterion for genetic algorithms. European Journal of Operational Research 126:662--674.Google ScholarCross Ref
- Bachelier, L. 1900. Annales des Sciences de l'Ecole Superieure 17, 21.Google Scholar
- Blanchet, J. H., J. Liu. 2007. Rare-event simulation for a multidimensional random walk with t-distributed increment. Proc. of the 2007 IEEE Winter Simulation Conference. Google ScholarDigital Library
- Ching, J., J. L. Beck. 2007. Real-time reliability estimation for serviceability limit states in structures with uncertain dynamic excitation and incomplete output data. Probabilistic Engineering Mechanics 22 (2007) 50--62Google ScholarCross Ref
- Ding, M.&G. Rangarajan. 2004. First Passage Time Problem: A Fokker-Planck Approach. in "New Directions in Statistical Physics". ed by L. T. Wille. Springer. pp31--46.Google Scholar
- Duan, H., D. Wang, X. Yu. 2006. Markov Chains and Martingale Theory Based Convergence Proof of Ant Colony Algorithm and Its Simulation Platform. Proc. of the 6th World Cong. on Intelligent Control and Automation, June 21--23, 2006, Dalian, ChinaGoogle Scholar
- Gardiner, C. W. 1997. Handbook of Stochastic Methods. Springer.Google Scholar
- Giorno, V. A. G. Nobile, L. M. Ricciardib. 1997. BioSystems 40: 65--74Google Scholar
- Grimmet, G. R.&D. R. Stirzaker. 1994. Probability and Random Process. Oxford University Press, Oxford.Google Scholar
- Hill, T. L. 1989. Free energy transduction and biological cycle kinetics. Springer, New York.Google Scholar
- Hiromoto, R. E. 2007. An Iterative Monte Carlo Scheme with Relaxation. IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications. 6--8 September 2007.Google Scholar
- Karamchandani, N., D. Manjunath, D. Yogeshwaran and S. K. Iyer. 2006. Evolving Random Geometric Graph Models for Mobile Wireless Networks. 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.Google Scholar
- Kruzynski, M.&P. Chelminiak. 2002. Mean first-passage time in the stochastic theory of biochemical processes. Journal of Statistical Physics. 110:137--181.Google ScholarCross Ref
- Kulkarni, V. G. E. Tzenova. 2002. Mean first passage times in fluid queues. Operations Research Letters 30: 308--318. Google ScholarDigital Library
- Labou, M. 2003. Solution of the First Passage Problem by advanced Monte Carlo Simulation Technique. Strength of Materials, 35(6), 2003Google ScholarCross Ref
- Ma, Z., Z. Cao, W. Chen. 2008. A Fair Opportunistic Spectrum Access (FOSA) Scheme in Distributed Cognitive Radio Networks. 2008 IEEE Int. Conf. Comm.Google ScholarCross Ref
- Ma, Z. S. 2008. New approaches to reliability and survivability with survival analysis, dynamic hybrid fault models, and evolutionary game theory. PhD Dissertation, 177pp, University of Idaho, Moscow, ID, USA. Google ScholarDigital Library
- Ma, Z. S.&A. W. Krings. 2008a Multivariate Survival Analysis (I): Shared Frailty Approaches to Reliability and Dependence Modeling, Proc. 29th IEEE--AIAA Aerospace Conference, March 1--8, 2008, Big Sky, MT. 21 Pages.Google ScholarCross Ref
- Ma, Z. S.&A. W. Krings. 2008b. Dynamic hybrid fault models and their applications to wireless sensor networks. The 11-th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems. ACM MSWiM 2008. 9 pages. Google ScholarDigital Library
- Madhavan P.&M. Prasad. 2008. Fatigue reliability analysis of fixed offshore structures: A first passage problem approach. Journal of Zhejiang University Science A. 7(11):1839--1845Google ScholarCross Ref
- Nwankpa, C. O. 1992. The Search for An On-Line Dynamic Security Index. IEEE International Conference on Systems, Man and Cybernetics. Digital Object Identifier: 10.1109/ICSMC.1992.271644.Google Scholar
- Pichler, L, Pradlwarter H. J. 2008. Evolution of probability densities in the phase space for reliability analysis of nonlinear structures. doi:10.1016/j.strusafe.2008.09.002Google Scholar
- Pieper, V., Domine, M., Kurth, P. 1997. Level crossing problems and drift reliability. Mathematical Methods of Operations Research. 45:347--354.Google ScholarCross Ref
- Pr'ugel-Bennett, A. 2004. When a genetic algorithm outperforms hill-climbing. Theoretical Computer Science 320:135--153 Google ScholarDigital Library
- Rangarajan, G., M. Ding, M. Z. 2000. First passage time distribution for anomalous diffusion. Physics Letters A 273:322--330Google ScholarCross Ref
- Revelli, J. A. C. E. Budde, H. S. Wioa. 2006. Diffusion in fluctuating media: first passage time problem. Physics Letters A. 306 (2002) 104--109.Google Scholar
- Rinsaka, K and T. Dohi. 2004. Who Solved the Optimal Software Release Problems Based on Markovian Software Reliability Model? Proc. of the 47th IEEE International Midwest Symposium on Circuits and Systems.Google Scholar
- Rinsaka, K., K. Shibata, T. Dohi. 2006. Proportional Intensity-Based Software Reliability Modeling with Time-Dependent Metrics. Proceedings of the 30th Annual Int. Computer Software and Applications Conf. (COMPSAC'06). Google ScholarDigital Library
- Risken, K. 1989. The Fokker-Planck Equation. Springer.Google Scholar
- Shibata, K. K. Rinsaka, T. Dohi. 2006. Metrics-Based Software Reliability Models Using Non-homogeneous Poisson Processes. 17th International Symposium on Software Reliability Engineering (ISSRE'06) Google ScholarDigital Library
- Tuckwell, H. C. 1988. Introduction to theoretical neurobiology. Cambridge Univ. Press.Google Scholar
- Tuckwell, H. C. and F. Y. M. Wan. 2000. First Passage Time to Detection in Stochastic Population Dynamical Models for HIV-1. Applied Mathematics Letters 13 (2000) 79--83.Google ScholarCross Ref
- Wakuta, K. 2000. A First Passage Problem with multiple costs. Mathematical Methods of Operations Research. 51:419--32.Google ScholarCross Ref
- Wang, S. P., W. J. Pei, Z-Y. He. 2008. Random Walks On the Neural Network of C. elegans. IEEE Int. Conference Neural Networks&Signal Processing.Google Scholar
- Wang, S. P. W. J. Pei. 2008. First passage time of multiple Brownian particles on networks with applications. Physica A 387: 4699--4708Google ScholarCross Ref
- Wu, Y. and W. Fang. 2008. Stochastic averaging method for estimating first-passage statistics of stochastically excited Duffing--Rayleigh--Mathieu system. Acta Mech Sin. 24:575--582Google ScholarCross Ref
- Yuen, S. Y. and B. K. S. Cheung. 2006. Bounds for Probability of Success of Classical Genetic Algorithm Based on Hamming Distance. IEEE Trans. Evol. Comp. 10(1):1--18. Google ScholarDigital Library
- Zhao, W.&E. A. Elsayed. 2004. An Accelerated Life Testing Model Involving Performance Degradation. IEEE RAMS 2004.Google Scholar
- Zhua, W. Q. Z. L. Huang, M. L. Deng. 2003. First-passage failure and its feedback minimization of quasi-partially integrable Hamiltonian systems. International Journal of Non-Linear Mechanics 38:1133--1148Google ScholarCross Ref
Index Terms
- Introduction of first passage time (FPT) analysis for software reliability and network security
Recommendations
Detecting, validating and characterizing computer infections in the wild
IMC '11: Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conferenceAlthough network intrusion detection systems (IDSs) have been studied for several years, their operators are still overwhelmed by a large number of false-positive alerts. In this work we study the following problem: from a large archive of intrusion ...
Syntax vs. semantics: competing approaches to dynamic network intrusion detection
Malicious network traffic, including widespread worm activity, is a growing threat to internet-connected networks and hosts. In this paper, we consider both syntax and semantics based approaches for dynamic network intrusion detection. The semantics-...
Directions in Network-Based Security Monitoring
This article outlines some recently emerging research in network-based malicious software detection. The author discusses differences between traditional network intrusion detection and these new techniques, and highlights a new freely available tool ...
Comments