On the application of Rouché's theorem in queueing theory

From MaRDI portal
Revision as of 03:01, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2494834

DOI10.1016/j.orl.2005.05.012zbMath1091.60027OpenAlexW2123859517MaRDI QIDQ2494834

Erik M. M. Winands, Ivo J. B. F. Adan, Johan S. H. van Leeuwaarden

Publication date: 30 June 2006

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/on-the-application-of-rouches-theorem-in-queueing-theory(e8ff1e0c-7531-472a-a9f2-4ae19313522f).html



Related Items

Discrete-time queues with variable service capacity: a basic model and its analysis, Combined Analysis of Transient Delay Characteristics and Delay Autocorrelation Function in theGeoX/G/1Queue, Impact of class clustering in a multiclass FCFS queue with order-dependent service times, Analysis of a Two-Class Priority Queue with Correlated Arrivals from Another Node, Power series approximations for two-class generalized processor sharing systems, Analysis of a discrete-time queue with general service demands and phase-type service capacities, Spitzer's identity for discrete random walks, HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS, System occupancy in a multiclass batch-service queueing system with limited variable service capacity, Cloud data storage: a queueing model with thresholds, The acquisition queue, On the three-queue priority polling system with threshold service policy, Boundary stabilization of a class of reaction-advection-diffusion systems via a gradient-based optimization approach, A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X}/C\)-\( MSP /1/\infty \)], Singularities of the matrix exponent of a Markov additive process with one-sided jumps, An exact root-free method for the expected queue length for a class of discrete-time queueing systems, USING SINGULARITY ANALYSIS TO APPROXIMATE TRANSIENT CHARACTERISTICS IN QUEUEING SYSTEMS, A STATE-DEPENDENT POLLING MODEL WITH k-LIMITED SERVICE, Robust heavy-traffic approximations for service systems facing overdispersed demand, Discrete-time modified number- and time-limited vacation queues, Service with a queue and a random capacity cart: random processing batches and E-limited policies, Batch Arrival Multiserver Queue with State-Dependent Setup for Energy-Saving Data Center, Novel Heavy-Traffic Regimes for Large-Scale Service Systems, Stationary analysis of certain Markov-modulated reflected random walks in the quarter plane



Cites Work