### Abstract

We consider here a model of temporal networks, the links of which are available only at certain moments in time, chosen randomly from a subset of the positive integers. We define the notion of the Temporal Diameter of such networks. We also define fast and slow such temporal networks with respect to the expected value of their temporal diameter. We then provide a partial characterization of fast random temporal networks. We also define the critical availability as a measure of periodic random availability of the links of a network, required to make the network fast. We finally give a lower bound as well as an upper bound on the (critical) availability.

Original language | English (US) |
---|---|

Pages (from-to) | 109-120 |

Number of pages | 12 |

Journal | Journal of Parallel and Distributed Computing |

Volume | 87 |

DOIs | |

State | Published - Jan 1 2016 |

### Keywords

- Availability
- Diameter
- Random input
- Temporal networks

### ASJC Scopus subject areas

- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Artificial Intelligence

## Fingerprint Dive into the research topics of 'Ephemeral networks with random availability of links: The case of fast networks'. Together they form a unique fingerprint.

## Cite this

*Journal of Parallel and Distributed Computing*,

*87*, 109-120. https://doi.org/10.1016/j.jpdc.2015.10.002