{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T09:38:09Z","timestamp":1706261889162},"reference-count":16,"publisher":"EDP Sciences","issue":"5","license":[{"start":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T00:00:00Z","timestamp":1632096000000},"content-version":"vor","delay-in-days":19,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2021,8,14]]},"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:p>This paper considers an exact bi-objective approach for simultaneously minimizing the total cost of flow routing and the network bottleneck when link qualities and flow weights are relevant. This is useful for wireless multi-hop networks with long-term TCP (Transmission Control Protocol) flows. The introduced proposal can generate a minimal complete set of Pareto-optimal solutions. Our proposal is evaluated through simulation in which are explored different parameter settings and metrics.<\/jats:p>","DOI":"10.1051\/ro\/2021121","type":"journal-article","created":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T08:49:26Z","timestamp":1629794966000},"page":"2631-2637","source":"Crossref","is-referenced-by-count":2,"title":["Flow routing aiming load balancing and path length in multi-hop networks with different link qualities"],"prefix":"10.1051","volume":"55","author":[{"given":"Leizer L.","family":"Pinto","sequence":"first","affiliation":[]},{"given":"K\u00e1tia C. C.","family":"Fernandes","sequence":"additional","affiliation":[]},{"given":"Kleber V.","family":"Cardoso","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S1389-1286(01)00302-4","volume":"38","author":"Akyildiz","year":"2002","journal-title":"Comput. Netw."},{"key":"R2","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/j.comnet.2004.12.001","volume":"47","author":"Akyildiz","year":"2005","journal-title":"Comput. Netw."},{"key":"R3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"Barab\u00e1si","year":"1999","journal-title":"Science"},{"key":"R4","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1287\/opre.38.1.178","volume":"38","author":"Berman","year":"1990","journal-title":"Oper. Res."},{"key":"R5","doi-asserted-by":"crossref","first-page":"1969","DOI":"10.1016\/j.cor.2011.09.006","volume":"39","author":"Bornstein","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"R6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.adhoc.2016.05.002","volume":"48","author":"de Mello","year":"2016","journal-title":"Ad Hoc Netw."},{"key":"R7","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.compeleceng.2017.04.011","volume":"66","author":"Fan","year":"2018","journal-title":"Comput. Electr. Eng."},{"key":"R8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10479-016-2360-8","volume":"267","author":"Gadegaard","year":"2016","journal-title":"Ann. Oper. Res."},{"key":"R9","doi-asserted-by":"crossref","first-page":"1765","DOI":"10.1016\/j.adhoc.2013.04.002","volume":"11","author":"G\u00e1lvez","year":"2013","journal-title":"Ad Hoc Netw."},{"key":"R10","doi-asserted-by":"crossref","first-page":"1404","DOI":"10.1109\/LCOMM.2012.072012.120502","volume":"16","author":"Liu","year":"2012","journal-title":"IEEE Commun. Lett."},{"key":"R11","doi-asserted-by":"crossref","first-page":"1585","DOI":"10.1109\/TII.2017.2777846","volume":"4","author":"Lu","year":"2018","journal-title":"IEEE Trans. Industr. Inform."},{"key":"R12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(84)90011-0","volume":"17","author":"Martins","year":"1984","journal-title":"Euro. J. Oper. Res."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Martin R., Menth M. and Hemmkeppler M., Accuracy and dynamics of hash-based load balancing algorithms for multipath internet routing. In: 2006 3rd International Conference on Broadband Communications, Networks and Systems. IEEE (2006) pp. 1\u201310.","DOI":"10.1109\/BROADNETS.2006.4374377"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Patil P., Hakiri A., Barve Y., and Gokhale A., Enabling Software-Defined Networking for Wireless Mesh Networks in smart environments. In: IEEE 15th International Symposium on Network Computing and Applications (NCA). IEEE (2016) 153\u2013157.","DOI":"10.1109\/NCA.2016.7778610"},{"key":"R15","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.cor.2019.02.004","volume":"106","author":"Pinto","year":"2019","journal-title":"Compute. Oper. Res."},{"key":"R16","first-page":"662","volume":"14","author":"Prabhavat","year":"2011","journal-title":"IEEE Commun. Surv. Tutor."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2021121\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T07:58:22Z","timestamp":1632124702000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2021121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":16,"journal-issue":{"issue":"5"},"alternative-id":["ro200574"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2021121","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9]]}}}