Joint Burke's Theorem and RSK Representation for a Queue and a Store
Authors: Moez Draief 1; Jean Mairesse 1; Neil O'Connell 2
NULL##NULL##NULL
Moez Draief;Jean Mairesse;Neil O'Connell
1 Laboratoire d'informatique Algorithmique : Fondements et Applications
2 Warwick Mathematics Institute
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 $\mathcal{A}$ the arrival process and by $s$ the services. Assume the stability condition to be satisfied. Denote by $\mathcal{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 $(\mathcal{D},r)$ has the same law as $(\mathcal{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.
Liu, Chibiao; Qiu, Jinming, 2016, Performance Study Of 802.11W For Preventing DoS Attacks On Wireless Local Area Networks, Wireless Personal Communications, 95, 2, pp. 1031-1053, 10.1007/s11277-016-3812-9.
Okhovvat, Morteza; Sharifi, Mohsen; Momeni, Hossein, 2011, Task Allocation To Actors In Wireless Sensor Actor Networks: An Energy And Time Aware Technique, Procedia Computer Science, 3, pp. 484-490, 10.1016/j.procs.2010.12.082.