• Publications
  • Influence
Securing ad hoc networks
This article takes advantage of the inherent redundancy in ad hoc networks-multiple routes between nodes-to defend routing against denial-of-service attacks and uses replication and new cryptographic schemes to build a highly secure and highly available key management service, which terms the core of this security framework. Expand
A multi-radio unification protocol for IEEE 802.11 wireless networks
The results show that under dynamic traffic patterns with realistic topologies, MUP significantly improves both TCP throughput and user perceived latency for realistic workloads. Expand
Vigilante: end-to-end containment of internet worms
Vigilante, a new end-to-end approach to contain worms automatically that addresses limitations of network-level techniques, can automatically contain fast-spreading worms that exploit unknown vulnerabilities without blocking innocuous traffic. Expand
Apollo: Scalable and Coordinated Scheduling for Cloud-Scale Computing
Efficiently scheduling data-parallel computation jobs over cloud-scale computing clusters is critical for job performance, system throughput, and resource utilization. It is becoming even moreExpand
Kineograph: taking the pulse of a fast-changing and connected world
Kineograph is a distributed system that takes a stream of incoming data to construct a continuously changing graph, which captures the relationships that exist in the data feed and supports graph-mining algorithms to extract timely insights from the fast-changing graph structure. Expand
Gandiva: Introspective Cluster Scheduling for Deep Learning
Gandiva is introduced, a new cluster scheduling framework that utilizes domain-specific knowledge to improve latency and efficiency of training deep learning models in a GPU cluster and achieves better utilization by transparently migrating and time-slicing jobs to achieve better job-to-resource fit. Expand
TimeStream: reliable stream computation in the cloud
This work advocates a powerful new abstraction called resilient substitution that caters to the specific needs in this new computation model to handle failure recovery and dynamic reconfiguration in response to load changes. Expand
MODIST: Transparent Model Checking of Unmodified Distributed Systems
Most importantly, MODIST found protocol-level bugs (i.e., flaws in the core distributed protocols) in every system checked: 10 in total, including 2 in Berkeley DB, 2 in MPS, and 6 in PACIFICA. Expand
Transactional Flash
This work develops a novel commit protocol called cyclic commit for TxFlash, which significantly outperforms traditional commit for small transactions (95% improvement in transaction throughput) and completely eliminates the space overhead due to commit records. Expand
Chronos: a graph engine for temporal graph analysis
The result is a high-performance temporal-graph system that offers up to an order of magnitude speedup for temporal iterative graph mining compared to a straightforward application of existing graph engines on a series of snapshots. Expand