Abstract
In this paper, we present a technique for obtaining conflict-free schedules for real-time automation protocol for industrial Ethernet (RAPIEnet) switches. Mathematical model of the switch is obtained using graph theory. Initially network traffic entry and exit parts in a single RAPIEnet switch are identified, so that a bipartite conflict graph can be constructed. The obtained conflict graph is transformed to three kinds of matrices to be used as inputs for our simulation model, and selection of any of the matrix forms is application-specific. A greedy edge-coloring algorithm is used to schedule the network traffic and to solve the minimum coloring problem. After scheduling, empty slots are identified for forwarding the non real-time traffic of asynchronous devices. Finally, an algorithm for synchronizing the schedules of adjacent switches is proposed using edge-contraction and minors. All simulations were carried out using Matlab.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
