• Publications
  • Influence
Network Coding for Distributed Storage Systems
TLDR
This paper shows how to optimally generate MDS fragments directly from existing fragments in the system, and introduces a new scheme called regenerating codes which use slightly larger fragments than MDS but have lower overall bandwidth use. Expand
Finishing flows quickly with preemptive scheduling
TLDR
It is demonstrated that PDQ significantly outperforms TCP, RCP and D3 in data center environments, and is stable, resilient to packet loss, and preserves nearly all its performance gains even given inaccurate flow information. Expand
Jellyfish: Networking Data Centers Randomly
TLDR
Jellyfish is a high-capacity network interconnect which, by adopting a random graph topology, yields itself naturally to incremental expansion, and is more cost-efficient than a fat-tree. Expand
VeriFlow: verifying network-wide invariants in real time
TLDR
VeriFlow is a layer between a software-defined networking controller and network devices that checks for network-wide invariant violations dynamically as each forwarding rule is inserted, and it is found that VeriFlow can perform rigorous checking within hundreds of microseconds per rule insertion. Expand
OpenDHT: a public DHT service and its uses
TLDR
This paper has created a public DHT service called OpenDHT, which aims to lower the barriers facing DHT-based applications and describes the variety of applications already using the system. Expand
Global Analytics in the Face of Bandwidth and Regulatory Constraints
TLDR
Geode supports all SQL operators, including Joins, across global data and uses 250× less bandwidth than centralized analytics in a Microsoft production workload and up to 360× less on popular analytics benchmarks including TPC-CH and Berkeley Big Data. Expand
PCC: Re-architecting Congestion Control for Consistent High Performance
TLDR
It is proved that PCC converges to a stable and fair equilibrium, and shows consistent and often 10× performance improvement, with better fairness and stability than TCP. Expand
Load balancing in dynamic structured P2P systems
TLDR
The simulation results show that in the face of rapid arrivals and departures of objects of widely varying load, the proposed distributed algorithm achieves load balancing for system utilizations as high as 90% while moving only about 8% of the load that arrives into the system. Expand
Network coding for distributed storage systems
TLDR
It is shown that there is a fundamental tradeoff between storage and repair bandwidth which is theoretically characterize using flow arguments on an appropriately constructed graph and regenerating codes are introduced that can achieve any point in this optimal tradeoff. Expand
PCC Vivace: Online-Learning Congestion Control
TLDR
It is established that Vivace significantly outperforms traditional TCP variants, the previous realization of the PCC framework, and BBR in terms of performance, convergence speed, alleviating bufferbloat, reactivity to changing network conditions, and friendliness towards legacy TCP in a range of scenarios. Expand
...
1
2
3
4
5
...