不对称令牌总线在分布式控制系统中应用的性能分析与参数设置

建立了实时信息与非实时信息到达模型，并分析了完全不对称令牌总线网络用于控制系统时的性能，主要包括令牌循环时间和网络稳定条件。给出了参数(包括高优先级令牌持有时间和低优先级目标令牌循环时间)设置时应满足的条件。最后给出了收发缓冲器容量的设置方法。     

Selection of token holding times in timed-token protocols

Minimum requirements for the high-priority token holding time (HPTHT) in a network using timed token access protocols (such as IEEE 802.4 and FDDI) are derived in order to ensure that the throughput of synchronous messages is no lower than the amount of traffic generated for that class. The minimal value is essential in order to avoid unbounded queue length for the synchronous class as well as to achieve high network responsiveness. The results have been obtained for synchronous messages generated according to a generic periodic pattern with no constraint for the shape and for the period of the pattern. The manner in which the theoretical results obtained can be used to tune the network performance is also shown     

Performance of token schemes supporting delay-constrained prioritytraffic streams

A symmetric priority-based token network is considered. Messages are divided into two priority classes. High-priority messages are assumed to require tight delay constraints. As a result, each station is allowed to establish, at any time, at most a single real-time high-priority access concentration. High-priority messages are guaranteed access onto the channel within a prescribed limited period. In turn, regular priority messages are only served when the system determines, through the repetitive use of circulating tokens (as used by the IEEE 802.5 token-ring-type protocol), that no high-priority messages are currently waiting in the system. Two token schemes employing different service disciplines are used to provide network access. Exact and approximate mean delay formulas for both message classes are derived. Numerical results are then exhibited to illustrate the network performance under various traffic conditions     

Throughput analysis of the IEEE 802.4 priority scheme

The IEEE 802.4 token bus standard defines an optional priority scheme to handle multiple classes of data. It allocates the channel bandwidth among different priority classes of messages by a set of timers at each station. An analytical model for the priority scheme is presented. The model relates the throughput of each priority class of messages to the traffic intensities of different classes, the target rotation times, and the high-priority token holding time. The network is assumed to be symmetric with respect to its parameters and the traffic distribution among nodes. Simulation results are used to evaluate the accuracy of the model. The model provides means of evaluating the network throughput and can be used to determine the time values to meet the throughput requirements of different classes of traffic     

Setting target rotation times in an IEEE token bus network

The IEEE standard 802.4 token bus protocol requires each network station to implement a synchronous (highest priority) message class, and permits a station to implement three lower priority classes: urgent asynchronous, normal asynchronous, and time available. Each of the lower three priorities (called access classes) is assigned a target token rotation time that limits the amount of time that a station can use to service lower priority traffic. A formulation of the problem is presented in which messages are transmitted from an access class as long as network throughput remains below a user-specified threshold. Formulas are derived that transform this priority scheme, based on network throughput limits, into the proper target rotation time settings that the token bus protocol actually requires. The analytical model is compared with a computer simulation of the token bus protocol and shows close agreement     

Performance of Single Access Classes on the IEEE 802.4 Token Bus

The IEEE 802.4 token bus defines both synchronous and asynchronous message access classes. Their performance is compared for networks implementing a single message class. Throughput bounds are derived from the access class timer. It is shown that for some configurations, the asynchronous class yields lower observable message delays. Mean observable delay is minimized by allowing each medium access controller unrestricted service.     

Determination of LTPB parameters to guarantee message deadlines

A bandwidth allocation scheme for a linear token passing multiplex data bus is proposed based on balancing message transmission time with traffic load to each node. It is proved to provide a network worst case achievable utilization of 50%. Under this allocation scheme, closed-form expressions for the initialized value of token holding timers and token rotation timers in each node are obtained.     

Are priorities useful in an 802.5 token ring?

