Show simple item record

dc.contributor.authorFatourou, Panagiotaen
dc.contributor.authorMavronicolas, Mariosen
dc.contributor.authorSpirakis, Paul G.en
dc.creatorFatourou, Panagiotaen
dc.creatorMavronicolas, Mariosen
dc.creatorSpirakis, Paul G.en
dc.description.abstractLower and upper bounds on convergence complexity, under varying degrees of locality, for optimistic, rate-based flow control algorithms are established. It is shown that randomness can be exploited to yield an even simpler oblivious algorithm at the price of a small increase in convergence complexity. The results for partially oblivious algorithms imply that knowledge of session rates cannot merely suffice to reduce convergence complexity.en
dc.sourceProceedings of the Annual ACM Symposium on Principles of Distributed Computingen
dc.sourceProceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computingen
dc.subjectDistributed computer systemsen
dc.subjectRandom processesen
dc.subjectComputational complexityen
dc.subjectConvergence of numerical methodsen
dc.subjectLinear convergence complexityen
dc.subjectNon oblivious algorithmen
dc.subjectOblivious algorithmsen
dc.titleEfficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow controlen
dc.description.endingpage148 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeConference Objecten
dc.description.notes<p>Sponsors: ACMen
dc.description.notesConference code: 47174</p>en
dc.contributor.orcidSpirakis, Paul G. [0000-0001-5396-3749]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record