Algorithms For Extracting Timeliness Graphs
Carole Delporte-Gallet (LIAFA), St\'ephane Devismes (VERIMAG - IMAG),, Hugues Fauconnier (LIAFA), Mikel Larrea

TL;DR
This paper introduces algorithms to approximate the timeliness graph in asynchronous message-passing systems, enabling processes to converge on a common graph structure like trees or rings based on communication delays.
Contribution
It presents a general extraction algorithm and a more efficient variant that minimizes message use on the extracted graph, improving understanding of network timeliness.
Findings
Algorithms successfully approximate the timeliness graph.
Processes converge to the same graph structure in finite time.
Communication-efficient algorithm reduces message overhead.
Abstract
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p; q) is an edge of the timeliness graph if the link from p to q is timely (that is, there is bound on communication delays from p to q). The main goal of this paper is to approximate this timeliness graph by graphs having some properties (such as being trees, rings, ...). Given a family S of graphs, for runs such that the timeliness graph contains at least one graph in S then using an extraction algorithm, each correct process has to converge to the same graph in S that is, in a precise sense, an approximation of the timeliness graph of the run. For example, if the timeliness graph contains a ring, then using an extraction algorithm, all correct processes eventually converge to the same ring and in this ring all nodes…
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.