The IEEE standard 802.5 token ring protocol defines eight packet priorities. The intent is that high-priority packets should be delivered prior to low-priority packets. A series of simulations shows that this expected behavior occurs when there are very few network stations, very short data packets (but still long relative to ring latency), very short token hold times, and very high network loads. In the general case, priorities did not markedly influence packet delivery time. Use of the priority system generally resulted in more overhead and longer average packet delays than when all packets were carried as a single priority. The features of the protocol operation that are the cause of this increased delay and lack of priority discrimination are described mathematically     

Approximate performance analysis of real-time traffic over heavilyloaded 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     

A 250-Mbit/s ring local computer network using 1.3-µm single-mode optical fibers

A 250-Mbit/s three-station fiber-optic ring local computer network was built and successfully demonstrated. A conventional token protocol was employed for bus arbitration to maximize the bus efficiency under high loading conditions, and a non-return-to-zero (NRS) data encoding format was selected for simplicity and maximum utilization of the ECL-circuit bandwidth.     

The performance of a timer-controlled token passing mechanism withfinite buffers in an industrial communication network

The timer-controlled token-passing mechanism widely used in industrial communication networks is analyzed. Several real network parameters, such as finite buffers and finite token-holding time (THT), which generally determine the overall performance of a network, are considered. The approximate matrix equation between the queue length distribution and the token rotation time is derived. Based on this matrix equation, the equations for the mean waiting time and the blocking probability are also derived. These equations can be easily solved using personal computers, due to its simple matrix structure and small computation time. Using these equations, the performance of field bus or other timer-controlled token-passing networks can be more accurately evaluated, since finite size buffers and finite THT are considered. The approximation error is shown to be small by computer simulation     

A Fiber Optic Contention Bus with Bounded Delays

This paper describes the operation of a new type of fiber optic local area network (LAN) that has most of the advantages of both the contention and token systems. The new system, called PRENET, is basically a contention system; it has no collisions, no message size or cable length limitations, and no stability problems. It can be loaded up to 80-85 percent of its bus capacity and it has bounded delays. The PRENET system has active stations and can be operated with two or four fiber optic cables. When operating with four cables the advantage of PRENET over other networks is its robustness against station failures and open-cable problems. The PRENET system uses a new media-access protocol called Preemptive Contention. It is shown that with this new protocol a packet- or station-based priority scheme can be readily included in the operation of the system. The computer simulation of a two cable system using the Preemptive Contention protocol is also presented. It is shown that for such a system operating at 2 Mbits/s with 80 percent bus utilization the mean waiting time is under 1 ms. It is also shown that the waiting time of a four-cable PRENET system is still smaller. It is pointed out that the new media-access protocol of the PRENET simplifies the behavior of this contention system to one that can be approximately predicted using an M/D/1 queueing model with batch arrivals.     

