The paper considers the modeling of networks of queues. Nodes in the network are modeled as memoryless queues. The focus is on open networks, since external packet arrivals and packet departures are permitted. Memoryless queues are characterized by a Poisson packet arrival process. This means that the interarrival times are exponentially distributed. The service times are characterized by an exponential distribution as well. Systems of queues could be used to model communication networks. Namely, after leaving one node in the network, there is a certain probability that a packet proceeds to another node in the network. Note that the external packet arrivals are also generated according to a Poisson process. In addition, there is a non-zero probability for the packets to leave the network. The network performance is illustrated by numerical examples.
FETA, A.,
&
STEFANOV, A.,
(2021). MODELING NETWORKS OF QUEUES. International Journal of Technical and Natural Sciences, 2(1), 70-75. Arrival Date Posted By:https://ijtns.ibupress.com/articles/modeling-networks-of-queues
