A queueing model with feedback applied to a communication problem with interference-caused retransmissions

Download
Author
Lüneburg, Jörg Wilhelm
Date
1972-09Advisor
Milch, Paul R.
Metadata
Show full item recordAbstract
A queueing model with feedback is proposed as a mathematical representation of a communication system with interference-caused retransmissions. A satellite receives messages of constant length from ground stations. New messages arrive in a Poisson pattern with constant rate. A finite number of channels is available for transmission and channel selection is random among all channels. All messages with overlapping transmission times on the same channel have to be retransmitted. The arrival rate of messages is a composition of the constant
arrival rate of the basic Poisson process and the arrival rate of the feedback from retransmissions. The arrival rate is approximated in discrete time steps. A necessary and sufficient condition for a finite limiting point of the resulting sequence of arrival rates is derived. Numerical results for finite limiting points, rate of convergence, and expected number of transmissions have been computed. Examples for sequences of arrival rates have been tabulated.
Rights
Copyright is reserved by the copyright ownerCollections
Related items
Showing items related by title, author, creator and subject.
-
Congestion in a system of N service centers with interference.
Lee, Kheng Nam (Monterey, California. Naval Postgraduate School, 1974-09);We have a system of N sendox machines (service centers) which can transmit or receive (but not simultaneously) photocopies to and from each other. The stochastic process {X(M)(t),t ≥ 0}, where X(M)(t) is the number of ... -
Gaussian approximations to service problems : a communication system example
Gaver, Donald Paul; Lehoczky, John P. (Monterey, California. Naval Postgraduate School, 1975-06); NPS55Gv75061Messages arrive at a group of service channels in accordance with a time-dependent Poisson process. An arrival either (1) immediately begins k-stage Markovian service if an empty channel is reached, or (2) balks and enters ... -
Reduction in bandwidth by using variable length codes
Akinsel, Serdar (1985-12);A method of coding an ensemble of messages of a finite number of symbols is developed. Minimizing the average number of coding digits per message by using Huffman coding can result in a large variance. This is a problem ...