This paper studies the fundamental task of establishing routing paths in distributed networks.
We prove the existence of compact routing tables that store in each network-node few …

O (c+ d) steps using constant-size queues, where c is the congestion of the paths in the
network, and d is the length of the longest path. The proof, however, used the Lovász Local …

This paper deals with data management in computer systems in which the computing nodes
are connected by a relatively sparse network. We consider the problem of placing and …

Packet-scheduling is a particular challenge in wireless networks due to interference from
nearby transmissions. A distance-2 interference model serves as a useful abstraction here …

This book presents the history and state of the art of universal routing strategies, which can
be applied to networks independently of their respective topologies. It opens with a self …

In the interference scheduling problem, one is given a set of n communication requests
described by source–destination pairs of nodes from a metric space. The nodes correspond …

One of tha contra1 tasks of networking is packet-rouling when edge bandwidth is limited.
Tremendous progress has been achiavcd by separating the issue of routing into two …

In 1988, Leighton, Maggs and Rao proved a much celebrated result: that for any network,
given any collection of packets with a specified route for each packet, there exists an …

In tbis paper we study randomized algorithms for circuit switching on multistage networks
related to the butterfly. We devise algorithms that route messages by constructing circuits (or …

This paper addresses point-to-point packet routing in undirected networks, which is the most
important communication primitive in most networks. The main result proves the existence of …