On the Robustness of Interconnections in Random Graphs: A Symbolic Approach - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2000

On the Robustness of Interconnections in Random Graphs: A Symbolic Approach

Philippe Flajolet
  • Function : Author
  • PersonId : 829512
Kostas Hatzis
  • Function : Author
Sotiris Nikoletseas
  • Function : Author
Paul Spirakis
  • Function : Author

Abstract

Graphs are models of communication networks. This paper applies symbolic combinatorial techniques in order to characterize the interplay between two parameters of a random graph, namely its density (the number of edges in the graph) and its robustness to link failures. Here, robustness means multiple connectivity by short disjoint paths. We determine the expected number of ways to get from a source to a destination via two edge-disjoint paths of length $\ell$ in the classical random graph model $\G_n,p$. We then derive bounds on related threshold probabilities.
Fichier principal
Vignette du fichier
RR-4069.pdf (461.28 Ko) Télécharger le fichier

Dates and versions

inria-00072567 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072567 , version 1

Cite

Philippe Flajolet, Kostas Hatzis, Sotiris Nikoletseas, Paul Spirakis. On the Robustness of Interconnections in Random Graphs: A Symbolic Approach. [Research Report] RR-4069, INRIA. 2000. ⟨inria-00072567⟩
55 View
186 Download

Share

Gmail Facebook X LinkedIn More