IEEE Transactions on Communications · 1992 · 28 citations · 13 references
BusinessComputer EngineeringComputer ScienceComputer NetworksDigital CommunicationQueuing TheoryBuffer ManagementNetwork ProtocolsQueueing NetworksQueueing SystemsQueueing TheoryQueuing AnalysisAutomatic Repeat RequestBuffer Occupancy DistributionChannelsDynamic Assignment ProblemDynamic Channel AllocationQueue OccupancyRetransmission ProtocolsSelective Repeat Protocol
A communications system in which multiple parallel channels are available to carry traffic from a transmitter to a receiver is considered, and an extension of the selective-repeat automatic repeat request (SR-ARQ) protocol that dynamically assigns packets to channels for each (re)transmission is presented. Because of selective retransmission, packets arrive at the receiver out of order and must be stored in a resequencing buffer. A queuing model for the resequencing buffer is constructed. The generating function of the buffer occupancy and the packet-delay distribution are derived, and procedures for simplifying the computation are presented. The dynamic assignment scheme is compared with, and shown to have performance superior to, a static assignment scheme.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
13
A Proof for the Queuing Formula: <i>L</i> = λ<i>W</i>
John D. C. Little · Operations Research · 1961 · 2.7K citations
H. Burton, D. Sullivan · Proceedings of the IEEE · 1972 · 191 citations