OUTPUT PROCESS CHARACTERIZATION FOR FAST TOKEN RING NETWORKS SUPPORTING 2 PRIORITIES

Authors
Citation
Nf. Li et Zh. Tsai, OUTPUT PROCESS CHARACTERIZATION FOR FAST TOKEN RING NETWORKS SUPPORTING 2 PRIORITIES, Computer communications, 20(14), 1997, pp. 1280-1291
Citations number
19
Journal title
ISSN journal
01403664
Volume
20
Issue
14
Year of publication
1997
Pages
1280 - 1291
Database
ISI
SICI code
0140-3664(1997)20:14<1280:OPCFFT>2.0.ZU;2-P
Abstract
A performance model Cor the fast token ring connected to an output lin k via a switching node is considered. For each station, traffic stream s of two priority classes are supported. Poisson packet arrival proces s, Erlang-K packet length distribution and zero walk time are assumed, The output process of one fast token ring with a switching node is ch aracterized by using a 3-phase Markov Modulated Erlang Process (MMEP), The numerical results indicate that the required output link capacity predicted by this approximated process can be much less than the esti mation based on the Poisson Process assumption, provided that the cong estion at the switching node is kept at the same level. (C) 1997 Elsev ier Science B.V.