Academic Bibliography

 Search 200 years of publications by Ghent University researchers.
Advanced search
2 files | 1.91 MB
Add to list
  1. Search results
  2. Routing and scheduling for 1+1 protec...

Routing and scheduling for 1+1 protected DetNet flows

Gourav Prateek Sharma, Wouter Tavernier (UGent) , Didier Colle (UGent) and Mario Pickavet (UGent)
(2022) COMPUTER NETWORKS. 211.
Author
Organization
Project
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.
Keywords
DetNet, CSQF, Protection

Downloads

  • Download
    8093 acc.pdf
    • full text (Accepted manuscript)
    • |
    • open access
    • |
    • PDF
    • |
    • 684.81 KB
  • Download
    (...).pdf
    • full text (Published version)
    • |
    • UGent only
    • |
    • PDF
    • |
    • 1.22 MB

Citation

Please use this url to cite or link to this publication:

MLA
Sharma, Gourav Prateek, et al. “Routing and Scheduling for 1+1 Protected DetNet Flows.” COMPUTER NETWORKS, vol. 211, 2022, doi:10.1016/j.comnet.2022.108960.
APA
Sharma, G. P., Tavernier, W., Colle, D., & Pickavet, M. (2022). Routing and scheduling for 1+1 protected DetNet flows. COMPUTER NETWORKS, 211. https://doi.org/10.1016/j.comnet.2022.108960
Chicago author-date
Sharma, Gourav Prateek, Wouter Tavernier, Didier Colle, and Mario Pickavet. 2022. “Routing and Scheduling for 1+1 Protected DetNet Flows.” COMPUTER NETWORKS 211. https://doi.org/10.1016/j.comnet.2022.108960.
Chicago author-date (all authors)
Sharma, Gourav Prateek, Wouter Tavernier, Didier Colle, and Mario Pickavet. 2022. “Routing and Scheduling for 1+1 Protected DetNet Flows.” COMPUTER NETWORKS 211. doi:10.1016/j.comnet.2022.108960.
Vancouver
1.
Sharma GP, Tavernier W, Colle D, Pickavet M. Routing and scheduling for 1+1 protected DetNet flows. COMPUTER NETWORKS. 2022;211.
IEEE
[1]
G. P. Sharma, W. Tavernier, D. Colle, and M. Pickavet, “Routing and scheduling for 1+1 protected DetNet flows,” COMPUTER NETWORKS, vol. 211, 2022.
@article{8760427,
  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.}},
  articleno    = {{108960}},
  author       = {{Sharma, Gourav Prateek and Tavernier, Wouter and Colle, Didier and Pickavet, Mario}},
  issn         = {{1389-1286}},
  journal      = {{COMPUTER NETWORKS}},
  keywords     = {{DetNet,CSQF,Protection}},
  language     = {{eng}},
  pages        = {{12}},
  title        = {{Routing and scheduling for 1+1 protected DetNet flows}},
  url          = {{http://doi.org/10.1016/j.comnet.2022.108960}},
  volume       = {{211}},
  year         = {{2022}},
}
Altmetric
View in Altmetric
Web of Science
Times cited: