Network Topology Analysis and Internet Modelling with Nem

D. Magoni

References

  1. [1] B. Waxman, Routing of multipoint connections, IEEE Journalon Selected Areas in Communications, 6(9), 1998, 1617–1622. doi:10.1109/49.12889
  2. [2] E. Zegura, K. Calvert, & M. Donahoo, A quantitative com-parison of graph-based models for internetworks, IEEE/ACMTrans. on Networking, 5(6), 1997, 770–783. doi:10.1109/90.650138
  3. [3] M. Doar, A better model for generating test networks, Proc.IEEE GLOBECOM’96, London, November 1996, 86–93. doi:10.1109/GLOCOM.1996.586131
  4. [4] M. Faloutsos, P. Faloutsos, & C. Faloutsos, On power-law rela-tionships of the internet topology, Proc. ACM SIGCOMM’99,Cambridge, MA, August 1999, 251–262. doi:10.1145/316194.316229
  5. [5] R. Govindan & H. Tangmunarunkit, Heuristics for internetmap discovery, Proc. IEEE INFOCOM’00, Tel Aviv, Israel,March 2000, 1371–1380. doi:10.1109/INFCOM.2000.832534
  6. [6] D. Magoni & J.-J. Pansiot, Analysis of the autonomous systemnetwork topology, ACM Computer Communication Review,31(3), 2001, 26–37. doi:10.1145/505659.505663
  7. [7] C. Jin, Q. Chen, & S. Jamin, Inet: Internet topology generator,Technical Report CSE-TR-433-00, University of Michigan, AnnArbor, MI, 2000.
  8. [8] P. Radoslavov, H. Tangmunarunkit, H. Yu, R. Govindan,S. Shenker, & D. Estrin, On characterizing network topologiesand analyzing their impact on protocol design, Technical Report,University of Southern California, Los Angeles, CA, 2000.
  9. [9] W. Aiello, F. Chung, & L. Lu, A random graph model formassive graphs, Proc. ACM STOC’00, Portland, OR, 2000,171–180. doi:10.1145/335305.335326
  10. [10] A. Medina, I. Matta, & J. Byers, On the origin of power laws ininternet topologies, ACM Computer Communication Review,30(2), April 2000, 18–28. doi:10.1145/505680.505683
  11. [11] R. Albert & A.-L. Barab´asi, Topology of evolving networks:local events and universality, Physical Review Letters, 85, 2000,5234. doi:10.1103/PhysRevLett.85.5234
  12. [12] C. Palmer & G. Steffan, Generating network topologies thatobey power laws, Proc. IEEE GLOBECOM’00, San Francisco,CA, November 2000, 434–438. doi:10.1109/GLOCOM.2000.892042
  13. [13] The VINT project, network simulator (ns-2), UCB/LBNL,USC/ISI, Xerox PARC, available at http://www.isi.edu/nsnam/vint/.
  14. [14] Network simulator (OPNET), OPNET Technologies Inc., avail-able at http://www.opnet.com.
  15. [15] GloMoSim, Parallel Computing Laboratory, available athttp://pcl.cs.ucla.edu/projects/glomosim/.
  16. [16] H. Burch & B. Cheswick, Mapping the internet, IEEE Com-puter, 32(4), 1999, 97–98. doi:10.1109/2.755008
  17. [17] A.V. Aho, J.E. Hopcroft, & J.D. Ullman, Data structures andalgorithms (Addison-Wesley, 1983).
  18. [18] D. Magoni & J.-J. Pansiot, Internet topology modeler basedon map sampling, Proc. 7th IEEE Symp. Computers andCommunications, Giardini Naxos, Italy, July 2002, 1021–1027.
  19. [19] S. Baase, Computer algorithms, 2nd ed. (Addison-Wesley,1988).
  20. [20] M. Hoerdt & D. Magoni, Completeness of the internet coretopology collected by a fast mapping software, Proc. 11thInt. Conf. on Software, Telecommunications and ComputerNetworks, Split, Croatia, October 2003, 257–261.
  21. [21] A. Law & W. Kelton, Simulation modelling and analysis,3rd ed. (McGraw-Hill, 2000).
  22. [22] M. Matsumoto & T. Nishimura, Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random numbergenerator, ACM Trans. on Modeling and Computer Simulation,8(1), 1998, 3–30. doi:10.1145/272991.272995

Important Links:

Go Back