Study of the Impact of Self-Similarity on the Network Node Traffic
AbstractThe article analyses a stochastically bounded the GI/G/m//N circuit switched network model with packet losses, with stochastic input network traffic, stochastic served network node, and deterministic and finite network node buffer capacity. Max-plus algebra instrumentality is used for the network processes analysis. FIFO tail drop or LIFO tail drop buffer is used. We have established that the average waiting time in the queue had increased when the queue service discipline was FIFO as compared with LIFO, while the offered traffic was Poisson and the served in the node traffic was self-similar. The network traffic is served faster in the network node with the buffer queue discipline LIFO, while the offered traffic is Poisson and its intensity exceeds the served in the node traffic 10 times. Ill. 2, bibl. 24 (in English; abstracts in English and Lithuanian).
Authors retain copyright and grant the journal the right of the first publication with the paper simultaneously licensed under the Creative Commons Attribution 4.0 (CC BY 4.0) licence.
Authors are allowed to enter into separate, additional contractual arrangements for the non-exclusive distribution of the paper published in the journal with an acknowledgement of the initial publication in the journal.
Copyright terms are indicated in the Republic of Lithuania Law on Copyright and Related Rights, Articles 4-37.