Analysis of the SCAN service polling model
A performance analysis is given for a polling system in which the server polls N stations back and forth according to the so-called SCAN system. Messages arrive at each station in Poisson fashion at an average rate A: The number of characters in a message has a geometric distribution with mean l/er....
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1991
|
| Sorozat: | Acta cybernetica
10 No. 1-2 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12487 |
| Tartalmi kivonat: | A performance analysis is given for a polling system in which the server polls N stations back and forth according to the so-called SCAN system. Messages arrive at each station in Poisson fashion at an average rate A: The number of characters in a message has a geometric distribution with mean l/er. The service time per character, 6, and the switchover time between adjacent stations, r, are both assumed to be constant. An exact analysis is given but because of associated computational problems this has limited application. Thus a second approximate analysis which allows systems with a large number of stations to be treated, has been developed. In both cases it is a simple matter to calculate such performance measures as average polling cycle time and mean response time at each star tion. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 1-13 |
| ISSN: | 0324-721X |