1$ queues

Current License: CC BY-SA 3.0

7 events

when toggle format	what		by	license	comment
May 21, 2014 at 2:31	vote	accept	hengxin
May 5, 2014 at 14:14	comment	added	hengxin		After a 2-week learning of basic queue theory, I tend to think that your approach to the original model is not feasible in the new one since the PASTA property talks about arrival times instead of served times. What do you think? In addition, if we are keeping to the original model (i.e., `if there is some customer in service, no more customers can enter it`), how to solve the third problem (i.e., What is the probability that there are exactly $k$ customers in $c^{\prec}$ each of which finishes during the service interval of $c′$)? Any suggestions? Thanks.
Apr 24, 2014 at 14:32	comment	added	hengxin		Unfortunately, I realized that the queueing model I gave two days ago was a little misleading: The requirement `if there is some customer in service, no more customers can enter it` is not what I really want, and I have modified it to that `the customer joins the queue if the server is busy`. I am trying to figure out whether your approach is still feasible. In addition, a third problem is added. Thanks for your efforts.
Apr 20, 2014 at 14:51	comment	added	hengxin		Thanks. According to your suggestion, I have provided a link (and some explanations on the differences) to that question in math.stackexchange in the comment to this post. I have to spend some time (one day or two) understanding your answer before making any comments or accepting it. Thanks again.
Apr 20, 2014 at 14:41	review	First posts
Apr 20, 2014 at 14:44
Apr 20, 2014 at 14:25	comment	added	user137846		@Hengxin : The question appears in math.stackexchange as well. Please provide a link to that question. I did not post this under the question because I do not have sufficient reputation points.
Apr 20, 2014 at 14:23	history	answered	user137846	CC BY-SA 3.0