{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:49:26Z","timestamp":1783612166930,"version":"3.55.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T00:00:00Z","timestamp":1578268800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGBED Rev."],"published-print":{"date-parts":[[2020,1,6]]},"abstract":"<jats:p>A carefully designed routing synthesis can help system designers achieve a better load balancing in TSN-based networks and avoid congestion. To this end purpose, this work proposes two heuristics referred to as (1) LB-DRR, which aims at achieving a better load balancing and compute as much disjoint routing paths as possible for each replicated flow; and (2) CR-DRR, which recomputes paths for time-sensitive flows in congestion situations. Extensive simulations demonstrate that the proposed approach outperforms the classical Shortest Path (SPA) and the weighted Equal Cost Multi-path (wt-ECMP) algorithms in terms of the maximum load transmitted on a link by more than 70% and 20%, respectively.<\/jats:p>","DOI":"10.1145\/3378408.3378411","type":"journal-article","created":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T19:03:23Z","timestamp":1578337403000},"page":"20-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["Routing heuristics for load-balanced transmission in TSN-based networks"],"prefix":"10.1145","volume":"16","author":[{"given":"Mubarak Adetunji","family":"Ojewale","sequence":"first","affiliation":[{"name":"CISTER Research Centre, ISEP Polytechnic Institute of Porto, Portugal"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick Meumeu","family":"Yomsi","sequence":"additional","affiliation":[{"name":"CISTER Research Centre, ISEP Polytechnic Institute of Porto, Portugal"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,1,6]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"207","volume-title":"Third Int. Scientific Practical Conf.","author":"Arif F. A. R.","year":"2016"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2997465.2997494"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOP734"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3139258.3139284"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/inte.20.4.74"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1483"},{"key":"e_1_2_1_7_1","unstructured":"IEEE. Time-Sensitive Networking Task Group.  IEEE. Time-Sensitive Networking Task Group."},{"key":"e_1_2_1_8_1","volume-title":"IEEE Standard for Local and metropolitan area networks---Bridges and Bridged Networks - Amendment 24","author":"IEEE.","year":"2016"},{"key":"e_1_2_1_9_1","first-page":"1","volume-title":"IEEE Comm. Surveys & Tutorials","author":"Nasrallah A.","year":"2018"},{"key":"e_1_2_1_10_1","volume-title":"RTN workshop, ECRTS","author":"Nayak N. G.","year":"2017"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cps.2016.0021"},{"key":"e_1_2_1_12_1","volume-title":"Routing Algorithms for Time Sensitive Networks. Master's thesis","author":"Singh S.","year":"2017"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.819168"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.536364"}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3378408.3378411","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3378408.3378411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:45:04Z","timestamp":1750203904000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3378408.3378411"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,6]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,1,6]]}},"alternative-id":["10.1145\/3378408.3378411"],"URL":"https:\/\/doi.org\/10.1145\/3378408.3378411","relation":{},"ISSN":["1551-3688"],"issn-type":[{"value":"1551-3688","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,6]]},"assertion":[{"value":"2020-01-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}