A queuing system SN With N servers and a Poisson inputflow of messages of intensity λN is considered. At its arrival amessage is split into m packets and each packet is send to a randomlyselected server where it joins a FCFS queue. The service time of apacket is distributed exponentially with mean 1. We investigate thequeue length distribution as N→∞
展开▼
机译:具有N个服务器和Poisson输入的排队系统S N sub>
考虑强度为λN的消息流。在它的到来
消息被分成m个数据包,每个数据包被随机发送
加入FCFS队列的选定服务器。一个的服务时间
数据包以均值1指数分布。我们调查
队列长度分布为N→∞
展开▼