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

Mozo Velasco, Alberto; López Presa, Jose Luis y Fernández Anta, Antonio (2012). SLBN: A Scalable Max-min Fair Algorithm for Rate-Based Explicit Congestion Control. En: "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.

Descripción

Título: SLBN: A Scalable Max-min Fair Algorithm for Rate-Based Explicit Congestion Control
Autor/es:
  • Mozo Velasco, Alberto
  • López Presa, Jose Luis
  • Fernández Anta, Antonio
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 2012 IEEE 11th International Symposium on Network Computing and Applications
Fechas del Evento: 23/09/2012 - 25/09/2012
Lugar del Evento: Cambridge, MA, USA
Título del Libro: 2012 IEEE 11th International Symposium on Network Computing and Applications
Fecha: 2012
ISBN: 978-1-4673-2214-0
Materias:
Palabras Clave Informales: Bandwidth,Probes,Routing protocols,Scalability,Convergence,Transient analysis,distributed algorithm,max-min fairness,control congestion
Escuela: E.U. de Informática (UPM) [antigua denominación]
Departamento: Arquitectura y Tecnología de Computadores [hasta 2014]
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (3MB) | Vista Previa

Resumen

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.

Más información

ID de Registro: 21143
Identificador DC: http://oa.upm.es/21143/
Identificador OAI: oai:oa.upm.es:21143
URL Oficial: http://doi.ieeecomputersociety.org/10.1109/NCA.2012.40
Depositado por: Memoria Investigacion
Depositado el: 16 Oct 2013 10:26
Ultima Modificación: 21 Abr 2016 11:14
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM