Model Based Simulation of Acyclic Traffic Management in FIELDBUS systems

Karim Al-jebory*, Usama M. Ali**
*Al-Isra Private University,Amman ,Jordan
**Ministry of Industry and Minerals,Iraq
Periodicity:January - March'2007
DOI : https://doi.org/10.26634/jse.1.3.743

Abstract

In industrial systems, there are a number of devices with low processing capacities called field device. Currently, these devices (sensors and actuators) are connected by dedicated wires, often of a considerable length. The idea of replacing bundles of cables with one field-bus, linking up a set of intelligent field devices seems to be a valid solution to the problems presented by point to point connections.

Usually in fieldbus systems, a variety of different nodes, sensors and local node applications. Differences stem from varying hardware architectures, vendors, and sensor types. In order to guarantee their inter-operability we have to introduce abstraction mechanisms that hide these inherent differences from the other nodes in the network[1].

In fieldbus, the cyclic time-critical traffic generated by the exchange of measurement and control data, normally used by the system, will be accompanied by another kind of traffic (acyclic traffic). Scheduling in fieldbus is characterized by the presence of a processing unit acting as a Link Active Scheduler (LAS), whose task is to manage the bandwidth and distributing it among all the producing devices.

In this paper, recent evolutions of the initial protocol definition concerning transmission of synchronous and asynchronous messages are presented. The performance of the Link Active Scheduler (LAS), is also discussed, which assigns the stations capable of sharing the fieldbus communication capacity, called Link Masters (LMs), the right to transmit by using token mechanism. In the present work, a general semi-Markov model is developed for a field bus system with priority levels associated with the requests. The paper presents a model for handling the on-line scheduling of acyclic processes. Based on the priority scheme the model simulation results provide an optimal allocation method for acyclic traffic.

Keywords

Field Bus, Bus Timing & Control, Acyclic Traffic and Scheduling

How to Cite this Article?

Karim Al-jebory and Usama M. Ali (2007). Model Based Simulation of Acyclic Traffic Management in FIELDBUS systems. i-manager’s Journal on Software Engineering, 1(3), 60-67. https://doi.org/10.26634/jse.1.3.743

References

[I ]. Zech, Kurt. "Understonding Fieldbus". Chem|col ProcessingVol. 58 N3. Mor, I 995. Pp6 .
[2]. J. Xu. And D. L. Pornos, "On SotisfVing Timing Constroints in Hord ReoI-Time Systems". IEEE Trons. Softwore Eng. , Vol, I 9 . Jon, I 993, PP 70-84.
[3]. J.P Thomesse. Moin Porodigms os o Bosis for Current Fieldbus Concepts. Proc, FeT '99 Fieldbus Systems ond Applicotions Conference, Mogdeburg, Germony, September 1999.
[4]. J. Stonkovic et ol.. Strotegic Directions in ReoI-Time ond Embedded Systems. ACM Computing Surveys, 28(4): 751-763, 1996,
[5]. R Pedreiros ond L. Almeido. Asynchronous Communicotion on FTT-CAN: Experimentol Results, Proc. FerOl - F/e/dbus Systems and Applicatlons Conference, NOncy, Fronce, Nov 2001 .
[6]. Tovor, E., Vosques, F.: "Pre-run-time Schedulobility Anolysis of P-NET Networks" Proceedings of 24th Annuol Conference of the IEEE Industriol Electronics Society (IECON'98), Aochen, Germony, pp. 236- 241, 1998,
[7.] L. Almeido ond J.A. Fonseco. FTT-CAN: o Network- Centric Approoch for CAN Dosed Distributed Systems. S/C/CA'0O (4th IFAC Symp. On Intelligent Components and Instruments for Control Appllcatlons), Buenos Aires,Argentina I 3- I 5 September 2000,
[8]. A. Di Stefono, O. Mirobello, "Evoluoting the Field Bus Dato Link LoVer by o Petr/net Hosed Simulotion", IEEE Tronsoctions on Industriol Electronics, Vol. 38, nu. Aug. I 991, PP 288-297,
[9]. A. K. Mok, "The Design of ReoI-Time Progromming Systems Hosed on Process Models", Proc. IEEE ReoI-Time Systems Symp. , PP 5- I 7. Dec. I 984,
[10]. Ashwoni K. Romonl, Prodip K. Chonde ond Promod C . Shormo, "A Generol Model for Performonce Investigotions of Priority Hosed Multiprocessor System", IEEE Trons, on Computers, Vol. 41, n6, Jun~ I 992, PP 747- 754,
[1 I ]. L. Ciminiero ond V. Volenzono, "Acknowledgment ond Priority Mechonism in the 802. 4 Token-Bus", IEEE Trons, Indust. Electron,, Vol. IE-35, PP 307-3 I 6, May, I 988,
[12]. S. M. Ross, "Stochostic Processes", New York : Wiley, I 983, PP 205-207,
[13]. T. N. Mudge ond H. 8. Al-Sodoon, "A Semi-Morkov Model for the Performonce of Multiple Bus Systems", IEEE. Trons, Comput., Vol, C-3u, PP 934-942, Oct, I 985.
[14]. L. Almeido ond J.A. Fonseco. AnOlysis of o Simple Model for Non-Preemptive Blocking-Free Scheduling, ECRTS'OI (Euromicro Conf. on Reol-Time Systems), Delft, HoOond, June, 2001 .
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.