Performance of a token-passing system with batch arrivals and its application to file transfers
This paper investigates the performance of token-passing systems with limited service and Poisson arrivals. For pure Poisson arrivals, the Laplace-Stieltjes Transform (LST) of an approximate customer/packet waiting time distribution is derived and expressed as a functional equation, from which the a...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
1993
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/196 https://ink.library.smu.edu.sg/context/sis_research/article/1195/viewcontent/Token_Passing_Batch_Arrival_1992_afv.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |
| Summary: | This paper investigates the performance of token-passing systems with limited service and Poisson arrivals. For pure Poisson arrivals, the Laplace-Stieltjes Transform (LST) of an approximate customer/packet waiting time distribution is derived and expressed as a functional equation, from which the approximate mean and variance of waiting time are obtained; for batch Poisson arrivals, an approximate mean of waiting time is derived. Mean waiting time approximations are compared against both simulation results and other results presented in the literature; the variance approximation is evaluated by comparing it to simulation results only, since no other results on variance have been reported so far. As application examples of our analytical results, multimedia file transfers over token-passing LANs are modelled and studied. |
|---|