{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:36:45Z","timestamp":1760243805519,"version":"build-2065373602"},"reference-count":39,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:00:00Z","timestamp":1661731200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"School of IT Research Grants (Deakin University)"},{"name":"Canada\u2019s Natural Sciences and Engineering Research Council (NSERC)"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>There is no well-defined utility function for existing multipath TCP algorithms. Therefore, network utility maximization (NUM) for MPTCP is a complex undertaking. To resolve this, we develop a novel condition under which Kelly\u2019s NUM mechanism may be used to explicitly compute the equilibrium. We accomplish this by defining a new utility function for MPTCP by employing Tullock\u2019s rent-seeking paradigm from game theory. We investigate the convergence of no-regret learning in the underlying network games with continuous actions. Based on our understanding of the design space, we propose an original MPTCP algorithm that generalizes existing algorithms and strikes a good balance among the important properties. We implemented this algorithm in the Linux kernel, and we evaluated its performance experimentally.<\/jats:p>","DOI":"10.3390\/fi14090257","type":"journal-article","created":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T21:01:31Z","timestamp":1661806891000},"page":"257","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Game-Theoretic Rent-Seeking Framework for Improving Multipath TCP Performance"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5819-765X","authenticated-orcid":false,"given":"Shiva Raj","family":"Pokhrel","sequence":"first","affiliation":[{"name":"School of Information Technology, Deakin University, Geelong, VIC 3220, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carey","family":"Williamson","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Calgary, Calgary, AB T2N 1N4, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,8,29]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/3453953.3453968","article-title":"A Rent-Seeking Framework for Multipath TCP","volume":"48","author":"Pokhrel","year":"2021","journal-title":"ACM Sigmetrics Perform. Eval. Rev."},{"key":"ref_2","unstructured":"Study on Access Traffic Steering, Switch and Splitting Support in the 5G System Architecture Phase 2 (Release 17) (Standard No. 3GPP TS23.700-93, V17.0.0). Available online: https:\/\/portal.3gpp.org\/desktopmodules\/Specifications\/SpecificationDetails.aspx?specificationId=3649."},{"key":"ref_3","unstructured":"System Architecture for the 5G System (V 16.4) (Standard No. 3GPP TS 23.501). Available online: https:\/\/portal.3gpp.org\/desktopmodules\/Specifications\/SpecificationDetails.aspx?specificationId=3144."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Raiciu, C., Handly, M., and Wischik, D. (2022, June 07). Coupled Congestion Control for Multipath Transport Protocols. IETF RFC 6356. October 2011. Available online: https:\/\/www.rfc-editor.org\/rfc\/rfc6356.html.","DOI":"10.17487\/rfc6356"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"8489","DOI":"10.1109\/TCOMM.2019.2941926","article-title":"Low-Delay Scheduling for Internet of Vehicles: Load-Balanced Multipath Communication with FEC","volume":"67","author":"Pokhrel","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1057\/palgrave.jors.2600523","article-title":"Rate Control for Communication Networks: Shadow Prices, Proportional Fairness and Stability","volume":"49","author":"Kelly","year":"1998","journal-title":"J. Oper. Res. Soc."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/ett.4460080106","article-title":"Charging and rate control for elastic traffic","volume":"8","author":"Kelly","year":"1997","journal-title":"Eur. Trans. Telecommun."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Tullock, G. (2005). The Rent-Seeking Society, Liberty Fund.","DOI":"10.4337\/9781845424688.00012"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1651","DOI":"10.1109\/TNET.2013.2274462","article-title":"MPTCP is Not Pareto-optimal: Performance Issues and a Possible Solution","volume":"21","author":"Khalili","year":"2013","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"2562","DOI":"10.1109\/TMC.2018.2876366","article-title":"Improving Multipath TCP Performance over WiFi and Cellular Networks: An Analytical Approach","volume":"18","author":"Pokhrel","year":"2019","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1109\/TMC.2018.2840701","article-title":"Fair Coexistence of Regular and Multipath TCP over Wireless Last-Miles","volume":"18","author":"Pokhrel","year":"2019","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Reiffers-Masson, A., Hayel, Y., and Altman, E. (2014, January 6\u201310). Game Theory Approach for Modeling Competition over Visibility on Social Networks. Proceedings of the 6th IEEE International Conference on Communication Systems and Networks (COMSNETS), Bangalore, India.","DOI":"10.1109\/COMSNETS.2014.6734939"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Altman, E., Datar, M., Burnside, G., and Touati, C. (2019, January 25\u201326). Normalized Equilibrium in Tullock Rent Seeking Game. Proceedings of the Game Theory for Networks, Paris, France.","DOI":"10.1007\/978-3-030-16989-3_8"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s13226-016-0185-4","article-title":"Generalising Diagonal Strict Concavity Property for Uniqueness of Nash Equilibrium","volume":"47","author":"Altman","year":"2016","journal-title":"Indian J. Pure Appl. Math."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Chen, Y., Lim, Y., Gibbens, R., Nahum, E., Khalili, R., and Towsley, D. (2013, January 25\u201327). A Measurement-based Study of Multipath TCP Performance over Wireless Networks. Proceedings of the ACM Internet Measurement Conference (IMC), Barcelona, Spain.","DOI":"10.1145\/2504730.2504751"},{"key":"ref_16","unstructured":"Hajek, B., and Gopalakrishnan, G. (2002, January 24\u201329). Do greedy autonomous systems make for a sensible Internet. Proceedings of the Conference on Stochastic Networks, Stanford, CA, USA."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1287\/moor.1040.0091","article-title":"Efficiency loss in a network resource allocation game","volume":"29","author":"Johariand","year":"2004","journal-title":"Math. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"520","DOI":"10.2307\/1911749","article-title":"Existence and Uniqueness of Equilibrium Points for Concave N-Person Games","volume":"33","author":"Rosen","year":"1965","journal-title":"Econometrica"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Stoenescu, T.M., and Teneketzis, D. (2005). Decentralized resource allocation mechanisms in networks: Realization and implementation. Advances in Control, Communication Networks, and Transportation Systems, Birkh\u00e4user.","DOI":"10.1007\/0-8176-4409-1_13"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1730","DOI":"10.1109\/TNET.2021.3075837","article-title":"Towards Stability Analysis of Data Transport Mechanisms: A Fluid Model and Its Applications","volume":"29","author":"Vardoyan","year":"2021","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1477","DOI":"10.1109\/TNET.2021.3066505","article-title":"Combating Bufferbloat in Multi-Bottleneck Networks: Theory and Algorithms","volume":"29","author":"Ye","year":"2021","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/1866739.1866762","article-title":"Path Selection and Multipath Congestion Control","volume":"54","author":"Key","year":"2011","journal-title":"Commun. ACM"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1109\/TNET.2014.2379698","article-title":"Multipath TCP: Analysis, Design, and Implementation","volume":"24","author":"Peng","year":"2016","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_24","unstructured":"Peng, Q., Walid, A., and Low, S. (2013, January 18\u201320). Multipath TCP: Theory and Design. Proceedings of the ACM SIGMETRICS, Pittsburgh, PA, USA."},{"key":"ref_25","unstructured":"Tullock, G., Brady, G., and Seldon, A. (2002). Government Failure: A Primer in Public Choice, Cato Institute."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1109\/90.556341","article-title":"Dynamic Bandwidth Allocation Using Loss-Load Curves","volume":"4","author":"Williamson","year":"1996","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1006\/game.1995.1023","article-title":"Quantal Response Equilibria for Normal Form Games","volume":"10","author":"McKelvey","year":"1995","journal-title":"Games Econ. Behav."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","article-title":"Primal-Dual Subgradient Methods for Convex Problems","volume":"120","author":"Nesterov","year":"2009","journal-title":"Math. Program."},{"key":"ref_29","unstructured":"Padhye, J., Firoiu, V., Towsley, D., and Kurose, J. (September, January 31). Modeling TCP Throughput: A Simple Model and its Empirical Validation. Proceedings of the ACM SIGCOMM\u201998 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, Vancouver, BC, Canada."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s10107-018-1254-8","article-title":"Learning in Games with Continuous Action Sets and Unknown Payoff Functions","volume":"173","author":"Mertikopoulos","year":"2019","journal-title":"Math. Program."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1287\/moor.2016.0778","article-title":"Learning in Games via Reinforcement and Regularization","volume":"41","author":"Mertikopoulos","year":"2016","journal-title":"Math. Oper. Res."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1561\/2200000018","article-title":"Online Learning and Online Convex Optimization","volume":"4","year":"2011","journal-title":"Found. Trends Mach. Learn."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"10299","DOI":"10.1109\/JIOT.2021.3056466","article-title":"Multipath TCP Meets Transfer Learning: A Novel Edge-based Learning For Industrial IoT","volume":"8","author":"Pokhrel","year":"2021","journal-title":"IEEE Internet Things J."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Pokhrel, S.R., and Walid, A. (2021). Learning to harness bandwidth with multipath congestion control and scheduling. IEEE Trans. Mob. Comput.","DOI":"10.36227\/techrxiv.14701227.v1"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"15197","DOI":"10.1007\/s00521-022-07065-z","article-title":"Learning from data streams for automation and orchestration of 6G industrial IoT: Toward a semantic communication framework","volume":"34","author":"Pokhrel","year":"2022","journal-title":"Neural Comput. Appl."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"9032","DOI":"10.1109\/TVT.2022.3175173","article-title":"Data Privacy of Wireless Charging Vehicle to Grid (V2G) Networks with Federated Learning","volume":"71","author":"Pokhrel","year":"2022","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_37","unstructured":"Luo, T., Kanhere, S.S., Tan, H.-P., Wu, F., and Wu, H. (May, January 26). Crowdsourcing with tullock contests: A new perspective. Proceedings of the IEEE Conference on Computer Communications (INFOCOM), Hong Kong, China."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Altman, E., Menasch\u00e9, D., Reiffers-Masson, A., Datar, M., Dhamal, S., Touati, C., and El-Azouzi, R. (2020). Blockchain competition between miners: A game theoretic perspective. Front. Blockchain, 26.","DOI":"10.3389\/fbloc.2019.00026"},{"key":"ref_39","unstructured":"Datar, M., and Altman, E. (September, January 31). Strategic Resource Management in 5G Network Slicing. Proceedings of the IEEE International Teletraffic Congress (ITC-33), Avignon, France."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/14\/9\/257\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:19:49Z","timestamp":1760141989000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/14\/9\/257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,29]]},"references-count":39,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2022,9]]}},"alternative-id":["fi14090257"],"URL":"https:\/\/doi.org\/10.3390\/fi14090257","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2022,8,29]]}}}