Some Problems in Compact Message Passing
Armando Casta\~neda (1), Jonas Lef\`evre (2), Amitabh Trehan (2), ((1) Instituto de Matem\'aticas, UNAM, Mexico,(2) Computer Science,, Loughborough University, UK)

TL;DR
This paper introduces the CMP model for distributed algorithms with sublinear memory, presenting solutions for classic problems and pioneering fully compact self-healing routing algorithms for memory-constrained networks.
Contribution
It defines the CMP model, introduces local compact functions, and develops the first fully compact self-healing routing algorithm for low-memory distributed networks.
Findings
Solutions for leader election, tree construction, and traversal in CMP.
First fully compact self-healing routing algorithm.
Compact versions of Forgiving Tree and Thorup-Zwick routing.
Abstract
This paper seeks to address the question of designing distributed algorithms for the setting of compact memory i.e. sublinear bits working memory for arbitrary connected networks. The nodes in our networks may have much lower internal memory as compared to the number of their possible neighbours implying that a node may not be able to store all the IDs of its neighbours. These algorithms are useful for large networks of small devices such as the Internet of Things, for wireless or ad-hoc networks, and, in general, as memory efficient algorithms. We introduce the Compact Message Passing(CMP) model;an extension of the standard message passing model considered at a finer granularity where a node can interleave reads and writes with internal computations, using a port only once in a round. The interleaving is required for meaningful computations due to the low memory requirement and is akin…
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
TopicsDistributed systems and fault tolerance · Optimization and Search Problems · Mobile Ad Hoc Networks
