25 citations · 33 across the 7 of their papers we have counts for
8 papers
On the Problem of Optimal Path Encoding for Software-Defined Networks
Adiseshu Hari, Urs Niesen, Gordon Wilfong
Packet networks need to maintain state in the form of forwarding tables at each switch. The cost of this state increases as networks support ever more sophisticated per-flow routin…
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…
Density decompositions of networks
Glencora Borradaile, Theresa Migler, Gordon Wilfong
We introduce a new topological descriptor of a network called the density decomposition which is a partition of the nodes of a network into regions of uniform density. The decompos…
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…
Routing Regardless of Network Stability
Bundit Laekhanukit, Adrian Vetta, Gordon Wilfong
We examine the effectiveness of packet routing in this model for the broad class next-hop preferences with filtering. Here each node v has a filtering list D(v) consisting of nodes…
iBGP and Constrained Connectivity
Michael Dinitz, Gordon Wilfong
We initiate the theoretical study of the problem of minimizing the size of an iBGP overlay in an Autonomous System (AS) in the Internet subject to a natural notion of correctness d…