Routing high-bandwidth traffic in max-min fair share networks
Routing high-bandwidth traffic in max-min fair share networks
复制标题
在最大-最小公平共享网络中路由高带宽流量
DOI：
10.1145/248156.248175
复制
发表时间：
1996
期刊：
影响因子：
--
通讯作者：
Hui Zhang
中科院分区：
文献类型：
--
作者：
Qingming Ma;P. Steenkiste;Hui Zhang
我们研究如何提高高带宽流量的吞吐量，例如在连接之间公平共享资源的网络中的大文件传输。虽然可以设计优先级或基于预留的方案，以牺牲其他连接为代价来优先处理高带宽流量，但我们重点关注使用路由算法来改善资源分配，同时保持最大-最小公平共享语义。在我们的方法中，路由与拥塞控制紧密结合，因为路由算法使用拥塞信息（例如分配给现有连接的速率）。为了减少必须分发的路由信息量，引入了拥塞信息的抽象。通过大量的模拟，我们确定了“最短路径”路由的链路成本或成本度量，其性能均优于最小跳数路由和最短最宽路径路由算法。为了进一步提高吞吐量而不减少单路径连接的公平份额，我们提出了一种新颖的优先级多路径路由算法，其中低优先级路径共享高优先级路径未使用的带宽。这导致了最大-最小公平性的保守扩展，称为优先多级最大-最小公平性。仿真结果证实了我们的多路径路由算法的优势。
We study how to improve the throughput of high-bandwidth traffic such as large file transfers in a network where resources are fairly shared among connections. While it is possible to devise priority or reservation-based schemes that give high-bandwidth traffic preferential treatment at the expense of other connections, we focus on the use of routing algorithms that improve resource allocation while maintaining max-min fair share semantics. In our approach, routing is closely coupled with congestion control in the sense that congestion information, such as the rates allocated to existing connections, is used by the routing algorithm. To reduce the amount of routing information that must be distributed, an abstraction of the congestion information is introduced. Using an extensive set of simulation, we identify a link-cost or cost metric for "shortest-path" routing that performs uniformly better than the minimal-hop routing and shortest-widest path routing algorithms. To further improve throughput without reducing the fair share of single-path connections, we propose a novel prioritized multi-path routing algorithm in which low priority paths share the bandwidth left unused by higher priority paths. This leads to a conservative extension of max-min fairness called prioritized multi-level max-min fairness. Simulation results confirm the advantages of our multi-path routing algorithm.