25 citations · 33 across the 7 of their papers we have counts for
4 papers · 1 filter
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…
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…
The Knapsack Problem with Neighbour Constraints
Glencora Borradaile, Brent Heeringa, Gordon Wilfong
We study a constrained version of the knapsack problem in which dependencies between items are given by the adjacencies of a graph. In the 1-neighbour knapsack problem, an item can…