• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 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 the Korean Institute of Telematics and Electronics
• /
• v.26 no.3
• /
• pp.22-31
• /
• 1989

In this paper, we analyze the performance of the IEEE 802.4 token passing bus protocol through a simulation model of the protocol. In order to analyze performance of the protocol in the initialization, transition and fault recovery states as well as in the steady state, the protocol functions are divided into five processes each of which can effectively simulate protocol behaviors according to the variations of protocol parameters. From the simulation study, we obtain protocol parameters which severely influence the protocol performance and find out that proper selection of the protocol parameter values for token passing is very important to obtain good performance of the protocol when the priority scheme is used.

• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.741-744
• /
• 1990

This paper deals with the implementation of the IEEE 802.4 token passing bus protocol which is the world standard for LAN protocol. We are design station adaptor using MC68824 for data link layer, MC68194 for physical layer, and implemented by IEEE 802.4 and 802.2 type 3. We made three station adaptor and its performance is experimented.

• 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.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.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.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.3
• /
• pp.125-133
• /
• 2002

In this paper, we present an efficient broadcast protocol, called Btoken, that ensures total ordering of messages and atomicity of delivery in the large scaled distributed systems. Unlike the existing token-passing based protocol, Btoken does not circulate a token around the ring, instead, it uses three kinds of control messages for token transmission. The token has a sequence number field for broadcasting message, and the only site having the token can broadcast a message. When a site wishes to broadcast, It must send a message to the token site requesting the token. The token site sends a message with the token to the requester When the requester receives the token, it becomes the current token site and broadcasts a new message after setting sequence number derived from a field of the token into its message. Upon reception of it, any operating member is informed the position of the token site and will send token requesting message to the new token site. However, the other site may request the token to the old token site prior to receiving the broadcast message from the new token site. To resolve this problem, Btoken uses a message which is sent to the current token site by the old token site notifying who is the next token requester. Results of our simulation of the protocol show that Btoken is more efficient in the large scaled distributed system compared to existing broadcast protocols.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.52.3-52
• /
• 2001

There are some problems to implement a realtime network system with Ethernet because the MAC(Medium Access Control) of Ethernet uses a CSMA/CD protocol, which introduces unexpected delays. In this paper, we designed a method to solve problems due to the Ethernet MAC. This method introduces a pseudo-MAC in application layer to support the real-time feature. So the presented method doesn´t need any modifications of protocols such as UDP/IP/MAC. The presented pseudo-MAC is based on both a token passing protocol and a publisher-subscriber protocol. The suggested realtime protocol is implemented and tested practically in a local area network. The proposed real-time network consists of a token controller node and general nodes.