Token Bus Research Articles

Performance Analysis and Comparison of Multi Hop Token Ring and Token Bus LAN Technologies

Token ring and token bus networks are two of the most commonly used type of local-area network (LAN). Token ring is designed in such a way that it can provide high throughput under heavy loads. Token bus is implemented using the token ring protocol over a virtual ring on a coaxial cable. The names, token ring and token bus, are applied to LANs which support a multiple access system using a token passing scheme. It is possible to define the maximum access delay experienced by a packet and thus to define the end-to-end delay across the network. In this paper after simulating the token ring and token bus technologies we have focused on the performance issues like throughput, mean delay, normalized throughput and response time of both the techniques. Lastly using some graphs and the data deduced from our simulation we have compared and concluded that token ring performs better than token bus for multi hop network design.

RESEARCH OF ENGINEERING TRAFFIC IN COMPUTER UZ NETWORK USING MPLS TE TECHNOLOGY

Purpose. In railway transport of Ukraine one requires the use of computer networks of different technologies: Ethernet, Token Bus, Token Ring, FDDI and others. In combined computer networks on the railway transport it is necessary to use packet switching technology in multiprotocol networks MPLS (MultiProtocol Label Switching) more effectively. They are based on the use of tags. Packet network must transmit different types of traffic with a given quality of service. The purpose of the research is development a methodology for determining the sequence of destination flows for the considered fragment of computer network of UZ. Methodology. When optimizing traffic management in MPLS networks has the important role of technology traffic engineering (Traffic Engineering, TE). The main mechanism of TE in MPLS is the use of unidirectional tunnels (MPLS TE tunnel) to specify the path of the specified traffic. The mathematical model of the problem of traffic engineering in computer network of UZ technology MPLS TE was made. Computer UZ network is represented with the directed graph, their vertices are routers of computer network, and each arc simulates communication between nodes. As an optimization criterion serves the minimum value of the maximum utilization of the TE-tunnel. Findings. The six options destination flows were determined; rational sequence of flows was found, at which the maximum utilization of TE-tunnels considered a simplified fragment of a computer UZ network does not exceed 0.5. Originality. The method of solving the problem of traffic engineering in Multiprotocol network UZ technology MPLS TE was proposed; for different classes its own way is laid, depending on the bandwidth and channel loading. Practical value. Ability to determine the values of the maximum coefficient of use of TE-tunnels in computer UZ networks based on developed software model «TraffEng». The input parameters of the model: number of routers, channel capacity, the number of streams, the average flow velocity. As a result of the model «TraffEng» choices variants of TE-tunnels with the corresponding values of the maximum coefficient of their use are presented.

Protection Technique for Complex Distribution Smart Grid Using Wireless Token Ring Protocol

Distributed generation is expected to increase sharply as more and more renewable are integrated to power system with the realization of smart grid, consequently complex distribution smart grid is given. The traditional protection devices cannot be able to protect complex power system configuration due to many fault current loops will feed the fault point. Relays based on standalone decisions cannot provide reliable and correct action when used on a complex distribution system. This paper proposes new protection philosophy using wireless technology. Data sharing among relays to obtain reliable and accurate decision are introduced. Wireless Token Ring Protocol (WTRP) as a wireless local area network (LAN) protocol inspired by the IEEE 802.4 Token Bus Protocol is used for data sharing. WTRP is selected to improve efficiency by reducing the number of retransmissions due to collisions. WTRP architecture and protocol are described to verify operation. MATLAB simulation program is used to simulate the data exchange protocol between relays in a ring for a specified amount of time.

Token Bus based MAC protocol for Wireless Sensor Networks

this paper, we propose TBB-MAC, an enhancement for medium access control (MAC) protocol based on the token bus in wireless sensor networks (WSNs). In this type of networks, sensors are spatially correlated and they often sense and collect the information and send it to the sink. In this paper, we design an innovative contention-based MAC protocol to provide long network lifetime. Our ideas help wireless nodes at sleep mode as much as possible to avoid major energy waste causes, such as idle listening, collision and overhearing. We want to show that, TBB- MAC can be an efficient method to reduce redundant transmissions in sensor networks, thus diminishing energy consumption and transmission delay. Hence, the network lifetime can last longer and the sink receives events within shorter delays. We propose to apply our technique in S-MAC and T-MAC, the contention based protocols for WSN. By simulation and experimentation, we prove that TBB-MAC overpasses S-MAC and T-MAC in terms of energy consumption and transmission delay.

