산업용 이더넷 스위치의 실시간 스케쥴링 방법

Abstract

Abstract Scheduling Policy for Real-time Industrial Ethernet Switch

Syed Hayder Abbas Department of Electronics, Electrical Control & Instrumentation Engineering Graduate School of Engineering Hanyang University

Directed By Prof. Seung Ho Hong, Ph.D.

In this study we present an approach to obtain conflict-free schedules for RAPIEnet (Real-time Automation Protocol for Industrial Ethernet) switches using Graph Theory. For this purpose, first the exclusive resources in a single RAPIEnet switch are identified, so that bipartite conflict graph can be built. Conflict graph is mapped to three kinds of matrices for the inputs of our evaluation method; selection of any of the matrix form is application specific. Greedy Edge-coloring algorithm is used to solve the minimum coloring problem to obtain schedules for each switch, to be uploaded offline. After scheduling; empty slots are identified to forward nRT traffic of asynchronous devices. Finally an algorithm to synchronize the schedules of adjacent switches is presented using ‘edge-contraction’ and ‘minor’ concept.