B-Neck: A Distributed and Quiescent Max-Min Fair Algorithm

Mozo Velasco, Alberto; López Presa, Jose Luis y Fernández Anta, Antonio (2011). B-Neck: A Distributed and Quiescent Max-Min Fair Algorithm. En: "The 10th IEEE International Symposium on Network Computing and Applications 2011", 25/08/2011 - 27/08/2011, Cambridge, Massachusetts USA. ISBN 978-1-4577-1052-0.

Descripción

Título: B-Neck: A Distributed and Quiescent Max-Min Fair Algorithm
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: The 10th IEEE International Symposium on Network Computing and Applications 2011
Fechas del Evento: 25/08/2011 - 27/08/2011
Lugar del Evento: Cambridge, Massachusetts USA
Título del Libro: Proceedings of the 10th IEEE International Symposium on Network Computing and Applications 2011
Fecha: 2011
ISBN: 978-1-4577-1052-0
Materias:
Palabras Clave Informales: Max-mix fairness , distributed algorithm , quiescence
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 (221kB) | Vista Previa

Resumen

The problem of fairly distributing the capacity of a network among a set of sessions has been widely studied. In this problem, each session connects via a single path a source and a destination, and its goal is to maximize its assigned transmission rate (i.e., its throughput). Since the links of the network have limited bandwidths, some criterion has to be defined to fairly distribute their capacity among the sessions. A popular criterion is max-min fairness that, in short, guarantees that each session i gets a rate λi such that no session s can increase λs without causing another session s' to end up with a rate λs/ <; λs. Many max-min fair algorithms have been proposed, both centralized and distributed. However, to our knowledge, all proposed distributed algorithms require control data being continuously transmitted to recompute the max-min fair rates when needed (because none of them has mechanisms to detect convergence to the max-min fair rates). In this paper we propose B-Neck, a distributed max-min fair algorithm that is also quiescent. This means that, in absence of changes (i.e., session arrivals or departures), once the max min rates have been computed, B-Neck stops generating network traffic. Quiescence is a key design concept of B-Neck, because B-Neck routers are capable of detecting and notifying changes in the convergence conditions of max-min fair rates. As far as we know, B-Neck is the first distributed max-min fair algorithm that does not require a continuous injection of control traffic to compute the rates. The correctness of B-Neck is formally proved, and extensive simulations are conducted. In them, it is shown that B-Neck converges relatively fast and behaves nicely in presence of sessions arriving and departing.

Más información

ID de Registro: 11653
Identificador DC: http://oa.upm.es/11653/
Identificador OAI: oai:oa.upm.es:11653
URL Oficial: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6038580&contentType=Conference+Publications&sortType%3Dasc_p_Sequence%26filter%3DAND(p_IS_Number%3A6038577)%26rowsPerPage%3D50
Depositado por: Memoria Investigacion
Depositado el: 29 Nov 2012 09:32
Ultima Modificación: 20 Abr 2016 19:40
  • 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