Article

Free access

Convergence complexity of optimistic rate based flow control algorithms (extended abstract)

Authors:

Yehuda Afek,

Yishay Mansour,

Zvi OstfeldAuthors Info & Claims

STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing

Pages 89 - 98

https://doi.org/10.1145/237814.237837

Published: 01 July 1996 Publication History

PDF eReader

References

[1]

Y. Afek, Y. Mansour, and Z. Ostfeld. Convergence complexity of optimistic rate based flow control algorithms, ftp://ftp.math.tau.ac.il /pub / m ansour/PAP ERS/D ISTRI B UTED / flow.ps.Z, November 1995.

Google Scholar

[2]

F. Bonomi and K. Fendick. The rate based flow control for available bit rate atm service. IEEE Networks, pages 24-39, March/April 1995.

Digital Library

Google Scholar

[3]

D.P. Bertsekas and R. G. Gallager. Data Networks. Prentice Hall, 1987.

Digital Library

Google Scholar

[4]

A. Charny. An algorithm for rate allocation in a packet-switching network with feedback. Technical Report MIT/LCS/TR-601, MIT Laboratory for Computer Science, April 1994.

Digital Library

Google Scholar

[5]

E. Gafni. The Integration of Routing and Flow Control for Voice and Data in a Computer Communication Network. PhD thesis, Massachusetts Institute of Technology, Dept. of Elec. Eng. and Comp. Science, Cambridge, MA, August 1982.

Google Scholar

[6]

E. Gafni and D. P. Bertsekas. Dynamic control of session input rates in communication networks. IEEE Trans. on Automatic Control, AC- 29( 11 ):804-823, November 1984.

Google Scholar

[7]

H. Hayden. Voice flow control in integrated packet networks. Master's thesis, Massachusetts Institute of Technology, Dept. of Electrical Engineering, Cambridge, MA, 1981.

Google Scholar

[8]

J.M. Jaffe. Bottleneck flow control. IEEE Trans on Communication, COM-29,1(7):954- 962, July 1981.

Crossref

Google Scholar

[9]

R. Jain, S. Kalyanaraman, and R. Viswanathan. The OSU scheme for congestion avoidance using explicit rate indication. Technical Report ATM-FORUM/95-0883, The Ohio State University, September 1994.

Google Scholar

[10]

H.T. Kung and R. Morris. Credit-based flow control for arm networks. IEEE Networks, pages 40-48, March/April 1995.

Digital Library

Google Scholar

[11]

J. Mosley. Asynchronous Distributed Flow Control Algorithms. PhD thesis, MIT, June 1984.

Google Scholar

[12]

L. Roberts. Enhanced PRCA (proportional rate-control algorithm). Technical Report ATM-FORUM/94-0735R1, ATM Systems, August 1994.

Google Scholar

[13]

K.S. Siu and H. H. Tzeng. Adaptived proportional rate control (APRC) with intelligent congestion indication. Technical Report ATM.FORUM/94-0888, University of California, Irvine, September 1994.

Google Scholar

Cited By

View all

Su SWang YJiang SShuang KXu P(2014)Efficient algorithms for scheduling multiple bulk data transfers in inter-datacenter networksInternational Journal of Communication Systems10.1002/dac.260327:12(4144-4165)Online publication date: 1-Dec-2014
https://dl.acm.org/doi/10.1002/dac.2603
Chou JLin B(2009)Optimal multi-path routing and bandwidth allocation under utility max-min fairness2009 17th International Workshop on Quality of Service10.1109/IWQoS.2009.5201396(1-9)Online publication date: Jul-2009
https://doi.org/10.1109/IWQoS.2009.5201396
Bejerano YHan SLi LHaas ZDas SJain R(2004)Fairness and load balancing in wireless LANs using association controlProceedings of the 10th annual international conference on Mobile computing and networking10.1145/1023720.1023751(315-329)Online publication date: 26-Sep-2004
https://dl.acm.org/doi/10.1145/1023720.1023751
Show More Cited By

Index Terms

Convergence complexity of optimistic rate based flow control algorithms (extended abstract)
1. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes

Recommendations

