Routing regardless of network stability

DOI10.1007/s00453-014-9908-2zbMath1314.68029arXiv1207.0043OpenAlexW2061257005MaRDI QIDQ487016

Gordon Wilfong, Bundit Laekhanukit, Adrian Vetta

Publication date: 19 January 2015

Published in: Algorithmica, Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.0043

zbMATH Keywords

stabilitynetwork routinghardness of approximationBGPborder gateway protocol

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Network protocols (68M12)

Cites Work

• Unnamed Item
• Unnamed Item
• BGP-RCN: improving BGP convergence through root cause notification
• Interdomain Routing and Games
• Reducibility among Combinatorial Problems
• Cuts and Disjoint Paths in the Valley-Free Path Model

This page was built for publication: Routing regardless of network stability