Data-driven Intra-Autonomous Systems Graph Generator (2308.05254v2)
Abstract: Accurate modeling of realistic network topologies is essential for evaluating novel Internet solutions. Current topology generators, notably scale-free-based models, fail to capture multiple properties of intra-AS topologies. While scale-free networks encode node-degree distribution, they overlook crucial graph properties like betweenness, clustering, and assortativity. The limitations of existing generators pose challenges for training and evaluating deep learning models in communication networks, emphasizing the need for advanced topology generators encompassing diverse Internet topology characteristics. This paper introduces a novel deep-learning-based generator of synthetic graphs representing intra-autonomous in the Internet, named Deep-Generative Graphs for the Internet (DGGI). It also presents a novel massive dataset of real intra-AS graphs extracted from the project ITDK, called IGraphs. It is shown that DGGI creates synthetic graphs that accurately reproduce the properties of centrality, clustering, assortativity, and node degree. The DGGI generator overperforms existing Internet topology generators. On average, DGGI improves the MMD metric $84.4\%$, $95.1\%$, $97.9\%$, and $94.7\%$ for assortativity, betweenness, clustering, and node degree, respectively.
- “The impact of Internet policy and topology on delayed routing convergence” In Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No. 01CH37213) 1, 2001, pp. 537–546 IEEE
- Mehmet Hadi Gunes and Kamil Sarac “Importance of IP alias resolution in sampling Internet topologies” In 2007 IEEE Global Internet Symposium, 2007, pp. 19–24 IEEE
- “Graph Neural Networks for Communication Networks: Context, Use Cases and Opportunities” In IEEE Network IEEE, 2022
- Weiwei Jiang “Graph-based deep learning for communication networks: A survey” In Computer Communications Elsevier, 2021
- “Survey on machine learning for intelligent end-to-end communication toward 6G: From network access, routing to traffic control and streaming adaption” In IEEE Communications Surveys & Tutorials 23.3 IEEE, 2021, pp. 1578–1598
- Alexei Vázquez, Romualdo Pastor-Satorras and Alessandro Vespignani “Large-scale topological and dynamical properties of the Internet” In Physical Review E 65.6 APS, 2002, pp. 066130
- “Orbis: Rescaling Degree Correlations to Generate Annotated Internet Topologies” In Proceedings of the 2007 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM ’07 Association for Computing Machinery, 2007, pp. 325–336
- Giovanni Accongiagioco, Enrico Gregori and Luciano Lenzini “S-BITE: A Structure-Based Internet Topology gEnerator” In Computer Networks 77, 2015, pp. 73–89
- “Structural Decomposition Model for the Evolution of AS-Level Internet Topologies” In IEEE Access 8, 2020, pp. 175277–175296
- Khalid Bakhshaliyev and Mehmet Hadi Gunes “Generation of 2-mode scale-free graphs for link-level internet topology modeling” In Plos one 15.11 Public Library of Science San Francisco, CA USA, 2020
- Soon-Hyung Yook, Hawoong Jeong and Albert-László Barabási “Modeling the Internet’s large-scale topology” In Proceedings of the National Academy of Sciences 99.21 National Acad Sciences, 2002, pp. 13382–13386
- “Emergence of scaling in random networks” In science 286.5439 American Association for the Advancement of Science, 1999, pp. 509–512
- “BRITE: An approach to universal topology generation” In MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2001, pp. 346–353 IEEE
- Niema Moshiri “The dual-Barab\\\backslash\’asi-Albert model” In arXiv preprint arXiv:1810.10538, 2018
- “Competition and multiscaling in evolving networks” In EPL (Europhysics Letters) 54.4 IOP Publishing, 2001, pp. 436
- “Topology of evolving networks: local events and universality” In Physical review letters 85.24 APS, 2000, pp. 5234
- “A simple conceptual generator for the Internet graph” In 2010 17th IEEE Workshop on Local Metropolitan Area Networks (LANMAN), 2010, pp. 1–6
- Ahmed Elmokashfi, Amund Kvalbein and Constantine Dovrolis “On the scalability of BGP: The role of topology growth” In IEEE Journal on Selected Areas in Communications 28.8 IEEE, 2010, pp. 1250–1261
- Christopher L Hood and George F Riley “On predicting the performance characteristics of the NS-3 distributed simulator for scale-free internet models” In Proceedings of the 2015 Workshop on ns-3, 2015, pp. 54–59
- “Network performance anomaly detection and localization” In IEEE INFOCOM 2009, 2009, pp. 1377–1385 IEEE
- Brian Paul Swenson and George F Riley “Simulating large topologies in ns-3 using brite and cuda driven global routing” In Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques, 2013, pp. 159–166
- Muhammed Abdullah Canbaz, Khalid Bakhshaliyev and Mehmet Hadi Gunes “Router-level topologies of autonomous systems” In International Workshop on Complex Networks, 2018, pp. 243–257 Springer
- Matheus RF Mendonça, André MS Barreto and Artur Ziviani “Approximating network centrality measures using node embedding and machine learning” In IEEE Transactions on Network Science and Engineering 8.1 IEEE, 2020, pp. 220–230
- “Intrinsic correlation with betweenness centrality and distribution of shortest paths” In Mathematics 10.14 MDPI, 2022, pp. 2521
- “Complex network measurements: Estimating the relevance of observed properties” In IEEE INFOCOM 2008-The 27th Conference on Computer Communications, 2008, pp. 1660–1668 IEEE
- Réka Albert, Hawoong Jeong and Albert-László Barabási “Error and attack tolerance of complex networks” In nature 406.6794 Nature Publishing Group, 2000, pp. 378–382
- “A measurement study on overhead distribution of value-added Internet services” In Computer Networks 51.14 Elsevier, 2007, pp. 4153–4173
- Naoto Hidaka, Shin’ichi Arakawa and Masayuki Murata “A modeling method for ISP topologies based on network-cost optimization” In Fourth International Conference on Autonomic and Autonomous Systems (ICAS’08), 2008, pp. 169–174 IEEE
- Caio Dadauto, Nelson Saldanha da Fonseca and Ricardo Silva Torres “Internet Graphs (IGraphs)” IEEE Dataport, 2023 DOI: 10.21227/cnw0-ea27
- “The CAIDA Macroscopic Internet Topology Data Kit - 2020-08” URL: https://www.caida.org/catalog/datasets/internet-topology-data-kit
- “A kernel method for the two-sample-problem” In Advances in neural information processing systems 19, 2006
- “Graphrnn: Generating realistic graphs with deep auto-regressive models” In International conference on machine learning, 2018, pp. 5708–5717 PMLR
- “Characterization of complex networks: A survey of measurements” In Advances in physics 56.1 Taylor & Francis, 2007, pp. 167–242
- “Fast unfolding of communities in large networks” In Journal of statistical mechanics: theory and experiment 2008.10 IOP Publishing, 2008, pp. P10008
- “Graphvae: Towards generation of small graphs using variational autoencoders” In Artificial Neural Networks and Machine Learning–ICANN 2018: 27th International Conference on Artificial Neural Networks, Rhodes, Greece, October 4-7, 2018, Proceedings, Part I 27, 2018, pp. 412–422 Springer
- “Learning deep generative models of graphs” In arXiv preprint arXiv:1803.03324, 2018
- “On the properties of neural machine translation: Encoder–decoder approaches” In 8th Workshop on Syntax, Semantics and Structure in Statistical Translation, SSST 2014, 2014, pp. 103–111 Association for Computational Linguistics (ACL)
- “The internet topology zoo” In IEEE Journal on Selected Areas in Communications 29.9 IEEE, 2011, pp. 1765–1775
- Flemming Topsøe “Bounds for entropy and divergence for distributions over a two-element set” In J. Ineq. Pure & Appl. Math 2.2 Citeseer, 2001, pp. 300
- Diederik P Kingma JLB “Adam: A method for stochastic optimization” In 3rd international conference for learning representations, San Diego, 2015