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

Akrida, E.C.; Gąsieniec, L.; Mertzios, G.B.; Spirakis, P.G.

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 characterisation 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.

Citation

Akrida, E., Gąsieniec, L., Mertzios, G., & Spirakis, P. (2016). Ephemeral networks with random availability of links: The case of fast networks. Journal of Parallel and Distributed Computing, 87, 109-120. https://doi.org/10.1016/j.jpdc.2015.10.002

• Journal Article Type: Article
• Acceptance Date: Oct 14, 2015
• Online Publication Date: Oct 24, 2015
• Publication Date: Jan 1, 2016
• Deposit Date: Oct 22, 2015
• Publicly Available Date: Oct 24, 2016
• Journal: Journal of Parallel and Distributed Computing
• Print ISSN: 0743-7315
• Electronic ISSN: 1096-0848
• Publisher: Elsevier
• Peer Reviewed: Peer Reviewed
• Volume: 87
• Pages: 109-120
• DOI: https://doi.org/10.1016/j.jpdc.2015.10.002
• Keywords: Temporal networks, Random input, Diameter, Availability.
• Public URL: https://durham-repository.worktribe.com/output/1428413