Results 251 to 260 of about 588,874 (281)
Some of the next articles are maybe not open access.
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
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 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 +2 more sources
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 +3 more sources
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
Some distributional approximations in Markovian queueing networks
Advances in Applied Probability, 1982We consider single-class Markovian queueing networks with state-dependent service rates (the immigration processes of Whittle (1968)). The distance of customer flows from Poisson processes is estimated in both the open and closed cases. The bounds on distances lead to simple criteria for good Poisson approximations.
Brown, TC, Pollett, PK
openaire +5 more sources
European Journal of Operational Research, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reinaldo Morabito +2 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reinaldo Morabito +2 more
openaire +3 more sources
Delay bounds for approximate maximum weight matching algorithms for input queued switches
Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2003Input Queued (IQ) switch architecture has been of interest due to its low memory bandwidth requirement. A scheduling algorithm is required to schedule the transfer of packets through cross-bar switch fabric at every time slot. The performance, that is throughput and delay, of a switch depends on the scheduling algorithm.
Devavrat Shah, Milind Kopikare
openaire +2 more sources
Performance Evaluation, 1990
Abstract In this paper we develop very accurate approximations for all mean performance measures of interest, for a class of cyclic queuing networks (CQNs). The number of nodes K, and the closed chain population N, are finite but arbitrary. Each node processes type t customers from the single closed chain, and type o customers from a dedicated open ...
Joseph S. Kaufman, Wing Shing Wong
openaire +1 more source
Abstract In this paper we develop very accurate approximations for all mean performance measures of interest, for a class of cyclic queuing networks (CQNs). The number of nodes K, and the closed chain population N, are finite but arbitrary. Each node processes type t customers from the single closed chain, and type o customers from a dedicated open ...
Joseph S. Kaufman, Wing Shing Wong
openaire +1 more source
2014 IEEE International Conference on Automation Science and Engineering (CASE), 2014
In this paper, we develop a mix integer programming model for daily personnel scheduling for emergency departments with non-stationary patient arrival over time. The goal is to minimize the total expected waiting time which is estimated by a combination of steady-state analysis of M/M/s queues and inventory-like flow balance equations.
Qiang Liu +2 more
openaire +2 more sources
In this paper, we develop a mix integer programming model for daily personnel scheduling for emergency departments with non-stationary patient arrival over time. The goal is to minimize the total expected waiting time which is estimated by a combination of steady-state analysis of M/M/s queues and inventory-like flow balance equations.
Qiang Liu +2 more
openaire +2 more sources