{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:25:45Z","timestamp":1743071145016,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_356","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:30:58Z","timestamp":1214505058000},"page":"803-806","source":"Crossref","is-referenced-by-count":0,"title":["Schedulers for Optimistic Rate Based Flow Control"],"prefix":"10.1007","author":[{"given":"Panagiota","family":"Fatourou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"356_CR1_356","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1006\/jagm.1998.0970","volume":"30","author":"Y. Afek","year":"1999","unstructured":"Afek, Y., Mansour, Y., Ostfeld, Z.: Convergence complexity of optimistic rate based flow control algorithms. J.\u00a0Algorithms 30(1), 106\u2013143 (1999)","journal-title":"J. Algorithms"},{"issue":"3","key":"356_CR2_356","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S1389-1286(99)00138-3","volume":"32","author":"Y. Afek","year":"2000","unstructured":"Afek, Y., Mansour, Y., Ostfeld, Z.: Phantom: a\u00a0simple and effective flow control scheme. Comput. Netw. 32(3), 277\u2013305 (2000)","journal-title":"Comput. Netw."},{"key":"356_CR3_356","volume-title":"Data Networks","author":"D.P. Bertsekas","year":"1992","unstructured":"Bertsekas, D.P., Gallager, R.G.: Data Networks, 2nd edn. Prentice Hall, Englewood Cliffs (1992)","edition":"2"},{"issue":"2","key":"356_CR4_356","first-page":"25","volume":"9","author":"F. Bonomi","year":"1995","unstructured":"Bonomi, F., Fendick, K.: The Rate-Based Flow Control for Available Bit Rate ATM Service. IEEE\/ACM Trans. Netw. 9(2), 25\u201339 (1995)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"8","key":"356_CR5_356","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1109\/49.464716","volume":"13","author":"L.S. Brakmo","year":"1995","unstructured":"Brakmo, L.S., Peterson, L.: TCP Vegas: End-to-end Congestion Avoidance on a\u00a0Global Internet. IEEE J. Sel. Areas Commun. 13(8), 1465\u20131480 (1995)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"356_CR6_356","unstructured":"Charny, A.: An algorithm for rate-allocation in a\u00a0packet-switching network with feedback. Technical Report MIT\/LCS\/TR-601, Massachusetts Institute of Technology, April 1994"},{"issue":"5","key":"356_CR7_356","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1137\/S009753970343275X","volume":"34","author":"P. Fatourou","year":"2005","unstructured":"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\u20131252 (2005)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"356_CR8_356","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1142\/S0219265905001332","volume":"6","author":"P. Fatourou","year":"2005","unstructured":"Fatourou, P., Mavronicolas, M., Spirakis, P.: Max-min fair flow control sensitive to priorities. J.\u00a0Interconnect. Netw. 6(2), 85\u2013114 (2005) (also in Proceedings of the 2nd International Conference on Principles of Distributed Computing, pp. 45\u201359 (1998)","journal-title":"J. Interconnect. Netw."},{"key":"356_CR9_356","doi-asserted-by":"crossref","unstructured":"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.\u00a0244\u2013258, June 1998","DOI":"10.1145\/277697.277763"},{"issue":"11","key":"356_CR10_356","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1109\/TAC.1984.1103431","volume":"29","author":"E. Gafni","year":"1984","unstructured":"Gafni, E., Bertsekas, D.: Dynamic control of session input rates in communication networks. IEEE Trans. Autom. Control 29(11), 1009\u20131016 (1984)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"7","key":"356_CR11_356","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1109\/49.103550","volume":"9","author":"E. Hahne","year":"1991","unstructured":"Hahne, E.: Round Robin Scheduling for Max-min Fairness in Data Networks. IEEE J. Sel. Areas Commun. 9(7), 1024\u20131039 (1991)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"7","key":"356_CR12_356","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TCOM.1981.1095081","volume":"29","author":"J. Jaffe","year":"1981","unstructured":"Jaffe, J.: Bottleneck Flow Control. IEEE Trans. Commun. 29(7), 954\u2013962 (1981)","journal-title":"IEEE Trans. Commun."},{"key":"356_CR13_356","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Rabani, Y., Tardos, \u00c9.: Fairness in routing and load balancing. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp.\u00a0568\u2013578, October 1999","DOI":"10.1109\/SFFCS.1999.814631"},{"issue":"1","key":"356_CR14_356","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1109\/TNET.2004.842234","volume":"13","author":"S. Sarkar","year":"2005","unstructured":"Sarkar, S., Tassiulas, L.: Fair distributed congestion control in multirate multicast networks. IEEE\/ACM Trans. Netw. 13(1), 121\u2013133 (2005)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"356_CR15_356","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/JSAC.2004.837365","volume":"23","author":"L. Tassiulas","year":"2005","unstructured":"Tassiulas, L., Sarkar, S.: Maxmin fair scheduling in wireless adhoc networks. IEEE J. Sel. Areas Commun. 23(1), 163\u2013173 (2005)","journal-title":"IEEE J. Sel. Areas Commun."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:32:02Z","timestamp":1738272722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_356"}},"subtitle":["2005; Fatourou, Mavronicolas, Spirakis"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_356","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}