An optimal synchronous bandwidth allocation scheme for guaranteeingsynchronous message deadlines with the timed-token MAC protocol

This paper investigates the inherent timing properties of the timed-token medium access control (MAC) protocol necessary to guarantee synchronous message deadlines in a timed token ring network such as, fiber distributed data interface (FDDI), where the timed-token MAC protocol is employed. As a result, an exact upper bound, tighter than previously published, on the elapse time between any number of successive token arrivals at a particular node has been derived. Based on the exact protocol timing property, an optimal synchronous bandwidth allocation (SBA) scheme named enhanced MCA (EMCA) for guaranteeing synchronous messages with deadlines equal to periods in length is proposed. This scheme is an enhancement on the previously published MCA scheme     

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     

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.     

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.     

容错型令牌总线网性能评价算法

本文对符合ＩＥＥＥ８０２．４和ＭＡＰ标准的令牌总线网的性能指标评估给出了一种新的计算方法。文中重点考虑了具有信包重发机制、令牌最大保留时间和信包缓冲区容量有限的令牌网络的性能指标评估问题，克服了以往不能分析同时具有信包重发机制和令牌最大保留时间令牌网性能的局限。文中给出的方法简单易行、计算迅速、精度颇高。最后，本文通过例题说明了此方法的应用。     

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     

面向船舶AIS自组织网络的地理位置路由算法

针对船舶自动识别系统（Automatic Identification System,AIS）的自组织网络路由算法设计问题,提出了一种基于优化的贪婪边界无状态路由（Greedy Perimeter Stateless Routing,GPSR）的技术方案。该方案利用AIS时分多址接入协议,为消息报文提供信道接入方法。首先,设计了位置报文的自适应转发策略,使船舶节点根据网络环境自主决策位置报文的转发行为;其次,通过缩小GPSR贪婪转发的选择范围,减少了因节点运动导致的边缘路由失败情况。仿真结果表明,所提方案实现了AIS船舶节点的有效组网。与现有转发策略相比,自适应转发策略降低92.7%的位置报文转发量,并降低了79.6%的时隙冲突率,可有效提高网络资源的利用率。      

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     

Using network coding to achieve the capacity of deterministic relay networks with relay messages

In this paper, we derive the capacity of the deterministic relay networks with relay messages. We consider a network that consists of five nodes, four of which can only communicate via the fifth one. However, the fifth node is not merely a relay as it may exchange private messages with the other network nodes. First, we develop an upper bound on the capacity region based on the notion of a single‐sided genie. In the course of the achievability proof, we also derive the deterministic capacity of a four‐user relay network (without private messages at the relay). The capacity achieving schemes use a combination of two network coding techniques: the simple ordering scheme and detour scheme. In the simple ordering scheme, we order the transmitted bits at each user such that the bi‐directional messages will be received at the same channel level at the relay, while the basic idea behind the detour scheme is that some parts of the message follow an indirect paths to their respective destinations. This paper, therefore, serves to show that user cooperation and network coding can enhance throughput, even when the users are not directly connected to each other. Finally, we make a conjecture about the capacity region of the general K‐node relay network with relay messages. Copyright © 2016 John Wiley & Sons, Ltd.     

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     

提供端到端时延和时延抖动保障的QoS控制

 提出了一类具有最大速率控制的速率保障(Maximum Rate Control-Guaranteed Rate,MRC-GR)算法,可对流同时提供速率保障和最大速率控制.当网络各节点执行MRC-GR算法时,提供了确定网络端到端时延上限和下限的方法,针对服从令牌桶模型和同步单元模型的业务源给出了网络时延上限和下限.针对MRC-GR算法实例——具有最大速率控制的最差情形公平加权公平排队(worst-case fair weighted fair queueing with maximum rate control)调度算法进行仿真实验,仿真结果验证了理论分析.     

On the message and time complexity of protocols for reliablebroadcasts/multicasts in networks with omission failures

This paper presents a fundamental study on the message and time complexity of reliable broadcast/multicast protocols in point-to-point networks subject to omission failures. We assume a weakly synchronous model in which there is a known upper bound on the delay in delivering a message from one process to another. A faulty process may omit sending or receiving messages; this characterizes a common faulty behavior in networking applications. We focus our study on the number of messages and the maximum amount of time required of any fault-tolerant protocol in failure-free executions. We present protocols that, in an n-process network subject to at most t faulty processes, guarantee the delivery of a message from any process to all other nonfaulty processes. In particular, when no failure occurs in the network, our protocols require (n+t-1) messages and at most (n-1+upper bound [log₂(t+1)])·δ units of time, where δ is the maximum time required to deliver a message from a process to another. Moreover, we show that our protocols are optimal with respect to message and time complexity. The new insights provided by the lower bound proofs yield a graph-theoretic characterization of all message and time optimal reliable broadcast/multicast protocols in failure-free executions. We further discuss the implications of our results on the support of multicast services in high-speed switching networks such as ATM     

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     

A 100% efficient media-access protocol for multichannel LAN

This article introduces a slotted protocol for multi-user access to a LAN over parallel OR-type channels. An OR-type channel is defined as a digital communication channel such that, when a bit signal is injected into the channel, the channel content m at the bit position becomes logically ORed with the injected bit. The protocol applies a dynamic coding scheme to achieve 100% channel efficiency in the sense that, in each transmission session, an intended messages, or at least as many as the number of channels, are successfully broadcast. Message reception is through decoding from the OR composition of user injected bits. The coding scheme is a substitute for such approaches as slot reservation, permission token, and collision resolution that are used in most media access protocols     

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     

一种优化的LTPB网络带宽分配方法及实时性能分析

研究LTPB（线性令牌传递总线）通信网络中带宽分配方法对网络实时性能的影响。提出了一种优化的带宽分配方法和基于“最差情形下可达负载率”的网络实时性能分析方法，证明了该带宽分配方法优于所有传统的分配方法，最后举例说明了结论的正确性。     

Performance and parameter region for real-time use in IEEE 802.4token bus network

The upper and lower bounds for the mean cycle time and the mean message transmission time of class six and class four in the IEEE 802.4 token bus network, within which the minimum utilization constraint of class four is guaranteed, are derived. Stability conditions for the token bus network are also derived. These bounds and stability conditions are represented in terms of the high-priority token hold time, the token rotation time, the arrival rate, the total number of stations, etc. A parameter-tuning algorithm in a partially symmetric token bus network with two classes is suggested. This algorithm maximizes the utilization of class four for a given high-priority token hold time and at the same time meets the constraints of the stability condition of the network, the real-time constraint, and the minimum utilization of class four     

Performance analysis of type 3 LLC in industrial 802.5 nets

Some performance results obtained by simulating the behavior of a local area network based on the IEEE 802.5 standard are presented. The simulation model has been designed to evaluate the mean response time observed by the user of the LLC (logical link control) service, instead of measuring the turnaround time experienced by the medium access control user; i.e. the performance index is the average delay between the message generation and the receipt of the corresponding acknowledgement. Type-3 LLC service is analyzed since it appears particularly attractive in industrial LANs concerned with real-time activities and adopting reduced protocol profiles. The effect of having different priority classes for the messages in the network system has been studied. Some results that demonstrate the existence of a practical upper bound to the maximum value of the token holding time have been obtained     

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

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

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