By Topic

On the Large Deviations of Resequencing Queue Size: 2-M/M/1 Case

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xia, Y. ; Dept. of Comput. & Inf. Sci. & Eng., Florida Univ., Gainesville, FL ; Tse, D.N.C.

In data communication networks, packets that arrive at the receiving host may be disordered for reasons such as retransmission of dropped packets or multipath routing. Reliable protocols such as the Transmission Control Protocol (TCP) require packets to be accepted, i.e., delivered to the receiving application, in the order they are transmitted at the sender. In order to do so, the receiver's transport layer is responsible for temporarily buffering out-of-order packets and resequencing them as more packets arrive. In this paper, we analyze a model where the disordering is caused by multipath routing. Packets are generated according to a Poisson process. Then, they arrive at a disordering network (DN) modeled by two parallel M/M/l queues, and are routed to each of the queues according to an independent Bernoulli process. A resequencing buffer follows the DN. In such a model, the packet resequencing delay is known. However, the size of the resequencing queue (RSQ) is unknown. We derive the probability for the large deviations of the queue size.

Published in:

Information Theory, IEEE Transactions on  (Volume:54 ,  Issue: 9 )