Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Traffic Divergence Theory: An Analysis Formalism for Dynamic Networks (2404.03066v1)

Published 3 Apr 2024 in cs.MA, cs.NI, and math.DS

Abstract: Traffic dynamics is universally crucial in analyzing and designing almost any network. This article introduces a novel theoretical approach to analyzing network traffic dynamics. This theory's machinery is based on the notion of traffic divergence, which captures the flow (im)balance of network nodes and links. It features various analytical probes to investigate both spatial and temporal traffic dynamics. In particular, the maximal traffic distribution in a network can be characterized by spatial traffic divergence rate, which reveals the relative difference among node traffic divergence. To illustrate the usefulness, we apply the theory to two network-driven problems: throughput estimation of data center networks and power-optimized communication planning for robot networks, and show the merits of the proposed theory through simulations.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (65)
  1. C. Barakat et al., “Modeling internet backbone traffic at the flow level,” IEEE Transactions on Signal processing, vol. 51, no. 8, pp. 2111–2124, 2003.
  2. P. R. Jelenkovic and B. Melamed, “Algorithmic modeling of TES processes,” IEEE Transactions on Automatic Control, vol. 40, no. 7, pp. 1305–1312, 1995.
  3. I. W. Lee and A. O. Fapojuwo, “Stochastic processes for computer network traffic modeling,” Computer communications, vol. 29, no. 1, pp. 1–23, 2005.
  4. A. Nogueira et al., “Modeling network traffic with multifractal behavior,” Telecommunication Systems, vol. 24, no. 2, pp. 339–362, 2003.
  5. A. N. Dudin and V. I. Klimenok, “Optimal admission control in a queueing system with heterogeneous traffic,” Operations Research Letters, vol. 31, no. 2, pp. 108–118, 2003.
  6. F. Xia et al., “Exploring human mobility patterns in urban scenarios: A trajectory data perspective,” IEEE Communications Magazine, vol. 56, no. 3, pp. 142–149, 2018.
  7. T. Umer et al., “A dual ring connectivity model for VANET under heterogeneous traffic flow,” Wireless Personal Communications, vol. 98, no. 1, pp. 105–118, 2018.
  8. T. NISHANBAYEV and S. MAHMUDOV, “Model of distributing heterogeneous traffic flows in a software-defined network,” DEStech Transactions on Computer Science and Engineering, no. iteee, 2019.
  9. M. Macktoobian, F. Basciani, D. Gillet, and J.-P. Kneib, “Data-driven convergence prediction of astrobots swarms,” IEEE Transactions on Automation Science and Engineering, vol. 19, no. 2, pp. 747–758, 2021.
  10. M. Macktoobian, Z. Shu, and Q. Zhao, “Topology recoverability prediction for ad-hoc robot networks: A data-driven fault-tolerant approach,” IEEE Transactions on Signal and Information Processing over Networks, 2023.
  11. H. Abdi and L. J. Williams, “Principal component analysis,” Wiley interdisciplinary reviews: computational statistics, vol. 2, no. 4, pp. 433–459, 2010.
  12. A. o. Lakhina, “Structural analysis of network traffic flows,” in Joint international conference on Measurement and modeling of computer systems, 2004, pp. 61–72.
  13. R. Madan and P. S. Mangipudi, “Predicting computer network traffic: a time series forecasting approach using DWT, ARIMA and RNN,” in 11th International Conference on Contemporary Computing.   IEEE, 2018, pp. 1–5.
  14. A. M. Mohammed and A. F. Agamy, “A survey on the common network traffic sources models,” International Journal of Computer Networks (IJCN), vol. 3, no. 2, pp. 103–115, 2011.
  15. E. Papadogiannaki and S. Ioannidis, “A survey on encrypted network traffic analysis applications, techniques, and countermeasures,” ACM Computing Surveys (CSUR), vol. 54, no. 6, pp. 1–35, 2021.
  16. L. G. Latham II, “Network flow analysis algorithms,” Ecological Modelling, vol. 192, no. 3-4, pp. 586–600, 2006.
  17. L. R. Ford Jr, “Network flow theory,” Rand Corp Santa Monica Ca, Tech. Rep., 1956.
  18. S. Han et al., “The maximum flow problem of uncertain network,” Information Sciences, vol. 265, pp. 167–175, 2014.
  19. R. E. Tarjan, “Algorithms for maximum network flow,” in Netflow at Pisa.   Springer, 1986, pp. 1–11.
  20. P. Lammich and S. R. Sefidgar, “Formalizing the edmonds-karp algorithm,” in International Conference on Interactive Theorem Proving.   Springer, 2016, pp. 219–234.
  21. V. M. Malhotra et al., “An O(—V— 3) algorithm for finding maximum flows in networks,” Information Processing Letters, vol. 7, no. 6, pp. 277–278, 1978.
  22. J. B. Orlin, “Max flows in O(nm) time, or better,” in 45th Annual symposium on Theory of computing.   ACM, 2013, pp. 765–774.
  23. P. Kumar et al., “Semi-oblivious traffic engineering: The road not taken,” in 15th USENIX Symposium on Networked Systems Design and Implementation, 2018, pp. 157–170.
  24. E. W. Weisstein, “Adjacency matrix,” https://mathworld. wolfram. com/, 2007.
  25. N. Megiddo, “Optimal flows in networks with multiple sources and sinks,” Mathematical Programming, vol. 7, no. 1, pp. 97–107, 1974.
  26. R. Ahlswede et al., “Network information flow,” IEEE Transactions on information theory, vol. 46, no. 4, pp. 1204–1216, 2000.
  27. S. Carmi et al., “Transport in networks with multiple sources and sinks,” Europhysics Letters, vol. 84, no. 2, p. 28005, 2008.
  28. Y. Gu et al., “Detecting anomalies in network traffic using maximum entropy estimation,” in 5th SIGCOMM conference on Internet Measurement.   ACM, 2005, pp. 32–32.
  29. A.-L. Cheng et al., “Phase transitions in optimized network models,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2020, no. 9, p. 093404, 2020.
  30. I. Kotenko et al., “A technique for early detection of cyberattacks using the traffic self-similarity property and a statistical approach,” in 29th Euromicro International Conference on Parallel, Distributed and Network-Based Processing.   IEEE, 2021, pp. 281–284.
  31. A. Hagberg et al., “Exploring network structure, dynamics, and function using networkx,” Los Alamos National Lab., Tech. Rep., 2008.
  32. L. Beal et al., “Gekko optimization suite,” Processes, vol. 6, no. 8, p. 106, 2018.
  33. E. Leonardi et al., “Optimal scheduling and routing for maximum network throughput,” IEEE/ACM Transactions on Networking, vol. 15, no. 6, pp. 1541–1554, 2007.
  34. D. Johnson and G. Hancke, “Comparison of two routing metrics in OLSR on a grid based mesh network,” Ad Hoc Networks, vol. 7, no. 2, pp. 374–387, 2009.
  35. Q. Ma and P. Steenkiste, “Routing traffic with quality-of-service guarantees in integrated services networks,” in Workshop on Network and Operating Systems Support for Digital Audio and Video, 1998, p. 41.
  36. J. Sun et al., “Quantifying the impact of routing and scheduling on throughput for wireless networks,” in Military Communications Conference.   IEEE, 2015, pp. 732–737.
  37. J. Dong et al., “Secure high-throughput multicast routing in wireless mesh networks,” IEEE Transactions on Mobile Computing, vol. 10, no. 5, pp. 653–668, 2010.
  38. Y. Qin and J. He, “The impact on throughput of hierarchical routing in ad hoc wireless networks,” in International Conference on Communications, vol. 5.   IEEE, 2005, pp. 3010–3014.
  39. K. Zeng et al., “On end-to-end throughput of opportunistic routing in multirate and multihop wireless networks,” in 27th Conference on Computer Communications.   IEEE, 2008, pp. 816–824.
  40. A. B. Ahmed and A. B. Abdallah, “LA-XYZ: low latency, high throughput look-ahead routing algorithm for 3D network-on-chip architecture,” in 6th International Symposium on Embedded Multicore SoCs.   IEEE, 2012, pp. 167–174.
  41. H. Kim et al., “Clumsy flow control for high-throughput bufferless on-chip networks,” IEEE Computer Architecture Letters, vol. 12, no. 2, pp. 47–50, 2012.
  42. A. Bakhoda et al., “Throughput-effective on-chip networks for manycore accelerators,” in 43rd IEEE/ACM International Symposium on Microarchitecture.   IEEE, 2010, pp. 421–432.
  43. M. Xu et al., “Greening data center networks with throughput-guaranteed power-aware routing,” Computer Networks, vol. 57, no. 15, pp. 2880–2899, 2013.
  44. A. Kabbani et al., “Flowbender: Flow-level adaptive routing for improved latency and throughput in datacenter networks,” in 10th International on Conference on emerging Networking Experiments and Technologies.   ACM, 2014, pp. 149–160.
  45. S. A. Jyothi et al., “Measuring and understanding throughput of network topologies,” in International Conference for High Performance Computing, Networking, Storage and Analysis.   IEEE, 2016, pp. 761–772.
  46. A. Singla et al., “High throughput data center topology design,” in 11th USENIX Symposium on Networked Systems Design and Implementation, 2014, pp. 29–41.
  47. K. I. Munene et al., “A throughput drop estimation model for concurrent communications under partially overlapping channels without channel bonding and its application to channel assignment in IEEE 802.11 n wlan,” IEICE Transactions on Information and Systems, vol. 104, no. 5, pp. 585–596, 2021.
  48. N. Jain et al., “Maximizing throughput on a dragonfly network,” in International Conference for High Performance Computing, Networking, Storage and Analysis.   IEEE, 2014, pp. 336–347.
  49. R. Klöti et al., “Policy-compliant path diversity and bisection bandwidth,” in Conference on Computer Communications.   IEEE, 2015, pp. 675–683.
  50. P. Namyar et al., “A throughput-centric view of the performance of datacenter topologies,” in SIGCOMM Conference, 2021, pp. 349–369.
  51. N. G. Duffield et al., “A flexible model for resource management in virtual private networks,” in Conference on Applications, technologies, architectures, and protocols for computer communication, 1999, pp. 95–108.
  52. A. Singla et al., “Jellyfish: Networking data centers randomly,” in 9th USENIX Symposium on Networked Systems Design and Implementation, 2012, pp. 225–238.
  53. C. G. Requena et al., “Ruft: Simplifying the fat-tree topology,” in 14th International Conference on Parallel and Distributed Systems.   IEEE, 2008, pp. 153–160.
  54. A. Sinha et al., “Throughput-optimal broadcast in wireless networks with dynamic topology,” in 17th International Symposium on Mobile Ad Hoc Networking and Computing.   ACM, 2016, pp. 21–30.
  55. N. Saeed et al., “Point-to-point communication in integrated satellite-aerial 6G networks: State-of-the-art and future challenges,” IEEE Open Journal of the Communications Society, 2021.
  56. A. Rahman et al., “Controlled flooding in wireless ad-hoc networks,” in International Workshop on Wireless Ad-Hoc Networks.   IEEE, 2004, pp. 73–78.
  57. R. Ramanathan, “On the performance of ad hoc networks with beamforming antennas,” in 2nd International Symposium on Mobile Ad-hoc Networking & Computing.   ACM, 2001, pp. 95–105.
  58. H.-N. Dai et al., “An overview of using directional antennas in wireless networks,” International journal of communication systems, vol. 26, no. 4, pp. 413–448, 2013.
  59. V. Kumar et al., “Robot and sensor networks for first responders,” IEEE Pervasive Computing, vol. 3, no. 4, pp. 24–33, 2004.
  60. C. M. Clark et al., “Dynamic networks for motion planning in multi-robot space systems,” 2003.
  61. J. Choi et al., “Low-power low-VHF ad-hoc networking in complex environments,” IEEE Access, vol. 5, pp. 24 120–24 127, 2017.
  62. M. Macktoobian et al., “Learning optimal topology for ad-hoc robot networks,” IEEE Robotics and Automation Letters, vol. 8, no. 4, pp. 2181–2184, 2023.
  63. G. Lee and N. Y. Chong, “Decentralized formation control for small-scale robot teams with anonymity,” Mechatronics, vol. 19, no. 1, pp. 85–105, 2009.
  64. M. Macktoobian, D. Gillet, and J.-P. Kneib, “Astrobotics: swarm robotics for astrophysical studies,” IEEE Robotics & Automation Magazine, vol. 28, no. 3, pp. 92–101, 2021.
  65. ——, “Supervisory coordination of robotic fiber positioners in multi-object spectrographs,” IFAC-PapersOnLine, vol. 52, no. 3, pp. 61–66, 2019.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now