A Connectivity-Prior Model for Generating Connected Power Law Random Graphs with Prescribed Degree Sequence

Generating precise network topologies is an important issue for the purpose of simulating and evaluating networking applications. Recent research results reveal that the topology of Internet is neither a purely random network nor a hierarchical structure, but similar to complex networks obeying power law distributions. Under this condition, a practical degree-driven method is widely used for generating network topologies with prescribed degree sequence. To import random features, additional random transformations are required to perform upon the generated graph. In this paper, we propose a connectivity-prior algorithm to create a connected graph and develop a simple but efficient method to perform randomization operations to transform the generated graph. During the creating and transforming process, the graph is kept connected. We made experiments with the latest degree sequence data of the actually Internet topologies. The results show that our method works more efficiently.

[1]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[2]  A. Martin-Löf,et al.  Generating Simple Random Graphs with Prescribed Degree Distribution , 2006, 1509.06985.

[3]  S. Shenker,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM '02.

[4]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[5]  Zhang Yu,et al.  A Survey on Internet Topology Modeling , 2004 .

[6]  Matthieu Latapy,et al.  Efficient and simple generation of random simple connected graphs with prescribed degree sequence , 2005, J. Complex Networks.

[7]  Generating stationary random graphs on Z with prescribed i , 2006 .

[8]  Ellen W. Zegura,et al.  A quantitative comparison of graph-based models for Internet topology , 1997, TNET.

[9]  Walter Willinger,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM 2002.

[10]  Christos Gkantsidis,et al.  The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs , 2003, ALENEX.

[11]  Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees , 2006, Advances in Applied Probability.

[12]  Matthew Doar,et al.  A better model for generating test networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[13]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .