A Simplified Analysis of Scan Times in an Asymmetrical Newhall Loop with Exhaustive Service

A Newhall loop with exhaustive service, infinite buffer storage, and non-identical terminals is analyzed. A simple and computationally efficient procedure is demonstrated for determining first and second moments of queue lengths and scan times.

[1]  Alan G. Konheim.  Chaining in a Loop System , 1976, IEEE Trans. Commun..

[2]  Bernd Meister,et al.  Waiting Lines and Times in a System with Polling , 1974, JACM.

[3]  Wesley W. Chu,et al.  On the Analysis and Modeling of a Class of Computer Communication Systems , 1972, IEEE Trans. Commun..

[4]  E. E. Newhall,et al.  An experimental distributed switching system to handle bursty computer traffic , 1969, Symposium on Problems in the Optimization of Data Communications Systems.