Beyond Fairness : Flexible and Enforceable Sender Bandwidth Allocation with Justice

We propose a new bandwidth allocation paradigm, “Justice” as an alternative to the prevailing perflow max-min fairness. Per-flow max-min fairness assigns bandwidth to flows, which implicitly handles the fact that some users, such as popular web servers, deserve more bandwidth than others. However, this design also creates an unavoidable vulnerability to the concurrent flows attack: by establishing several concurrent flows, a greedy or malicious user can consume an amount of bandwidth limited only by link capacity. For this reason, Justice abandons per-flow allocation, relying instead on per-source bandwidth allocation. To make per-source allocation tractable, we hierarchically decompose the problem of determining the allocation of each source on each link. With Justice, each router divides its available link capacity between its immediate neighbors. These, in turn, divide their allocations between their immediate neighbors, and so on. Justice can be implemented in today’s networks through the use of a source-weight field attached to each packet, and weighted fair queuing on each participating router. This provides each source with strong performance guarantees: at each router, a source is guaranteed to receive at least an allocation proportional to its allocation at the previous router, and up to the entire capacity of the outgoing link, depending on the number, and weight, of concurrent users. We demonstrate through analysis and simulation that Justice is flexible with respect to the bandwidth allocation desires of network administrators, and provides robust bandwidth allocation, independent of user behavior. 1

我们提出了一个新的带宽分配范式，“正义”是普遍存在的Max-Min公平的替代方案。值得的带宽比其他人更多。带宽仅受链接容量的限制，因此，大法官拒绝分配，而是依赖于每源的带宽分配。与正义相关的，每个路由器都在其直接的邻居之间分配其可用的链接通过使用每个数据包附加的源重量字段在当今的网络中实现，并在每个参与路由器上加权排队。与以前的路由器分配成正比，并根据并发用户的数量和权重，直至外向链接的全部容量。关于网络管理员的带宽分配的愿望是灵活的，并且提供了强大的带宽分配，而不是用户行为