Heuristics for Internet map discovery
By Ramesh Govindan, Hongsuda Tangmunarunkit. Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 2000
826 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications, Hardware and Architecture
View Paper: https://www.semanticscholar.org/paper/5dbbe02a8d66028e38ae875f9687184e08fd0a75
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- T. Anderson
- David Wetherall
- Kang G. Shin
- Haining Wang
- Jennifer Rexford
- Yuval Shavitt
- Mark Crovella
- Alessandro Vespignani
In Computer Networks and Communications
- Jennifer Rexford
- David Wetherall
- Peter Druschel
- Anne-Marie Kermarrec
- Antony Ian Taylor Rowstron
- Mark Newman
- Alessandro Vespignani
- Miguel Oom Temudo de Castro
In Hardware and Architecture
- Jennifer Rexford
- Anukool Lakhina
- Mark Crovella
- Michalis Faloutsos
- Romualdo Pastor-Satorras
- Hal Burch
- Chen-Nee Chuah
- David Wetherall
Citations in the corpus
- Hop-count filtering: an effective defense against spoofed DDoS traffic (2003, background): “The recent Internet mapping efforts such as Internet Map [7], Mercator [18], Rocketfuel [38], and Skitter [8] projects, may make the approach plausible.”
- Towards IP geolocation using delay and topology measurements (2006, methodology): “We were able to identify 1,672 alias pairs using the Mercator technique and an additional 621 alias pairs using the IP-ID based scheme.”
- Evolution of networks (2001, methodology): “edu domain of the WWW [2]; 1i 0 and 1o 0 are from in- and out-degree distributions of the pages of the WWW scanned by Altavista in October 1999 [6, 90]; 1o 00 is the ®o value from another ®tting of the same data [61]; 1i 000 is ®i for domain level of the WWW in spring 1997 [117]; 2 is ® for the inte”
- Sampling biases in IP topology measurements (2003, methodology): “4To be precise, the authors of [3] concluded that while the degree distribution upto a degree of 30 displayed evidence for a power-law, the distribution of higher degrees was more diffused.”
- SplitStream: high-bandwidth multicast in cooperative environments (2003, methodology): “Mercator is a topology model with 102,639 routers, obtained from measurements of the Internet using the Mercator system [21].”
- IDMaps: a global internet host distance estimation service (2001, background): “The projects described in [6], [7], for example, provide snapshots of the Internet topology at the hop-by-hop level.”
- BRITE: Universal Topology Generation from a User''s Perspective (2001, background): “Such lack of accuracy is mainly due to the fact that mapping the Internet topology is a very challenging task [11, 23].”
- Evolution and Structure of the Internet: Index (2004, methodology): “org/tools/utilities/netgeo) to locate the geographical position of the routers mapped by the Mercator software (Govindan and Tangmunarunkit, 2000).”
- Practical network support for IP traceback (2000, background): “More advanced network maps [8, 23] can resolve this issue in an increasing number of cases.”
- Tracing Anonymous Packets to Their Approximate Source (2000, methodology): “We begin by creating a map of the routes from the victim (see Figure 2) to every network, using any known mapping technology [1, 6, 7].”
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications (2005, methodology): “…from traceroute experiments which record successive IP-hops along paths between selected network host computers (see for example the Mercator [45], Skitter [33], and Rocketfuel [90] projects), there remain a number of challenges when trying to reverse-engineer a network’s physical…”
- On inferring autonomous system relationships in the Internet (2000, background): “Several studies [6], [9] present heuristics on discovering the router adjacencies by”
- Bipartite Graphs as Models of Complex Networks (2003, background): “…received much attention and span quite well the variety of contexts in which complex networks appear: an Internet graph at router level [16, 32, 33] consisting of physical links between routers ; a web graph from Notre Dame university [5, 23] where web pages are linked by hyperlinks ; a…”
- A survey of fault localization techniques in computer networks (2004, methodology): “[30] infer the Internet map using hop-limited probes.”