• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1805-1810
• /
• 1991

This paper derives the upper and the lower bound of the mean cycle time and the mean service time of the class 6 and the class 4, within which the minimum utilization constrain of the class 4 is guaranteed. Also, derived are conditions under which the token bus network is stable or unstable. These bounds and stable conditions are represented in terms of the high priority token hold time, the token rotation time and the arrival rate and the total station number etc. This paper suggest a parameter tuning algorithm in a partially symmetric token bus network with two classes, which maximizes the token rotation time for a suitable high priority token hold time and at the same time meets the stability condition of the network, the real time constraint and the minimum utilization constraint of the class 4.

• 제어로봇시스템학회논문지
• /
• 제2권3호
• /
• pp.220-228
• /
• 1996

This paper presents a extended stochastic Petri net (ESPN) model for CTN(Circulated Token with No duration) service in the data link layer of IEC/ISA fieldbus. It is assumed that a station on the fieldbus has a specified minimum token holding time, a finite capacity buffer, and one transmitter queue with the highest priority. The mean transmission (or service) time at a station and the mean token rotation time for the symmetric fieldbus system atr derived using the presented SPN model and the moment generating function. These performance measures are represented in terms of the minimum token holding time, the number of stations, the arrival rate of messages, and the mean length of messages. The presented performance measure are validated by computer simulations.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.382-388
• /
• 1987

In this paper, the performance of Mini MAP architecture is analyzed by simulation method. Token rotation time and waiting time are obtained by simulation. The results of the simulation are compared with these of the analytic model. From these comparisons, it is shown that simulation results are approximately identical to analytic results. Mini MAP architecture has good real time performances in token rotation time and waiting time and can be used to many real time applications.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.57.2-57
• /
• 2001

Timed token protocols inadequately provide periodic communication service, although this is crucial for hard real time systems. We propose an approach to guaranteeing periodic communication service on a timed token protocol network. In this approach, we allocate bandwidth to each node so that the summation of bandwidth allocations is Target Token Rotation Time (TTRT). If a node cannot consume the allocated time, the residual time can be used by other nodes for non-periodic service using a timer which contains the unused time value and is appended to the token. This approach can always guarantee transmission of real-time messages before their deadlines when the network utilization is less than 50%.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.181-184
• /
• 2003

Recently, the fieldbus becomes an indispensable component for many automated systems. In the fieldbus system, realtime data containing sensor values and control commands has a tendency to rapidly lose its value as time elapses after its creation. In order to deliver these data in time, the fieldbus network should be designed to have short delay compared to the maximum allowable delay. Because the communication delay is affected by performance parameters such as target rotation timer of token passing protocol, it is necessary to select proper parameter settings to satisfy the real-time requirement for communication delay. This paper presents the timer selection method for Profibus token passing networks using genetic algorithm (GA) to meet the delay requirements.

• 전자공학회논문지B
• /
• 제33B권7호
• /
• pp.11-20
• /
• 1996

In this paper, the performance of the IeEE 802.4 token-passing is analyzed under the assumption that all nodes have finite buffers and finite THT (token tolding time). The loads generated at nodes are assumed to be asymmetric. The priority mechanism is not considered. This paper derives an approximate matrix equation of the queue length distributin in terms of the number of nodes, frame arrival rate and mean service time of a frame in steady state. Based on the matrix equation, the mean token rotation time, the mean waiting time and the blocking probability are derived analytically. the analytic results are compared with simulation results in order to show that the deviations are small.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권5호
• /
• pp.650-657
• /
• 1999

In this paper, a real-time communication method using a PICNET-NP(Plant Instrumentation and Control Network for Nuclear Power plant) is proposed with an analysis of the control network requirements of DCS(Distributed Control System) in unclear power plants. The method satisfies deadline in case of worst data traffics by considering aperiodic and periodic real-time data and others.

• 제어로봇시스템학회논문지
• /
• 제6권7호
• /
• pp.602-610
• /
• 2000

In communication networks used in safety-critical systems such as control systems in nuclear power plants there exist three types of data traffic : urgent or asynchronous hard real-time data hard real-time periodic data and soft real-time periodic data. it is necessary to allocate a suitable bandwidth to each data traffic in order to meet their real-time constraints. This paper proposes a method to meet the real-time constraints for the three types of data traffic simultaneously under a timer-controlled token bus protocol or the IEEE 802.4 token bus protocol and verifies the validity of the presented method by an example. This paper derives the proper region of the high priority token hold time and the target token rotation time for each station within which the real-time constraints for the three types of data traffic are met, Since the scheduling of the data traffic may reduce the possibility of the abrupt increase of the network load this paper proposes a brief heuristic method to make a scheduling table to satisfy their real-time constraints.

• 기술사
• /
• 제28권3호
• /
• pp.121-134
• /
• 1995

본 논문에서는 생산 환경에서 MAP 네트워크에 접속된 여러 단위제어기기의 운영을 지원하기 위한 네트워크 관리 모듈을 설계하여 공정 모델 시스템에서 시범 운영하였다. 설계된 네트워크 모델의 안정성 해석을 위하여 토큰의 사용권의 공정한 배분과 시스템의 동작이 공정상의 특정한 시간 범위 내에 완료되어야 한다. 따라서 본 논문에서는 네트워크의 부하 파라미터로서 데이타 패킷의 크기와 노드의 수의 변화로 선정하여 이에 따른 네트워크 운영을 위한 토큰 로테이션 시간과 대기 시간의 대응된 변화값을 해석하였다. MAP 네트워크의 운영에서 데이타 패킷의 크기를 10바이트에서 100바이트까지 변화시킬 경우, 이에 대응한 토큰 로테이션 시간과 대기 시간의 변화는 주어진 조건하에서 10msec 이하의 값을 가진다. 따라서 프로그래머블 콘트를러 등의 단위 제어기기가 수십 msec 정도의 응답 하한선을 가지고 있으며 데이타 패킷의 크기는 50바이트를 넘지 않으므로 이의 실시간 처리에 충분히 적용 가능함을 알 수 있다.

• 제어로봇시스템학회논문지
• /
• 제9권12호
• /
• pp.1055-1064
• /
• 2003

In many automated systems, such as manufacturing systems and process plants, a fieldbus is a very important component for the exchange of various and sometimes crucial information. Some of the information has a tendency to rapidly lose its value as time elapses after its creation. Such information or data is called real-time data that includes sensor values and control commands. In order to deliver these data in time, the fieldbus network should be tailored to have short delay with respect to the individual time limit of various data. Fine-tuning the network for a given traffic requires the knowledge on the relationship between the protocol parameters such as timer values and the performance measure such as network delay. This paper presents a mathematical performance model to calculate communication delays of the Profibus-FMS network when the timer value and the traffic characteristics are given.