Comments on `Performance of single access classes on the IEEE 802.4token bus' by M.A. Colvin and A.C. Weaver

In the above correspondence (ibid., vol.COM-34, no.12, p.1253-6, Dec. 1986), throughput bounds are derived for the IEEE 802-4 token passing scheme, in the presence of a single class of messages. It does not consider the fact that even after the token holdtimer expires, a node is allowed to complete its message transmission. Here, the fact is considered, and the upper bounds on throughput are modified     

QoS-based remote control of networked control systems via Profibus token passing protocol

This paper focuses on a quality-of-service (QoS)-based remote control scheme for networked control systems via the Profibus token passing protocol. Typically, token passing experiences random network delay due to uncertainties in token circulation, but the protocol has in-built upper and lower bounds of network delay. Thus, to ensure the control performance of networked control systems via the Profibus token passing protocol, the network delay should be maintained below the allowable delay level. As the network delay is affected by protocol parameters, such as target rotation time, we present here an algorithm for selection of target rotation time using a genetic algorithm to ensure QoS of control information. We also discuss the performance of the QoS-based remote control scheme under conditions of controlled network delay. To evaluate its feasibility, a networked control system for a feedback control system using a servo motor was implemented on a Profibus-FMS network.     

Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels

In this correspondence, we consider the class of finite-state Markov channels (FSMCs) in which the channel behaves as a binary symmetric channel (BSC) in each state. Upper bounds on the rate of LDPC codes for reliable communication over this class of FSMCs are found. A simple upper bound for all noninverting FSMCs is first derived. Subsequently, tighter bounds are derived for the special case of Gilbert-Elliott (GE) channels. Tighter bounds are also derived over the class of FSMCs considered. The latter bounds hold almost-surely for any sequence of randomly constructed LDPC codes of given degree distributions. Since the bounds are derived for optimal maximum-likelihood decoding, they also hold for belief propagation decoding. Using the derivations of the bounds on the rate, some lower bounds on the density of parity check matrices for given performance over FSMCs are derived     

Comparative performance of voice/data local area networks

Using simulation, a network-independent framework compares the performance of contention-based Ethernet and two contention-free round-robin schemes, namely Expressnet and the IEEE 802.4 token bus. Two priority mechanisms for voice/data traffic on round-robin networks are studied: the alternating-rounds mechanism of the Expressnet, and the token rotation timer mechanism of the token bus, which restricts access rights based on the time taken for a token to make one round. It is shown that the deterministic schemes almost always perform better than the contention-based scheme. Design issues such as the choice of minimum voice packet length, priority parameters, and voice encoding rate are investigated. An important aspect that is noted is the accurate characterization of performance over a wide region of the design space of voice/data networks     

基于令牌总线网络的RS 485应用

应用RS 485物理层标准,构建总线型的控制网络,采用令牌方式实现总线的共享访问,以适应控制网络实时性要求。在进行令牌总线协议设计时,从RS 485特点出发,以特殊的设计来简化协议,提高协议的效率。为了保证网络的可靠性,在协议中采用了有效的错误处理方法,即保证数据传输的正确性,又减小了协议的控制开销,以简单、方便、快捷、高效的方式实现控制网络的介质访问管理,给RS 485网络提供一种较好的连网模型。     

Performance of the timed token scheme in MAP

Two new analytic approximations are given for the mean delay in the timed token bus network specified in MAP (manufacturing automation protocol). Each station on the network has two kinds of timer for controlling the maximum amount of time for data transfer before giving up the token. High-priority stations would set large values in the token holding timer (THT) and transmit until the timer expires. Low-priority stations compare the elapsed time since the last token arrival (measured cycle time) to the token rotation timer (TRT) setting, and transmit only for the time left in the timer. The first approximation, based on Fuhrmann's bound for the limited-k service discipline, is for the symmetric case where all the stations have the same traffic load and the identical THT or TRT settings. The approximation has been compared to simulation results, and found to be quite accurate for a representation factory network, with THT or TRT set at two and five times the average total walk time. The second approximation is for the asymmetric case where there is one saturated low-priority (limited-TRT) station, and the rest of the stations in the network have high priority with limited-THT service. These two formulas will be useful in the planning and operation of MAP networks by providing guidance in the choice of timer settings for meeting different priority service requirements     

Stability of Decision Feedback Inverses

The method of inversion of linear discrete time systems utilizing quantized feedback is examined, and a stability concept is developed. The application in mind is decision feedback equalization (DFE). Sets of necessary conditions and sufficient conditions for stability are derived. A lower bound for the probability of recovery from error, and an upper bound for the mean recovery time are obtained. It is suggested that a stability index for each system could be defined. The bounds derived do not depend on the nature of the noise or the channel impulse response except through its length.     

Buzz-Net: A Hybrid Token/Random Access LAN

Buzz-net is a local network supported by a pair of unidirectional buses to which stations are connected via passive interfaces. The access protocol is a hybrid which combines random access and virtual token features. More precisely, the network operates in random access mode at light load and virtual token mode at heavy load. Because of the virtual token implementation, Buzz-net retains high efficiency even at very high bus speeds. Efficiency at high speeds and bus unidirectionality make Buzz-net particularly suitable for fiber optics media. This paper describes the protocol, develops approximate analytic models for performance evaluation, and compares Buzz-net performance results to those of other unidirectional bus schemes.