Title

Computing Estimates Of Waiting Times In Ring Local Area Networks With Priority Classes.

Abstract

A heuristic algorithm for evaluating average waiting times for asymmetric ring local area networks with priority classes is presented. The algorithm extends the model proposed by R. Berry and M. Chandy for rings with FCFS queues. The average waiting time for each priority class in each site of the network is computed using iterative formulation with rapid convergence. Numerical comparison results of the algorithm with a SLAM simulation model are presented for three different data transmission protocols.

Publication Date

10-1-1987

Publication Title

Computer Systems Science and Engineering

Volume

2

Issue

4

Number of Pages

155-160

Document Type

Article

Personal Identifier

scopus

Socpus ID

0023440264 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0023440264

This document is currently not available here.

Share

COinS