Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Matrix algorithm for Polling models with PH distribution
Authors: Mişcoi Gheorghe, Udo R. Krieger, Diana Bejenari
– 0.12 Mb
Abstract
Polling systems provide performance evaluation criteria for a variety of demand-based, multiple-access schemes in computer and communication systems [1]. For studying this systems it is necessary to find their important characteristics. One of the important characteristics of these systems is the $k$-busy period [2]. In [3] it is showed that analytical results for $k$-busy period can be viewed as the generalization of classical Kendall functional equation [4]. A matrix algorithm for solving the gene-\\ralization of classical Kendall functional equation is proposed. Some examples and numerical results are presented.E-mail: , ,
Fulltext
– 0.12 Mb
Contents
- Instability of solutions for nonlinear functional differential equations of fifth order with n-deviating arguments
- The stochastic optimal growth problem
- Conjugate sets of loops and quasigroups. DC-quasigroups
- Center problem for cubic systems with a bundle of two invariant straight lines and one invariant conic
- On cyclically-interval edge colorings of trees
- Post-optimal analysis of investment problem with Wald's ordered maximin criteria
- Matrix algorithm for Polling models with PH distribution
- On asymptotic representation of singular solutions of the model elliptic equation near boundary and formulation of singular
- Moment analysis of the telegraph random process
