Advanced search
1 file | 185.81 KB

Applying branching processes to delay-tolerant networks

Author
Organization
Abstract
Mobility models that have been used in the past to study delay tolerant networks (DTNs) have been either too complex to allow for deriving analytical expressions for performance measures, or have been too simplistic. In this paper we identify several classes of DTNs where the dynamics of the number of nodes that have a copy of some packet can be modeled as branching process with migration. Using recent results on such processes in a random environment, we obtain explicit formulae for the first two moments of the number of copies of a file that is propagated in the DTN, for quite general mobility models. Numerical examples illustrate our approach.
Keywords
IMMIGRATION, RANDOM ENVIRONMENT, QUEUES, TIMES

Downloads

  • bionets.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 185.81 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Fiems, Dieter, and Eitan Altman. 2009. “Applying Branching Processes to Delay-tolerant Networks.” In Lecture Notes of the Institute for Computer Science, Social Informatics and Telecommunications Engineering, ed. E Altman, I Carrera, R ElAzouzi, E Hart, and Y Hayel, 39:117–125. Berlin, Germany: Springer.
APA
Fiems, D., & Altman, E. (2009). Applying branching processes to delay-tolerant networks. In E Altman, I. Carrera, R. ElAzouzi, E. Hart, & Y. Hayel (Eds.), LECTURE NOTES OF THE INSTITUTE FOR COMPUTER SCIENCE, SOCIAL INFORMATICS AND TELECOMMUNICATIONS ENGINEERING (Vol. 39, pp. 117–125). Presented at the 4th International conference on Bio-Inspired Models of Network, Information, and Computer Systems (BIONETICS 2009), Berlin, Germany: Springer.
Vancouver
1.
Fiems D, Altman E. Applying branching processes to delay-tolerant networks. In: Altman E, Carrera I, ElAzouzi R, Hart E, Hayel Y, editors. LECTURE NOTES OF THE INSTITUTE FOR COMPUTER SCIENCE, SOCIAL INFORMATICS AND TELECOMMUNICATIONS ENGINEERING. Berlin, Germany: Springer; 2009. p. 117–25.
MLA
Fiems, Dieter, and Eitan Altman. “Applying Branching Processes to Delay-tolerant Networks.” Lecture Notes of the Institute for Computer Science, Social Informatics and Telecommunications Engineering. Ed. E Altman et al. Vol. 39. Berlin, Germany: Springer, 2009. 117–125. Print.
@inproceedings{1008235,
  abstract     = {Mobility models that have been used in the past to study delay tolerant networks (DTNs) have been either too complex to allow for deriving analytical expressions for performance measures, or have been too simplistic. In this paper we identify several classes of DTNs where the dynamics of the number of nodes that have a copy of some packet can be modeled as branching process with migration. Using recent results on such processes in a random environment, we obtain explicit formulae for the first two moments of the number of copies of a file that is propagated in the DTN, for quite general mobility models. Numerical examples illustrate our approach.},
  author       = {Fiems, Dieter and Altman, Eitan},
  booktitle    = {LECTURE NOTES OF THE INSTITUTE FOR COMPUTER SCIENCE, SOCIAL INFORMATICS AND TELECOMMUNICATIONS ENGINEERING},
  editor       = {Altman, E and Carrera, I and ElAzouzi, R and Hart, E and Hayel, Y},
  isbn         = {9783642128073},
  issn         = {1867-8211},
  keyword      = {IMMIGRATION,RANDOM ENVIRONMENT,QUEUES,TIMES},
  language     = {eng},
  location     = {Avignon, France},
  pages        = {117--125},
  publisher    = {Springer},
  title        = {Applying branching processes to delay-tolerant networks},
  volume       = {39},
  year         = {2009},
}

Web of Science
Times cited: