A closed multiple-access system composed of M sources and a single service facility is analyzed. The closed network is modeled as a finite source M/G/1 queueing system. We consider systems with a large number of sources (i. e. M greater than 1) and we assume that the mean time required to process an individual request is short (O(1/M)). We then construct asymptotic approximations to the stationary distribution of the number of requests in the service facility by using the method of matched asymptotic expansions. We give formulas for the first and second moments of the number of requests, for all traffic intensities.
|Original language||English (US)|
|Number of pages||21|
|Journal||SIAM Journal on Computing|
|State||Published - Jan 1 1987|
ASJC Scopus subject areas
- Computer Science(all)