Skip to main content

Research Repository

Advanced Search

Towards Communication-Efficient Peer-to-Peer Networks (2024)
Conference Proceeding
Hourani, K., Moses Jr., W. K., & Pandurangan, G. (in press). Towards Communication-Efficient Peer-to-Peer Networks. . https://doi.org/10.4230/LIPIcs.ESA.2024.9

We focus on designing Peer-to-Peer (P2P) networks that enable efficient communication. Over the last two decades, there has been substantial algorithmic research on distributed protocols for building P2P networks with various desirable properties suc... Read More about Towards Communication-Efficient Peer-to-Peer Networks.

Awake Complexity of Distributed Minimum Spanning Tree (2024)
Conference Proceeding
Augustine, J., Moses Jr, W. K., & Pandurangan, G. (in press). Awake Complexity of Distributed Minimum Spanning Tree.

The \emph{awake complexity} of a distributed algorithm measures the number of rounds in which a node is awake. When a node is not awake, it is {\em sleeping} and does not do any computation or communication and spends very little resources. Reduci... Read More about Awake Complexity of Distributed Minimum Spanning Tree.

Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd (2024)
Conference Proceeding
Moses Jr., W. K., & Redlich, A. (2024). Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd. In ICDCN '24: Proceedings of the 25th International Conference on Distributed Computing and Networking (400-405). https://doi.org/10.1145/3631461.3632310

In this paper, we look at and expand the problems of dispersion and Byzantine dispersion of mobile robots on a graph, introduced by Augustine and Moses Jr. [ICDCN 2018] and by Molla, Mondal, and Moses Jr. [ALGOSENSORS 2020], respectively, to graphs w... Read More about Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd.