Deductive Way of Reasoning about the Internet AS Level Topology
D\'avid Szab\'o, Attila K\H{o}r\"osi, J\'ozsef B\'ir\'o, Andr\'as, Guly\'as

TL;DR
This paper introduces a deductive reasoning approach to analyze the Internet's AS topology, providing new insights into its structure beyond traditional inductive models.
Contribution
It proposes a novel deductive framework for understanding AS topology, complementing existing inductive models and introducing the YEAS model for topology generation.
Findings
Deductive approach reveals omnipresent subgraphs and peering likelihoods.
YEAS model generates topologies with traditional and new metrics.
Complementary insights into AS topology properties.
Abstract
Our current understanding about the AS level topology of the Internet is based on measurements and inductive-type models which set up rules describing the behavior (node and edge dynamics) of the individual ASes and generalize the consequences of these individual actions for the complete AS ecosystem using induction. In this paper we suggest a third, deductive approach in which we have premises for the whole AS system and the consequences of these premises are determined through deductive reasoning. We show that such a deductive approach can give complementary insights into the topological properties of the AS graph. While inductive models can mostly reflect high level statistics (e.g. degree distribution, clustering, diameter), deductive reasoning can identify omnipresent subgraphs and peering likelihood. We also propose a model, called YEAS, incorporating our deductive analytical…
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.
