By Topic

Performance analysis of a multiple-access ring network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ghafir, H.M. ; Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA ; Silio, C.B., Jr.

The authors model the delay-throughput performance of a class of multiple-access circuit-switched ring local area networks that allow multiple messages to be transferred concurrently on the ring. In particular, they model analytically the PLAYTHROUGH protocol under assumptions of uniform and symmetric traffic, infinite buffers, and a first-in, first-out (FIFO) queueing discipline at each station to predict message mean waiting times that adequately approximate waiting times observed through simulation. The queue is analyzed at an arbitrary station as a M/G/1 vacation system having a Bernoulli schedule with parameter p. Expressions for the vacation duration and p are derived in terms of service times and competing traffic intensities on PLAYTHROUGH rings. The vacation period is modeled as a series of subvacations because the server is allowed to take multiple subvacations when the queue is nonempty. Application of this modeling strategy is shown to provide good agreement between analytical predictions and simulation results. The performance of this class of networks is compared with that of token rings

Published in:

Communications, IEEE Transactions on  (Volume:41 ,  Issue: 10 )