We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
Chiranjeeb Buragohain, Subhash Suri, Csaba D. T&oa...
Clusters of workstations have become a cost-effective means of performing scientific computations. However, large network latencies, resource sharing, and heterogeneity found in ...
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...