Timer selection for satisfying the maximum allowable delay using performance model of profibus token passing protocol

Recently, the Fieldbus has become an indispensable component for many automated systems. In the Fieldbus system, real-time data containing sensor values and control commands have a tendency to rapidly lose their value as time elapses after its creation. In order to deliver these data in time, the fieldbus network should be designed to have a short delay compared to the maximum allowable delay. Because the communication delay is affected by performance parameters such as the 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 a genetic algorithm to meet the delay requirements.     

Gain adaptation of networked DC motor controllers based on QoS variations

Connecting a complex control system with various sensors, actuators, and controllers as a networked control system by a shared data network can effectively reduce complicated wiring connections. This system is also easy to install and maintain. The trend is to use networked control systems for time-sensitive applications, such as remote DC motor actuation control. The performance of a networked control system can be improved if the network can guarantee quality-of-service (QoS). Due to time-varying network traffic demands and disturbances, QoS requirements provided by a network may change. In this case, a network has to reallocate its resources and may not be able to provide QoS requirements to a networked control application as needed. Therefore, the application may have to gracefully degrade its performance and perform the task as best as possible with the provided network QoS. This paper proposes a novel approach for networked DC motor control systems using controller gain adaptation to compensate for the changes in QoS requirements. Numerical and experimental simulations, and prototyping, are presented to demonstrate the feasibility of the proposed adaptation scheme to handle network QoS variation in a control loop. The effective results show the promising future of the use of gain adaptation in networked control applications.     

Impact and control of network QoS on smart grid controlled electrical vehicle charging

Novel, networked information-rich control systems are emerging to provide a stable and cost-efficient operation of future electricity distribution grids. However, the dependence on fault-prone, low-cost, and heterogeneous network technologies and architectures challenges the grid control quality. In this work, we study the impact of varying network QoS for M2M connectivity on the low voltage grid operation in an electrical vehicle charging scenario. The analyzed charging control system relies on: (a) grid power sensing using smart meters via high latency power line communication and, (b) charging point actuation commands disseminated via unreliable wireless links (IEEE 802.11). Based on emulation results, we quantify the maximum acceptable meter reading delay from network transmission that sufficiently minimizes load prediction error. Further, based on the introduction of a timed reliable communication protocol, it is shown how changing the trade-off in QoS parameters of delay, loss and information inconsistency can be applied to overcome degradation of controller performance.     

Selection of timed token protocol parameters to guarantee messagedeadlines

Networks that use the timed token protocol (such as the 100 Mbit/s FDDI network) are well suited for real-time applications because they guarantee, to each node, an average bandwidth and a bounded access time to the communication network. This guarantee is necessary but not sufficient for the timely delivery of deadline-constrained messages; protocol parameters must be carefully selected to ensure that these messages meet their deadlines. This paper addresses the issue of selecting the protocol parameters TTRT (target token rotation time) and the synchronous capacities assigned to each node. The objective is to guarantee that each synchronous message is transmitted before its deadline. An upper bound is derived on the worst case achievable utilization (WCAU) of any parameter selection scheme. The WCAU of a scheme is defined as the maximum utilization U such that the scheme guarantees all synchronous messages as long as their utilization is less than U. An algorithm for selecting the above parameters is proposed, The algorithm is shown to have a WCAU that is very close to the upper bound     

采用动态令牌的MANET多址接入协议

本文设计了一种采用动态令牌算法的MANET多址接入协议,解决了隐藏终端和入侵终端问题.利用这种算法,不再需要为令牌的传递预先建立虚拟的令牌逻辑环路,而是根据当前的网络拓扑结构自动地形成令牌的传递路由,使得令牌的传递能够适应网络拓扑结构动态的动态变化.同时,通过周期性地产生令牌并严格地限制每个令牌的生存时间,简化了令牌的维护过程,并为时延敏感的业务提供良好的QoS保障.另外,该协议采用一种互同步技术,具有成本低廉、运行可靠的特点,可完全独立于其它系统(如GPS等),且已应用于实际的MANET网络.     

Buffered fixed routing: a routing protocol for real-time transportin grid networks

We propose a new routing protocol called buffered fixed routing (BFR) for real-time applications on grid networks. While previous routing protocols for grid networks have been designed to improve network throughput, the BFR scheme is proposed to guarantee the end-to-end packet delay and sequencing without loss by using finite buffers at each node. Thus the proposed scheme can satisfy quality-of-service (QoS) requirements of real-time applications. The BFR scheme uses the token on the row ring to provide QoS guarantees. The performance of the BFR scheme is analyzed by using the Geom/Geom/1 queueing system under uniform traffic. In the simulation, the BFR scheme shows the zero-loss, high-throughput performance with the minimum delay variation compared to other routing protocols such as store and forward routing, deflection routing and vertical routing. In addition, it has shown the smallest average delay at intermediate and heavy loads     

Approximate analysis of timer-controlled priority scheme in thesingle-service token-passing systems

