Fast and simple scheduling algorithm for PROFINET IRT networks
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...
Saved in:
Published in | 2012 9th IEEE International Workshop on Factory Communication Systems pp. 141 - 144 |
---|---|
Main Authors | , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.05.2012
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
ISBN: | 9781467306935 1467306932 |
DOI: | 10.1109/WFCS.2012.6242556 |