Suppose that we sequentially place n balls into n boxes by putting each ball into a randomly chosen box. It is well known that when we are done, the fullest box has with high probability (1 + o(1))… (More)
We develop a framework that allows us to address the issues of admission control and routing in high-speed networks under the restriction that once a call is admitted and routed, it has to proceed to… (More)
In this paper we study the problem of on-line allocation of routes to virtual circuits (both <italic>point-to-point</italic> and <italic>multicast</italic>) where the goal is to route all requests… (More)
The essence of the simplest buy-at-bulk network design problem is buying network capacity "whole-sale" to guarantee connectivity from all network nodes to a certain central network switch. Capacity… (More)
Let <i>X=[1,2,•••,n]</i> be a ground set of <i>n</i> elements, and let <i>S</i> be a family of subsets of <i>X</i>, <i>|S|=m</i>, with a positive cost <i>c<sub>S</sub></i>… (More)
Consider the on-line problem where a number of servers are ready to provide service to a set of customers. Each customer's job can be handled by any of a <italic>subset</italic> of the servers.… (More)
Experimental evidence suggests that spectral techniques are valuable for a wide range of applications. A partial list of such applications include (i) semantic analysis of documents used to cluster… (More)
We study a wide range of online graph and network optimization problems, focusing on problems that arise in the study of connectivity and cuts in graphs. In a general online network design problem,… (More)
In this paper we study an idealized problem of on-line allocation of routes to virtual circuits where the goal is to minimize the required bandwidth. For the case where virtual circuits continue to… (More)
A recent seminal result of Racke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Racke's construction is… (More)