skip to main content
10.1145/3139258.3139289acmotherconferencesArticle/Chapter ViewAbstractPublication PagesrtnsConference Proceedingsconference-collections
research-article

ILP-based joint routing and scheduling for time-triggered networks

Published:04 October 2017Publication History

ABSTRACT

Networks in the automotive and aerospace area as well as in production facilities have to support time-critical (i.e., hard real-time) communication. For such applications, time-triggered Ethernet-based networking solutions provide the required timeliness, i.e., reliable packet delivery with deterministic latencies and low jitter. However, the routing and scheduling of the time-triggered traffic is an NP-hard problem. Hence, existing solutions to this problem make certain abstractions to reduce complexity if necessary. Nonetheless, such abstractions exclude feasible routing and scheduling options from the design space. Specifically, it is a typical approach to model routing and scheduling as separate problems, which are solved successively or with heuristic coupling. Therefore, we present a novel ILP formulation that can be used to jointly solve the routing and scheduling problem for time-triggered Ethernet networks. Using this formulation, it is possible to solve various scheduling problems that are infeasible when using a fixed shortest path routing with separate scheduling. Compared to a fixed load balanced routing with separate scheduling, schedules computed with our formulation offer lower communication latencies.

References

  1. Jochen W. Guck and Wolfgang Kellerer. 2014. Achieving end-to-end real-time Quality of Service with Software Defined Networking. In IEEE International Conference on Cloud Networking (CloudNet).Google ScholarGoogle Scholar
  2. Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart. 2008. Exploring network structure, dynamics, and function using NetworkX. Proceedings of the 7th Python in Science Conference (SciPy2008) (Aug. 2008), 11--15.Google ScholarGoogle Scholar
  3. Zdeněk Hanzálek, Pavel Burget, and Přemysl Šůcha. 2010. Profinet IO IRT Message Scheduling With Temporal Constraints. IEEE Transactions on Industrial Informatics 6, 3 (Aug. 2010), 369--380.Google ScholarGoogle ScholarCross RefCross Ref
  4. J. D. Hunter. 2007. Matplotlib: A 2D graphics environment. Computing In Science & Engineering 9, 3 (June 2007), 90--95. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Gurobi Optimization Inc. 2016. Gurobi Optimizer Reference Manual. (2016). http://www.gurobi.comGoogle ScholarGoogle Scholar
  6. Brigitte Jaumard, Christophe Meyer, and Babacar Thiongane. 2004. ILP formulations for the RWA problem: Symmetric systems. published on researchgate.net (Nov. 2004).Google ScholarGoogle Scholar
  7. Martin Lukasiewycz, Reinhard Schneider, Dip Goswami, and Samarjit Chakraborty. 2012. Modular Scheduling of Distributed Heterogeneous Time-Triggered Automotive Systems. In Asia and South Pacific Design Automation Conference (ASP-DAC).Google ScholarGoogle Scholar
  8. Kai Neubauer, Philipp Wanko, Torsten Schaub, and Christian Haubelt. 2017. Enhancing Symbolic System Synthesis through ASPmT with Partial Assignment Evaluation. In Design, Automation and Test in Europe (DATE). Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Eike Schweissguth, Peter Danielis, Christoph Niemann, and Dirk Timmermann. 2016. Application-aware industrial ethernet based on an SDN-supported TDMA approach. In IEEE World Conference on Factory Communication Systems (WFCS).Google ScholarGoogle ScholarCross RefCross Ref
  10. Wilfried Steiner. 2010. An Evaluation of SMT-Based Schedule Synthesis for Time-Triggered Multi-hop Networks. In IEEE Real-Time Systems Symposium (RTSS). Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Domiţian Tămaş-Selicean, Paul Pop, and Wilfried Steiner. 2015. Design optimization of TTEthernet-based distributed real-time systems. Real-Time Systems 51, 1 (Jan. 2015), 1--35. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Jihui Zhang, Haitao Wu, Qian Zhang, and Bo Li. 2005. Joint Routing and Scheduling in Multi-radio Multi-channel Multi-hop Wireless Networks. In International Conference on Broadband Networks.Google ScholarGoogle Scholar

Index Terms

  1. ILP-based joint routing and scheduling for time-triggered networks

        Recommendations

        Comments

        Login options

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

        Sign in
        • Published in

          cover image ACM Other conferences
          RTNS '17: Proceedings of the 25th International Conference on Real-Time Networks and Systems
          October 2017
          318 pages
          ISBN:9781450352864
          DOI:10.1145/3139258

          Copyright © 2017 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 4 October 2017

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate119of255submissions,47%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader