On the public citation graph

Queueing Theory

https://doi.org/10.1515/9783110936025
0 signed · 43 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.1651892openalex-extracted
A Queueing Theory Description of Fat-Tailed Price Returns in Imperfect Financial Markets
inferred← citeshttps://doi.org/10.2139/ssrn.2368952openalex-extracted
Managing Long Queues in Seasonal Sales Shopping
inferred← citeshttps://doi.org/10.1002/sim.7013openalex-snapshot
Measuring concurrency using a joint multistate and point process model for retrospective sexual history data
inferred← citeshttps://doi.org/10.1007/978-3-030-36614-8_33openalex-snapshot
Queue with Retrial Group for Modeling Best Effort Traffic with Minimum Bit Rate Guarantee Transmission Under Network Slicing
inferred← citeshttps://doi.org/10.1007/978-3-030-72247-0_20openalex-snapshot
Methods for Analyzing Slicing Technology in 5G Wireless Network Described as Queueing System with Unlimited Buffer and Retrial Group
inferred← citeshttps://doi.org/10.1007/978-3-030-97110-6_3openalex-snapshot
Analysis of Non-preemptive Scheduling for 5G Network Model Within Slicing Framework
inferred← citeshttps://doi.org/10.1007/978-3-031-26655-3_32openalex-snapshot
Detection of Edges in Transport Networks Which are Critical for Public Service Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-61835-2_7openalex-snapshot
Application of Queueing Theory to Investigation of HaProxy Load Balancer Performance Characteristics
inferred← citeshttps://doi.org/10.1007/978-3-319-51917-3_31openalex-snapshot
Stationary Waiting Time Distribution in G|M|n|r with Random Renovation Policy
inferred← citeshttps://doi.org/10.1007/978-3-319-68069-9_13openalex-snapshot
Combination of Queueing Systems of Different Types with Common Buffer: A Theoretical Treatment
inferred← citeshttps://doi.org/10.1007/978-3-642-23795-9_20openalex-snapshot
A Two-Priority Queueing System with Trunk Reservation, Infinite Capacity Buffers for Customers of Both Priorities, and Different Service Intensities for High-Priority and Non-priority Customers
inferred← citeshttps://doi.org/10.1007/978-3-642-35980-4_1openalex-snapshot
Analysis of Queueing System with Constant Service Time for SIP Server Hop-by-Hop Overload Control
inferred← citeshttps://doi.org/10.1007/978-3-642-40316-3_34openalex-snapshot
Queuing Model for SIP Server Hysteretic Overload Control with Bursty Traffic
inferred← citeshttps://doi.org/10.1007/s10958-013-1630-0openalex-snapshot
Simulation and Analysis of a Bank’s Multi-Server Queueing System
inferred← citeshttps://doi.org/10.1007/s12652-022-03903-zopenalex-snapshot
Analysis of a priority queueing system with the enhanced fairness of servers scheduling
inferred← citeshttps://doi.org/10.1016/j.apm.2009.03.013openalex-snapshot
On the BMAP/G/1 G-queues with second optional service and multiple vacations
inferred← citeshttps://doi.org/10.1016/j.apm.2010.09.031openalex-snapshot
Performance analysis of MAP/G/1 queue with working vacations and vacation interruption
inferred← citeshttps://doi.org/10.1016/j.cor.2016.01.005openalex-snapshot
The impact of a global FCFS service discipline in a two-class queue with dedicated servers
inferred← citeshttps://doi.org/10.1016/j.trpro.2022.02.033openalex-snapshot
Properties of a Markov model representing the dynamics of mode choice adaptation to radical supply changes
inferred← citeshttps://doi.org/10.1109/icectech.2011.5942072openalex-snapshot
Analysis of a single server batch Markovian arrival process with feedback
inferred← citeshttps://doi.org/10.1109/icumt.2012.6459680openalex-snapshot
On analytical model for optimal SIP server hop-by-hop overload control
inferred← citeshttps://doi.org/10.1109/synchroinfo.2019.8813973openalex-snapshot
Interpretation of Intelligent Transport Systems Data in Moscow for Bernoulli Approximation of Deterministic-Stochastic Model
inferred← citeshttps://doi.org/10.1134/s0005117911120058openalex-snapshot
On temporal characteristics in an exponential queueing system with negative claims and a bunker for ousted claims
inferred← citeshttps://doi.org/10.1134/s1064226912120054openalex-snapshot
The stationary distribution of the waiting time in a queueing system with negative customers and a bunker for superseded customers in the case of the LAST-LIFO-LIFO discipline
inferred← citeshttps://doi.org/10.1134/s1064226913120152openalex-snapshot
Stationary characteristics of M 2|G|1|r system with hysteretic policy for arrival rate control
inferred← citeshttps://doi.org/10.1134/s1064230718060035openalex-snapshot
Controllable Markov Jump Processes. I. Optimum Filtering Based on Complex Observations
inferred← citeshttps://doi.org/10.1140/epjb/e2010-00248-5openalex-snapshot
A queueing theory description of fat-tailed price returns in imperfect financial markets
inferred← citeshttps://doi.org/10.1142/s0217595914500298openalex-snapshot
ANALYSIS OF FINITE CAPACITY QUEUE WITH NEGATIVE CUSTOMERS AND BUNKER FOR OUSTED CUSTOMERS USING CHEBYSHEV AND GEGENBAUER POLYNOMIALS
inferred← citeshttps://doi.org/10.1214/10-aap738openalex-snapshot
Asymptotic approximations for stationary distributions of many-server queues with abandonment
inferred← citeshttps://doi.org/10.1287/trsc.2014.0550openalex-snapshot
A Computationally Efficient Simulation-Based Optimization Algorithm for Large-Scale Urban Transportation Problems
inferred← citeshttps://doi.org/10.1287/trsc.2016.0673openalex-snapshot
Simulation-Based Optimization: Achieving Computational Efficiency Through the Use of Multiple Simulators
inferred← citeshttps://doi.org/10.14498/vsgtu1607openalex-snapshot
Среднее время ожидания в системе массового обслуживания $H_2/H_2/1$ с запаздыванием
inferred← citeshttps://doi.org/10.1515/amcs-2016-0060openalex-snapshot
Performance evaluation of an M/G/n-type queue with bounded capacity and packet dropping
inferred← citeshttps://doi.org/10.21468/scipostphyscore.9.3.056openalex-snapshot
Thermodynamic coprocessor for linear operations with input-size-independent calculation time based on open quantum system
inferred← citeshttps://doi.org/10.22363/2658-4670-2022-30-1-5-20openalex-snapshot
Performance analysis of queueing system model under priority scheduling algorithms within 5G networks slicing framework
inferred← citeshttps://doi.org/10.3390/fi16110397openalex-snapshot
Streaming and Elastic Traffic Service in 5G-Sliced Wireless Networks and Mutual Utilization of Guaranteed Resource Units
inferred← citeshttps://doi.org/10.3390/math10030321openalex-snapshot
Resource Retrial Queue with Two Orbits and Negative Customers
inferred← citeshttps://doi.org/10.3390/math8091501openalex-snapshot
Priority Multi-Server Queueing System with Heterogeneous Customers
inferred← citeshttps://doi.org/10.3390/math9030273openalex-snapshot
Asymptotically Normal Estimators for the Parameters of the Gamma-Exponential Distribution
inferred← citeshttps://doi.org/10.3390/math9243236openalex-snapshot
Performance Evaluation of the Priority Multi-Server System MMAP/PH/M/N Using Machine Learning Methods
inferred← citeshttps://doi.org/10.4018/jitn.2013040102openalex-snapshot
A Formal Framework for Patch Management
inferred← citeshttps://doi.org/10.46300/9106.2021.15.172openalex-snapshot
Optimization of Transport Flow on Two Paths with Respect to the Passengers Time Costs
inferred← citeshttps://doi.org/10.51408/1963-0057openalex-snapshot
The Steady State Distribution for M|M|m|n Model with the Waiting Time Restriction
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.