A golden ratio control policy for a multiple-access channel

Alon Itai · Zvi Rosberg

80 citations0/0 files storedIEEE Transactions on Automatic Control

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 Networks and Protocols Age of Information Optimization

Abstract

Considernstations sharing a single communications channel. Each station has a buffer of length one. If the arrival rate of stationiis ri, then1-\Pi_{i}(1- r_{i})is shown to be an upper bound (over all policies) on the throughput of the channel. Moreover, an optimal policy always exists and is stationary and periodic. The throughput of two policies, the random-policy, and the golden-ratio policy, are analyzed for a finite and infinite number of stations. The latter is shown to approach a limit which is within at least 98.4 percent of the upper bound.

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 — 80 citations exist upstream.

References

1972Service in a Loop System

Cited by

1985The design of teletext broadcast cycles 2002Applications of Markov Decision Processes in Communication Networks 1994Optimization of static traffic allocation policies 1992Algorithms for generalized round robin routing 1993Efficient visit orders for polling systems 1995Scheduling policies using marked/phantom slot algorithms 1992Optimal scheduling in some multiqueue single-server systems 2002Optimal admission, routing and service assignment control: the case of single buffer queues

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.