The Flooding Time in Random Graphs |
| |
| Authors: | Remco Van Der Hofstad Gerard Hooghiemstra Piet van Mieghem |
| |
| Affiliation: | (1) Information Technology and Systems, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands |
| |
| Abstract: | Based on our analysis of the hopcount of the shortest path between two arbitrary nodes in the class Gp (N) of random graphs, the corresponding flooding time is investigated. The flooding time TN (p) is the minimum time needed to reach all other nodes from one node. We show that, after scaling, the flooding time TN (p) converges in distribution to the two-fold convolution  (2*) of the Gumbel distribution function (z)=exp (–e–z), when the link density pN satisfies NpN/(log N)3   if N . |
| |
| Keywords: | flooding time Internet random graphs |
| 本文献已被 SpringerLink 等数据库收录！ |
|
