About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IEEE Journal on Selected Areas in Communications
Paper
Discrete-Time Priority Queues with Partial Interference
Abstract
A class of discrete-time priority queueing systems with partial interference is considered. In these systems, N nodes share a common channel to transmit their packets. One node uses a random access scheme, while other nodes access the channel according to preassigned priorities. Packet arrivals are modeled as discrete-time batch processes, and packets are forwarded through the network according to fixed prescribed probabilities. Steady-state analysis of the class of systems under consideration is provided. In particular, we present a recursive method for the derivation of the joint generating function of the queue lengths distribution at the nodes in steady state. The condition for steady state is also derived. A simple example’ demonstrates the general analysis and provides some insights into the behavior of systems with partial interference such as multihop packet radio systems. Copyright © 1987 by The Institute of Electrical and Electronics Engineers, Inc.