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

R. Carsten · E. E. Newhall · Morton J. M. Posner

30 citations0/0 files storedIRE Transactions on Communications Systems

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Wireless Communication Networks Research Interconnection Networks and Systems

Abstract

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 30 citations exist upstream.

References

1974Waiting Lines and Times in a System with Polling 1972On the Analysis and Modeling of a Class of Computer Communication Systems

Cited by

1991Polling systems with simultaneous arrivals 1991Binomial-gated service: a method for effective operation and optimization of polling systems 1989Delay computation and dynamic behavior of non-symmetric polling systems 1986Approximate Delay Analysis and Results for Asymmetric Token-Passing and Polling Networks 1989Polling systems with correlated arrivals

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.