Measuring the effectiveness of the s-metric to produce better network models

Proceedings - Winter Simulation Conference

Volumn , Issue , 2008, Pages 1020-1028

  Beichl, Isabel ^a   Cloteaux, Brian ^a  

^a NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTONOMOUS SYSTEMS; COMPLEX NETWORKS; COMPUTATIONAL EXPERIMENTS; DEGREE DISTRIBUTIONS; IDENTICAL DEGREES; INTERNET TOPOLOGIES; NETWORK MODELS; NODE DEGREES; RANDOM MODELS; S-METRIC; STRUCTURAL CHARACTERISTICS; STRUCTURAL METRICS; STRUCTURAL NETWORKS;

EID: 60749130818     PISSN: 08917736     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WSC.2008.4736169     Document Type: Conference Paper

References (20)

1. Abu-Khzam, F. N., R. L. Collins, M. R. Fellows, M. A. Langston, W. H. Suters, and C. T. Symons. 2004. Kernelization algorithms for the vertex cover problem: Theory and experiments. In Proc. 6th ACM-SIAM ALENEX, 62-69: ACM-SIAM.
2. Amaral, L. A., A. Scala, M. Barthelemy, and H. E. Stanley. 2000, October. Classes of small-world networks. Proc Natl Acad Sci USA 97 (21): 11149-11152.
3. Barabási, A.-L., and R. Albert. 1999. Emergence of scaling in random networks. Science 286:509-512.
4. Beichl, I., and B. Cloteaux. 2008. Generating network models using the S-metric. In MSV '08: Proc. of the International Conference on Modeling, Simulation and Visualization Methods, 159-164.
5. Blitzstein, J. 2007. Program for generating random graphs with prescribed degrees. http://www.people.fas.harvard.edu/blitz/Site/Research-files/ GraphAlgorithmR.txt. Accessed 10/12/2007.
6. Blitzstein, J., and R Diaconis. 2006. A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Submitted to Annals of Applied Probability.
7. Faloutsos, M., P. Faloutsos, and C. Faloutsos. 1999. On power-law relationships of the internet topology. In SIGCOMM '99: Proc. of the conference on applications, technologies, architectures, and protocols for computer communication, 251-262. New York, NY, USA: ACM.
8. Garey, M. R., and D. S. Johnson. 1990. Computers and intractability; a guide to the theory of NP-completeness. New York, NY, USA: W. H. Freeman & Co.
9. Jeong, H., B. Tombor, R. Albert, Z. Oltvai, and A. L. Barabási. 2000, October. The large-scale organization of metabolic networks. Nature 407 (6804): 651-654.
10. Jerrum, M. 2003. Counting, sampling and integrating: Algorithms and complexity. Birkhauser.
11. Li, L., D. Alderson, J. C. Doyle, and W. Willinger. 2005. Towards a theory of scale-free graphs: Definition, properties, and implications. Internet Mathematics 2 (4): 431-523.
12. Newman, M.E.J. 2002, Oct. Assortative mixing in networks. Physical Review Letters 89 (20): 208701.
13. Potanin, A., J. Noble, M. Frean, and R. Biddle. 2005. Scalefree geometry in OO programs. Communications of the ACM 48 (5): 99-103.
14. Sriram, K., D. Montgomery, O. Borchert, O. Kim, and D. R. Kuhn. 2006, October. Study of BGP peering session attacks and their impacts on routing performance. IEEE Journal on Selected Areas in Communications 24 (10): 1901-1915.
15. Tangmunarunkit, H., R. Govindan, S. Jamin, S. Shenker, and W. Willinger. 2002. Network topology generators: degree-based vs. structural. SIGCOMM Comput. Commun. Rev. 32 (4): 147-159.
16. Tarjan, R. 1972. Depth-first search and linear graph algorithms. SIAM Journal on Computing 1 (2): 146-160.
17. UCLA 2008. UCLA internet topology collection. http://irl.cs.ucla.edu/ topology. Accessed 1/14/2008.
18. Vazirani, V. V. 2001. Approximation algorithms. Springer.
19. Watts, D. J., and S. H. Strogatz. 1998. Collective dynamics of 'small-world' networks. Nature 393:440-442.
20. Williams, R. J., and N. D. Martinez. 2000, March. Simple rules yield complex food webs. Nature 404 (6774): 180-183.