Analysis of an FDDI network supporting stations with single-packet buffers

We present exact analysis of a nonsymmetric multiple-priority token ring network with single packet buffers under a timedtoken protocol, similar to that employed for medium access control of the Fiber Distributed Data Interface (FDDI) network. The single-packet buffer model is employed for describin...

Full description

Saved in:
Bibliographic Details
Published inComputer networks and ISDN systems Vol. 29; no. 2; pp. 249 - 266
Main Authors Rubin, Izhak, Wu, James C.-H.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 1997
Elsevier Science
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:We present exact analysis of a nonsymmetric multiple-priority token ring network with single packet buffers under a timedtoken protocol, similar to that employed for medium access control of the Fiber Distributed Data Interface (FDDI) network. The single-packet buffer model is employed for describing the queueing operation characterizing typical user terminals. An iterative procedure is used to compute the limiting state distribution of the embedded Markov chains representing the system state process. We obtain the distributions of the token rotation time, the normalized throughput, and the mean packet waiting time. By using a counting process representing the numbers of transmitted and deferred packets in a token rotation cycle, we present a simplified analysis of a symmetric network containing a large number of stations. We illustrate the application of the analytic approach through numerical examples representing FDDI network systems operating under various traffic loading conditions.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0169-7552
DOI:10.1016/S0169-7552(96)00007-4