• Publications
  • Influence
Achieving high utilization with software-driven WAN
We present SWAN, a system that boosts the utilization of inter-datacenter networks by centrally controlling when and how much traffic each service sends and frequently re-configuring the network's data plane to match current traffic demand. Expand
Information propagation in the Bitcoin network
In this paper we analyze how Bitcoin uses a multi-hop broadcast to propagate transactions and blocks through the network to update the ledger replicas. Expand
Geometric ad-hoc routing: of theory and practice
We propose a new geometric routing algorithm which is outstandingly efficient on practical average-case networks, however is also in theory asymptotically worst-case optimal for ad-hoc networks. Expand
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. Expand
Does topology control reduce interference?
Topology control in ad-hoc networks tries to lower node energy consumption by reducing transmission power and by confining interference, collisions and consequently retransmissions. Commonly lowExpand
Dynamic scheduling of network updates
We present Dionysus, a system for fast, consistent network updates in software-defined networks. Expand
The Complexity of Connectivity in Wireless Networks
We study the scheduling complexity of connectivity, i.e., the minimal amount of time required until a connected structure can be scheduled. Expand
Farsite: federated, available, and reliable storage for an incompletely trusted environment
Farsite is a secure, scalable file system that logically functions as a centralized file server but is physically distributed among a set of untrusted computers. Farsite provides file availabilityExpand
Gradient clock synchronization in wireless sensor networks
We propose the Gradient Time Synchronization Protocol (GTSP) which is designed to provide accurately synchronized clocks between neighbors. Expand
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
We show that taking α = 5π/6 is a necessary and sufficient condition to guarantee that network connectivity is preserved. Expand