Bitte benutzen Sie diese Kennung, um auf die Ressource zu verweisen: http://dx.doi.org/10.18419/opus-9401
Langanzeige der Metadaten
DC ElementWertSprache
dc.contributor.authorZinkler, Stephan-
dc.date.accessioned2017-12-07T17:05:43Z-
dc.date.available2017-12-07T17:05:43Z-
dc.date.issued2016de
dc.identifier.urihttp://elib.uni-stuttgart.de/handle/11682/9418-
dc.identifier.urihttp://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-94188de
dc.identifier.urihttp://dx.doi.org/10.18419/opus-9401-
dc.description.abstractSharing the network between Networked Control System (NCS) having strict demands with respect to latency and jitter and applications only requiring best-effort service leads to multiple problems. An important task to consider is how to prioritize individual types of traffic in such a way that the necessary guarantees for an NCS to be stable can still be given. While there are ways to prioritize the more important control traffic of an NCS over best-effort traffic sharing the same network, a more sophisticated approach has to be found in order to handle multiple NCS sharing the highest priority. In this thesis, in-network priority scheduling applications with a global view on the network are developed in order to schedule and prioritize individual NCS such that their stability can be guaranteed while sharing the network between multiple NCS. This thesis deals with in-network packet priority scheduling for Networked Control Systems. Using Data Plane Development Kit (DPDK) to achieve a Network Function Virtualization (NFV) based approach, a priority scheduling application is implemented in a middlebox to handle continuous priorities. This application could be instantiated and migrated within the network while simultaneously using Software Defined Networking (SDN) to route the traffic to the respective nodes. Additionally, this approach is extended using SDN and OpenFlow to adapt priorities in-network. Using the eight internal perport queues of a switch, discrete priorities are used to schedule, and additionally adapt, the priorities on the switch. This approach could give the opportunity for priority-based routing by using the SDN-controller for routing decisions and configuring the switches. The evaluation of this thesis is done by simulating NCSs and emulating the network containing the middlebox. For this, a simulation of an inverted pendulum is implemented for which the use of DPDK is compared to standard sockets. It can be shown that DPDK is able to perform better due to less delay and jitter. The scheduling application is evaluated by comparing it to a round-robin scheduling approach. The result suggests that the application is able to keep multiple NCS more stable than it’s round-robin counterpart. Furthermore, it is able to stabilize a more unstable system faster and more effectively. While the maximum sampling time for a system with a pendulum having an initial angle of 35° was found to be 50ms for the round-robin scheme, the middlebox is able to keep the system stable until 120ms. The application using OpenFlow is evaluated with respect to the time it takes to configure the switch as well as the overhead imposed by the configuration compared to the number of NCS within the network.en
dc.language.isoende
dc.rightsinfo:eu-repo/semantics/openAccessde
dc.subject.ddc004de
dc.titleIn-network packet priority adaptation for networked control systemsen
dc.typemasterThesisde
ubs.fakultaetInformatik, Elektrotechnik und Informationstechnikde
ubs.institutInstitut für Parallele und Verteilte Systemede
ubs.publikation.noppnyesde
ubs.publikation.seitenxi, 48de
ubs.publikation.typAbschlussarbeit (Master)de
Enthalten in den Sammlungen:05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Dateien zu dieser Ressource:
Datei Beschreibung GrößeFormat 
Thesis.pdf1,43 MBAdobe PDFÖffnen/Anzeigen


Alle Ressourcen in diesem Repositorium sind urheberrechtlich geschützt.