M
Markus Schumacher
Researcher at Phoenix Contact
Publications - 7
Citations - 68
Markus Schumacher is an academic researcher from Phoenix Contact. The author has contributed to research in topics: Communications system & Ethernet. The author has an hindex of 5, co-authored 7 publications receiving 63 citations.
Papers
More filters
Proceedings ArticleDOI
Fast and simple scheduling algorithm for PROFINET IRT networks
TL;DR: The approach presented in this paper, simplifies the scheduling problem of PROFINET IRT by resolving communication conflicts by utilization of the dynamic frame packing (DFP) mechanism.
Proceedings ArticleDOI
Increasing flexibility of Time Triggered Ethernet based systems by optimal greedy scheduling approach
TL;DR: An approach to increase Time Triggered Ethernet based systems is proposed, based on a greedy scheduling approach that can be implemented directly in a processing limited hardware such as IO Controller, and has been proven that the proposed scheduling approach is not only simple but also powerful.
Proceedings ArticleDOI
Node to node synchronization accuracy requirements of Dynamic Frame Packing
TL;DR: This paper examines influence of the synchronization jitter on the industrial Ethernet networks by taking the example of PROFINET IO, a common representative of an industrial Ethernet based protocol that uses a Time Division Multiple Access (TDMA) procedure together with the communication scheduling to fulfill hard real-time requirements.
Patent
Communication system and method for isochronous data transmission in real time
TL;DR: In this article, a real-time-critical data message is transmitted by a conventional standard Ethernet communication device (10) to a PROFINET IRT system (40) with first communication devices (50, 60) for isochronous transmission.
Proceedings ArticleDOI
Linear time, possibly disjoint path search approach for ethernet based industrial automation networks
TL;DR: An algorithm is proposed that has linear time complexity and is able to find two possibly disjoint paths for an arbitrary network topology in a short time.