Hello everyone.....I am doing my final project. I have found many problem in my project. My final project about m/m/n queueing model in LAN network. I have read book about this, all books said that packet arrival was poisson. My said to me "How did you prove that packets arrival was poisson".. But I couldn't prove it. So, I was confuse. would you help????
......Thank you so much.....
replied to: sinichi
Replied to: Hello everyone.....I am doing my final project. I have found many...
M/M/n queues are based on the assumption of memoryless property for both service times and arrivals (e.g. Memoryless/Memoryless). Poisson is one of the distributions that has this property. This is well-known and is not something you should prove... In my opinion, if you really want to prove it, prove that the the queues with Poisson arrivals and exponential service times have memoryless property (e.g. Memoryless/Memoryless).
Hope it is not too late...
