We investigate the similarities and differences among three queue rules,the first-in-first-out(FIFO)rule,last-in-firstout(LIFO)rule and random-in-random-out(RIRO)rule,on dynamical networks with limited buffer size.In ...We investigate the similarities and differences among three queue rules,the first-in-first-out(FIFO)rule,last-in-firstout(LIFO)rule and random-in-random-out(RIRO)rule,on dynamical networks with limited buffer size.In our network model,nodes move at each time step.Packets are transmitted by an adaptive routing strategy,combining Euclidean distance and node load by a tunable parameter.Because of this routing strategy,at the initial stage of increasing buffer size,the network density will increase,and the packet loss rate will decrease.Packet loss and traffic congestion occur by these three rules,but nodes keep unblocked and lose no packet in a larger buffer size range on the RIRO rule networks.If packets are lost and traffic congestion occurs,different dynamic characteristics are shown by these three queue rules.Moreover,a phenomenon similar to Braess’paradox is also found by the LIFO rule and the RIRO rule.展开更多
We study a vacation queueing system with a single server simultaneously dealing with an M/G/1 and an M/D/1 queue. Two classes of units, priority and non-priority, arrive at the system in two independent Poisson stream...We study a vacation queueing system with a single server simultaneously dealing with an M/G/1 and an M/D/1 queue. Two classes of units, priority and non-priority, arrive at the system in two independent Poisson streams. Under a non-preemptive priority rule, the server provides a general service to the priority units and a deterministic service to the non-priority units. We further assume that the server may take a vacation of random length just after serving the last priority unit present in the system. We obtain steady state queue size distribution at a random epoch. Corresponding results for some special cases, including the known results of the M/G/1 and the M/D/1 queues, have been derived.展开更多
We study a two stage queuing model where the server provides two stages of service one by one in succession. We consider reneging to occur when the server is unavailable during the system breakdown or vacation periods...We study a two stage queuing model where the server provides two stages of service one by one in succession. We consider reneging to occur when the server is unavailable during the system breakdown or vacation periods. We concentrate on deriving the steady state solutions by using supplementary variable technique and calculate the mean queue length and mean waiting time. Further some special cases are also discussed and numerical examples are presented.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant Nos.71801066 and 71431003)the Fundamental Research Funds for the Central Universities of China(Grant Nos.PA2019GDQT0020 and JZ2017HGTB0186)
文摘We investigate the similarities and differences among three queue rules,the first-in-first-out(FIFO)rule,last-in-firstout(LIFO)rule and random-in-random-out(RIRO)rule,on dynamical networks with limited buffer size.In our network model,nodes move at each time step.Packets are transmitted by an adaptive routing strategy,combining Euclidean distance and node load by a tunable parameter.Because of this routing strategy,at the initial stage of increasing buffer size,the network density will increase,and the packet loss rate will decrease.Packet loss and traffic congestion occur by these three rules,but nodes keep unblocked and lose no packet in a larger buffer size range on the RIRO rule networks.If packets are lost and traffic congestion occurs,different dynamic characteristics are shown by these three queue rules.Moreover,a phenomenon similar to Braess’paradox is also found by the LIFO rule and the RIRO rule.
文摘We study a vacation queueing system with a single server simultaneously dealing with an M/G/1 and an M/D/1 queue. Two classes of units, priority and non-priority, arrive at the system in two independent Poisson streams. Under a non-preemptive priority rule, the server provides a general service to the priority units and a deterministic service to the non-priority units. We further assume that the server may take a vacation of random length just after serving the last priority unit present in the system. We obtain steady state queue size distribution at a random epoch. Corresponding results for some special cases, including the known results of the M/G/1 and the M/D/1 queues, have been derived.
文摘We study a two stage queuing model where the server provides two stages of service one by one in succession. We consider reneging to occur when the server is unavailable during the system breakdown or vacation periods. We concentrate on deriving the steady state solutions by using supplementary variable technique and calculate the mean queue length and mean waiting time. Further some special cases are also discussed and numerical examples are presented.
