{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:18Z","timestamp":1740123678352,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T00:00:00Z","timestamp":1575504000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T00:00:00Z","timestamp":1575504000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Vietnam National Foundation for Science and Technology Development","award":["102.02-2015.36"],"award-info":[{"award-number":["102.02-2015.36"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s11036-019-01436-y","type":"journal-article","created":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T19:02:43Z","timestamp":1575572563000},"page":"1174-1177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Upward Max-Min Fairness Multipath Flow Control"],"prefix":"10.1007","volume":"25","author":[{"given":"Phuong L.","family":"Vo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2954-0097","authenticated-orcid":false,"given":"Tuan-Anh","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen H.","family":"Tran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,5]]},"reference":[{"issue":"3","key":"1436_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1057\/palgrave.jors.2600523","volume":"49","author":"FP Kelly","year":"1998","unstructured":"Kelly FP, Maulloo AK, Tan DKH (1998) Rate control for communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society 49(3):237\u2013252","journal-title":"Journal of the Operational Research Society"},{"issue":"6","key":"1436_CR2","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1109\/90.811451","volume":"7","author":"S Low","year":"1999","unstructured":"Low S, Lapsley D (1999) Optimization flow control, i: Basic algorithm and convergence. IEEE\/ACM Trans Netw 7(6):861\u2013874","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"11","key":"1436_CR3","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1109\/LCOMM.2002.805519","volume":"6","author":"B Wydrowski","year":"2002","unstructured":"Wydrowski B, Zukerman M (2002) MaxNet: A congestion control architecture. IEEE Commun Lett 6 (11):512\u2013514","journal-title":"IEEE Commun Lett"},{"issue":"10","key":"1436_CR4","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1109\/LCOMM.2003.818888","volume":"7","author":"B Wydrowski","year":"2003","unstructured":"Wydrowski B, Andrew L, Zukerman M (2003) Maxnet: a congestion control architecture for scalable network. IEEE Communications Letters 7(10):511\u2013513","journal-title":"IEEE Communications Letters"},{"key":"1436_CR5","doi-asserted-by":"crossref","unstructured":"Wischik D, Handley M, Raiciu C (2009). In: N\u00fa\u00f1ez-Queija R, Resing J (eds) Control of multipath TCP and optimization of multipath routing in the internet, ser. Lecture Notes in Computer Science. Springer , Berlin, p 5894","DOI":"10.1007\/978-3-642-10406-0_14"},{"key":"1436_CR6","unstructured":"Vo PL, Le AT, Hong CS (2012) The successive approximation approach for multi-path utility maximization problem. In: IEEE ICC\u201912"},{"key":"1436_CR7","doi-asserted-by":"crossref","unstructured":"Han H, Shakkottai S, Hollot CV, Srikant R, Towsley D (2006) Multi-path TCP: A joint congestion control and routing scheme to exploit path diversity in the internet, vol 14","DOI":"10.1109\/TNET.2006.886738"},{"issue":"4","key":"1436_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/SURV.2008.080403","volume":"10","author":"D Nace","year":"2008","unstructured":"Nace D, Pioro M (2008) Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial. IEEE Communications Surveys Tutorials 10(4):5\u201317","journal-title":"IEEE Communications Surveys Tutorials"},{"key":"1436_CR9","volume-title":"Data networks","author":"D Bertsekas","year":"1992","unstructured":"Bertsekas D, Gallager R (1992) Data networks, 2nd edn. Prentice-Hall Inc., Upper Saddle River","edition":"2nd edn."},{"issue":"5","key":"1436_CR10","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1109\/90.879343","volume":"8","author":"J Mo","year":"2000","unstructured":"Mo J, Walrand J (2000) Fair end-to-end window-based congestion control. IEEE\/ACM Trans Netw 8 (5):556\u2013567","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"1","key":"1436_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/3011282","volume":"64","author":"E Danna","year":"2017","unstructured":"Danna E, Hassidim A, Kaplan H, Kumar A, Mansour Y, Raz D, Segalov M (2017) Upward Max-Min Fairness. J ACM (JACM) 64(1):2","journal-title":"J ACM (JACM)"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-019-01436-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-019-01436-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-019-01436-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T01:01:40Z","timestamp":1607043700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-019-01436-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,5]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["1436"],"URL":"https:\/\/doi.org\/10.1007\/s11036-019-01436-y","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"type":"print","value":"1383-469X"},{"type":"electronic","value":"1572-8153"}],"subject":[],"published":{"date-parts":[[2019,12,5]]},"assertion":[{"value":"5 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}