25 citations · 32 across the 6 of their papers we have counts for
6 papers
Improving Robustness of Next-Hop Routing
Glencora Borradaile, W. Sean Kennedy, Gordon Wilfong +1
A weakness of next-hop routing is that following a link or router failure there may be no routes between some source-destination pairs, or packets may get stuck in a routing loop a…
Energy-Delay Tradeoffs in a Load-Balanced Router
Matthew Andrews, Lisa Zhang
The Load-Balanced Router architecture has received a lot of attention because it does not require centralized scheduling at the internal switch fabrics. In this paper we reexamine…
Egalitarian Graph Orientations
Glencora Borradaile, Jennifer Iglesias, Theresa Migler +3
Given an undirected graph, one can assign directions to each of the edges of the graph, thus orienting the graph. To be as egalitarian as possible, one may wish to find an orientat…
Utility Optimization in Heterogeneous Networks via CSMA-Based Algorithms
Matthew Andrews, Lisa Zhang
We study algorithms for carrier and rate allocation in cellular systems with distributed components such as a heterogeneous LTE system with macrocells and femtocells. Existing work…
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
Prahladh Harsha, Moses Charikar, Matthew Andrews +14
These are the lecture notes for the DIMACS Tutorial "Limits of Approximation Algorithms: PCPs and Unique Games" held at the DIMACS Center, CoRE Building, Rutgers University on 20-2…
Source Routing and Scheduling in Packet Networks
Matthew Andrews, Antonio Fernandez, Ashish Goel +1
We study {\em routing} and {\em scheduling} in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected.…