Approximate analysis of asymmetric single-service token-passing systems

Author

Ibe, Oliver C. ; Cheng, Xian

Author_Institution

Digital Equipment Corp., Andover, MA, USA

Volume

37

Issue

6

fYear

1989

fDate

6/1/1989 12:00:00 AM

Firstpage

572

Lastpage

577

Abstract

Consideration is given to token-passing or polling systems in which the message arrival process, the message transmission time distribution, and the walk time vary from one station to another. An approximate analysis of these systems is obtained. The results obtained from the approximate analysis are compared against both simulation results and those obtained from two approximate methods that have been proposed earlier. For the special case of a symmetric system, it is shown that the approximate analysis is exact when the walk time is constant. Even when the walk time is exponentially distributed, it is shown that the approximate analysis gives an approximation error of less than 0.3% in the range of offered load that is generally of interest

Keywords

probability; queueing theory; token networks; LAN; approximate analysis; asymmetric single-service system; computer networks; message arrival process; message transmission time distribution; polling systems; symmetric system; token-passing systems; walk time; Analytical models; Application software; Approximation error; Bridges; Communications Society; Computer applications; Identity-based encryption; Local area networks; Network servers; Telecommunication traffic;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.31141

Filename

31141