Publication
Routing heuristics for load-balanced transmission in TSN-based networks
dc.contributor.author | Ojewale, Mubarak | |
dc.contributor.author | Yomsi, Patrick | |
dc.date.accessioned | 2020-01-16T10:42:28Z | |
dc.date.embargo | 2120 | |
dc.date.issued | 2019 | |
dc.description.abstract | 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. | pt_PT |
dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
dc.identifier.doi | 10.1145/3378408.3378411 | pt_PT |
dc.identifier.issn | 1551-3688 | |
dc.identifier.uri | http://hdl.handle.net/10400.22/15277 | |
dc.language.iso | eng | pt_PT |
dc.peerreviewed | yes | pt_PT |
dc.publisher | Association for Computing Machinery | pt_PT |
dc.relation.publisherversion | https://dl.acm.org/doi/10.1145/3378408.3378411 | pt_PT |
dc.subject | Time Sensitive Networking | pt_PT |
dc.subject | Routing Algorithms | pt_PT |
dc.subject | Congestion | pt_PT |
dc.subject | Load-Balancing | pt_PT |
dc.title | Routing heuristics for load-balanced transmission in TSN-based networks | pt_PT |
dc.type | journal article | |
dspace.entity.type | Publication | |
oaire.citation.endPage | 25 | pt_PT |
oaire.citation.issue | 4 | pt_PT |
oaire.citation.startPage | 20 | pt_PT |
oaire.citation.title | ACM Sigbed Review | pt_PT |
oaire.citation.volume | 16 | pt_PT |
rcaap.rights | closedAccess | pt_PT |
rcaap.type | article | pt_PT |