Building a Reference Combinatorial Modelfor Dynamic Networks:Initial Results in Evolving Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport Année : 2003

Building a Reference Combinatorial Modelfor Dynamic Networks:Initial Results in Evolving Graphs

Résumé

Wireless technologies and the deployment of mobile and nomadic services are driving the emergence of complex ad-hoc networks, that have a highly dynamic behavior. Modeling such dynamics, and creating a reference model on which results could be compared and reproduced was stated as a fundamental issue by a recent NSF workshop on networking. In this paper, we show how the modeling of time-changes unsettles old questions and allows for new insights into central problems in networking, like routing metrics, connectivity, and spanning trees. Such modeling is made possible through evolving graphs, a simple combinatorial model which helps capture the behavior of dynamic networks over time.
Fichier principal
Vignette du fichier
RR-5041.pdf (314.6 Ko) Télécharger le fichier
Loading...

Dates et versions

inria-00071542 , version 1 (23-05-2006)

Identifiants

  • HAL Id : inria-00071542 , version 1

Citer

Afonso Ferreira. Building a Reference Combinatorial Modelfor Dynamic Networks:Initial Results in Evolving Graphs. RR-5041, INRIA. 2003. ⟨inria-00071542⟩
110 Consultations
115 Téléchargements

Partager

Gmail Facebook X LinkedIn More