On the stability of interacting queues in a multiple-access system
Ramesh R. Rao,Anthony Ephremides +1 more
Reads0
Chats0
TLDR
It is shown that the stability region for the case of two terminals can be obtained in a simple way and lower (inner) bounds are obtained for the Stability region of the system with an arbitrary finite number of terminals that are tighter than the ones already known.Abstract:
The standard discrete-time slotted ALOHA system with a finite number of buffered terminals is considered. The stability (ergodicity) region for this system is known only for the case of two terminals and for the case of any number of symmetric terminals. The stability of the system is studied by means of a simple concept of dominance. It is shown that the stability region for the case of two terminals can be obtained in a simple way. Lower (inner) bounds are obtained for the stability region of the system with an arbitrary finite number of terminals that are tighter than the ones already known. A similarity between these stability results and the achievable region of the no-feedback collision channel is pointed out that suggests a connection between the two problems. >read more
Citations
More filters
Book
Control Techniques for Complex Networks
TL;DR: The workload model that is the basis of traditional analysis of the single queue becomes a foundation for workload relaxations used in the treatment of complex networks and Lyapunov functions and dynamic programming equations lead to the celebrated MaxWeight policy.
Journal ArticleDOI
Information theory and communication networks: an unconsummated union
Anthony Ephremides,Bruce Hajek +1 more
TL;DR: Several topics that are related to communication networks and that have an information-theoretic flavor are reviewed, including multiaccess protocols, timing channels, effective bandwidth of bursty data sources, deterministic constraints on datastreams, queuing theory, and switching networks.
Journal ArticleDOI
Stable Throughput of Cognitive Radios With and Without Relaying Capability
TL;DR: A scenario with two single-user links, one licensed to use the spectral resource (primary) and one unlicensed (secondary or cognitive), is considered and benefits of relaying strongly depend on the topology of the network.
Journal ArticleDOI
Stability and delay of finite-user slotted ALOHA with multipacket reception
TL;DR: The effect of multipacket reception (MPR) on stability and delay of slotted ALOHA based random-access systems is considered and it is shown that in certain capture scenarios, AlOHA with transmission probability one is delay optimal for all stable arrival rates.
Journal ArticleDOI
Cognitive multiple access via cooperation: Protocol design and performance analysis
TL;DR: The analysis reveals that the throughput region of the proposed cognitive multiple-access strategy is a subset of its maximum stable throughput region, which is different from random access, where both regions are conjectured to be identical.
References
More filters
Proceedings ArticleDOI
THE ALOHA SYSTEM: another alternative for computer communications
TL;DR: A remote-access computer system under development as part of a research program to investigate the use of radio communications for computer-computer and console-computer links and a novel form of random-access radio communications developed for use within THE ALOHA SYSTEM is described.
Journal ArticleDOI
The stability of a queue with non-independent inter-arrival and service times
TL;DR: In this paper, the authors introduced the concept of subcritical and supercritical queues for series of queues in series and showed that a queue in series is subcritical if E(S 0 − To) > 0, and a queue is supercritical when E(T 0 − T 0) < 0.
The ALOHA System-Another Alternative for Computer Communications
TL;DR: The ALOHA system as discussed by the authors was developed as part of a research program to investigate the use of radio communications for computer-computer and console-computer links and discussed some advantages of radio communication over conventional wire communications for interactive users of a large computer system.
Journal ArticleDOI
The collision channel without feedback
J. Massey,Peter Mathys +1 more
TL;DR: Maximum-erasure burst-correcting codes over an alphabet of arbitrary size are constructed and shown to suffice for reconstructing the packets lost in "collisions" when these protocol sequences are used.
Journal ArticleDOI
Two coupled processors: The reduction to a Riemann-Hilbert problem
TL;DR: In this article, a particular problem is addressed but results lead to a computationally reasonable solution which applies to very general two dimensional random walks, where the unknown functions are the generating functions for a stationary distribution of the studied process.