Learn More
We consider two types of buffering policies that are used in network switches supporting QoS (Quality of Service). In the <italic>FIFO</italic> type, packets must be released in the order they arrive; the difficulty in this case is the limited buffer space. In the <italic>bounded-delay</italic> type, each packet has a maximum delay time by which it must be(More)
Motivated by a frequency assignment problem in cellular networks, we introduce and study a new coloring problem that we call Minimum Conflict-Free Coloring (Min-CF-Coloring). In its general form, the input of the Min-CF-coloring problem is a set system (X, S), where each S ∈ S is a subset of X. The output is a coloring χ of the sets in S that satisfies the(More)
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the <i>cover time</i> - the expected time required to visit every node in a graph at least once - and we show that for a large(More)
We use distributed computing tools to provide a new perspective on the behavior of cooperative biological ensembles. We introduce the <i>Ants Nearby Treasure Search (ANTS)</i> problem, a generalization of the classical cow-path problem [10, 20, 41, 42], which is relevant for collective foraging in animal groups. In the ANTS problem, <i>k</i> identical(More)
We consider a simple model for overlay networks, where all n processes are connected to all other processes, and each message contains at most O(log n) bits. For this model, we present a distributed algorithm which constructs a minimum-weight spanning tree in O(log log n) communication rounds, where in each round any process can send a message to every(More)
Motivated by real world networks and use of algorithms based on random walks on these networks we study the simple random walks on dynamic undirected graphs with fixed underlying vertex set, i.e., graphs which are modified by inserting or deleting edges at every step of the walk. We are interested in the expected time needed to visit all the vertices of(More)
In this paper we study gossip based information spreading with bounded message sizes. We use algebraic gossip to disseminate <i>k</i> distinct messages to all <i>n</i> nodes in a network. For arbitrary networks we provide a new upper bound for uniform algebraic gossip of <i>O</i>((<i>k</i> + log <i>n</i> + <i>D</i>)&#916;) rounds with high probability,(More)
We study a combinatorial geometric problem related to the design of wireless networks with directional antennas. Specifically, we are interested in necessary and sufficient conditions on such antennas that enable one to build a connected communication network, and in efficient algorithms for building such networks when possible. We formulate the problem by(More)