Mapping and visualizing the internet

2000 USENIX Annual Technical Conference

Volumn , Issue , 2000, Pages

  Cheswick, Bill ^a   Burch, Hal ^b   Branigan, Steve ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA VISUALIZATION; INFORMATION FILTERING;

DOMAIN INFORMATIONS; INTERNET DATA; INTERNET GRAPHS; LARGE PROBLEMS; MINIMUM DISTANCE; REACHABILITY; RESEARCH PURPOSE; SPANNING TREE;

TREES (MATHEMATICS);

EID: 85084160220     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. Burch, H,and Cheswick, W., “Mapping the Internet,” IEEE Computer, Vol, 32, No, 4, April 1999.
2. Burch, H, and Cheswick, W., “Tracing Anonymous Packets to Their Source by Selective Denial-of-Service Probes,” submitted to LISA.
3. Cheswick, W., Nonnenmacher, J., Sinha, R., and Varadhan, K., “Modeling Internet Topology,” Submitted to ACM Sigmetrics 2000.
4. Claffy, K., et al, “Internet Tomography,” Nature, January 7, 1999.
5. claffy, k., private communication
6. Cohen, J., “Drawing graphs to convey proximity: an incremental arrangement method,” ACM Transactions on Human-Computer Interaction 1997, v.4, no,3, p.197-229.
7. Di Battista, G., et al, “Graph Drawing,” p41-64, Prentice-Hall, 1999.
8. Eades, P., “A heuristic for graph drawing,” Congressus Numerantium, Vol, 42 p,149160, 1984.
9. Frick, A., Ludwig, A., and Mehldau, H., “A fast adaptive layout algorithm for undirected graphs,” Proceedings of Graph Drawing’94, 1995.
10. Govindan, R., and Tangmunarunkit, H., “Heuristics for Internet Map Discovery,” Technical Report 99-717, Computer Science Department, University of Southern California
11. Munzner, T., “H3: Laying Out Large Directed Graphs in 3D Hyperbolic Space,” Proceedings of the 1997 IEEE Symposium on Information Visualization, October 20-21 1997, pp 2-10, 1997.
12. Pansiot, J.-J. and Grad, D., “On routes and multicast trees in the Internet,” Proceedings of IEEE INFOCOM ’97, Apr 1997.
13. Russel, S. and Norvig, P., “Artificial Intelligence: A Modern Approach,” p, 111-114, Prentice-Hall
14. Shewchuk, J., “An Introduction to the Conjugate Gradient Method without the Agonizing Pain,” Carnegie Mellon University, School of Computer Science, unpublished paper
15. Stevens, W. Richard, TCP/IP Illustrated Volume 1, Addison Wesley, 1994, pps, 97-110.
16. Tunkelange, D., “JIGGLE: Java Interactive Graph Layout Environment,” Proceedings of Graph Drawing ‘98, 1998.
17. http://graphics.Stanford.edu/munzner/h3/
18. http://www.mids.org/
19. http://www.caida.org/
20. http://www.internetweather.com/
21. http://www.cybergeography.org/
22. http://www.cs.bell-labs.com/"ches/map/index.html
23. http://www.cs.bell-labs.com/"ches/map/db.gz
24. http://www.cs.bell-labs.com/"ches/map/lucent.mpeg
25. Wired, December 1998.
26. ’’Cartography”, National Geographic, Jan, 2000.
27. http://www.peacockmaps.com/
28. ftp://ftp.merit.edu/routing.arbiter/radb/dbase/