• Publications
  • Influence
Complexity of network synchronization
The problem of simulating a synchronous network by an asynchronous network is investigated. A new simulation technique, referred to as a synchronizer, which is a new, simple methodology for designingExpand
  • 693
  • 46
  • PDF
The Price of Routing Unsplittable Flow
The essence of the routing problem in real networks is that the traffic demand from a source to destination must be satisfied by choosing a single path between source and destination. The splittableExpand
  • 296
  • 42
  • PDF
Verifiable secret sharing and achieving simultaneity in the presence of faults
Verifiable secret sharing is a cryptographic protocol that allows one to break a secret in 11 pieccs and publicly distribute thcln to 11 people so that tile secret is reconstructible given onlyExpand
  • 748
  • 40
An on-demand secure routing protocol resilient to byzantine failures
An ad hoc wireless network is an autonomous self-organizing system ofmobile nodes connected by wireless links where nodes not in directrange can communicate via intermediate nodes. A common techniqueExpand
  • 601
  • 33
  • PDF
Universal stability results for greedy contention-resolution protocols
In this paper we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We focus on a basicExpand
  • 178
  • 29
  • PDF
Throughput-competitive on-line routing
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 toExpand
  • 362
  • 27
  • PDF
Sparse partitions
A collection of clustering and decomposition techniques that make possible the construction of sparse and locality-preserving representations for arbitrary networks is presented. The representationExpand
  • 304
  • 25
  • PDF
Buy-at-bulk network design
  • B. Awerbuch, Y. Azar
  • Computer Science
  • Proceedings 38th Annual Symposium on Foundations…
  • 19 October 1997
The essence of the simplest buy-at-bulk network design problem is buying network capacity "wholesale" to guarantee connectivity from all network nodes to a certain central network switch. Capacity isExpand
  • 182
  • 25
  • PDF
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
Minimal delay routing is a fundamental task in networks. Since delays depend on the (potentially unpredictable) traffic distribution, online delay optimization can be quite challenging. WhileExpand
  • 217
  • 25
  • PDF
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems
This paper develops linear time distributed algorithms for a class of problems in an asynchronous communication network. Those problems include Minimum-Weight Spanning Tree (MST), Leader Election,Expand
  • 374
  • 24
  • PDF