By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)

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.

Published in:

Integration Technology, 2007. ICIT '07. IEEE International Conference on

Date of Conference:

20-24 March 2007