Optimistic concurrency control algorithms for distributed database systems
The expressive powers of the logic programming semantics (extended abstract)
PODS '90: Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

We compare the expressive powers of three semantics for deductive databases and logic programming: the 3-valued program completion semantics, the well-founded semantics, and the stable semantics, We identify the expressive power of the stable semantics, ...
Convergence of noncooperative optimal rate-based flow control algorithms in decentralized networks

Comments

Information & Contributors

Information

Published In

STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing

July 1996

661 pages

ISBN:0897917855

DOI:10.1145/237814

Chairman:
Gary L. Miller

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC96

Sponsor:

SIGACT

STOC96: ACM Symposium on Theory of Computing

May 22 - 24, 1996

Pennsylvania, Philadelphia, USA

Acceptance Rates

STOC '96 Paper Acceptance Rate 74 of 201 submissions, 37%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
305
Total Downloads

Downloads (Last 12 months)41
Downloads (Last 6 weeks)5

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Su SWang YJiang SShuang KXu P(2014)Efficient algorithms for scheduling multiple bulk data transfers in inter-datacenter networksInternational Journal of Communication Systems10.1002/dac.260327:12(4144-4165)Online publication date: 1-Dec-2014
https://dl.acm.org/doi/10.1002/dac.2603
Chou JLin B(2009)Optimal multi-path routing and bandwidth allocation under utility max-min fairness2009 17th International Workshop on Quality of Service10.1109/IWQoS.2009.5201396(1-9)Online publication date: Jul-2009
https://doi.org/10.1109/IWQoS.2009.5201396
Bejerano YHan SLi LHaas ZDas SJain R(2004)Fairness and load balancing in wireless LANs using association controlProceedings of the 10th annual international conference on Mobile computing and networking10.1145/1023720.1023751(315-329)Online publication date: 26-Sep-2004
https://dl.acm.org/doi/10.1145/1023720.1023751
Cho SGoel A(2004)Bandwidth allocation in networksProceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking10.1007/11527954_4(28-41)Online publication date: 5-Aug-2004
https://dl.acm.org/doi/10.1007/11527954_4
Jain KVazirani VReif J(2002)Equitable cost allocations via primal-dual-type algorithmsProceedings of the thiry-fourth annual ACM symposium on Theory of computing10.1145/509907.509956(313-321)Online publication date: 19-May-2002
https://dl.acm.org/doi/10.1145/509907.509956
Goel AMeyerson APlotkin SKosaraju S(2001)Approximate majorization and fair online load balancingProceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms10.5555/365411.365483(384-390)Online publication date: 9-Jan-2001
https://dl.acm.org/doi/10.5555/365411.365483
Bhargava RGoel AMeyerson A(2001)Using approximate majorization to characterize protocol fairnessACM SIGMETRICS Performance Evaluation Review10.1145/384268.37882629:1(330-331)Online publication date: 1-Jun-2001
https://dl.acm.org/doi/10.1145/384268.378826
Bhargava RGoel AMeyerson AVernon M(2001)Using approximate majorization to characterize protocol fairnessProceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems10.1145/378420.378826(330-331)Online publication date: 1-Jun-2001
https://dl.acm.org/doi/10.1145/378420.378826
Goel AMeyerson APlotkin SYao FLuks E(2000)Combining fairness with throughputProceedings of the thirty-second annual ACM symposium on Theory of computing10.1145/335305.335400(670-679)Online publication date: 1-May-2000
https://dl.acm.org/doi/10.1145/335305.335400
Kleinberg JTardos ERabani Y(1999)Fairness in Routing and Load BalancingProceedings of the 40th Annual Symposium on Foundations of Computer Science10.5555/795665.796474Online publication date: 17-Oct-1999
https://dl.acm.org/doi/10.5555/795665.796474
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Optimistic concurrency control algorithms for distributed database systems

The expressive powers of the logic programming semantics (extended abstract)

Convergence of noncooperative optimal rate-based flow control algorithms in decentralized networks

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Optimistic concurrency control algorithms for distributed database systems

The expressive powers of the logic programming semantics (extended abstract)

Convergence of noncooperative optimal rate-based flow control algorithms in decentralized networks

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations