research-article

Routing heuristics for load-balanced transmission in TSN-based networks

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.

References

  1. F. A. R. Arif and T. S. Atia. Load balancing routing in time-sensitive networks. In Problems of Inf. Science and Technology (PIC S&T), Third Int. Scientific Practical Conf., pages 207--208. IEEE, 2016.Google ScholarGoogle Scholar
  2. F. Dürr and N. G. Nayak. No-wait packet scheduling for ieee time-sensitive networks (TSN). In Proc. of the 24th Int. Conf. on RTNS, pages 203--212. ACM, 2016.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. L. Erdős, A. Knowles, H.-T. Yau, J. Yin, et al. Spectral statistics of erdős-rényi graphs i: local semicircle law. The Annals of Probability, 41(3B):2279--2375, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  4. V. Gavrilut, B. Zarrin, P. Pop, and S. Samii. Fault-tolerant topology and routing synthesis for IEEE time-sensitive networking. In 25th Int. Conf. on RTNS, pages 267--276. ACM, 2017.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. F. Glover. Tabu search: A tutorial. Interfaces, 20(4):74--94, 1990.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. D. Grammatikakis, D. F. Hsu, M. Kraetzl, and J. F. Sibeyn. Packet routing in fixed-connection networks: A survey. Journal of Parallel and Distributed Computing, 54(2):77--132, 1998.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. IEEE. Time-Sensitive Networking Task Group.Google ScholarGoogle Scholar
  8. IEEE. IEEE Standard for Local and metropolitan area networks---Bridges and Bridged Networks - Amendment 24. IEEE, 2016.Google ScholarGoogle Scholar
  9. A. Nasrallah, A. Thyagaturu, Z. Alharbi, C. Wang, X. Shao, M. Reisslein, and H. Elbakoury. Ultra-Low Latency (ULL) Networks: The IEEE TSN and IETF DetNet Standards and Related 5G ULL Research. IEEE Comm. Surveys & Tutorials, pages 1--59, 2018.Google ScholarGoogle Scholar
  10. N. G. Nayak, F. Duerr, and K. Rothermel. Routing Algorithms for IEEE802. 1Qbv Networks. RTN workshop, ECRTS, 2017.Google ScholarGoogle Scholar
  11. P. Pop, M. L. Raagaard, S. S. Craciunas, and W. Steiner. Design optimisation of cyber-physical distributed systems using IEEE time-sensitive networks. IET Cyber-Physical Systems: Theory & Applications, 1:86--94, 2016.Google ScholarGoogle ScholarCross RefCross Ref
  12. S. Singh. Routing Algorithms for Time Sensitive Networks. Master's thesis, Univ. of Stuttgart, 2017.Google ScholarGoogle Scholar
  13. B. Wang and J. C. Hou. Multicast routing and its qos extension: problems, algorithms, and protocols. IEEE network, 14(1):22--36, 2000.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Z. Wang and J. A. Crowcroft. Quality-of-service routing for supporting multimedia applications. IEEE Journal on Sel. Areas in Comm., 14:1228--1234, 1996.Google ScholarGoogle ScholarDigital LibraryDigital Library

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader
About Cookies On This Site

We use cookies to ensure that we give you the best experience on our website.

Learn more

Got it!