Data Transmission Mode of a Small-Scale, Real-Time Industry Control Network

MAC protocol of bus control network has important influence on its real-time feature. Combining Profibus-DP protocol and Token Bus protocol, a new bus model suitable for small-scaled control system is put forward. Under the principle that follows a control network whole balance, the LAS and GAPL maintenance process in token passing mode and master-slave polling process in data exchange mode of Profibus-DP are discarded. The basic cutting thought of this bus model is summarized; its concrete realization is illustrated in detail, theoretical maximal value of message transmission time and actual test result are presented. The experiment result shows the system’s real-time characteristic is improved, and come to the expectant result.

Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1(m) Traffic

In this paper we consider a local area network (LAN) of dual mode service where one is a token bus and the other is a carrier sense multiple access with a collision detection (CSMA/CD) bus. The objective of the paper is to find the overall cell/packet dropping probability of a dual mode LAN for finite length queue M/G/1(m) traffic. Here, the offered traffic of the LAN is taken to be the equivalent carried traffic of a one-millisecond delay. The concept of a tabular solution for two-dimensional Poisson's traffic of circuit switching is adapted here to find the cell dropping probability of the dual mode packet service. Although the work is done for the traffic of similar bandwidth, it can be extended for the case of a dissimilar bandwidth of a circuit switched network.

디지털 병렬 통신을 이용한 부하분담 알고리즘

본 논문에서는 마이컴(ATmega-2560) 기반의 디지털 통신 방식을 이용한 새로운 부하분담(Load-sharing) 알고리즘(Algorithm)을 제안한다. 기존의 아날로그 방식과 달리 고속 통신과 디지털 제어를 수행하고 실시간 제어를 위한 시분할 토큰버스 방식을 적용함으로서 효율적인 부하분담 및 리던던시(Redundancy)를 구현하였다. 또한 자동 ID 설정 알고리즘을 적용함으로서 시스템 비용을 낮추었으며, 제어기의 전압 및 전류 적분값을 공유하는 새로운 알고리즘으로 시스템의 속응성을 향상시켰다. 제작된 병렬 시스템은 각 모듈마다 독립된 제어기가 구성되어 있으며, 마스터(Master) 모듈의 지령치에 따라 슬레이브(Slave) 모듈이 부하분담을 수행한다. 본 논문에서는 PSIM을 통한 시뮬레이션과 시작품 제작을 통해 제안된 알고리즘의 타당성을 검증하였다. In this paper, we proposes a new load-sharing algorithm with a ATmega2560 based digital communication. Proposed algorithm is different from conventional analog method. The high speed communication digital control is performed. To apply the digital communication and real-time control for time-sharing token bus method, we implemented high efficient load-sharing and redundancy. Also this system make down the price by auto ID algorithm and system response is improved by controller's voltage and current integral value sharing. In parallel system prototype, each module have controller and performed load-sharing according to master module integral value. In this paper, we verify the validity of proposed algorithm using PSIM program and prototype.

三光子纠缠W态隐形传输令牌总线网的保真度计算

The fidelity of three-photon W state teleportation token bus network is calculated.The calculation indicates that,for a given analysis angle θ,the fidelity are related only with the coefficient-a-2s during the processes of quantum network communication.With the increase of analysis angles,the maximum fidelity of the corresponding coefficient-a-2s correspondingly reduced.When θ=π/4,π/2,3π/4,the fidelity are up to the maximum 1,and the corresponding-a-2s are 0.724,0.5,and 0.276,respectively.For a given coefficient-a-,the fidelity are related only with the analysis angles θ.If-a-=0,the fidelity is always 0 regardless of the value of θ.When-a-=-b-=0.7071 and θ=π/2,3π/2,the fidelity are up to the maximum 1.

Finite Buffer Vacation Queue under E-limited with Limit Variation Service and Batch Markovian Arrival Process

