{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:22:41Z","timestamp":1759134161760},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s1389-1286(03)00269-x","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:26:08Z","timestamp":1051737968000},"page":"227-245","source":"Crossref","is-referenced-by-count":23,"title":["Exploiting the efficiency and fairness potential of AIMD-based congestion avoidance and control"],"prefix":"10.1016","volume":"43","author":[{"given":"Adrian","family":"Lahanas","sequence":"first","affiliation":[]},{"given":"Vassilis","family":"Tsaoussidis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S1389-1286(03)00269-X_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0169-7552(89)90019-6","article-title":"Analysis of the increase\/decrease algorithms for congestion avoidance in computer networks","volume":"17","author":"Chiu","year":"1989","journal-title":"Computer Networks and ISDN"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB2","doi-asserted-by":"crossref","unstructured":"V. Jacobson, Congestion avoidance and control, in: Proceedings of ACM SIGCOMM\u201988, 1988, pp. 314\u2013329","DOI":"10.1145\/52324.52356"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB3","unstructured":"J. Postel, Transmission Control Protocol, RFC 793"},{"issue":"3","key":"10.1016\/S1389-1286(03)00269-X_BIB4","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/79147.79161","article-title":"Knowledge and common knowledge in a distributed environment","volume":"37","author":"Halpern","year":"1990","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB5","doi-asserted-by":"crossref","unstructured":"Y. Yang, S. Lam, General AIMD congestion control, in: Proceedings of the IEEE International Conference on Network Protocols, 2000","DOI":"10.1109\/ICNP.2000.896303"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB6","doi-asserted-by":"crossref","unstructured":"D. Bansal, H. Balakrishnan, Binomial congestion control algorithms, in: Proceedings of IEEE INFOCOM\u201901, 2001, pp. 631\u2013640","DOI":"10.1109\/INFCOM.2001.916251"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB7","unstructured":"S. Jin, L. Guo, I. Matta, A. Bestavros, TCP-friendly SIMD congestion control and its convergence behavior, in: Proceedings of ICNP\u20192001, 2001"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB8","doi-asserted-by":"crossref","unstructured":"J. Padhye, V. Firoiu, D. Towsley, J. Kurose, Modeling TCP throughput: A simple model and its empirical validation, in: Proceedings of ACM SIGCOMM, 1998","DOI":"10.1145\/285237.285291"},{"issue":"4","key":"10.1016\/S1389-1286(03)00269-X_BIB9","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1109\/90.793002","article-title":"Promoting the use of end-to-end congestion control in the internet","volume":"7","author":"Floyd","year":"1999","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB10","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/263932.264023","article-title":"The macroscopic behavior of the TCP congestion avoidance algorithm","volume":"27","author":"Mathis","year":"1997","journal-title":"ACM Computer Communication Review"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB11","doi-asserted-by":"crossref","unstructured":"R. Karp, E. Koutsoupias, C. Papadimitriou, S. Shenker, Optimization problems in congestion control, in: IEEE Symposium on Foundations of Computer Science, 2000, pp. 66\u201374","DOI":"10.1109\/SFCS.2000.892066"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB12","unstructured":"A. Lahanas, V. Tsaoussidis, Exploiting the efficiency and fairness potential of AIMD-based congestion avoidance and control, Tech. Rep. NU-CCS-02-04, Web Page: http:\/\/www.ccs.neu.edu\/~ladrian, April 2002"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB13","unstructured":"The Network Simulator\u2013\u2013NS-2, Tech. rep., Web Page: http:\/\/www.isi.edu\/nsnam\/ns\/. Version 2.1b7a, October 2000"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB14","unstructured":"M. Mathis, J. Mahdavi, S. Floyd, A. Romanow, TCP Selective Acknowledgment Options, RFC 2018"},{"issue":"4","key":"10.1016\/S1389-1286(03)00269-X_BIB15","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/90.251892","article-title":"Random early detection gateways for congestion avoidance","volume":"1","author":"Floyd","year":"1993","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"4","key":"10.1016\/S1389-1286(03)00269-X_BIB16","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/357401.357402","article-title":"End-to-end arguments in system design","volume":"2","author":"Saltzer","year":"1984","journal-title":"ACM Transactions on Computer Systems"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB17","doi-asserted-by":"crossref","unstructured":"A. Akella, S. Seshan, R. Karp, S. Shenker, C. Papadimitriou, Selfish behavior and stability of the Internet: a game-theoretic analysis of TCP, in: ACM SIGCOMM, 2002","DOI":"10.1145\/633025.633037"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB18","unstructured":"R. Jain, D.M. Chiu, H. Hawe, A quantitative measure of fairness and discrimination for resource allocation in shared systems, Tech. Rep. DEC-TR-301, Digital Equipment Corporation, 1984"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB19","doi-asserted-by":"crossref","unstructured":"C. Zhang, V. Tsaoussidis, The interrelation of TCP responsiveness and smoothness in heterogeneous networks, in: Proceedings of the 7th IEEE Symposium on Computers and Communications, ISCC, 2002","DOI":"10.1109\/ISCC.2002.1021692"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB20","doi-asserted-by":"crossref","unstructured":"M. Vojnovic, J. Boudec, On the long-run behavior of equation-based rate control, in: ACM SIGCOMM, 2002","DOI":"10.1145\/633025.633036"},{"key":"10.1016\/S1389-1286(03)00269-X_BIB21","unstructured":"K. Ramakrishnan, S. Floyd, A Proposal to add Explicit Congestion Notification (ECN) to IP, RFC 2481"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S138912860300269X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S138912860300269X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T16:43:47Z","timestamp":1584636227000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S138912860300269X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S138912860300269X"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(03)00269-x","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}