Cyber Orbits of Large Scale Network Traffic
Jeremy Kepner, Hayden Jananthan, Chasen Milner, Michael Houle, Michael Jones, Peter Michaleas, Alex Pentland

TL;DR
This paper introduces a physical analogy for large-scale network traffic analysis, using a cyber orbit model inspired by physical phenomena to better understand complex network behaviors.
Contribution
It presents a simplified physical interpretation of network traffic dynamics that avoids complex differential equations, offering new insights into network behavior modeling.
Findings
The probability of observing a source is proportional to 1/r(t)^2.
The cyber orbit analogy aligns with observed network source correlations.
Provides a new intuitive framework for analyzing massive network data.
Abstract
The advent of high-performance graph libraries, such as the GraphBLAS, has enabled the analysis of massive network data sets and revealed new models for their behavior. Physical analogies for complicated network behavior can be a useful aid to understanding these newly discovered network phenomena. Prior work leveraged the canonical Gull's Lighthouse problem and developed a computational heuristic for modeling large scale network traffic using this model. A general solution using this approach requires overcoming the essential mathematical singularities in the resulting differential equations. Further investigation reveals a simpler physical interpretation that alleviates the need for solving challenging differential equations. Specifically, that the probability of observing a source at a temporal ``distance'' at time is . This analogy aligns with many…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