We consider a finite-buffer single server queue with single (multiple) vacation(s) under batch Markovian Arrival Process (BMAP). The service discipline is varying number limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of l customers have been served. Queue length distributions at various epochs such as, pre-arrival, arbitrary, departure etc. have been obtained. Several other service disciplines like, Bernoulli scheduling, non-exhaustive service and E-limited service can be treated as special cases of the ELV service. Such a queueing system finds applications in the token ring or token bus of local area network (LAN) in which the vacation would correspond to the time the token is away to the other stations.

Estimation Techniques for Monitoring and Controlling the Performance of the Computer Communication Networks

This study was concerned with making a comparative study between four types of time series model with the goal of choosing the optimum one to predict the performance of a computer communication network. The investigated four types of time series are: Least Square (LS), Fourier series, Exponential Weighted Moving Average (EWMA) and the Auto Regressive Integrated Moving Average (ARIMA). Comparative study is based on comparing some of statistical measurement for these four time series models as: mean standard deviation and variance. We apply these various types of time series on two types of network to predict their performance; the first one is called token bus while the second one is called the token ring. Concluded results prove that both EWMA and ARIMA perform better than the others LS and Fourier since both EWMA and ARIMA forecast the network performance parameters with an accuracy of 98% near the actual values.

Fault Detection of Computer Communication Networks Using an Expert System

The main objective of this study was to build an expert system for assisting the network administrator in his work of management and administration of the computer communication network. Theory of operation of the proposed expert system depends on using a time series model capable of forecasting the various performance parameters as: delay, utilization and collision frequency. When the expert system finds a difference (with certain tolerance) between the predicted value and the measured value, it informs the network administrator that there exist problems in his network either in the switch or link or router. We examine two types of network by our proposed expert system, the first one is called token bus while the second one is called token ring. When we run our expert system on these two types of computer networks, actually the expert system captures the problem when there exists an excess deviation from the network performance parameters.

Performance Management of Communication Networks for Computer Integrated Manufacturing

Performance management of computer networks is intended to improve a given network performance in order for more efficient information exchange between subsystems of an integrated large-scale system. Importance of perfomance management is growing as many functions of the large- scale system depend on the quality of communication services provided by the network. The role of performance management is to manipulate the adjustable protocol parameters on line so that the network can adapt itself to a dynamic environment. This can be divided into two subtasks : performance evaluation to find how changes in protocol parameters affect the network performance and decision making to determine the magnitude and direction of parameter adjustment. This paper is the first part of the two papers focusing on conceptual design, development, and evaluation of performance management for token bus networks. This paper specifically deals with the task of performance evaluation which utilizes the principle of perturbation analysis of discrete event dynamic systems. The developed algorithm can estimate the network performance under a perturbed protocol parameter setting from observations of the network operations under a nominal parameter setting

Performance degradation of the IEEE 802.4 token bus network in a noisy environment

This paper analyzes the performance degradation of the IEEE 802.4 token bus network in a noisy environment where clustered noises are generated with non-zero durations. The operation of the token passing mechanism in a token bus network is modeled by a state machine considering the effects of noise, and then the detailed token passing operation under clustered noise is investigated with the state machine model. The mean token passing time and the mean token rotation time are derived from the detailed token passing operation to evaluate the performance degradation of the IEEE 802.4 token bus network. The experiment on a test bed, which consists of an IEEE 802.4 token bus network and a noise generator, shows that the derived token rotation time is valid. The analysis shows that in a noisy environment the current recovery mechanism for the token passing operation becomes unreliable and the performance of the network decreases because the token is quite easily lost.

On The Throughput Of A Partitioned Local Area Computer Network

A new switch connection Approach to improve the performance of large token bus networks is devised. The single large token bus network is partitioned into smaller networks, and these networks are interconnected by a multi-stage butterfly switch. This technique has enhanced the performance of the network by increasing the throughput and reducing the average packet delay. The performance of the single large network and the proposed partitioned network have been modelled and simulated using Simscript II.5. It was found that the throughput of the proposed partitioned network is improved and there is a significant decrease in the average packet delay compared to the single network.

