Routing and scheduling for 1+1 protected DetNet flows
Deterministic Networking (DetNet) is attracting a lot of attention lately due to their ability to provide bounded latency and zero packet loss for time-sensitive applications. In this paper, we formulate the routing and scheduling problem for 1+1 protected DetNet flows based on Cycle Specified Queui...
Gespeichert in:
| Veröffentlicht in: | Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2022-07, Vol.211, p.108960, Article 108960 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | 108960 |
| container_title | Computer networks (Amsterdam, Netherlands : 1999) |
| container_volume | 211 |
| creator | Sharma, Gourav Prateek Tavernier, Wouter Colle, Didier Pickavet, Mario |
| description | Deterministic Networking (DetNet) is attracting a lot of attention lately due to their ability to provide bounded latency and zero packet loss for time-sensitive applications. In this paper, we formulate the routing and scheduling problem for 1+1 protected DetNet flows based on Cycle Specified Queuing and Forwarding (CSQF). The solution to this problem selects two paths between the two endpoints of each service request and schedules packet transmission on these paths meanwhile maximizing the accepted traffic. We have modelled the problem using Integer Linear Programming (ILP). We also propose two heuristic approaches: greedy and Tabu-search (TS) that can perform 1+1 routing and scheduling for a large number of requests in a reasonable time. Eventually, the performance of the ILP approach and heuristics is evaluated by performing simulation experiments. The results highlight the scalability of the two heuristics as compared to the ILP and superior performance of TS over greedy. The trade-off of cycle time on traffic acceptance and end-to-end delay is also presented. |
| doi_str_mv | 10.1016/j.comnet.2022.108960 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2725349885</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1389128622001372</els_id><sourcerecordid>2725349885</sourcerecordid><originalsourceid>FETCH-LOGICAL-c380t-96539d1a87e8881e59257e85f3c8ba4073c234652bb228bf71aed0428739ecc03</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhoMouK7-Aw8Fj9I1H00zuQiyrh-wKIieQ5tOtWW3WZNU8d-bpZ49zQfvzLzzEHLO6IJRVl71C-u2A8YFp5ynFuiSHpAZA8VzRUt9mHIBOmccymNyEkJPKS0KDjMiX9wYu-E9q4YmC_YDm3GzL1vnM3bJsp13EW3EJrvF-IQxazfuO5ySo7baBDz7i3Pydrd6XT7k6-f7x-XNOrcCaMx1KYVuWAUKAYCh1FymVLbCQl0VVAnLRVFKXtecQ90qVmFDky8lNFpLxZxcTHuTjc8RQzS9G_2QThquuBSFBpBJVUwq610IHluz89228j-GUbMHZHozATJ7QGYClMaupzFMH3x16E2wHQ4Wm86nl03juv8X_AJZW24B</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2725349885</pqid></control><display><type>article</type><title>Routing and scheduling for 1+1 protected DetNet flows</title><source>ScienceDirect Journals (5 years ago - present)</source><creator>Sharma, Gourav Prateek ; Tavernier, Wouter ; Colle, Didier ; Pickavet, Mario</creator><creatorcontrib>Sharma, Gourav Prateek ; Tavernier, Wouter ; Colle, Didier ; Pickavet, Mario</creatorcontrib><description>Deterministic Networking (DetNet) is attracting a lot of attention lately due to their ability to provide bounded latency and zero packet loss for time-sensitive applications. In this paper, we formulate the routing and scheduling problem for 1+1 protected DetNet flows based on Cycle Specified Queuing and Forwarding (CSQF). The solution to this problem selects two paths between the two endpoints of each service request and schedules packet transmission on these paths meanwhile maximizing the accepted traffic. We have modelled the problem using Integer Linear Programming (ILP). We also propose two heuristic approaches: greedy and Tabu-search (TS) that can perform 1+1 routing and scheduling for a large number of requests in a reasonable time. Eventually, the performance of the ILP approach and heuristics is evaluated by performing simulation experiments. The results highlight the scalability of the two heuristics as compared to the ILP and superior performance of TS over greedy. The trade-off of cycle time on traffic acceptance and end-to-end delay is also presented.</description><identifier>ISSN: 1389-1286</identifier><identifier>EISSN: 1872-7069</identifier><identifier>DOI: 10.1016/j.comnet.2022.108960</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>CSQF ; Cycle time ; DetNet ; Heuristic methods ; Integer programming ; Linear programming ; Packet transmission ; Protection ; Queueing ; Scheduling ; Traffic models</subject><ispartof>Computer networks (Amsterdam, Netherlands : 1999), 2022-07, Vol.211, p.108960, Article 108960</ispartof><rights>2022 Elsevier B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Jul 5, 2022</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c380t-96539d1a87e8881e59257e85f3c8ba4073c234652bb228bf71aed0428739ecc03</citedby><cites>FETCH-LOGICAL-c380t-96539d1a87e8881e59257e85f3c8ba4073c234652bb228bf71aed0428739ecc03</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.comnet.2022.108960$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3548,27923,27924,45994</link.rule.ids></links><search><creatorcontrib>Sharma, Gourav Prateek</creatorcontrib><creatorcontrib>Tavernier, Wouter</creatorcontrib><creatorcontrib>Colle, Didier</creatorcontrib><creatorcontrib>Pickavet, Mario</creatorcontrib><title>Routing and scheduling for 1+1 protected DetNet flows</title><title>Computer networks (Amsterdam, Netherlands : 1999)</title><description>Deterministic Networking (DetNet) is attracting a lot of attention lately due to their ability to provide bounded latency and zero packet loss for time-sensitive applications. In this paper, we formulate the routing and scheduling problem for 1+1 protected DetNet flows based on Cycle Specified Queuing and Forwarding (CSQF). The solution to this problem selects two paths between the two endpoints of each service request and schedules packet transmission on these paths meanwhile maximizing the accepted traffic. We have modelled the problem using Integer Linear Programming (ILP). We also propose two heuristic approaches: greedy and Tabu-search (TS) that can perform 1+1 routing and scheduling for a large number of requests in a reasonable time. Eventually, the performance of the ILP approach and heuristics is evaluated by performing simulation experiments. The results highlight the scalability of the two heuristics as compared to the ILP and superior performance of TS over greedy. The trade-off of cycle time on traffic acceptance and end-to-end delay is also presented.</description><subject>CSQF</subject><subject>Cycle time</subject><subject>DetNet</subject><subject>Heuristic methods</subject><subject>Integer programming</subject><subject>Linear programming</subject><subject>Packet transmission</subject><subject>Protection</subject><subject>Queueing</subject><subject>Scheduling</subject><subject>Traffic models</subject><issn>1389-1286</issn><issn>1872-7069</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAQhoMouK7-Aw8Fj9I1H00zuQiyrh-wKIieQ5tOtWW3WZNU8d-bpZ49zQfvzLzzEHLO6IJRVl71C-u2A8YFp5ynFuiSHpAZA8VzRUt9mHIBOmccymNyEkJPKS0KDjMiX9wYu-E9q4YmC_YDm3GzL1vnM3bJsp13EW3EJrvF-IQxazfuO5ySo7baBDz7i3Pydrd6XT7k6-f7x-XNOrcCaMx1KYVuWAUKAYCh1FymVLbCQl0VVAnLRVFKXtecQ90qVmFDky8lNFpLxZxcTHuTjc8RQzS9G_2QThquuBSFBpBJVUwq610IHluz89228j-GUbMHZHozATJ7QGYClMaupzFMH3x16E2wHQ4Wm86nl03juv8X_AJZW24B</recordid><startdate>20220705</startdate><enddate>20220705</enddate><creator>Sharma, Gourav Prateek</creator><creator>Tavernier, Wouter</creator><creator>Colle, Didier</creator><creator>Pickavet, Mario</creator><general>Elsevier B.V</general><general>Elsevier Sequoia S.A</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>E3H</scope><scope>F2A</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20220705</creationdate><title>Routing and scheduling for 1+1 protected DetNet flows</title><author>Sharma, Gourav Prateek ; Tavernier, Wouter ; Colle, Didier ; Pickavet, Mario</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c380t-96539d1a87e8881e59257e85f3c8ba4073c234652bb228bf71aed0428739ecc03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>CSQF</topic><topic>Cycle time</topic><topic>DetNet</topic><topic>Heuristic methods</topic><topic>Integer programming</topic><topic>Linear programming</topic><topic>Packet transmission</topic><topic>Protection</topic><topic>Queueing</topic><topic>Scheduling</topic><topic>Traffic models</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sharma, Gourav Prateek</creatorcontrib><creatorcontrib>Tavernier, Wouter</creatorcontrib><creatorcontrib>Colle, Didier</creatorcontrib><creatorcontrib>Pickavet, Mario</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Library & Information Sciences Abstracts (LISA)</collection><collection>Library & Information Science Abstracts (LISA)</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sharma, Gourav Prateek</au><au>Tavernier, Wouter</au><au>Colle, Didier</au><au>Pickavet, Mario</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Routing and scheduling for 1+1 protected DetNet flows</atitle><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle><date>2022-07-05</date><risdate>2022</risdate><volume>211</volume><spage>108960</spage><pages>108960-</pages><artnum>108960</artnum><issn>1389-1286</issn><eissn>1872-7069</eissn><abstract>Deterministic Networking (DetNet) is attracting a lot of attention lately due to their ability to provide bounded latency and zero packet loss for time-sensitive applications. In this paper, we formulate the routing and scheduling problem for 1+1 protected DetNet flows based on Cycle Specified Queuing and Forwarding (CSQF). The solution to this problem selects two paths between the two endpoints of each service request and schedules packet transmission on these paths meanwhile maximizing the accepted traffic. We have modelled the problem using Integer Linear Programming (ILP). We also propose two heuristic approaches: greedy and Tabu-search (TS) that can perform 1+1 routing and scheduling for a large number of requests in a reasonable time. Eventually, the performance of the ILP approach and heuristics is evaluated by performing simulation experiments. The results highlight the scalability of the two heuristics as compared to the ILP and superior performance of TS over greedy. The trade-off of cycle time on traffic acceptance and end-to-end delay is also presented.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.comnet.2022.108960</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1389-1286 |
| ispartof | Computer networks (Amsterdam, Netherlands : 1999), 2022-07, Vol.211, p.108960, Article 108960 |
| issn | 1389-1286 1872-7069 |
| language | eng |
| recordid | cdi_proquest_journals_2725349885 |
| source | ScienceDirect Journals (5 years ago - present) |
| subjects | CSQF Cycle time DetNet Heuristic methods Integer programming Linear programming Packet transmission Protection Queueing Scheduling Traffic models |
| title | Routing and scheduling for 1+1 protected DetNet flows |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T13%3A05%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Routing%20and%20scheduling%20for%201+1%20protected%20DetNet%20flows&rft.jtitle=Computer%20networks%20(Amsterdam,%20Netherlands%20:%201999)&rft.au=Sharma,%20Gourav%20Prateek&rft.date=2022-07-05&rft.volume=211&rft.spage=108960&rft.pages=108960-&rft.artnum=108960&rft.issn=1389-1286&rft.eissn=1872-7069&rft_id=info:doi/10.1016/j.comnet.2022.108960&rft_dat=%3Cproquest_cross%3E2725349885%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2725349885&rft_id=info:pmid/&rft_els_id=S1389128622001372&rfr_iscdi=true |