Share Email Print
cover

Proceedings Paper

Markovian analysis of threshold-based priority mechanism for frame relay networks
Author(s): Salima Hamma; P. Pecka; T. Czachorski; Tulin Atmaca
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

A number of priority mechanisms have been proposed and analyzed for ATM switching and multiplexing. The need of such mechanisms arises from the difficulty to accurately characterize and size low priority traffic. This investigation concerns the performance evaluation of a shared buffer for Frame Relay switch with threshold priority mechanism compared to one without priority mechanism. The main contribution of the paper is the proposed Markovian model for this scheme. The evaluation, based on finite-state Markov model of a switch and its incoming traffic, allow to guarantee loss requirements, i.e. probabilities of 10-6 and 10-4 for high and low priority frames. The Markovian model was generated with the use of a more general tool, the principles of which are also presented in the article. This tool is prepared to construct various Markovian models of computer networks and their control mechanisms. It contains a set of objects written in C++ which may be composed into a network. Steady-state analysis is performed. In addition, a comparative study shows that analytical results validated by simulation.

Paper Details

Date Published: 10 October 1997
PDF: 10 pages
Proc. SPIE 3231, Performance and Control of Network Systems, (10 October 1997); doi: 10.1117/12.290435
Show Author Affiliations
Salima Hamma, Institut National des Telecommunications (France)
P. Pecka, IITIS PAN (Poland)
T. Czachorski, IITIS PAN (Poland)
Tulin Atmaca, Institut National des Telecommunications (France)


Published in SPIE Proceedings Vol. 3231:
Performance and Control of Network Systems
Wai Sum Lai; Hisashi Kobayashi, Editor(s)

© SPIE. Terms of Use
Back to Top