Analysis of simulation models with fuzzy graph based metamodeling

The analysis of complex simulation models using so-called metamodels offers reduced complexity and an understandable representation. In this paper we present an efficient algorithm that constructs a metamodel only from simulation data, so no a priori knowledge has to be included. Since no additional parameters have to be adjusted, the method is easy to use. It will be shown that the resulting system approximates the underlying model with an adjustable precision. In addition, the data can contain imprecise values or values with a corresponding confidence interval. This is especially well suited for simulation data due to its stochastic nature. The metamodel is represented in form of a Fuzzy Graph which allows the analyst to directly extract easy to interpret if-then rules. A real world token bus model was approximated with the proposed method. It is shown how the resulting Fuzzy Graph can be used to analyze this model and how the rule extraction leads to meaningful information about the model behavior.

Analysis of simulation models with fuzzy graph based metamodeling

Abstract The analysis of complex simulation models using so-called metamodels offers reduced complexity and an understandable representation. In this paper we present an efficient algorithm that constructs a metamodel only from simulation data, so no a priori knowledge has to be included. Since no additional parameters have to be adjusted, the method is easy to use. It will be shown that the resulting system approximates the underlying model with an adjustable precision. In addition, the data can contain imprecise values or values with a corresponding confidence interval. This is especially well suited for simulation data due to its stochastic nature. The metamodel is represented in form of a Fuzzy Graph which allows the analyst to directly extract easy to interpret if-then rules. A real world token bus model was approximated with the proposed method. It is shown how the resulting Fuzzy Graph can be used to analyze this model and how the rule extraction leads to meaningful information about the model behavior.

Performance management of token bus networks for computer integrated manufacturing

This paper focuses on performance management of computer communication networks serving computer integrated manufacturing systems. The performance management aims to improve the network performance in handling various types of messages by on-line adjustment of protocol parameters. The principle of fuzzy logic has been used in formulating the performance management rules and in deriving management decisions. Three types of the fuzzy performance management have been developed for IEEE 802.4 protocol standard and have been evaluated via discrete event simulation.

The role of medium access control protocols in SCADA systems

This paper deals with the influence of the medium access control (MAC) protocol in the performance of the communication channels used in power system SCADA systems (supervisory control and data acquisition). Three types of MAC protocols are presented and analyzed: polling, CSMA/CD (carrier sense multiple access with collision detection), and token bus. The simulation of each one of these protocols allows us to quantify its performance and establish certain criteria in order to be able to compare them. As a result of the analysis, the use of a MAC protocol is proposed for SCADA systems.

Skipping protocols integrating voice and data on a token bus LAN

In this paper two protocols integrating voice and data on a token bus LAN are proposed. These protocols use the access mechanism of the Token Bus protocol, but in addition the token bypasses idle stations, exploiting the periodicity of voice. The priority scheme of the Token Bus is used to separate voice traffic from data traffic. Voice packets are assigned to the higher priority while data packets and the voice call packets for setting up calls are assigned to the lower priority. The proposed protocols were studied via simulation tools. The simulation results show that these protocols satisfy the delay constraint of voice traffic, and at the same time, guarantee a sufficient bandwidth for data traffic. Results obtained under various traffic conditions are given.

Approximate performance analysis of real-time traffic over heavily loaded networks with timed token protocols

This paper studies timed token protocols with respect to real-time packet traffic in local area networks (LANs), such as FDDI and token bus, employed in distributed control systems. Typically, in such systems, three classes of packet traffic are encountered. The first class consists of packets cyclically generated by data acquisition tasks. The second traffic class is represented by packets generated in a random manner by control tasks and sporadic events. Finally, the third traffic class represents nonreal-time packet streams such as, for example, file transfers. To evaluate protocol performance, three performance measures are taken into account with respect to randomly generated real-time traffic: the mean waiting time, the blocking probability, and the probability that accepted packets will wait for service no longer than a specified time limit. In order to determine the last performance measure, a two-moment approximation of the waiting time distribution is applied. All three performance measures are evaluated at the beginning of the heavy network load region. Two examples of numerical calculations compared with computer simulations done for FDDI-II and token bus networks are given.