Results 241 to 250 of about 588,874 (281)

Approximate Transient Analysis of Some Queuing Systems

Operations Research, 1978
We propose approximations for the time-dependent queue size distribution Pn(t) and the mean queue size E[X(t)] of an M/M/1 queue. With a Laplace transform-generating function technique, the exact analysis involves the complex root u* inside the unit circle of a certain quadratic.
openaire   +3 more sources

Hierarchical fair queuing: single-step approximation of hierarchical-GPS

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE, 2003
We propose a hierarchical packet scheduling technique to closely approximate a hierarchical extension of the generalized processor sharing model, hierarchical generalized processor sharing (H-GPS). Our approach is to undertake the tasks of service guarantee and hierarchical link sharing in an independent manner so that each task best serves its own ...
Andrew Do-Sung Jun, Jinwoo Choe, Alberto Leon-Garcia   +2 more
openaire   +2 more sources

Approximate Analysis of the Queuing System with Heterogeneous Servers and N-Policy

2020
In this paper, we propose an approximate method to investigate the Markovian queuing system with two separate pools of heterogeneous servers (HS) under N-policy. It is assumed that fast servers (F-servers) remain awake all the time while slow servers (S-servers) will go to sleep independently when number of calls in the buffer less than some threshold.
Agassi Z. Melikov, Sevinc H. Aliyeva, Mammed O. Shahmaliyev   +2 more
openaire   +1 more source

Bounds and Approximations in Queuing through Monotonicity and Continuity

Operations Research, 1977
This paper is a survey of recent research on the monotonicity and continuity of queuing systems and their application to obtain bounds and approximations.
openaire   +1 more source

Discrete approximation of M/D/s/N queuing models

Electronics and Communications in Japan (Part I: Communications), 1999
In 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, Yutaka Yoshida
openaire   +1 more source

Nonlinear Diffusion Approximations of Queuing Networks

2001
The aim of this paper is to sketch two examples of simple queuing networks that possess nonlinear diffusion approximations. These approximations are obtained by considering hydrodynamic limits for the corresponding interacting particle systems obeying various exclusion rules. Asymptotic analysis of the approximating nonlinear pdes is also provided.
B. Margolius, W. A. Woyczyñski
openaire   +1 more source

Approximate Transient Analysis of Queuing Networks by Quasi Product Forms

2013
In this paper we deal with transient analysis of networks of queues. These systems most often have enormous state space and the exact computation of their transient behavior is not possible. We propose to apply an approximate technique based on assumptions on the structure of the transient probabilities.
ANGIUS, ALESSIO, HORVATH, Andras, Verena Wolf   +2 more
openaire   +3 more sources

Approximate queuing analysis for IEEE 802.15.4 sensor network

2010 Second International Conference on Ubiquitous and Future Networks (ICUFN), 2010
Wireless sensor networks (WSNs) have attracted much attention in recent years for their unique characteristics and wide use in many different applications. Especially, in military networks, all sensor motes are deployed randomly and densely. How can we optimize the number of deployed nodes (sensor node and sink) with a QoS guarantee (minimal end-to-end
null Nam Tuan Le, null Sun Woong Choi, null Yeong Min Jang   +2 more
openaire   +1 more source

Application of the diffusion approximation to queuing networks

Proceeding of the 1973 ACM SIGME symposium on - SIGME '73, 1973
The practical value of queuing theory in engineering application such as in computer modeling has been limited, since the interest in mathematical tractability has almost always led to an oversimplified model. The diffusion process approximation is an attempt to break away from the vogue in queuing theory.The present paper introduces a vector-valued ...
openaire   +2 more sources

Approximate Solution of Multiclass Queuing Networks with Region Constraints

2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2007
Among existing modeling techniques, queueing networks with "finite capacity regions" have largely proven to be effective in characterizing push-back effects and simultaneous resource possession in which a request holds more resources simultaneously. Queueing network models with finite capacity regions impose upper bounds on the number of jobs that can ...
Anselmi, Jonatha, Casale, Giuliano, Cremonesi, Paolo   +2 more
openaire   +2 more sources