Ephemeral networks with random availability of links: The case of fast networks



Akrida, Eleni C ORCID: 0000-0002-1126-1623, Gasieniec, Leszek ORCID: 0000-0003-1809-9814, Mertzios, George B and Spirakis, Paul G
(2016) Ephemeral networks with random availability of links: The case of fast networks. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 87. 109 - 120.

[img] Text
JPDCpaper-accepted-version.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (300kB)
[img] Atom XML (admin)
2017-05-12T11:17:18Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-12T12:16:40Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-12T13:16:16Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-12T14:16:10Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-12T15:16:22Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-12T16:16:23Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-12T17:16:06Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-12T18:16:27Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-12T19:16:18Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-12T20:16:22Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-12T21:16:36Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-12T22:16:32Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-12T23:21:45Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-13T01:16:56Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-13T02:16:45Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-13T03:16:50Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-13T04:30:18Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-13T05:16:41Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-13T06:16:20Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-13T07:16:30Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-13T08:16:44Z.atom - Unspecified

Download (0B)
[img] Atom XML (admin)
2017-05-13T09:16:23Z.atom - Unspecified

Download (0B)

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.

Item Type: Article
Uncontrolled Keywords: Temporal networks, Random input, Diameter, Availability
Depositing User: Symplectic Admin
Date Deposited: 02 Feb 2017 09:57
Last Modified: 01 May 2021 13:10
DOI: 10.1016/j.jpdc.2015.10.002
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3001588