# A golden ratio control policy for a multiple-access channel

@article{Itai1984AGR,
title={A golden ratio control policy for a multiple-access channel},
author={Alon Itai and Zvi Rosberg},
journal={IEEE Transactions on Automatic Control},
year={1984},
volume={29},
pages={712-718}
}
• Published 1 August 1984
• Computer Science
• IEEE Transactions on Automatic Control
Consider n stations sharing a single communications channel. Each station has a buffer of length one. If the arrival rate of station i is r i , then 1-\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… Expand
86 Citations

#### Topics from this paper

Packet delay under the golden ratio weighted TDM policy in a multiple-access channel
• Computer Science
• IEEE Trans. Inf. Theory
• 1987
A lower bound to the cost criterion under time division multiplexing (TDM) protocols is given, and the costs of two protocols are analyzed, where the first protocol is the {\em random-control} policy and the second is the golden ratio policy which is shown to achieve a cost close to the lower bound for realistic parameters. Expand
Independent Stations Algorithm for the Maximization of One-Step Throughput in a Multiaccess Channel
• Computer Science
• IEEE Trans. Commun.
• 1987
The approach is based on an independence assumption and yields a scheme which can be termed an independent stations approach (ISA), which is applicable to multiple-access schemes utilizing channel feedback information. Expand
Deterministic Routing to Buffered Channels
• Z. Rosberg
• Engineering, Computer Science
• IEEE Trans. Commun.
• 1986
It is shown that for a variety of system parameters, the golden ratio routing policy has a cost close to the lower bound. Expand
On the Existence of Stationary Team-Optimal Strategies for the Maximization of Average Expected Throughput in a Multiple Access Broadcast Channel
• Mathematics
• 1998
Abstract A multi-access slotted broadcast channel with N users is considered, where the information at the transmitting stations at time t consists of the channel history and the "personal state"Expand
TDM policies in multistation packet radio networks
• Engineering, Computer Science
• IEEE Trans. Commun.
• 1989
A multistation packet radio network with m stations and a finite number of nodes n that uses a conflict-free protocol to access the backbone network of stations through a shared channel is discussed.Expand
Scheduling policies using marked/phantom slot algorithms
• Computer Science
• Queueing Syst. Theory Appl.
• 1995
An approach based on perturbation analysis techniques, where all customer arrival processes can be arbitrary, and no information about them is required is presented, and several numerical results based on a simple optimization algorithm are included. Expand
The Effect of Bandwidth Allocation Policies on Delay in Unidirectional Bus Networks
• Computer Science
• IEEE J. Sel. Areas Commun.
• 1995
It is shown that changing the bus to unidirectional point-to-point links between (very simple) active interfaces at each node allows us to construct distributed access schemes that require no upstream feedback and are both work conserving and fair. Expand
Optimal scheduling in some multiqueue single-server systems
• Computer Science
• 1992
The authors address the problem of optimal scheduling in a multiqueue single-server (MQSS) model by showing that the so-called most customers first (MCF) policy minimizes the vector of the number of customers in each queue whose components are arranged in decreasing order. Expand
Golden ratio scheduling for low delay flow control in computer networks
• Computer Science
• IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age
• 1988
A scheme for flow control based on the golden ratio policy of A. Itai and Z. Rosberg (1984) that requires very few buffers and guarantees low end-to-end delays and is very well suited to an asynchronous time-division multiplexing (ATM) environment. Expand
Optimal scheduling in some multi-queue single-server systems
• Computer Science
• Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration
• 1990
This model has potential applications in videotex and time-division multiple-access systems and minimizes, in the sense of strong stochastic ordering, the vector of the number of customers in each queue whose components are arranged in decreasing order. Expand

#### References

SHOWING 1-9 OF 9 REFERENCES
Decentralized control in packet switched satellite communication
The problem of access control to a packet switched multi-access satellite broadcast channel is considered in the framework of nonclassical control theory and it is shown that randomized decisions will not be necessary. Expand
Optimal decentralized control in a multiaccess channel with partial information
A simple open-loop control policy is shown to be optimal for the long-run average throughput criterion for two transmission stations sharing a single communication channel. Expand
Fixed Assignment Access Technique
In this paper, two implementations of the fixed assignment technique are examined for time sharing either a satellite or terrestrial channel among the users of a data communication system. In fixedExpand
Decentralized control in packet switched satellite communication
• Computer Science
• 1979
The model introduced by Schoute is analyzed using a minimum principle for decentralized stochastic control for certain values of the input message rates p and number N of transmitting stations and the true optimal control is shown to be open loop for N = 2. Expand
Sufficient statistics in the optimum control of stochastic systems
The search for a sufficient statistic is primarily a problem of data reduction. When a great deal of data is available, it must somehow be summarized in such a way that no valuable information isExpand
Service in a Loop System
• Computer Science
• JACM
• 1972
Two related measures of the grade of service are considered: the average queue length and the average v i r tua l wai t ing t ime at each s ta t ion. Expand
Performance Issues in Back-End Storage Networks
• Computer Science
• Computer
• 1980
A back-end storage network allows heterogeneous mainframes and devices to share resources, unhampered by hardware compatibility requirements. This flexibility has implications for the network'sExpand
SeMce in a loop system
• 1973