1,076 research outputs found
An optimal synchronous bandwidth allocation scheme for guaranteeing synchronous 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. Thm scheme is an enhancement on the previously publiibed MCA scheme
Cycle-time properties of the timed token medium access control protocol
We investigate the timing properties of the timed token protocol that are necessary to guarantee synchronous message deadlines. A tighter upper bound on the elapse time between the token's lth arrival at any node i and its (l + v)th arrival at any node k is found. A formal proof to this generalized bound is presented
Recommended from our members
Tools for efficient analysis of concurrent software systems
The ever increasing use of distributed computing as a method of providing added computing power and reliability has sparked interest in methods to model and analyze concurrent hardware/ software systems. Efficient automated analysis tools are needed to aid designers of such systems. The Distributed Systems Project at UCI has been developing a suite of tools (dubbed the P-NUT system) which supports efficient analysis of models of concurrent software. This paper presents the principles which guide the development of P-NUT tools and discusses the development of one of the tools: the Reachability Graph Builder (RGB). The P-NUT approach to tool development has resulted in the production of a highly efficient tool for constructing reachability graphs. The careful design of data structures and associated algorithms has significantly enlarged the class of models which can be analyzed
The derivation of performance expressions for communication protocols from timed Petri net models
Petri Net models have been extended in a variety of ways and have been used to prove the correctness and evaluate the performance of communication protocols. Several extensions have been proposed to model time. This work uses a form of Timed Petri Nets and presents a technique for symbolically deriving expressions which describe system performance. Unlike past work on performance evaluation of Petri Nets which assumes a priori knowledge of specific time delays, the technique presented here applies to a wide range of time delays so long as the delays satisfy a set of timing constraints. The technique is demonstrated using a simple communication protocol
Performance analysis of FDDI
The Fiber Distributed Data Interface (FDDI) is an imerging ANSI and ISO standard for a 100 megabit per second fiber optic token ring. The performance of the FDDI media access control protocol is analyzed using a simulation developed at NASA Ames. Both analyses using standard measures of performance (including average delay for asynchronous traffic, channel utilization, and transmission queue length) and analyses of characteristics of ring behavior which can be attributed to constraints imposed by the timed token protocol on token holding time (including bounded token rotation time, support for synchronous traffic, and fairness of channel access for nodes transmitting asynchronous traffic) are included
Dynamic-Threshold-Limited Timed-Token (DTLTT) Protocol
An improved version of the Static-Threshold-Limited On-Demand Guaranteed Service Timed-Token (STOGSTT) Media Access Control (MAC) protocol for channel capacity allocation to the asynchronous trac in Multiservice Local Area Network (MLANs) was developed and analyzed. TLODGSTT protocol uses static value of threshold bandwidth to allocate available bandwidth to the asynchronous trac, as such, the throughput of STLODGSTT protocol drops signi cantly under non-uniform heavy load of asynchronous trac. The DTLTT protocol dynamically adjusts the threshold bandwidth in response to the variations in the load distribution of the asynchronous trac. In view of this dynamic mechanism, under various load distributions of the asynchronous trac, the DTLTT protocol maintains higher throughput than the STLODGSTT protocol. The improvement is demonstrated through analytical computations and simulation results.Keywords: multi-access, multiservice, network, synchronous, asynchronous, trac, timed-toke
Setting target rotation time in PROFIBUS based real-time distributed applications
In this paper, we analyse the ability of Profibus fieldbus to cope with
the real-time requirements of a Distributed Computer Control System (DCCS),
where messages associated to discrete events must be made available within a
maximum bound time. Our methodology is based on the knowledge of real-time
traffic characteristics, setting the network parameters in order to cope with
timing requirements. Since non-real-time traffic characteristics are usually
unknown at the design stage, we consider an operational profile where,
constraining non-real-time traffic at the application level, we assure that realtime
requirements are met.FLAD; ISE
Architectural impact of FDDI network on scheduling hard real-time traffic
The architectural impact on guaranteeing synchronous message deadlines in FDDI (Fiber Distributed Data Interface) token ring networks is examined. The FDDI network does not have facility to support (global) priority arbitration which is a useful facility for scheduling hard real time activities. As a result, it was found that the worst case utilization of synchronous traffic in an FDDI network can be far less than that in a centralized single processor system. Nevertheless, it is proposed and analyzed that a scheduling method can guarantee deadlines of synchronous messages having traffic utilization up to 33 pct., the highest to date
- …