{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T11:09:08Z","timestamp":1779275348365,"version":"3.51.4"},"reference-count":26,"publisher":"American Institute of Aeronautics and Astronautics (AIAA)","issue":"6","funder":[{"name":"MDA Space"},{"DOI":"10.13039\/501100019217","name":"Institut de valorisation des donn\u00e9es","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100019217","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015773","name":"Consortium de recherche et d'innovation en a\u00e9rospatiale au Qu\u00e9bec","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100015773","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["arc.aiaa.org"],"crossmark-restriction":true},"short-container-title":["Journal of Aerospace Information Systems"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:p>The rise in low Earth orbit (LEO) satellite Internet services has led to increasing demand, often exceeding available data rates and compromising the quality of service. While deploying more satellites offers a short-term fix, designing higher-performance satellites with enhanced transmission capabilities provides a more sustainable solution. Achieving the necessary high capacity requires interconnecting multiple modem banks within a satellite payload. However, there is a notable gap in research on internal packet routing within extremely high-throughput satellites. To address this, we propose a real-time optimal flow allocation and priority queue scheduling method using an online convex optimization-based model predictive control. We model the problem as a multicommodity flow instance and employ an online interior-point method to solve the routing and scheduling optimization iteratively. This approach minimizes packet loss and supports real-time rerouting with a low computational overhead. Our method is tested in numerical simulation on a next-generation extremely high-throughput satellite model, demonstrating its effectiveness compared to a reference batch optimization and to traditional methods.<\/jats:p>","DOI":"10.2514\/1.i011725","type":"journal-article","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T15:58:26Z","timestamp":1770911906000},"page":"499-506","update-policy":"https:\/\/doi.org\/10.2514\/aiaa_crossmarkpolicy","source":"Crossref","is-referenced-by-count":0,"title":["Online Convex Optimization for On-Board Routing in High-Throughput Satellites"],"prefix":"10.2514","volume":"23","author":[{"given":"Olivier","family":"B\u00e9langer","sequence":"first","affiliation":[{"name":"Polytechnique Montr\u00e9al"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Luc","family":"Lupien","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olfa Ben","family":"Yahia","sequence":"additional","affiliation":[{"name":"Polytechnique Montr\u00e9al"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Martel","sequence":"additional","affiliation":[{"name":"MDA Space"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Lesage-Landry","sequence":"additional","affiliation":[{"name":"Polytechnique Montr\u00e9al"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gunes Karabulut","family":"Kurt","sequence":"additional","affiliation":[{"name":"Polytechnique Montr\u00e9al"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1387","reference":[{"key":"r1","unstructured":"BrodkinJ. \u201cStarlink Is Getting a Lot Slower as More People Use It, Speed Tests Show,\u201d Ars Technica, 2022, https:\/\/arstechnica.com\/tech-policy\/2022\/09\/ookla-starlinks-median-us-download-speed-fell-nearly-30mbps-in-q2-2022\/."},{"key":"r2","unstructured":"AndersD. \u201cStarlink Internet Review: Is It Worth the Cost,\u201d CNET, 2024, https:\/\/www.cnet.com\/home\/internet\/best-satellite-internet\/."},{"key":"r3","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2024.3450292"},{"key":"r4","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2024.3514452"},{"key":"r5","doi-asserted-by":"publisher","DOI":"10.3390\/electronics8060683"},{"key":"r6","doi-asserted-by":"crossref","unstructured":"B\u00e9langerO.Ben YahiaO.MartelS.Lesage-LandryA.Karabulut KurtG. \u201cQuality of Service-Constrained Online Routing in High Throughput Satellites,\u201d IEEE Aerospace Conference, 2024, pp.\u00a01\u20139. 10.1109\/AERO58975.2024.10521272","DOI":"10.1109\/AERO58975.2024.10521272"},{"key":"r7","doi-asserted-by":"crossref","unstructured":"KakoulliE. \u201cLatest Innovations in Intelligent Network-on-Chip Architectures: A Systematic Review,\u201d 17th IEEE\/ACM International Workshop on Network on Chip Architectures (NoCArc), 2024, pp.\u00a01\u20136. 10.1109\/NoCArc64615.2024.10749933","DOI":"10.1109\/NoCArc64615.2024.10749933"},{"key":"r8","doi-asserted-by":"publisher","DOI":"10.1109\/MDAT.2023.3306719"},{"key":"r9","doi-asserted-by":"publisher","DOI":"10.1109\/MDAT.2024.3471989"},{"key":"r10","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-021-07682-3"},{"key":"r11","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.3044972"},{"key":"r12","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2009.2017934"},{"key":"r13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2024.3491819"},{"key":"r14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2351991"},{"key":"r15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3040249"},{"key":"r16","unstructured":"LiY.LiN. \u201cLeveraging Predictions in Smoothed Online Convex Optimization via Gradient-Based Algorithms,\u201d Advances in Neural Information Processing Systems (NeurIPS), edited by LarochelleH.RanzatoM.HadsellR.BalcanM. F.LinH., Vol.\u00a033, Curran Assoc., Red Hook, NY, 2020, pp.\u00a014520\u201314531."},{"key":"r17","unstructured":"ChenN.AgarwalA.WiermanA.BarmanS.AndrewL. L. H. \u201cOnline Convex Optimization Using Predictions,\u201d arXiv: 1504.06681, 2015. 10.1145\/2745844"},{"key":"r18","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-008-0098-1"},{"key":"r19","first-page":"671","volume":"7","author":"Scott S.","year":"2003","journal-title":"Bayesian Statistics"},{"key":"r20","volume-title":"Introduction to Online Convex Optimization","author":"Hazan E.","year":"2022","edition":"2"},{"key":"r21","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"r22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"r23","unstructured":"ZinkevichM. \u201cOnline Convex Programming and Generalized Infinitesimal Gradient Ascent,\u201d Proceedings of the 20th International Conference on Machine Learning (ICML), AAAI Press, Menlo Park, CA, 2003, pp.\u00a0928\u2013935."},{"key":"r24","volume-title":"The MOSEK Optimization Software","year":"2023"},{"key":"r25","doi-asserted-by":"publisher","DOI":"10.1137\/050633421"},{"key":"r26","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-40065-5_18"}],"container-title":["Journal of Aerospace Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arc.aiaa.org\/doi\/pdf\/10.2514\/1.I011725","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T10:44:56Z","timestamp":1779273896000},"score":1,"resource":{"primary":{"URL":"https:\/\/arc.aiaa.org\/doi\/10.2514\/1.I011725"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["10.2514\/1.I011725"],"URL":"https:\/\/doi.org\/10.2514\/1.i011725","relation":{},"ISSN":["1940-3151","2327-3097"],"issn-type":[{"value":"1940-3151","type":"print"},{"value":"2327-3097","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"2025-07-07","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-23","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}