Inet-3.0: Internet Topology Generator
By Jared Winick, Sugih Jamin. 2002
413 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/105059877b534b8bef0499bc7949fa768ec5a4d1
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Jure Leskovec
- Charu C. Aggarwal
- Yoshua Bengio
- Bernhard Schölkopf
- Jon M. Kleinberg
- Zoubin Ghahramani
- William L. Hamilton
- Dacheng Tao
Citations in the corpus
- The internet AS-level topology: three data sources and one definitive metric (2005, unknown): “One can show that networks with the same JDDs have the same RCC.”
- Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication (2005, background): “The vast majority of recent models involve some form of preferential attachment [1, 2, 28, 15, 16]: new nodes join the graph at each time step, and preferentially connect to existing nodes with high degree (the “rich get richer”).”
- Kronecker Graphs: An Approach to Modeling Networks (2008, background): “Power laws have been found in the Internet (Faloutsos et al.,1999), the Web (Kleinberg et al., 1999; Broder et al., 2000), citation graphs (Redner, 1998), online social networks (Chakrabarti et al., 2004) and many others.”
- Scheduling distributed applications: the SimGrid simulation framework (2003, background): “Using snapshots of the Internet, simple power-laws of the Internet topology have been derived, leading to several public-domain generators of “representative” Internet topologies [19, 26, 36 ].”
- Systematic topology analysis and generation using degree correlations (2006, background): “…but then quickly decreases, and it is surely 1 in the limit of d = n, cf. the example in Section 3. with more sophisticated forms of annotations, in which case the dK-series would describe correlations among different types of nodes connected by different types of links within d-sized geometries.”
- The rich-club phenomenon in the Internet topology (2003, methodology): “The model [5] generates networks in three steps: 1) build a spanning tree with all nodes that have degrees greater than o ne, 2) connect all nodes with degree one to nodes in the spanning tree with a linear preference, and 3) connect the remaining f ree links in the spanning tree.”