Convergence complexity of optimistic rate based flow control algorithms (brief announcement)

Yehuda Afek; Yishay Mansour; Zvi Ostfeld

doi:10.1145/248052.248095

Convergence complexity of optimistic rate based flow control algorithms (brief announcement)

Yehuda Afek^*
, Yishay Mansour
, Zvi Ostfeld

^*Corresponding author for this work

School of Computer Science and AI

Tel Aviv University

Research output: Contribution to conference › Paper › peer-review

2 Scopus citations

Abstract

This paper studies the basic properties of rate based flow-control algorithms and the max-min fairness criteria. A new approach is suggested for modeling and analysis of such algorithms, which may be considered more 'optimistic' and realistic than traditional approaches. The results are presented in detail.

Original language	English
Pages	212
Number of pages	1
DOIs	https://doi.org/10.1145/248052.248095
State	Published - 1996
Event	Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing - Philadelphia, PA, USA Duration: 23 May 1996 → 26 May 1996

Conference

Conference	Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing
City	Philadelphia, PA, USA
Period	23/05/96 → 26/05/96

Access to Document

10.1145/248052.248095

Cite this

@conference{927f2cf7a3e34739925ad082d390d774,

title = "Convergence complexity of optimistic rate based flow control algorithms (brief announcement)",

abstract = "This paper studies the basic properties of rate based flow-control algorithms and the max-min fairness criteria. A new approach is suggested for modeling and analysis of such algorithms, which may be considered more 'optimistic' and realistic than traditional approaches. The results are presented in detail.",

author = "Yehuda Afek and Yishay Mansour and Zvi Ostfeld",

year = "1996",

doi = "10.1145/248052.248095",

language = "אנגלית",

pages = "212",

note = "Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing ; Conference date: 23-05-1996 Through 26-05-1996",

}

TY - CONF

T1 - Convergence complexity of optimistic rate based flow control algorithms (brief announcement)

AU - Afek, Yehuda

AU - Mansour, Yishay

AU - Ostfeld, Zvi

PY - 1996

Y1 - 1996

N2 - This paper studies the basic properties of rate based flow-control algorithms and the max-min fairness criteria. A new approach is suggested for modeling and analysis of such algorithms, which may be considered more 'optimistic' and realistic than traditional approaches. The results are presented in detail.

AB - This paper studies the basic properties of rate based flow-control algorithms and the max-min fairness criteria. A new approach is suggested for modeling and analysis of such algorithms, which may be considered more 'optimistic' and realistic than traditional approaches. The results are presented in detail.

UR - https://www.scopus.com/pages/publications/0029711265

U2 - 10.1145/248052.248095

DO - 10.1145/248052.248095

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0029711265

SP - 212

T2 - Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing

Y2 - 23 May 1996 through 26 May 1996

ER -

Convergence complexity of optimistic rate based flow control algorithms (brief announcement)

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this