A local algorithm is a distributed algorithm that runs in constant time, independently of the
size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the …

Bandwidth reservation can effectively improve the service quality for data transfers because
of dedicated network resources. However, it is difficult to achieve a desired tradeoff between …

Large SDN networks will be partitioned in multiple controller domains; each controller is
responsible for one domain, and the controllers of adjacent domains may need to …

The gap between the known randomized and deterministic local distributed algorithms
underlies arguably the most fundamental and central open question in distributed graph …

There are distributed graph algorithms for finding maximal matchings and maximal
independent sets in O (Δ+ log* n) communication rounds; here, n is the number of nodes …

This paper is centered on the complexity of graph problems in the well-studied LOCAL
model of distributed computing, introduced by Linial [FOCS'87]. It is widely known that for …

The question of what can be computed, and how efficiently, is at the core of computer
science. Not surprisingly, in distributed systems and networking research, an equally …

We show that any randomised Monte Carlo distributed algorithm for the Lovász local lemma
requires Omega (log log n) communication rounds, assuming that it finds a correct …

We study the problem of computing the diameter of a network in a distributed way. The
model of distributed computation we consider is: in each synchronous round, each node can …

We develop a general deterministic distributed method for locally rounding fractional
solutions of graph problems for which the analysis can be broken down into analyzing pairs …