A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing

DOI10.1007/978-3-642-36694-9_29zbMath1377.68026arXiv1206.3718OpenAlexW2101764432MaRDI QIDQ4910828

Thomas Rothvoß

Publication date: 19 March 2013

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

FIFO and randomized competitive packet routing games

This page was built for publication: A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing