Results 231 to 240 of about 1,460 (284)
Queuing system evolution in a diffusion approximation scheme
Cybernetics and Systems Analysis, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mamonova, A. V., Griza, Lu. F.
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Accuracy of the Diffusion Approximation for Some Queuing Systems
IBM Journal of Research and Development, 1974This paper presents the resulotsf a rather extensive study of the accuracy of the diffusion approximation technique as applied to queuing models. The motivef or using the diffusion process approximation here is to develope realistic analytical models of computing systems by considering service time distributions of a general form.
Reiser, M., Kobayashi, H.
exaly +2 more sources
TLM modelling of the diffusion approximation of queuing system
International Journal of Numerical Modelling: Electronic Networks, Devices and Fields, 2001Summary: This paper provides an application of the TLM method to any queuing systems that can be approximated as a diffusion process. The TLM node has been extended in order to take into account the variables associated with the diffusion approximation of the queue, which is presented in Harrison, Patel, Performance Modelling of Communication Networks ...
Witwit, M., Ball, F.
exaly +3 more sources
Queuing Systems with Semi-Markov Flow in Average and Diffusion Approximation Schemes
Methodology and Computing in Applied Probability, 2008A semi-Markov \((SM/M/1/\infty)\) flow including the Markov and the renewal flows as particular cases are studied. By means of using an asymptotic average and a diffusion approximation of the fluctuations for these systems, some quantitative results are obtained. Among others, the fluctuation of the counting process for these systems are derived.
Nikolaos Limnios
exaly +2 more sources
Approximate Analysis of General Queuing Networks by Decomposition
IRE Transactions on Communications Systems, 1979In this paper an approximate method for the analysis of general queuing networks is proposed. The queuing network is of the open network type, having N single server queuing stations with arbitrary interconnections. Customers may enter the network at any queuing station. The interarrival times of the exogenous arrival processes and the service times at
exaly +2 more sources
Discrete approximation ofM/D/s/N queuing models
Electronics and Communications in Japan, 1999In future high-speed communication, it is anticipated that cases dealing with fixed-length data will increase. Therefore, a traffic analysis for constant-service-time models is needed. In this paper, a multiserver queuing model M/D/s/N for finite capacity in the system and constant service time is treated.
Takuya Morimoto
exaly +2 more sources
Diffusion approximation of queuing networks of open type
Ukrainian Mathematical Journal, 1989The open Jackson queueing network with ...
Lebedev, E. A., Chechel'nitskij, A. A.
exaly +4 more sources
An approximation method for general closed queuing networks with Fork/Join mechanisms
Journal of the Operational Research Society, 2000 International audienceQueuing networks with Fork/Join mechanisms are encountered in modelling and analysis of parallel computer systems and computer/communication networks. Exact analytical solutions of such networks are not available. In particular, due
Dallery, Yves, Baynat, Bruno
exaly +2 more sources
The Probabilistic Measures Approximation of a Resource Queuing System with Signals
2021Modern wireless networks are characterized by high user mobility. This factor can lead to changes in the quality of the channel during the lifetime of the interaction session. To take into account the fact of user movement in a resource queuing system with signals are introduced. Signal arrivals trigger resource reallocation of customers in the system.
Kirill A. Ageev +3 more
openaire +2 more sources