{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:07:53Z","timestamp":1725574073252},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212584"},{"type":"electronic","value":"9783540246985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_59","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:28:22Z","timestamp":1294439302000},"page":"567-576","source":"Crossref","is-referenced-by-count":3,"title":["On the Competitiveness of AIMD-TCP within a General Network"],"prefix":"10.1007","author":[{"given":"Jeff","family":"Edmonds","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"59_CR1","unstructured":"Baccelli, F., Hong, D.: AIMD, Fairness and Fractal Scaling of TCP Traffic RR-4155 INRIA Rocquencourt and Infocom (June 2002)"},{"key":"59_CR2","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"1","key":"59_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0169-7552(89)90019-6","volume":"17","author":"D.M. Chiu","year":"1989","unstructured":"Chiu, D.M., Jain, R.: Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer networks and ISDN systems\u00a017(1), 1\u201314 (1989)","journal-title":"Computer networks and ISDN systems"},{"key":"#cr-split#-59_CR4.1","doi-asserted-by":"crossref","unstructured":"Edmonds, J.: Scheduling in the dark. Journal of Theoretic Computer Science (1999);","DOI":"10.1145\/301250.301299"},{"key":"#cr-split#-59_CR4.2","unstructured":"ACM Symposium on Theory of Computing, pp.??179???188 (1999)"},{"key":"59_CR5","unstructured":"Edmonds, J.: Scheduling in the dark \u2013 improved results: manuscript (2001), http:\/\/www.cs.yorku.ca\/~jeff"},{"key":"59_CR6","doi-asserted-by":"crossref","unstructured":"Edmonds, J., Datta, S., Dymond, P.: TCP is Competitive Agains a Limited Adversary. In: Proc. 15th Ann. ACM Symp. of Parallelism in Algorithms and Achitectures, pp.\u00a0174\u2013183 (2003)","DOI":"10.1145\/777412.777440"},{"issue":"5","key":"59_CR7","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/122431.122434","volume":"21","author":"S. Floyd","year":"1991","unstructured":"Floyd, S.: Connections with multiple congested gateways in packet-switched networks, part I: One-way traffic. Computer communications review\u00a021(5), 30\u201347 (1991)","journal-title":"Computer communications review"},{"issue":"4","key":"59_CR8","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as Clairvoyance. Journal of the ACM\u00a047(4), 617\u2013643 (2000)","journal-title":"Journal of the ACM"},{"key":"59_CR9","doi-asserted-by":"crossref","unstructured":"Karp, R., Koutsoupias, E., Papadimitriou, C., Shenker, S.: Optimization problems in congestion control. In: IEEE Symposium on Foundations of Computer Science, pp. 66\u201374 (2000)","DOI":"10.1109\/SFCS.2000.892066"},{"key":"59_CR10","volume-title":"Mathematics Unlimited \u2013 2001 and Beyond","author":"F. Kelly","year":"2001","unstructured":"Kelly, F.: Mathematical modelling of the internet. In: Engquist, B., Schmid, W. (eds.) Mathematics Unlimited \u2013 2001 and Beyond. Springer, Heidelberg (2001)"},{"key":"59_CR11","doi-asserted-by":"crossref","unstructured":"Kelly, F.: Fairness and stability of end-to-end congestion control European Control Conference, Cambridge (2003)","DOI":"10.3166\/ejc.9.159-176"},{"key":"59_CR12","doi-asserted-by":"crossref","unstructured":"Kelly, F., Maulloo, A., Tan, D.: Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society\u00a049 (1998)","DOI":"10.2307\/3010473"},{"key":"59_CR13","volume-title":"Computer networking: A top-down approach featuring the Internet","author":"J. Kurose","year":"2002","unstructured":"Kurose, J., Ross, K.: Computer networking: A top-down approach featuring the Internet. Addison-Wesley, Reading (2002)"},{"key":"59_CR14","first-page":"17","volume":"130","author":"R. Motwani","year":"1994","unstructured":"Motwani, R., Phillips, S., Torng, E.: Non-clairvoyant scheduling. Theoretical computer science (Special issue on dynamic and on-line algorithms)\u00a0130, 17\u201347 (1994)","journal-title":"Theoretical computer science (Special issue on dynamic and on-line algorithms)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T02:56:01Z","timestamp":1637117761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}