Characterizing the Internet hierarchy from multiple vantage points

By L. Subramanian, Sharad K. Agarwal, Jennifer Rexford, Randy Howard Katz. Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002

656 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/fe172acdd07a20688b0f50e597032a1f5d6248e2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Enhancing Privacy via Hierarchical Federated Learning (2020, background): “That is evidenced by the existence and active operation of hierarchical architectures within complex, large-scale systems such as the Internet [26].”
On selfish routing in Internet-like environments (2003, background): “Moreover, despite some recent progress towards understanding autonomous system relationships [17, 38 ], more research efforts are needed to develop realistic models for inter-domain routing policies.”
A model of Internet topology using k-shell decomposition (2006, background): “[24] suggested to look for loose cliques, but unlike [21, 22] used the graph topology without side information.”
Bipartite Graphs as Models of Complex Networks (2003, background): “…the the slope (increasing, decreasing or constant) of the plot which relates the average degree of the neighbors of nodes of degree k , to k [11, 63, 64], or with a single parameter (assortativity coeﬃcient), which may be positive (assortative networks), negative (dissortative networks) or null…”
Locating internet routing instabilities (2004, methodology): “To understand the effect of an arbitrary link failure, we randomly select a set of observation points and destination points by picking from tier-1 ISPs, tier-2 ISPs, ISPs with other ranks (based on ranking algorithm in [29]), and stub ASes based on a fixed proportion.”
Network topology generators: degree-based vs. structural (2002, background): “Two notable, and related, examples [18, 40], describe techniques for inf e ri g hierarchical relationships ( e.”
The rich-club phenomenon in the Internet topology (2003, methodology): “Subramanian et al [2], using a heuristic argument based on the commercial relationship between ASes, found that the Inter net has a tier structure.”
Collecting the internet AS-level topology (2005, methodology): “In this work, weassemblethe most completeAS-leveltopologyby extending theconventional method along twodimensions.”
Improving the Reliability of Internet Paths with One-hop Source Routing (2004, neutral): “[23].”
The internet AS-level topology: three data sources and one definitive metric (2005, neutral): “A number of methods have been proposed [41, 42] to annotate links in AS-level graphs thus incorporating AS relationship information.”
Towards capturing representative AS-level Internet topologies (2002, methodology): “Two recent independently published works [23,22] provide heuristics to infer inter-AS relationships from publicly available BGP data.”
Network Discovery and Verification (2005, background): “There is an extensive body of related work studying various aspects of this approach, see e.g. [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12].”
Power laws and the AS-level internet topology (2003, background): “More recently, several works have focused on describing the topology in a qualitatively way [53, 31, 32, 52].”