Fast and simple scheduling algorithm for PROFINET IRT networks

@article{Wisniewski2012FastAS,
  title={Fast and simple scheduling algorithm for PROFINET IRT networks},
  author={Lukasz Wisniewski and Markus Schumacher and J{\"u}rgen Jasperneite and Sebastian Schriegel},
  journal={2012 9th IEEE International Workshop on Factory Communication Systems},
  year={2012},
  pages={141-144}
}
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. 
Highly Cited
This paper has 48 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
14 Extracted Citations
12 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 14 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 12 references

Wismuller, “A top-down approach for realtime industrial-Ethernet networks using edgecolouring of conflict-multigraphs”, in International Symposium on Power Electronics, Electrical Drives

  • R. F. Dopatka
  • Automation and Motion,
  • 2006
1 Excerpt

An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background

  • U. Lauther
  • GI-Tage, vol
  • 2004
1 Excerpt

Automation Initiative of German Automobile Manufacturers (Aida) decides to go for PROFINET [Online

  • Aida, nov
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…