Communication Network Theory

The Throughput of the Stack Algorithm in a Channel with $N$-Conflicts

B. S. Tsybakov, A. Yu. Privalov


Abstract: A stack algorithm with $Q$-ary conflict resolution is considered in an RMA channel with $N$-conflicts. An equation for the throughput of the stack algorithm for given $N$ and $Q$ is derived. The throughputs for various $N$ and $Q$ are calculated numerically. Throughput optimization by $Q$ for a given $N$ is performed.

UDC: 621.394.74-503.5

Received: 28.03.1991

 English version: Problems of Information Transmission, 1992, 28:2, 168–174

Bibliographic databases:

• 
•