Minimization of packet loss probability in network with fractal traffic

Abstract

Methods for radical reduction of packet loss probability in telecommunication networks with fractal traffic are developed. We investigate ways of preventing the losses within the framework of queueing theory; relevant simulation experiments are carried out. It is determined that strategy for the channel number increase in the network nodes has principally higher efficiency than that for the buffer increasing and/or channel performance increasing. Approximation methods for loss probability in the nodes of multiserver queueing system without buffers are investigated. The paper offers to approximate the loss probability in the node with n channels by steady-state probability in the state n of relating infinite-server queueing systems. We develop an analytical-statistical technique of optimal channel distribution over the nodes in networks with fractal traffic which is based on such approximation. The example of the method application is provided. The developed method could be used by engineers designing the telecommunication networks.