{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:55:06Z","timestamp":1776956106065,"version":"3.51.4"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2018,8,15]],"date-time":"2018-08-15T00:00:00Z","timestamp":1534291200000},"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":[[2018,8,15]]},"abstract":"<jats:p>\n            The recently published\n            <jats:italic>IEEE 802.1Qbv<\/jats:italic>\n            standard specifies enhancements for providing real-time communication guarantees for time-triggered flows while also handling best-effort traffic in a converged Ethernet network. The enhancements include a programmable time-based gating mechanism for stipulating which of the queues of an egress port are available for transmission at any given point of time. By appropriately programming (opening and closing) these gates, the traversal of packets through the network can be controlled to precisely follow a precomputed schedule that satisfies the timing constraints of the time-triggered flows. Computing such transmission schedules requires routing of the flows in the first step, followed by the computation of gate schedules for the flows along their respective routes. So far off-the-shelf algorithms like shortest path routing, which optimize the number of hops over which flows are routed, have been used for computing routes for the time-triggered traffic. In this paper, we explore how the routing of time-triggered flows affects their schedulability. Moreover, we identify additional parameters that must be considered while routing time-triggered traffic and propose ILP-based algorithms for the purpose. Our evaluations show that the proposed routing algorithms could improve the slack in the computed schedules by upto 60 % and 30 % compared to shortest path routing and equal cost multi-pathing (ECMP), respectively, and, thus, increase the capacity of the network to accommodate more time-triggered traffic.\n          <\/jats:p>","DOI":"10.1145\/3267419.3267421","type":"journal-article","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T12:11:42Z","timestamp":1534767102000},"page":"13-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["Routing algorithms for IEEE802.1Qbv networks"],"prefix":"10.1145","volume":"15","author":[{"given":"Naresh Ganesh","family":"Nayak","sequence":"first","affiliation":[{"name":"Institute for Distributed and Parallel Systems, Stuttgart, Germany"}]},{"given":"Frank","family":"D\u00fcrr","sequence":"additional","affiliation":[{"name":"Institute for Distributed and Parallel Systems, Stuttgart, Germany"}]},{"given":"Kurt","family":"Rothermel","sequence":"additional","affiliation":[{"name":"Institute for Distributed and Parallel Systems, Stuttgart, Germany"}]}],"member":"320","published-online":{"date-parts":[[2018,8,15]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"1D","article-title":"IEEE Standard for Local and metropolitan area networks","volume":"802","year":"2004","unstructured":"2004 . IEEE Standard for Local and metropolitan area networks : Media Access Control (MAC) Bridges. IEEE Std 802 . 1D - 2004 (Revision of IEEE Std 802.1D-1998) (2004), 1--277. 2004. IEEE Standard for Local and metropolitan area networks: Media Access Control (MAC) Bridges. IEEE Std 802.1D-2004 (Revision of IEEE Std 802.1D-1998) (2004), 1--277.","journal-title":"Media Access Control (MAC) Bridges. IEEE Std"},{"key":"e_1_2_1_2_1","volume-title":"IEEE Standard for Local and metropolitan area networks-Bridges and Bridged Networks","year":"2014","unstructured":"2014. IEEE Standard for Local and metropolitan area networks-Bridges and Bridged Networks . IEEE Std 802.1Q- 2014 (Revision of IEEE Std 802.1Q-2011) (2014), 1--1832. 2014. IEEE Standard for Local and metropolitan area networks-Bridges and Bridged Networks. IEEE Std 802.1Q-2014 (Revision of IEEE Std 802.1Q-2011) (2014), 1--1832."},{"key":"e_1_2_1_3_1","volume-title":"IEEE Standard for Local and metropolitan area networks - Bridges and Bridged Networks - Amendment 26: Frame Preemption","year":"2016","unstructured":"2016. IEEE Standard for Local and metropolitan area networks - Bridges and Bridged Networks - Amendment 26: Frame Preemption . IEEE Std 802.1Qbu- 2016 (Amendment to IEEE Std 802.1Q-2014) (2016), 1--52. 2016. IEEE Standard for Local and metropolitan area networks - Bridges and Bridged Networks - Amendment 26: Frame Preemption. IEEE Std 802.1Qbu-2016 (Amendment to IEEE Std 802.1Q-2014) (2016), 1--52."},{"key":"e_1_2_1_4_1","volume-title":"IEEE Standard for Local and metropolitan area networks - Bridges and Bridged Networks - Amendment 25: Enhancements for Scheduled Traffic","year":"2015","unstructured":"2016. IEEE Standard for Local and metropolitan area networks - Bridges and Bridged Networks - Amendment 25: Enhancements for Scheduled Traffic . IEEE Std 802.1Qbv- 2015 (2016), 1--57. 2016. IEEE Standard for Local and metropolitan area networks - Bridges and Bridged Networks - Amendment 25: Enhancements for Scheduled Traffic. IEEE Std 802.1Qbv-2015 (2016), 1--57."},{"key":"e_1_2_1_5_1","volume-title":"IEEE Standard for Local and metropolitan area networks- Bridges and Bridged Networks - Amendment 24: Path Control and Reservation","year":"2015","unstructured":"2016. IEEE Standard for Local and metropolitan area networks- Bridges and Bridged Networks - Amendment 24: Path Control and Reservation . IEEE Std 802.1Qca- 2015 (Amendment to IEEE Std 802.1Q- as amended by IEEE Std 802.1Qcd-2015 and IEEE Std 802.1Q---\/Cor 1-2015) (2016), 1--120. 2016. IEEE Standard for Local and metropolitan area networks- Bridges and Bridged Networks - Amendment 24: Path Control and Reservation. IEEE Std 802.1Qca-2015 (Amendment to IEEE Std 802.1Q- as amended by IEEE Std 802.1Qcd-2015 and IEEE Std 802.1Q---\/Cor 1-2015) (2016), 1--120."},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation (NSDI'10)","author":"Al-Fares Mohammad","year":"2010","unstructured":"Mohammad Al-Fares , Sivasankar Radhakrishnan , Barath Raghavan , Nelson Huang , and Amin Vahdat . 2010 . Hedera: Dynamic Flow Scheduling for Data Center Networks . In Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation (NSDI'10) . 19--19. Mohammad Al-Fares, Sivasankar Radhakrishnan, Barath Raghavan, Nelson Huang, and Amin Vahdat. 2010. Hedera: Dynamic Flow Scheduling for Data Center Networks. In Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation (NSDI'10). 19--19."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2997465.2997470"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2997465.2997494"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2010.2052819"},{"key":"e_1_2_1_10_1","volume-title":"Proc. of the IEEE 101","author":"Johas Teener M.D.","year":"2013","unstructured":"M.D. Johas Teener , A.N. Fredette , C. Boiger , P. Klein , C. Gunther , D. Olsen , and K. Stanton . 2013. Heterogeneous Networks for Audio and Video: Using IEEE 802.1 Audio Video Bridging . Proc. of the IEEE 101 , 11 ( Nov 2013 ), 2339--2354. M.D. Johas Teener, A.N. Fredette, C. Boiger, P. Klein, C. Gunther, D. Olsen, and K. Stanton. 2013. Heterogeneous Networks for Audio and Video: Using IEEE 802.1 Audio Video Bridging. Proc. of the IEEE 101, 11 (Nov 2013), 2339--2354."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3015037.3015044"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2997465.2997487"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626309"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2010.25"}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3267419.3267421","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3267419.3267421","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:43Z","timestamp":1750208263000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3267419.3267421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,15]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,8,15]]}},"alternative-id":["10.1145\/3267419.3267421"],"URL":"https:\/\/doi.org\/10.1145\/3267419.3267421","relation":{},"ISSN":["1551-3688"],"issn-type":[{"value":"1551-3688","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,15]]},"assertion":[{"value":"2018-08-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}