Generation and Analysis of Random Graphs to Model Internetworks
Megan Thomas, Ellen Witte Zegura · 1994
Graph models are commonly used in studying solutions to internetworking problems. This paper considers several random graph models that have been used to model internetworks, and considers ways to characterize the properties of these graphs. By matching the characteristics of the random graphs to the characteristics of real internetworks, more accurate modeling can be achieved. College of Computing Georgia Institute of Technology Atlanta, Georgia 30332--0280 1 Introduction Accompanying the rapidly increasing use of large networks and internetworks has been a corresponding growth in research on internetworking. Researchers working in internetwork communication generally adopt one of three methods to evaluate their ideas: ffl They implement their ideas on a real internetwork. This approach has obvious difficulties, including the problem of getting access to an internetwork of reasonable size that can tolerate experimentation. ffl They implement their ideas on a smaller network and e...