Waxman graphs are a popular class of random graphs used for modelling the Internet topology, especially for the intra-domain part. When used for network modelling purposes their connectedness properties are particularly relevant, both for the characteristics of the realized graph and for the generation time. In this paper, the probability of obtaining a connected Waxman graph is derived analytically for the general case of nodes disposed over a rectangular area (as opposed to the special case of an underlying square area already investigated in the literature) and is related to the values of the Waxman parameters used in the generation of the graph. (c) 2005 Elsevier B.V. All rights reserved.
Naldi, M. (2005). Connectivity of Waxman topology models. COMPUTER COMMUNICATIONS, 29(1), 24-31 [10.1016/j.comcom.2005.01.017].
Connectivity of Waxman topology models
NALDI, MAURIZIO
2005-01-01
Abstract
Waxman graphs are a popular class of random graphs used for modelling the Internet topology, especially for the intra-domain part. When used for network modelling purposes their connectedness properties are particularly relevant, both for the characteristics of the realized graph and for the generation time. In this paper, the probability of obtaining a connected Waxman graph is derived analytically for the general case of nodes disposed over a rectangular area (as opposed to the special case of an underlying square area already investigated in the literature) and is related to the values of the Waxman parameters used in the generation of the graph. (c) 2005 Elsevier B.V. All rights reserved.File | Dimensione | Formato | |
---|---|---|---|
Naldi-CC-2005.pdf
solo utenti autorizzati
Dimensione
286.06 kB
Formato
Adobe PDF
|
286.06 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.