Models for determination of total capacity in computer and communicating systems

MaRDI QIDQ3569850zbMATH OpenFDO

Authors Oleg M. Tikhonenko

Publication date 22 June 2010

zbMATH Keywords

queueing theoryrandom volume

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18)

Recommendations

• Generalized Erlang problem for service systems with finite total capacity
• On the total customers' capacity in multi-server queues
• scientific article; zbMATH DE number 4143213
• scientific article; zbMATH DE number 218388
• A solvable model for a finite-capacity queueing system

Cited in

(7)

• Generalized Erlang problem for service systems with finite total capacity
• Mathematical simulation of the capacity of the infrastructure of complex systems
• Computation of capacity
• On the efficiency and capacity of computers
• An infinite-server queueing \(MMAP_k|G_k|\infty\) model in semi-Markov random environment subject to catastrophes
• The aggregate capacity of virtual resources – linear models
• Models of central capacity and concurrency

This page was built for publication: Models for determination of total capacity in computer and communicating systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569850)