The space-requirement for routing-tables is an important characteristic of routing schemes. For the cost-measure of minimizing the total network load there exist a variety of results that show tradeoffs between stretch and required size for the routing tables. This paper designs compact routing schemes for the cost-measure congestion, where the goal is to minimize the maximum relative load of a link in the network (the relative load of a link is its traffic divided by its bandwidth). We show that for arbitrary undirected graphs we can obtain oblivious routing strategies with competitive ratio $\tilde{\mathcal{O}}(1)$ that have header length $\tilde{\mathcal{O}}(1)$, label size $\tilde{\mathcal{O}}(1)$, and require routing-tables of size $\tilde{\mathcal{O}}(\operatorname{deg}(v))$ at each vertex $v$ in the graph. This improves a result of R\"acke and Schmid who proved a similar result in unweighted graphs.

中文翻译：

---

加权图中的紧凑不经意路由

路由表的空间需求是路由方案的一个重要特征。对于最小化总网络负载的成本度量，存在多种结果，这些结果显示了路由表的伸展和所需大小之间的权衡。本文设计了针对成本测量拥塞的紧凑路由方案，其目标是最小化网络中链路的最大相对负载（链路的相对负载是其流量除以其带宽）。我们表明，对于任意无向图，我们可以获得具有竞争比 $\tilde{\mathcal{O}}(1)$ 的不经意路由策略，其头部长度为 $\tilde{\mathcal{O}}(1)$, label大小 $\tilde{\mathcal{O}}(1)$，并且在每个顶点 $v$ 需要大小为 $\tilde{\mathcal{O}}(\operatorname{deg}(v))$ 的路由表在图中。这改善了 R\"