Results 251 to 260 of about 1,460 (284)
Some of the next articles are maybe not open access.
Approximate Analysis of the Queuing System with Heterogeneous Servers and N-Policy
2020In 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 +2 more
openaire +1 more source
Approximate Transient Analysis of Queuing Networks by Quasi Product Forms
2013In 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.
Alessio Angius +2 more
openaire +1 more source
Approximate queuing analysis for IEEE 802.15.4 sensor network
2010 Second International Conference on Ubiquitous and Future Networks (ICUFN), 2010Wireless 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 +2 more
openaire +1 more source
Application of the diffusion approximation to queuing networks
Proceeding of the 1973 ACM SIGME symposium on - SIGME '73, 1973The 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 +1 more source
Approximate Solution of Multiclass Queuing Networks with Region Constraints
2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2007Among 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 +2 more
openaire +1 more source
Approximate analysis of general open queuing networks with restricted capacity
Performance Evaluation, 1990Abstract We consider an open queuing network having general service time distributions. The total number of customers simultaneously present in the network connot exceed a given value, called the capacity of the network. Customers arriving while the network is full are forced to wait in an external queue.
openaire +1 more source
AFCD: An Approximated-Fair and Controlled-Delay Queuing for High Speed Networks
2013 22nd International Conference on Computer Communication and Networks (ICCCN), 2013High speed networks have characteristics of high bandwidth, long queuing delay, and high burstiness which make it difficult to address issues such as fairness, low queuing delay and high link utilization. Current high speed networks carry heterogeneous TCP flows which makes it even more challenging to address these issues.
Lin Xue +5 more
openaire +1 more source
Approximate mean value analysis algorithms for queuing networks
Journal of the ACM, 1990This paper is concerned with the properties of nonlinear equations associated with the Scheweitzer-Bard (S-B) approximate mean value analysis (MVA) heuristic for closed product-form queuing networks. Three forms of nonlinear S-B approximate MVA equations in multiclass networks are distinguished: Schweitzer, minimal, and the nearly decoupled forms.
Krishna R. Pattipati +2 more
openaire +1 more source
An Approximation Algorithm for a Queuing Model with Bursty Heterogeneous Input Processes
2004We show a discrete-time queuing model to represent a single server queue with constant service rate and N bursty different input processes. The arrival process is modeled by an Interrupted Bernoulli Process. We propose an approximation algorithm to solve this queuing system.
Sugwon Hong +4 more
openaire +1 more source
Multivariate rational approximants for multiclass closed queuing networks
IEEE Transactions on Computers, 2001Closed Markovian networks of queues with multiclass customers and having a product form equilibrium state probability distribution are useful in the performance evaluation and design of computer and telecommunication systems. Therefore, the efficient computation of the normalizing function, the key element of the solution in product form, has attracted
Cuyt, A., Lenin, R.B.
openaire +2 more sources