Skip to main content
SpringerLink
Log in

Schedulers for Optimistic Rate Based Flow Control

2005; Fatourou, Mavronicolas, Spirakis

  • Reference work entry
Encyclopedia of Algorithms

  • 223 Accesses

Keywords and Synonyms

Rate allocation; Rate adjustment ; Bandwidth allocation                        

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 capacityof...

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

Access this chapter

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 399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  3. Bertsekas, D.P., Gallager, R.G.: Data Networks, 2nd edn. Prentice Hall, Englewood Cliffs (1992)

    MATH  Google Scholar 

  4. Bonomi, F., Fendick, K.: The Rate-Based Flow Control for Available Bit Rate ATM Service. IEEE/ACM Trans. Netw. 9(2), 25–39 (1995)

    Google Scholar 

  5. Brakmo, L.S., Peterson, L.: TCP Vegas: End-to-end Congestion Avoidance on a Global Internet. IEEE J. Sel. Areas Commun. 13(8), 1465–1480 (1995)

    Article  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Fatourou, P., Mavronicolas, M., Spirakis, P.: Max-min fair flow control sensitive to priorities. J. Interconnect. Netw. 6(2), 85–114 (2005) (also in Proceedings of the 2nd International Conference on Principles of Distributed Computing, pp. 45–59 (1998)

    Article  Google Scholar 

  9. Fatourou, P., Mavronicolas, M., Spirakis, P.: The global efficiency of distributed, rate-based flow control algorithms. In: Proceedings of the 5th Colloqium on Structural Information and Communication Complexity, pp. 244–258, June 1998

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Hahne, E.: Round Robin Scheduling for Max-min Fairness in Data Networks. IEEE J. Sel. Areas Commun. 9(7), 1024–1039 (1991)

    Article  Google Scholar 

  12. Jaffe, J.: Bottleneck Flow Control. IEEE Trans. Commun. 29(7), 954–962 (1981)

    Article  MathSciNet  Google Scholar 

  13. Kleinberg, J., Rabani, Y., Tardos, É.: Fairness in routing and load balancing. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 568–578, October 1999

    Google Scholar 

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

    Article  Google Scholar 

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

    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

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer ScienceMcCormick School of Engineering and Applied Science, Northwestern University, Evanston, IL, 60208, USA

    Ming-Yang Kao Professor of Computer Science

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Fatourou, P. (2008). Schedulers for Optimistic Rate Based Flow Control. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_356

Download citation

Publish with us

Policies and ethics

Search

Navigation