Matches in SemOpenAlex for { <https://semopenalex.org/work/W3140720105> ?p ?o ?g. }
Showing items 1 to 69 of
69
with 100 items per page.
- W3140720105 abstract "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 λ <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>i</sub> such that no session s can increase λ <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>s</sub> without causing another session s' to end up with a rate λ <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>s</sub> / <; λ <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>s</sub> . 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." @default.
- W3140720105 created "2021-04-13" @default.
- W3140720105 creator A5009709213 @default.
- W3140720105 creator A5018159603 @default.
- W3140720105 creator A5037473934 @default.
- W3140720105 date "2011-08-01" @default.
- W3140720105 modified "2023-10-01" @default.
- W3140720105 title "B-Neck: A Distributed and Quiescent Max-Min Fair Algorithm" @default.
- W3140720105 cites W1992674660 @default.
- W3140720105 cites W2017828495 @default.
- W3140720105 cites W2097713078 @default.
- W3140720105 cites W2108998547 @default.
- W3140720105 cites W2154336860 @default.
- W3140720105 cites W2159777336 @default.
- W3140720105 cites W3137188152 @default.
- W3140720105 doi "https://doi.org/10.1109/nca.2011.10" @default.
- W3140720105 hasPublicationYear "2011" @default.
- W3140720105 type Work @default.
- W3140720105 sameAs 3140720105 @default.
- W3140720105 citedByCount "2" @default.
- W3140720105 countsByYear W31407201052012 @default.
- W3140720105 countsByYear W31407201052014 @default.
- W3140720105 crossrefType "proceedings-article" @default.
- W3140720105 hasAuthorship W3140720105A5009709213 @default.
- W3140720105 hasAuthorship W3140720105A5018159603 @default.
- W3140720105 hasAuthorship W3140720105A5037473934 @default.
- W3140720105 hasBestOaLocation W31407201052 @default.
- W3140720105 hasConcept C111919701 @default.
- W3140720105 hasConcept C11413529 @default.
- W3140720105 hasConcept C136764020 @default.
- W3140720105 hasConcept C162324750 @default.
- W3140720105 hasConcept C177264268 @default.
- W3140720105 hasConcept C199360897 @default.
- W3140720105 hasConcept C26517878 @default.
- W3140720105 hasConcept C2777303404 @default.
- W3140720105 hasConcept C2779182362 @default.
- W3140720105 hasConcept C41008148 @default.
- W3140720105 hasConcept C50522688 @default.
- W3140720105 hasConcept C57869625 @default.
- W3140720105 hasConceptScore W3140720105C111919701 @default.
- W3140720105 hasConceptScore W3140720105C11413529 @default.
- W3140720105 hasConceptScore W3140720105C136764020 @default.
- W3140720105 hasConceptScore W3140720105C162324750 @default.
- W3140720105 hasConceptScore W3140720105C177264268 @default.
- W3140720105 hasConceptScore W3140720105C199360897 @default.
- W3140720105 hasConceptScore W3140720105C26517878 @default.
- W3140720105 hasConceptScore W3140720105C2777303404 @default.
- W3140720105 hasConceptScore W3140720105C2779182362 @default.
- W3140720105 hasConceptScore W3140720105C41008148 @default.
- W3140720105 hasConceptScore W3140720105C50522688 @default.
- W3140720105 hasConceptScore W3140720105C57869625 @default.
- W3140720105 hasLocation W31407201051 @default.
- W3140720105 hasLocation W31407201052 @default.
- W3140720105 hasOpenAccess W3140720105 @default.
- W3140720105 hasPrimaryLocation W31407201051 @default.
- W3140720105 hasRelatedWork W1586585988 @default.
- W3140720105 hasRelatedWork W1950922027 @default.
- W3140720105 hasRelatedWork W1970358763 @default.
- W3140720105 hasRelatedWork W2150392693 @default.
- W3140720105 hasRelatedWork W2166961423 @default.
- W3140720105 hasRelatedWork W2382095754 @default.
- W3140720105 hasRelatedWork W2389459180 @default.
- W3140720105 hasRelatedWork W2540751784 @default.
- W3140720105 hasRelatedWork W2908009812 @default.
- W3140720105 hasRelatedWork W4295922964 @default.
- W3140720105 isParatext "false" @default.
- W3140720105 isRetracted "false" @default.
- W3140720105 magId "3140720105" @default.
- W3140720105 workType "article" @default.