Queues, stores, and tableaux

Details Queues, stores, and tableaux Queues, stores, and tableaux

2007-07-27

arxiv.org/abs/0707.4104v1

Journal of Applied Probability 42, 4 (2005) 1145-1167

Computer Science

Discrete Mathematics

Conference version of the paper: "Joint Burke's theorem and RSK representation for a queue and a store" (with M. Draief and N.

Scientific paper

Consider the single server queue with an infinite buffer and a FIFO discipline, either of type M/M/1 or Geom/Geom/1. Denote by A the arrival process and by s the services. Assume the stability condition to be satisfied. Denote by D the departure process in equilibrium and by r the time spent by the customers at the very back of the queue. We prove that (D,r) has the same law as (A,s) which is an extension of the classical Burke Theorem. In fact, r can be viewed as the departures from a dual storage model. This duality between the two models also appears when studying the transient behavior of a tandem by means of the RSK algorithm: the first and last row of the resulting semi-standard Young tableau are respectively the last instant of departure in the queue and the total number of departures in the store.

Affiliated with

Also associated with

No associations

Rating

Queues, stores, and tableaux does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Queues, stores, and tableaux, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Queues, stores, and tableaux will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-271816