Exact analysis of round-robin scheduling of services

A multi-queue, cyclic-service model with a single-message buffer is considered. Each message consists of a number of characters, and one character is served at the server's each visit. Exact and explicit expressions are derived for performance measures, such as mean cycle time, mean message response time, and mean response time conditioned on the message length. The same model was previously solved by approximation by Wu and Chen [IBM J. Res. Develop. 19, No. 5, 486-493 (September 1975)].