BATCH ARRIVAL FLOW GENERATION ALGORITHMS

Abstract

The article observes algorithmic methods for a nalyzing ofqueuing systems. Software implementation is always preceded by the development of some algorithmic model of an object or process. The arsenal of algorithms combines both continuous and discrete logical functions, significantly expanding possibilities of algorithmic methods compared to analytical ones. Packet flows in multiservice telecommunication networks have a clearly expressed burst character and differ from Poisson flows significantly. The entire coherent analytic theory, which is valid for Poisson flows, unfortunately becomes unsuitable for burst flows. Real results for queuing systems with bursty flows may be obtained using simulation modeling, which requires knowledge and skills in algorithmizing of simulated processes. A software tool – a converter – is considered and examples of generating burst streams with various burst structures are presented. An analysis of algorithmic models of queuing systems for various service disciplines was conducted. The need for further development of the algorithmic theory of queuing systems is emphasized.