Decentralized computation of weighted max-min fair bandwidth allocation in networks with multicast flows

Emily E. Graves, R. Srikant, Don Towsley

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider the problem of designing decentralized algorithms to achieve max-min fairness in multicast networks. Starting with a convex program formulation, we show that there exists an algorithm to compute the fairshare at each link using only the total arrival rate at each link. Further this information can be conveyed to the multicast receivers using a simple marking mechanism. The mechanisms required to implement the algorithm at the routers have low complexity since they do not require any per-flow information.

Original languageEnglish (US)
Title of host publicationEvolutionary Trends of the Internet - 2001 Tyrrhenian International Workshop on Digital Communications, IWDC 2001, Proceedings
EditorsSergio Palazzo
PublisherSpringer-Verlag Berlin Heidelberg
Pages326-342
Number of pages17
ISBN (Print)3540425926, 9783540425922
DOIs
StatePublished - 2001
Event2001 Tyrrhenian International Workshop on Digital Communications, IWDC 2001 - Taormina, Italy
Duration: Sep 17 2001Sep 20 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2170 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2001 Tyrrhenian International Workshop on Digital Communications, IWDC 2001
CountryItaly
CityTaormina
Period9/17/019/20/01

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Decentralized computation of weighted max-min fair bandwidth allocation in networks with multicast flows'. Together they form a unique fingerprint.

Cite this