Application of decomposition principle in M/G/1 vacation model to two continuum cyclic queueing models — Especially token-ring LANs

We apply a recent decomposition result of Fuhrmann and Cooper for the M/G/1 queue with server vacations to obtain mean waiting times for the following two cyclic queueing models: The server scans at a constant velocity (1) serving work as it is encountered, or (2) collecting work that it serves at the end of each cycle. Model 1 describes token-ring polling in certain computer-communication networks; Model 2 has been used to describe mail pickup and delivery systems.