scispace - formally typeset
Open AccessProceedings ArticleDOI

Impact of fairness on Internet performance

Thomas Bonald, +1 more
- Vol. 29, Iss: 1, pp 82-91
Reads0
Chats0
TLDR
It is proved that for a broad class of fair bandwidth allocations, the total number of flows in progress remains finite if the load of every link is less than one.
Abstract: 
We discuss the relevance of fairness as a design objective for congestion control mechanisms in the Internet. Specifically, we consider a backbone network shared by a dynamic number of short-lived flows, and study the impact of bandwidth sharing on network performance. In particular, we prove that for a broad class of fair bandwidth allocations, the total number of flows in progress remains finite if the load of every link is less than one. We also show that provided the bandwidth allocation is "sufficiently" fair, performance is optimal in the sense that the throughput of the flows is mainly determined by their access rate. Neither property is guaranteed with unfair bandwidth allocations, when priority is given to one class of flow with respect to another. This suggests current proposals for a differentiated services Internet may lead to suboptimal utilization of network resources.

read more

Content maybe subject to copyright    Report

HAL Id: hal-01272522
https://hal.archives-ouvertes.fr/hal-01272522
Submitted on 11 Feb 2016
HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entic research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.
L’archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diusion de documents
scientiques de niveau recherche, publiés ou non,
émanant des établissements d’enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.
Impact of Fairness on Internet Performance
Thomas Bonald, Laurent Massoulié
To cite this version:
Thomas Bonald, Laurent Massoulié. Impact of Fairness on Internet Performance. ACM Sigmetrics /
Performance, 2001, Cambridge, United States. �hal-01272522�
Impact of Fairness on Internet Performance
Thomas Bonald
France Telecom R&D
thomas.bonald@francetelecom.com
Laurent Massouli´e
Microsoft Research
lmassoul@microsoft.com
ABSTRACT
1. INTRODUCTION
2. BANDWIDTH SHARING
2.1 Pareto-efficiency
2.2 Max-min fairness
2.3 Mean throughput criteria
2.4 A general criterion
Example 1 (Linear network).
Example 2 (Cyclic network).
Example 3 (Grid network).
3. STABILITY CONDITIONS
3.1 Unfairness and instability
Example 1 (Maximum throughput).
Example 2 (Class-based queuing).
Example 3 (Priority queuing).
Citations
More filters
Journal ArticleDOI

Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures

Mung Chiang, +3 more
TL;DR: A survey of the recent efforts towards a systematic understanding of layering as optimization decomposition can be found in this paper, where the overall communication network is modeled by a generalized network utility maximization problem, each layer corresponds to a decomposed subproblem, and the interfaces among layers are quantified as functions of the optimization variables coordinating the subproblems.

Layering as optimization decomposition: A mathematical theory of network architectures : There are various ways that network functionalities can be allocated to different layers and to different network elements, some being more desirable than others. The intellectual goal of the research surveyed by this article is to provide a theoretical foundation for these architectural decisions in networking

Mung Chiang, +3 more
TL;DR: A survey of the recent efforts towards a systematic understanding of layering as optimization decomposition, where the overall communication network is modeled by a generalized network utility maximization problem, each layer corresponds to a decomposed subproblem, and the interfaces among layers are quantified as functions of the optimization variables coordinating the subproblems.
Journal ArticleDOI

A tutorial on cross-layer optimization in wireless networks

Xiaojun Lin, +2 more
- 01 Aug 2006 - 
TL;DR: It is shown that a clean-slate optimization-based approach to the multihop resource allocation problem naturally results in a "loosely coupled" cross-layer solution, and how to use imperfect scheduling in the cross- layer framework is demonstrated.
Proceedings ArticleDOI

pFabric: minimal near-optimal datacenter transport

Mohammad Alizadeh, +6 more
TL;DR: In this paper, a minimalistic datacenter transport design that provides near theoretically optimal flow completion times even at the 99th percentile for short flows, while still minimizing average flow completion time for long flows is presented.
Journal ArticleDOI

Bandwidth sharing: objectives and algorithms

Laurent Massoulié, +1 more
- 01 Jun 2002 - 
TL;DR: It is proved that fixed-size window control can achieve fair bandwidth sharing according to any of these criteria, provided scheduling at each link is performed in an appropriate manner.
References
More filters
Book

Data networks

Dimitri P. Bertsekas, +1 more
TL;DR: Undergraduate and graduate classes in computer networks and wireless communications; undergraduate classes in discrete mathematics, data structures, operating systems and programming languages.

An Architecture for Differentiated Service

S. Blake, +5 more
TL;DR: An architecture for implementing scalable service differentiation in the Internet achieves scalability by aggregating traffic classification state which is conveyed by means of IP-layer packet marking using the DS field [DSFIELD].
Journal ArticleDOI

Rate control for communication networks: shadow prices, proportional fairness and stability

Frank Kelly, +2 more
- 07 Apr 1998 - 
TL;DR: This paper analyses the stability and fairness of two classes of rate control algorithm for communication networks, which provide natural generalisations to large-scale networks of simple additive increase/multiplicative decrease schemes, and are shown to be stable about a system optimum characterised by a proportional fairness criterion.
Posted Content

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

Raj Jain, +2 more
- 24 Sep 1998 - 
TL;DR: 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.
Journal ArticleDOI

Self-similarity in World Wide Web traffic: evidence and possible causes

Mark Crovella, +1 more
- 01 Dec 1997 - 
TL;DR: It is shown that the self-similarity in WWW traffic can be explained based on the underlying distributions of WWW document sizes, the effects of caching and user preference in file transfer, the effect of user "think time", and the superimposition of many such transfers in a local-area network.
Frequently Asked Questions (1)
Q1. What contributions have the authors mentioned in the paper "Impact of fairness on internet performance" ?

HAL this paper is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not.