This paper presents an approximate analysis of delay performance in the timer-controlled priority scheme of single-service token passing systems, where each priority queue is allowed to transmit one message at a time. This is the practical case of real-time networks such as those used in aircraft and spacecraft control, process control and factory communications. The token passing systems consist of N stations, each of which has (K+1) priority queues. The highest priority queues can transmit a message whenever the token arrives. A lower priority queue can transmit a message if the token rotation time (which was reset and restarted at the previous token arrival instant) is not expired when the token arrives. An analytical model is developed based on the independent and identically distributed random variables of conditional effective service times (time interval between two consecutive instants at which a priority queue has an opportunity to transmit a message) of each priority queue. The condition is assigned on the basis of the contribution of message transmission time to the effective service time. The approximate mean waiting time for each priority queue is determined using the well-known results from Kuehn (1979), who first introduced the conditional cycle time. The approximate analytical model is validated by comparison with the simulation results     

Modeling and performance analysis of a symmetric fast-circuitswitched robust-WDM LAN with the AR/LTP protocol

Robust wavelength division multiplexing (WDM) is a technique to implement WDM local area networks (LAN's) in the presence of laser wavelength drifts. A medium access control (MAC) protocol is used in conjunction with a wavelength-tracking receiver to tolerate the variations of transmission wavelengths. Among the proposed medium access schemes, the aperiodic reservation (AR) scheme with token-passing based control channel gives the best performance. An AR protocol with a lenient token passing policy (AR/LTP) is thus presented. An analytical model is developed to design Robust-WDM AR/LTP LAN's and predict their performance characteristics. The model can be used to evaluate the variation of waiting time and throughput for load and network parameters such as the arrival rate, number of nodes, number of channels and timing parameters. It also addresses the issues related to traffic loss, channel-blocking, token rotation time, network span, and the effect of device parameters     

Real-time fieldbus communications using Profibus networks

This paper provides a comprehensive study on how to use Profibus fieldbus networks to support real-time industrial communications, that is, on how to ensure the transmission of real-time messages within a maximum bound time. Profibus is base on a simplified timed token (TT) protocol, which is a well-proved solution for real-time communication systems. However, Profibus differs with respect to the TT protocol, thus preventing the application of the usual TT protocol real-time analysis. In fact, real-time solutions for networks based on the TT protocol rely on the possibility of allocating specific bandwidth for the real-time traffic. This means that a minimum amount of time is always available, at each token visit, to transmit real-time messages, transversely, with the Profibus protocol, in the worst case, only one real-time message is processed per token visit. The authors propose two approaches to guarantee the real-time behavior of the Profibus protocol: (1) an unconstrained low-priority traffic profile; and (2) a constrained low-priority traffic profile. The proposed analysis shows that the first profile is a suitable approach for more responsive systems (tighter deadlines), while the second allows for increased nonreal-time traffic throughput     

Generalized access control strategies for integrated services tokenpassing systems

The demand for integrated services local area networks is increasing at a rapid pace with the advent of many new and exciting applications: office and factory automation, distributed computing, and multimedia communications. To support these new applications, it is imperative to integrate traffic with diverse statistical characteristics and differing delay requirements on the same network. An attractive approach for integrating traffic has been adopted in two token passing local area network standards, the IEEE 802.4 token bus standard and FDDI. The idea is to control the transmissions of each station based on a distributed timing algorithm, so as to achieve the following goals: (i) to limit the token cycles so that time-critical traffic can be accommodated, and (ii) to allocate pre-specified bandwidths to different stations when the network is overloaded. We have investigated the analysis and design of this protocol previously (see Pang and Tobagi, 1989). In this paper, we generalize the transmission control algorithm used with that protocol. The major advantages of the generalization over the original protocol are: (i) it provides a much expanded design space, (ii) it guarantees convergent behavior, and (iii) it gives meaningful insights into the dynamics of the basic control algorithm     

New Predictive Control Scheme for Networked Control Systems

This paper is concerned with the design of networked control systems with random network-induced delay and data dropout. It presents a new control scheme, which is termed networked predictive control with optimal estimation. Based on Multirate Kalman Filtering, the measured data which are out of sequence or delayed can be used to improve the precision of estimation. The control prediction generator provides a set of future control predictions to make the closed-loop system achieve the desired control performance and the compensator removes the effects of the network transmission with time delay and data dropout. Simulation results are presented to illustrate the effectiveness of the control strategy via comparing with control schemes without any compensation for the network.     

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     

CSMA/CD with Deterministic Contention Resolution

This paper presents a novel media access protocol CSMA/CD with deterministic contention resolution (DCR) for a local area network. It usually operates as CSMA/CD, but once a collision occurs it resolves the collision using a kind of implicit token passing. An analysis was conducted on DCR performance characteristics based on simulation studies and in comparison to conventional CSMA/CD and implicit token passing. It was found that they were very satisfactory in terms of throughput, message delay, and delay standard deviation, these performance characteristics make DCR attractive as a media access protocol for combined voice and data traffic. It has also been shown that this protocol assures robustness against various kinds of transmission errors and station failures. A prototype of a local area network using this protocol has been developed. It consists of a pair of optical fiber buses to which each station is attached via a pair of directional couplers.     

基于优先级的IEEE802.16系统接纳控制算法研究

鉴于IEEE802.16标准中未对接纳控制机制提出定义,为了提高系统带宽利用率,在分析现有无线网络接纳控制技术的基础上,结合IEEE802.16的具体机制提出了一种基于业务优先级的接纳控制算法。相比于先到先服务的接纳机制,该算法严格区分业务优先级,为不同优先级业务预留带宽,以保证实时业务的服务质量(QoS)要求。利用NS2网络模拟软件对算法进行了仿真和性能评估。结果表明,本接纳控制算法可以较好地保障高优先级业务的实时性,同时在重负载情况下系统带宽利用率有了明显提高。     

Guaranteed Cost Networked Control for T–S Fuzzy Systems With Time Delays

This paper develops a guaranteed cost networked control (GCNC) method for Takagi-Sugeno (T-S) fuzzy systems with time delays. The state feedback controller is designed via the networked control system (NCS) theory. The stability of the overall fuzzy system using GCNC is also established. Network-induced delay in network transmission and packet dropout are analyzed. Some deductions are also extended to uncertain systems. Simulation results show the validity of the present control scheme     

End-to-End Adaptive QoS Provisioning over GPRS Wireless Mobile Network

The General Packet Radio Service (GPRS) offers performance guaranteed packet data services to mobile users over wireless frequency-division duplex links with time division multiple access, and core packet data networks. This paper presents a dynamic adaptive guaranteed Quality-of-Service (QoS) provisioning scheme over GPRS wireless mobile links by proposing a guaranteed QoS media access control (GQ-MAC) protocol and an accompanying adaptive prioritized-handoff call admission control (AP-CAC) protocol to maintain GPRS QoS guarantees under the effect of mobile handoffs. The GQ-MAC protocol supports bounded channel access delay for delay-sensitive traffic, bounded packet loss probability for loss-sensitive traffic, and dynamic adaptive resource allocation for bursty traffic with peak bandwidth allocation adapted to the current queue length. The AP-CAC protocol provides dynamic adaptive prioritized admission by differentiating handoff requests with higher admission priorities over new calls via a dynamic multiple guard channels scheme, which dynamically adapts the capacity reserved for dealing with handoff requests based on the current traffic conditions in the neighboring radio cells. Integrated services (IntServ) QoS provisioning over the IP/ATM-based GPRS core network is realized over a multi-protocol label switching (MPLS) architecture, and mobility is supported over the core network via a novel mobile label-switching tree (MLST) architecture. End-to-end QoS provisioning over the GPRS wireless mobile network is realized by mapping between the IntServ and GPRS QoS requirements, and by extending the AP-CAC protocol from the wireless medium to the core network to provide a unified end-to-end admission control with dynamic adaptive admission priorities.     

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

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

Evaluation of the Random Token Protocol for High-Speed and Radio Networks

In high-speed communication networks, the ratio between the end-to-end propagation delay to packet transmission time is large, causing increased scheduling overhead in demand assignment protocols and increased collision probabilities in random access schemes. These lead to rapid degradation of the channel utilization in both channel access control approaches. In this paper, we present a "random token" oriented protocol where channel access is scheduled by random, implicit token passing leading to lower channel access control penalty. By optimally balancing the collision and scheduling penalties, the protocol allows the network to reach better performance than that obtained from random access schemes in networks with and without collision detection, without imposing additional system operational assumptions. Specifically, the random token protocol does not require knowledge of the number of stations, their identities, or synchronization in periods of silence. Therefore, the protocol is also suitable for high-speed networks with frequent reconfiguration and for mobile radio networks.     

Networked Predictive Control of Systems With Random Network Delays in Both Forward and Feedback Channels

The design problem of networked control systems (NCS) with constant and random network delay in the forward and feedback channels, respectively, is considered in this paper. A novel networked predictive control (NPC) scheme is proposed to overcome the effects of network delay and data dropout. Stability criteria of closed-loop NPC systems are presented. The necessary and sufficient conditions for the stability of closed-loop NCS with constant time delay are given. Furthermore, it is shown that a closed-loop NPC system with bounded random network delay is stable if its corresponding switched system is stable. Both simulation study and practical experiments show the effectiveness of the control scheme     

Flow admission control for multi-channel multi-radio wireless networks

Providing Quality of Service (QoS) is a major challenge in wireless networks. In this paper we propose a distributed call admission control protocol (DCAC) to do both bandwidth and delay guaranteed call admission for multihop wireless mesh backbone networks, by exploiting the multi-channel multi-radio (mc-mr) feature. We propose a novel routing metric for route setup, and present an efficient distributed algorithm for link reservation that satisfies the required bandwidth and reduces the delay by a local scheduling that minimizes one hop delay. To the best of our knowledge, this is the first distributed protocol that embeds mc-mr feature in Time Division Medium Access (TDMA) to do QoS call admission in wireless backbone networks. Extensive simulation studies show that our protocol significantly improves network performance on supporting QoS sessions compared with some widely used protocols.