GridG: Synthesizing Realistic Computational Grids. Dong Lu , Peter A. Dinda Prescience Laboratory Department of Computer Science Northwestern University Evanston, IL 60201 . Outline. Why GridG? What is GridG? Topology generation Hierarchical vs. degree based?
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Dong Lu, Peter A. Dinda
Department of Computer Science
Evanston, IL 60201
Router (switching capacity)
Link (bw, latency)
Host (arch, numcpu, clock rate, osvendor, mem, disk,)
Power Law Internet Routers GridG Tiers
Rank -0.49 -0.51 -0.18
R2 0.94 0.89
Outdegree -2.49 -2.63 -3.4
R2 0.97 0.55
Eigen -0.18 -0.24 -0.23
R2 0.97 0.97
Hop-plot 2.84 2.88 1.64
R2 0.99 0.99
Notice Close Match
Rank law Outdegree law
This is a power law
Log-log plot of the derived Outdegree law. Perfect power law fit. So we can do Rank law Outdegree law.
Outdegree law Rank law
This is NOT a power law
Log-log plot of the derived Rank law. Not power law! So we can NOT do Outdegree law Rank law.
Corresponds well to the Faloutsos Internet data
We propose the following as the relationships among Internet topology power laws
New rank law
Outdegree power law
Hosts generated without considering Intra-host
correlation, each attribute follows its own distribution.
Hosts generated with considering Intra-host
Difficult to answer without measurement data
Difficult to acquire measurement data (see paper)
We would appreciate your help!
GridG is released online at:
Related RGIS project papers: