Sampling large Internet topologies for simulation purposes

Computer Networks

Volumn 51, Issue 15, 2007, Pages 4284-4302

  Krishnamurthy, Vaishnavi ^a   Faloutsos, Michalis ^a   Chrobak, Marek ^a   Cui, Jun Hong ^b   Lao, Li ^c   Percus, Allon G ^d  

^a University of California Riverside   (United States)

^b UNIVERSITY OF CONNECTICUT   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Graph modeling; Graph properties; Graph sampling

Indexed keywords

COMPUTATIONAL METHODS; GRAPH THEORY; MATHEMATICAL MODELS; MULTICASTING; NETWORK ROUTING; PROBLEM SOLVING;

GRAPH MODELING; GRAPH PROPERTIES; GRAPH SAMPLING;

INTERNET;

EID: 34548022329     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2007.06.004     Document Type: Article

References (49)

1. Aiello W., Chung F., and Lu L. A random graph model for massive graphs. STOC (2000)
2. Albert R., and Barabasi A. Statistical mechanics of complex networks. Review of Modern Physics (2002)
3. Ballardie A. Core Based Trees (CBT): an architecture for scalable inter-domain multicast routing. ACM SIGCOMM (1993)
4. A. Ballardie, Core Based Trees (CBT) multicast border router specification, 1997, Internet-draft: draft-ietf-idmr-cbt-br-spec-01.txt.
5. Barabasi A., and Albert R. Emergence of scaling in random networks. Science 8 (1999)
6. Battista G., Patrignani M., and Pizzonia M. Computing the types of the relationships between autonomous systems. IEEE INFOCOM (2003)
7. Billhartz T., Cain J.B., Farey-Goudreau E., Fieg D., and Batsell S.G. Performance and resource cost comparisons for CBT and PIM multicast routing protocols. IEEE Journal of Selected Areas in Communications 15 3 (1997) 304-315
8. Bu T., and Towsley D. On distinguishing between Internet power law topology generators. Infocom (2002)
9. Calvert K., Zegura E., and Doar M. Modeling Internet topology. IEEE Transactions on Communications (1997) 160-163
10. Kenneth L. Calvert, Ellen W. Zegura, Michael J. Donahoo, Core selection methods for multicast routing, in: Proceedings of the International Conference on Computer Communications and Networks (ICCCN), 1995.
11. R.C. Chalmers, K.C. Almeroth, Modeling the branching characteristics and efficiency gains in global multicast trees, in: Proceedings of IEEE INFOCOM'01, April 2001.
12. Chen Q., Chang H., Govindan R., Jamin S., Shenker S.J., and Willinger W. The origin of power laws in Internet topologies revisited. INFOCOM (2001)
13. Chuang J.C.-I., and Sirbu M.A. Pricing multicast communication: a cost-based approach. Telecommunication Systems 17 3 (2001) 281-297
14. X.A. Dimitropoulos, G.F. Riley, Creating realistic bgp models, in: Proceedings of the 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2003.
15. M. Doar, A better model for generating test networks, in: Proceedings of the Global Internet, IEEE, November 1996.
16. Fabrikant A., Koutsoupias E., and Papadimitriou C.H. Heuristically optimized trade-offs: a new paradigm for power laws in the internet (extended abstract). STOC (2002)
17. M. Faloutsos, P. Faloutsos, C. Faloutsos, On power-law relationships of the Internet topology, in: Proceedings of the ACM SIGCOMM, Cambridge, MA, September 1-3, 1999, pp. 251-262.
18. Floyd S., and Paxson V. Difficulties in simulating the internet. IEEE/ACM Transactions on Networking (2001)
19. National Laboratory for Applied Network Research, Online data and reports. Supported by NSF, 1998, http://www.nlanr.net.
20. L. Gao, On inferring autonomous system relationships in the Internet, in: Proceedings of the Global Internet, November 2000.
21. G.F. Riley, On standardized network topologies for network research, in: Simulation Conference 2002. Proceedings of the Winter, vol. 1, 2002, pp. 664-670.
22. Gkantsidis C., Mihail M., and Zegura E. Spectral analysis of Internet topologies. IEEE INFOCOM (2003)
23. Siganos G., Faloutsos M., Faloutsos P., and Faloutsos C. Power-laws of the Internet topology. IEEE/ACM Transactions on Networking (2003)
24. C. Jin, Q. Chen, S. Jamin, Inet: Internet topology generator, Technical Report UM CSE-TR-433-00, 2000.
25. Karger D. Randomization in graph optimization problems: a survey. Optima 58 (1998) 1-11
26. G. Karypis, Multilevel hypergraph partitioning, Technical Report, Department of Computer Science, University of Minnesota, 02-025, 2002.
27. G. Karypis, V. Kumar, A fast and high quality scheme for partitioning irregular graphs, Technical Report 95-035, Department of Computer Science, University of Minnesota, 1995.
28. V. Krishnamurthy, M. Faloutsos, M. Chrobak, L. Lao, J.H. Cui, A.G. Percus, Reducing large internet topologies for faster simulations, in: Proceedings of the IFIP Networking, Waterloo, Canada, 2005.
29. Jure Leskovec, Christos Faloutsos, Sampling from large graphs, in: Proceedings of the ACM SIGKDD'06, 2006, pp. 631-636.
30. L. Li, D. Alderson, W. Willinger, J. Doyle, R. Tanaka, S. Low, A first principles approach to understanding the Internet's router technology, in: Proceedings of the ACM SIGCOMM, 2004.
31. L. Subramanian, S. Agarwal, J. Rexford, R. Katz, Characterizing the Internet hierarchy from multiple vantage points, in: Proceedings of the IEEE INFOCOM, 2002.
32. D. Magoni, J.J. Pansiot, Internet topology modeler based on map sampling, in: Proceedings of the International Symposium on Computers and Communications, July 2002, pp. 1021-1027.
33. P. Mahadevan, D. Krioukov, K. Fall, A. Vahdat, Systematic topology analysis and generation using degree correlations, in: Proceedings of the ACM SIGCOMM, Pisa, Italy, 2006.
34. Mahadevan P., Krioukov D., Huffaker B., Dimitropoulos X., Claffy K.C., and Vahdat A. The internet AS-level topology: three data sources and one definitive metric. ACM SIGCOMM Computer Communication Review 36 1 (2006)
35. Medina A., Lakhina A., Matta I., and Byers J. Brite: an approach to universal topology generation. MASCOTS (2001)
36. Medina A., Matta I., and Byers J. On the origin of powerlaws in Internet topologies. ACM SIGCOMM Computer Communication Review 30 2 (2000) 18-34
37. Van Mieghem P., Hooghiemstra G., and van der Hofstad R. On the efficiency of multicast. IEEE/ACM Transactions on Networking 9 6 (2001)
38. Mitzenmacher M. A brief history of generative models for power law and lognormal distributions. Allerton (2001)
39. Newman M., Barabasi A.-L., and Watt D.J. The Structure and Dynamics of Networks (2006), Princeton Press
40. Palmer C.R., Gibbons P.B., and Faloutsos C. Anf: a fast and scalable tool for data mining in massive graphs. SIGKDD (2002)
41. G. Phillips, S. Shenker, H. Tangumanarunkit, Scaling of multicast trees: comments on the Chuang-Sirbu scaling law, in: ACM Computer Communication Review, Proceedings of ACM SIGCOMM '99 Conference, vol. 29(4), 1999, pp. 41-51.
42. M. Faloutsos Q. Yang, G. Siganos, S. Lonardi, Evolution versus intelligent design: comparing the topology of protein-protein interaction networks to the internet, in: Proceedings of the LSS Computational Systems Bioinformatics Conference (CSB'06), Stanford, CA, August 2006, pp. 299-310.
43. G.F. Riley, M.H. Ammar, R.M. Fujimoto, K. Perumalla, D. Xu, Distributed network simulations using the dynamic simulation backplan, in: Proceedings of the International Conference on Distributed Computing Systems 2001 (ICDCS'01), 2001.
44. Scheideler C. Probabilistic methods for coordination problems. HNI-Verlagsschriftenreihe vol. 78 (2000), University of Paderborn
45. Tangmurankit H., Govindan R., Jamin S., Shenker S.J., and Willinger W. Network topology generators: degree-based vs. structural. SIGCOMM (2002)
46. D. Thaler, D. Estrin, D. Meyer, Border gateway multicast protocol (BGMP): protocol specification, 1998, Internet-draft: draft-ietf-idmr-gum-02.txt.
47. L. Wei, D. Estrin, The trade-offs of multicast trees and algorithms, in: Proceedings of the International Conference on Computer Communications and Networks (ICCCN), 1994.
48. Zegura E., Calvert K., and Bhattacharjee S. How to model an Internetwork. IEEE INFOCOM (1996)
49. Zegura E.W., Calvert K.L., and Donahoo M.J. A quantitative comparison of graph-based models for Internetworks. IEEE/ACM Transactions on Networking 5 6 (1997)