Routing Regardless of Network Stability
Bundit Laekhanukit, Adrian Vetta, and Gordon Wilfong

TL;DR
This paper studies packet routing effectiveness under node filtering constraints, revealing computational hardness in some cases but also providing algorithms that guarantee packet delivery with probability one in specific scenarios.
Contribution
It introduces a new model for routing with filtering lists, proves inapproximability results, and offers probabilistic algorithms ensuring eventual packet delivery.
Findings
NP-hardness of approximation for certain filtering list sizes
Packets route with probability one when filtering lists contain only the node itself
Packets also route with probability one when filtering lists are empty
Abstract
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 it does not want its packets to route through. Acceptable paths (those that avoid nodes in the filtering list) are ranked according to the next-hop, that is, the neighbour of v that the path begins with. On the negative side, we present a strong inapproximability result. For filtering lists of cardinality at most one, given a network in which an equilibrium is guaranteed to exist, it is NP-hard to approximate the maximum number of packets that can be routed to within a factor of O(n^{1-\epsilon}), for any constant \epsilon >0. On the positive side, we give algorithms to show that in two fundamental cases every packet will eventually route with probability one. The first case is when each node's filtering list…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications · Game Theory and Voting Systems · Advanced Graph Theory Research
