On the total amount of resources occupied by serviced customers
From MaRDI portal
Publication:505298
DOI10.1134/S0005117916080087zbMath1354.93095OpenAlexW2523023709MaRDI QIDQ505298
K. E. Samuilov, A. K. Samuilov, Valeriĭ A. Naumov
Publication date: 20 January 2017
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117916080087
Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Control/observation systems involving computers (process control, etc.) (93C83) Stochastic systems in control theory (general) (93E03)
Related Items
Analysis of a resource-based queue with the parallel service and renewal arrivals ⋮ Resource queueing system \(M/GI/\infty\) in a random environment ⋮ Using infinite-server resource queue with splitting of requests for modeling two-channel data transmission ⋮ PRODUCT-FORM MARKOVIAN QUEUEING SYSTEMS WITH MULTIPLE RESOURCES ⋮ Analysis of the queuing systems with processor sharing service discipline and random serving rate coefficients ⋮ Resource sharing model with minimum allocation for the performance analysis of network slicing ⋮ On the Total Customers’ Capacity in Multi-server Queues ⋮ Construction of the Stability Indicator of Wireless D2D Connection in a Case of Fractal Random Walk of Devices ⋮ Analysis of networks of the resource queuing systems ⋮ Queueing systems with random volume customers and a sectorized unlimited memory buffer ⋮ Heterogeneous System MMPP/GI(2)/∞ with Random Customers Capacities ⋮ Resource Queueing System with the Requirements Copying at the Second Phase ⋮ Resource Queueing System with Dual Requests and Their Parallel Service
Cites Work
- Unnamed Item
- Unnamed Item
- A new stage in mathematical teletraffic theory
- Loss networks
- Destricted capacity queueing systems: Determination of their characteristics
- Generalized Erlang problem for service systems with finite total capacity
- Generalization of a problem of Erlang
- Analysis of queueing systems for random-length arrivals with limited cumulative volume
