The Simplest Models of Queue Control at Nodes of Packet-Switched Networks

摘要

Queueing systems simulating the operation of nodes of packet data transmission networks using probabilistic algorithms of packet dropping -namely, a single-channel system with a finite buffer and a multichannel system with an unlimited queue-are considered. An input flow is simulated with the use of a generalized Poisson process. The service time is exponentially distributed. An algorithm for finding the stationary distribution of the number of customers and the stationary characteristics of the system (the mean queue length, the mean time of waiting in a queue, the probability of customer service) is proposed. The obtained results are verified with the help of simulation models developed with the help of GPSS World tools.