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)
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)
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)
This paper considers the problem of distributively constructing a minimum-weight spanning tree (MST) for graphs of constant diameter in the bounded-messages model, where each message can contain at most <i>B</i> bits for some parameter <i>B</i>. It is shown that the time required to compute an MST for graphs of diameter 4 or 3 can be as high as(More)
We consider distributed algorithms for approximate maximum matching on general graphs. Our main result is a randomized (4 + &#949;)-approximation distributed algorithm for weighted maximum matching, whose running time is <i>O</i>(log <i>n</i>) for any constant &#949; &gt; 0, where <i>n</i> is the number of nodes in the graph. In addition, we consider the(More)