Dr Eleni Akrida eleni.akrida@durham.ac.uk
Associate Professor
Ephemeral networks with random availability of links: The case of fast networks
Akrida, E.C.; Gąsieniec, L.; Mertzios, G.B.; Spirakis, P.G.
Authors
L. Gąsieniec
Dr George Mertzios george.mertzios@durham.ac.uk
Associate Professor
P.G. Spirakis
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.
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 |
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 |
Files
Accepted Journal Article
(935 Kb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by-nc-nd/4.0/
Copyright Statement
© 2015 This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
You might also like
Narrowing and Stretching: Addressing the Challenge of Multi-track Programming
(2022)
Presentation / Conference Contribution
Temporal Flows in Temporal Networks
(2017)
Presentation / Conference Contribution
On Verifying and Maintaining Connectivity of Interval Temporal Networks
(2015)
Presentation / Conference Contribution
How fast can we reach a target vertex in stochastic temporal graphs?
(2019)
Presentation / Conference Contribution
Temporal vertex cover with a sliding time window
(2018)
Presentation / Conference Contribution
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search