• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.111-113
• /
• 2006

FOUNDATION fieldbus provides scheduling and token-passing services for cyclic and sporadic data respectively. In this paper, we evaluate the delay performance of token-passing mechanism in FOUNDATION fieldbus network system using an experimental model. This paper introduces a method of developing an experimental model which consists of 10 nodes of FOUNDATION fieldbus communication device. Using the experimental model, we evaluate the delay performance of time-critical and time-available data with respect to change of TTRT parameter.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.37-42
• /
• 1992

The main purpose of the paper is to derive asymptotic formulae for performance characteristics(throughput, delay) of large-scale token-passing network with buffered stations and to optimize the buffer capacity with respect to the probability of data generation. We consider two versions of token-passing network: uniform and nonuniform token-passing time interval. All results obtained are supported by simulations.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.54.3-54
• /
• 2002

$\textbullet$ Introduction $\textbullet$ Token Passing Protocol : Profibus-FMS $\textbullet$ Performance Model of Profibus Token Passing Protocol $\textbullet$ Calculation of Communication Delay in Performance Model $\textbullet$ Summaries and Conclusions

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• 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.

• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.36-54
• /
• 2014

Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clustered mobile ad hoc networks (MANETs). The mechanism that is adapted to handle token passing at the inter-cluster level is different from that at the intra-cluster level. It makes our algorithm message efficient and thus suitable for MANETs. In the interest of efficiency, we implemented a centralized token passing scheme at the intra-cluster level. The centralized schemes are inherently failure prone. Thus, we have presented an intra-cluster token passing scheme that is able to tolerate a failure. In order to enhance reliability, we applied a distributed token circulation scheme at the inter-cluster level. More importantly, the message complexity of the proposed algorithm is independent of N, which is the total number of nodes in the system. Also, under a heavy load, it turns out to be inversely proportional to n, which is the (average) number of nodes per each cluster. We substantiated our claim with the correctness proof, complexity analysis, and simulation results. In the end, we present a simple approach to make our protocol fault tolerant.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.118-118
• /
• 2000

This paper suggests the methodology to guarantee the rea1-time service over Ethernet and TCP/IP and to solve the problems such as re-transmission due to collision and platform-transparency and independence. This paper proposes a new mechanism called Real-time Ethernet protocol combined the centralized medium control mechanism with the token passing mechanism. The centralized medium control mechanism is used to get the token, the right to transmit the data, and the token passing mechanism is used to return the token to the token controller and to transmit data within the specified time interval. The proposed Real-Time Ethernet Protocol is based on Java and Java RMI(Remote Method Invocation). The presented protocol is believed to work enough in real-time applications considering latency occurred due to the Java RMI, which is less small than data transmission time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.7
• /
• pp.569-576
• /
• 2003

The data link layer of Foundation Fieldbus provides both token-passing and scheduling services for periodic, time-critical and time-available data. This study developed an analytical model that evaluates the delay performance of urgent data when the data link layer of Foundation Fieldbus provides token-passing service. The validity of analytical model is verified using an experimental model that consists of network interface boards of Foundation Fieldbus. Comparison of analytical and experimental models shows that the analytical model can be utilized in the approximate analysis of the delay characteristics of time-critical data in the Foundation Fieldbus. The analytical model can also be used in the basic design stage of Foundation Fieldbus network system.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.470-473
• /
• 2002

Most networks for automation are tuned to an expected traffic at their design stage. During their actual operations, however, the networks experience considerable changes in traffic from time to time. These traffic changes caused by common events like machine failure and production schedule change may adversely affect the network performance and, in turn, the performance of the connected devices. This paper presents communication delay model for Profibus token passing protocol, and introduces TTR selection methods to maintain a uniform level of network performance at all stations under changing network traffic.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.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.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.1000-1005
• /
• 1993

In this paper asymptotic formulate for performance characteristics throughput, delay) of large scale token-passing networks with priorities and limited service are given. In particular, adaptive control procedures for obtaining optimal buffer capacity with respect to each priority and optimal limited service are shown. All results obtained are supported by simulations.