BIFURCATIONS AND CHAOS IN A PERIODICALLY PROBED COMPUTER NETWORK
| Autor: | Edward Ott, Brian R. Hunt, Ian Frommer, Eric J. Harder, Ryan Lance, James A. Yorke |
|---|---|
| Rok vydání: | 2009 |
| Předmět: |
business.industry
Network packet Applied Mathematics Lyapunov exponent Function (mathematics) Bifurcation diagram Measure (mathematics) Connection (mathematics) Piecewise linear function symbols.namesake Modeling and Simulation symbols business Engineering (miscellaneous) Bifurcation Computer network Mathematics |
| Zdroj: | International Journal of Bifurcation and Chaos. 19:3129-3141 |
| ISSN: | 1793-6551 0218-1274 |
| DOI: | 10.1142/s0218127409024700 |
| Popis: | In this paper we model a computer network consisting of one standard Internet connection and one nonstandard connection that transmits uniformly sized bursts of packets at regular intervals. The nonstandard connection can represent probing activity of either a diagnostic measurement or attack. Using bifurcation diagrams, we study how the network's behavior changes as a function of the probing frequency. These diagrams reveal interesting, nonintuitive behavior. We present a series of models of increasing simplicity that capture the significant features of the network's behavior. Our simplest model is a piecewise linear, discontinuous one-dimensional map. This map helps explain the structure of the bifurcation diagram, and allows us to directly determine Lyapunov exponents, which give a measure of the system's predictability. As a result, we are able to more precisely describe and categorize the dynamics, including chaos, exhibited by this network. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|