Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Algorithms pp 1893–1897Cite as

Schedulers for Optimistic Rate Based Flow Control

  • Reference work entry
  • First Online:

  • 208 Accesses

Years and Authors of Summarized Original Work

  • 2005; Fatourou, Mavronicolas, Spirakis

Problem Definition

The problem concerns the design of efficient rate-based flow control algorithms for virtual-circuit communication networks where a connection is established by allocating a fixed path, called session, between the source and the destination. Rate-based flow-control algorithms repeatedly adjust the transmission rates of different sessions in an end-to-end manner with primary objectives to optimize the network utilization and achieve some kind of fairness in sharing bandwidth between different sessions.

A widely-accepted fairness criterion for flow-control is max-min fairness which requires that the rate of a session can be increased only if this increase does not cause a decrease to any other session with smaller or equal rate. Once max-min fairness has been achieved, no session rate can be increased any further without violating the above condition or exceeding the bandwidth capacity...

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Afek Y, Mansour Y, Ostfeld Z (1999) Convergence complexity of optimistic rate based flow control algorithms. J Algorithms 30(1):106–143

    Article  MathSciNet  MATH  Google Scholar 

  2. Afek Y, Mansour Y, Ostfeld Z (2000) Phantom: a simple and effective flow control scheme. Comput Netw 32(3):277–305

    Article  Google Scholar 

  3. Bertsekas DP, Gallager RG (1992) Data networks, 2nd edn. Prentice Hall, Englewood Cliffs

    MATH  Google Scholar 

  4. Bonomi F, Fendick K (1995) The rate-based flow control for available bit rate ATM service. IEEE/ACM Trans Netw 9(2):25–39

    Google Scholar 

  5. Brakmo LS, Peterson L (1995) TCP vegas: end-to-end congestion avoidance on a global internet. IEEE J Sel Areas Commun 13(8):1465–1480

    Article  Google Scholar 

  6. Charny A (1994) An algorithm for rate-allocation in a packet switching network with feedback. Technical report MIT/LCS/TR-601, Massachusetts Institute of Technology, Apr 1994

    Google Scholar 

  7. Fatourou P, Mavronicolas M, Spirakis P (2005) Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control. SIAM J Comput 34(5):1216–1252

    Article  MathSciNet  MATH  Google Scholar 

  8. Fatourou P, Mavronicolas M, Spirakis P (2005) Max-min fair flow control sensitive to priorities. J Interconnect Netw 6(2):85–114, Also in Proceedings of the 2nd international conference on principles of distributed computing, pp 45–59 (1998)

    Google Scholar 

  9. Fatourou P, Mavronicolas M, Spirakis P (1998) The global efficiency of distributed, rate-based flow control algorithms. In: Proceedings of the 5th colloquium on structural information and communication complexity, June 1998, pp 244–258

    Google Scholar 

  10. Gafni E, Bertsekas D (1984) Dynamic control of session input rates in communication networks. IEEE Trans Autom Control 29(11):1009–1016

    Article  MathSciNet  MATH  Google Scholar 

  11. Hahne E (1991) Round Robin scheduling for max-min fairness in data networks. IEEE J Sel Areas Commun 9(7):1024–1039

    Article  Google Scholar 

  12. Jaffe J (1981) Bottleneck flow control. IEEE Trans Commun 29(7):954–962

    Article  MathSciNet  Google Scholar 

  13. Kleinberg J, Rabani Y, Tardos É (1999) Fairness in routing and load balancing. In: Proceedings of the 40th annual IEEE symposium on foundations of computer science, Oct 1999, pp 568–578

    Google Scholar 

  14. Sarkar S, Tassiulas L (2005) Fair distributed congestion control in multirate multicast networks. IEEE/ACM Trans Netw 13(1):121–133

    Article  Google Scholar 

  15. Tassiulas L, Sarkar S (2005) Maxmin fair scheduling in wireless adhoc networks. IEEE J Sel Areas Commun 23(1):163–173

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Ioannina, Ioannina, Greece

    Panagiota Fatourou

Authors
  1. Panagiota Fatourou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Panagiota Fatourou .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Fatourou, P. (2016). Schedulers for Optimistic Rate Based Flow Control. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_356

Download citation

Publish with us

Policies and ethics

Search

Navigation