Flow rate fairness: dismantling a religion

@article{Briscoe2007FlowRF,
  title={Flow rate fairness: dismantling a religion},
  author={Bob Briscoe},
  journal={Comput. Commun. Rev.},
  year={2007},
  volume={37},
  pages={63-74}
}
  • B. Briscoe
  • Published 20 March 2007
  • Computer Science
  • Comput. Commun. Rev.
Resource allocation and accountability keep reappearing on every list of requirements for the Internet architecture. The reason we never resolve these issues is a broken idea of what the problem is. The applied research and standards communities are using completely unrealistic and impractical fairness criteria. The resulting mechanisms don't even allocate the right thing and they don't allocate it between the right entities. We explain as bluntly as we can that thinking about fairness… 

Figures from this paper

Distributive justice in network communications

Communication networks often have limited resources to serve all users and flows, and therefore different network resource assignment schemes have been deployed that satisfy fairness notions such as

Fairness on the Internet and its Importance in Development Context

Whether or not it is plausible to identify a framework for the evaluation of efficiently-fairness tradeoffs that may provide a sound basis for a model of a more equitable access to the Internet to a diversity of users with different needs and financial possibilities representing mainly developing regions and emerging economies is investigated.

Towards a framework for evaluating Efficiency-Fairness Tradeoffs on the Internet in Development Context

  • E. A. Gamukama
  • Computer Science, Economics
    2008 International Symposium on Communications and Information Technologies
  • 2008
The key question is whether or not it is plausible to identify a framework for the evaluation of efficiency-fairness tradeoffs that may provide a sound basis for a model of a more equitable access to the Internet to a diversity of users with different needs and financial possibilities representing mainly developing regions and emerging economies.

Policing freedom to use the internet resource pool

It is shown that attempts to isolate users from each other have corrosive side-effects - discouraging mutually beneficial sharing of the resource pool and harming the Internet's evolvability.

extracted from Freedom with Accountability for Causing Congestion in a Connectionless Internetwork

This dissertation defines the protocol and canonical examples of accountability mechanisms, and defines the congestion metric, and whether an incentive system is possible that assures its integrity as it is passed between parties around the system, despite proposed attacks motivated by self-interest and malice.

Revisiting inter-flow fairness

This work presents a simple, yet effective, methodology for examining a specific case of inter-flow fairness based solely on measurements of flow performance, and proposes a new metric which provides a richer information summary for the evaluation of fairness.

Re-feedback : freedom with accountability for causing congestion in a connectionless internetwork

This dissertation defines the protocol and canonical examples of accountability mechanisms, and defines the congestion metric, and whether an incentive system is possible that assures its integrity as it is passed between parties around the system, despite proposed attacks motivated by self-interest and malice.

A framework for evaluating efficiency-fairness tradeoff in IP networks in context of development

  • E. A. GamukamaO. Popov
  • Computer Science
    2009 9th International Symposium on Communications and Information Technology
  • 2009
A framework for the evaluation of efficiency-fairness tradeoffs that would provide a sound basis for network providers and social planners to provide or plan for an equitable access to the Internet to a diversity of users with different needs and financial possibilities representing mainly developing regions and emerging economies is introduced.

The Role of End-to-End Congestion Control in Networks with Fairness-Enforcing Routers

Simulation identifies and quantify the source of inefficiency in this regime, which is term zombie packets, and shows that aggressive mechanisms are not only tenable in a wide variety of network structures, but, combined with effective use of erasure coding, can avoid creating zombie packets and achieve throughputs that approach optimal.

Is it really necessary to go beyond a fairness metric for next-generation congestion control?

A new linear representation of relative harm between scenarios is presented, which can help to assess the differences in harm between a variety of situations.
...

References

SHOWING 1-10 OF 84 REFERENCES

A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems

A quantitative measure called Indiex of FRairness, applicable to any resource sharing or allocation problem, which is independent of the amount of the resource, and boundedness aids intuitive understanding of the fairness index.

Justice: Flexible and Enforceable Per-Source Bandwidth Allocation

The main goal of this work is to provide bandwidth allocation that is robust against the behavior of greedy or malicious users, and it is demonstrated that Justice is flexible, efficient, scalable, and robust to all identified attacks related to bandwidth allocation.

Policing congestion response in an internetwork using re-feedback

It is proposed mechanisms at the network edge that ensure the dominant selfish strategy of both network domains and end-points will be to set data headers honestly and to respond correctly to path congestion and delay, despite conflicting interests.

Promoting the use of end-to-end congestion control in the Internet

It is argued that router mechanisms are needed to identify and restrict the bandwidth of selected high-bandwidth best-effort flows in times of congestion, and several general approaches are discussed for identifying those flows suitable for bandwidth regulation.

Approximate fairness through differential dropping

This paper proposes an algorithm called Approximate Fair Dropping (AFD), which bases its dropping decisions on the recent history of packet arrivals, and simulation results suggest that the design provides a reasonable degree of fairness in a wide variety of operating conditions.

The Social Cost of Cheap Pseudonyms

We consider the problems of societal norms for cooperation and reputation when it is possible to obtain cheap pseudonyms, something that is becoming quite common in a wide variety of interactions on

Free-riding and whitewashing in peer-to-peer systems

A model to study the phenomenon of free-riding and free-identities in peer-to-peer systems finds that imposing penalty on all users that join the system is effective under many scenarios and that system performance degrades significantly only when the turnover rate among users is high.

Tussle in cyberspace: defining tomorrow's Internet

The position is that accommodating this tussle is crucial to the evolution of the network's technical architecture, and some technical design principles that take it into account are offered.

Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP

This document proposes two ways of weighting TCP connections by manipulating some parameters of the protocol and presents results from simulations and prototypes to discuss how proportional fairness could be used to implement an Internet with differentiated services.

IAB Concerns Regarding Congestion Control for Voice Traffic in the Internet

This document discusses IAB concerns about effective end-to-end congestion control for best-effort voice traffic in the Internet. These concerns have to do with fairness, user quality, and with the
...