SLBN: A Scalable Max-min Fair Algorithm for Rate-Based Explicit Congestion Control

Mozo Velasco, Alberto and López Presa, Jose Luis and Fernández Anta, Antonio (2012). SLBN: A Scalable Max-min Fair Algorithm for Rate-Based Explicit Congestion Control. In: "2012 IEEE 11th International Symposium on Network Computing and Applications", 23/09/2012 - 25/09/2012, Cambridge, MA, USA. ISBN 978-1-4673-2214-0. pp. 212-219.

Description

Title: SLBN: A Scalable Max-min Fair Algorithm for Rate-Based Explicit Congestion Control
Author/s:
  • Mozo Velasco, Alberto
  • López Presa, Jose Luis
  • Fernández Anta, Antonio
Item Type: Presentation at Congress or Conference (Article)
Event Title: 2012 IEEE 11th International Symposium on Network Computing and Applications
Event Dates: 23/09/2012 - 25/09/2012
Event Location: Cambridge, MA, USA
Title of Book: 2012 IEEE 11th International Symposium on Network Computing and Applications
Date: 2012
ISBN: 978-1-4673-2214-0
Subjects:
Freetext Keywords: Bandwidth,Probes,Routing protocols,Scalability,Convergence,Transient analysis,distributed algorithm,max-min fairness,control congestion
Faculty: E.U. de Informática (UPM)
Department: Arquitectura y Tecnología de Computadores [hasta 2014]
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (3MB) | Preview

Abstract

The growth of the Internet has increased the need for scalable congestion control mechanisms in high speed networks. In this context, we propose a rate-based explicit congestion control mechanism with which the sources are provided with the rate at which they can transmit. These rates are computed with a distributed max-min fair algorithm, SLBN. The novelty of SLBN is that it combines two interesting features not simultaneously present in existing proposals: scalability and fast convergence to the max-min fair rates, even under high session churn. SLBN is scalable because routers only maintain a constant amount of state information (only three integer variables per link) and only incur a constant amount of computation per protocol packet, independently of the number of sessions that cross the router. Additionally, SLBN does not require processing any data packet, and it converges independently of sessions' RTT. Finally, by design, the protocol is conservative when assigning rates, even in the presence of high churn, which helps preventing link overshoots in transient periods. We claim that, with all these features, our mechanism is a good candidate to be used in real deployments.

More information

Item ID: 21143
DC Identifier: http://oa.upm.es/21143/
OAI Identifier: oai:oa.upm.es:21143
Official URL: http://doi.ieeecomputersociety.org/10.1109/NCA.2012.40
Deposited by: Memoria Investigacion
Deposited on: 16 Oct 2013 10:26
Last Modified: 21 Apr 2016 11:14
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM