Building Fastest Broadcast Trees in Periodically-Varying Graphs
Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro

TL;DR
This paper presents a method to construct fastest broadcast trees in periodically-varying graphs, addressing the challenge of optimizing broadcast duration in delay-tolerant networks with intermittent, arbitrarily long contacts.
Contribution
It introduces a novel approach to build fastest broadcast trees in time-varying graphs with periodic contacts, considering mixed contact durations and using temporal distance abstraction.
Findings
Successfully computes fastest broadcast trees in complex periodic graphs.
Addresses the challenge of mixed continuous and discontinuous contact segments.
Provides a framework for minimizing broadcast duration in delay-tolerant networks.
Abstract
Delay-tolerant networks (DTNs) are characterized by a possible absence of end-to-end communication routes at any instant. Still, connectivity can generally be established over time and space. The optimality of a temporal path (journey) in this context can be defined in several terms, including topological (e.g. {\em shortest} in hops) and temporal (e.g. {\em fastest, foremost}). The combinatorial problem of computing shortest, foremost, and fastest journeys {\em given full knowledge} of the network schedule was addressed a decade ago (Bui-Xuan {\it et al.}, 2003). A recent line of research has focused on the distributed version of this problem, where foremost, shortest or fastest {\em broadcast} are performed without knowing the schedule beforehand. In this paper we show how to build {\em fastest} broadcast trees (i.e., trees that minimize the global duration of the broadcast, however…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOpportunistic and Delay-Tolerant Networks · Caching and Content Delivery · Mobile Ad Hoc Networks
