Bitte benutzen Sie diese Kennung, um auf die Ressource zu verweisen: http://dx.doi.org/10.18419/opus-10035
Autor(en): Caddell, Benjamin
Titel: Joint routing and scheduling with SMT
Erscheinungsdatum: 2018
Dokumentart: Abschlussarbeit (Bachelor)
Seiten: 43
URI: http://elib.uni-stuttgart.de/handle/11682/10052
http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-100520
http://dx.doi.org/10.18419/opus-10035
Zusammenfassung: Real-time communication over Ethernet networks are of growing importance for industrial applications. With the newly developed IEEE 802.1Qbv standard, new tools for guaranteeing timely boundaries for communication are available. While this standard specifies the mechanisms in place for guaranteeing the timeliness of transmissions, it falls short of defining algorithms to compute routes and schedules. Traditionally the routing problem and scheduling problem have been tackled independently. However these problems are strongly connected and solving them independently excludes feasible solutions. We provide an SMT formulation of the joint routing and scheduling problem. We implement this formulation to solve various different scheduling problems. We showcase and compare our SMT-Based solution to a similar ILP-Based solution.
Enthalten in den Sammlungen:05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Dateien zu dieser Ressource:
Datei Beschreibung GrößeFormat 
ausarbeitung_caddell.pdf476,65 kBAdobe PDFÖffnen/Anzeigen


Alle Ressourcen in diesem Repositorium sind urheberrechtlich geschützt.