DocumentCode :
2645627
Title :
Fast and simple scheduling algorithm for PROFINET IRT networks
Author :
Wisniewski, Lukasz ; Schumacher, Markus ; Jasperneite, Juergen ; Schriegel, Sebastian
Author_Institution :
inIT-Inst. Ind. IT, Lemgo, Germany
fYear :
2012
fDate :
21-24 May 2012
Firstpage :
141
Lastpage :
144
Abstract :
Scheduling of the communication in industrial networks takes time. Since it has to be carried out every time a new network is brought to work, the time necessary to perform scheduling becomes a prominent factor. 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.
Keywords :
field buses; local area networks; DFP mechanism; PROFINET IRT networks; dynamic frame packing; industrial network; real-time Ethernet; scheduling algorithm; Job shop scheduling; Network topology; Optimal scheduling; Payloads; Real time systems; Schedules; Topology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Factory Communication Systems (WFCS), 2012 9th IEEE International Workshop on
Conference_Location :
Lemgo
ISSN :
Pending
Print_ISBN :
978-1-4673-0693-5
Type :
conf
DOI :
10.1109/WFCS.2012.6242556
Filename :
6242556
Link To Document :
بازگشت