Open research questions in Advanced Queuing Theory Analysis
69 unresolved questions extracted from the limitations and future-work sections of 385 Advanced Queuing Theory Analysis papers in our library. Each links back to the study that raised it.
What the literature leaves open
The study of fluid flow systems modulated by double-ended queues subject to catastrophic failure and repair processes is challenging and has not received attention. Prior work has focused on classical single-ended queues, ignoring double-ended queue flow dynamics.
Stationary analysis for the fluid flow system regulated by a double-ended queue subject to catastrophic failures and repairs · 2026 · DOITo extend the analysis to other types of fluid flow systems. To compare the results with existing methods. To apply the results to other domains.
Stationary analysis for the fluid flow system regulated by a double-ended queue subject to catastrophic failures and repairs · 2026 · DOITo specify the function combining the physical structure of the system and the availability parameter. To apply the model to real systems such as cloud computing infrastructure.
There is a lack of analytical models for complex non-full-availability systems. The existing models have limitations and inaccuracies.
The system with vacations was not analyzed in the literature. There is a need for approximate formulas for mean waiting times and buffer dimensioning.
Analysis of the System with Vacations under Poissonian Input Stream and Constant Service Times · 2013 · DOIModeling the occupancy distribution in limited-availability groups with BPP traffic. Determining the hysteresis thresholds for such systems. Developing a accurate model for traffic management in access networks.
Future research can focus on extending the proposed model to other types of traffic. It can also explore the application of the model to real-world access networks.
The lack of a comprehensive method for calculating blocking probability in switching networks with overflow links. The need for a modification of the SN-BPPRec method to analyze switching networks with overflow links.
and Michał Dominik Stasiak Recurrent Method for Blocking Probability Calculation in Switching Networks with Overflow Links · 2013 · DOITo extend the model to consider other types of traffic or interference. To apply the model to real-world mobile cellular networks. To compare the performance of the model with other models.
The traditional Markovian chain method is cumbersome for three-dimensional traffic cases. There is a need for a direct analytical method to achieve traffic parameters. There is a need for a model that can determine normalized probability states or QoS directly.
Future research can focus on improving the accuracy of the approximate analytical method. Future research can also focus on analyzing the performance of other types of wireless systems. Future research can explore the application of the restricted occupancy urn model to other problems.
Approximate performance analysis of slotted downlink channel in a wireless CDMA system supporting integrated voice and data services · 2004 · DOIThe paper identifies the need for an approximate analytical method to evaluate system performance due to the computational complexity of the Markov analysis. The paper also identifies the need to consider the statistical dependence between queues at the BS.
Approximate performance analysis of slotted downlink channel in a wireless CDMA system supporting integrated voice and data services · 2004 · DOIFurther research can be done to develop more complex models of interactive diffusion. The model can be extended to include more factors that affect the diffusion process.
To develop a general theory for aggregation and decomposition approaches. To improve the numerical approaches for solving practical problems. To apply the theory to various fields, such as resource allocation and scheduling.
The theory is not yet fully developed for very large models. There is a need for generalization and improvement of the theory. The paper identifies the need for a general theory for aggregation and decomposition approaches.
The development of new queueing models for complex computer and communication networks. The application of queueing theory to other fields, such as economics and management.
The difficulty of devising a useful, mathematically tractable model of complex systems. The need for a good insight in the data flow inside the computer as well as in computer networks.
The complexity of modeling individual libraries as networks. The need to consider the library's floor plan and the activities carried on within the plan. The challenge of predicting average patron processing times and costs.
Application of Queueing Network Models to Optimization of Resource Allocation within Libraries · 1979 · DOIThe earlier article on optimal allocation of resources within libraries did not take note of one of a library's most valuable resources-its floor space. The field of library management has broadened its perspective to include library networks and resource sharing, but individual libraries have not been analyzed as networks.
Application of Queueing Network Models to Optimization of Resource Allocation within Libraries · 1979 · DOIThe paper identifies a gap in the existing literature by providing a simple proof of the optimality of the best N-policy. The paper addresses the need for a simple and intuitive proof of the optimality of the N-policy.
A simple proof of the optimality of the best N‐policy in the M/G/l queueing control problem with removable server · 1979 · DOITo further analyze the limitations of demand-revealing mechanisms. To develop alternative procedures for allocating resources in the presence of public goods. To consider the potential for resource waste and confiscatory taxing rules in demand-revealing mechanisms.
The limitations of demand-revealing mechanisms are not well understood. The mechanisms' ability to achieve Pareto-optimal allocations is not well analyzed. The potential for resource waste and confiscatory taxing rules is not well considered.
Extending the method to more general queueing systems. Improving the numerical stability of the method. Applying the method to practical queueing systems.
The lack of a numerical method for approximating the steady state distribution of the waiting time in a queueing system. The difficulty of applying analytical expressions for the G/G/1 queueing system, especially when the traffic intensity is close to one.
The number of studies starting from weaker assumptions is still rather scarce in literature. The paper identifies the need for further research on variants of the classical model.
Most-cited papers in Advanced Queuing Theory Analysis
- Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements · Operations Research · 2020 · 64 citations
- Spatial Capacity Planning · Operations Research · 2021 · 56 citations
- Analysis of Single Server Markovian Queueing Model with Differentiated Working Vacation, Vacation Interruption, Soft Failure, Reneging of Customers · International Journal for Global Academic & Scientific Research · 2024 · 48 citations
- Dynamic Pricing and Matching for Two-Sided Queues · Operations Research · 2022 · 29 citations
- An Online Learning Approach to Dynamic Pricing and Capacity Sizing in Service Systems · Operations Research · 2023 · 21 citations
- Drone-Delivery Network for Opioid Overdose: Nonlinear Integer Queueing-Optimization Models and Methods · Operations Research · 2024 · 14 citations
- Call Blocking Probabilities under a Probabilistic Bandwidth Reservation Policy in Mobile Hotspots · Telecom · 2021 · 7 citations
- Queueing Systems with Random Volume Customers and their Performance Characteristics · Journal of information and organizational sciences · 2021 · 3 citations
- MODELING AND ANALYSIS OF THE CHARACTERISTICS OF MULTICHANNEL AND MULTI-NODE COMPUTER NETWORKS WITH PRIORITY SERVICE · Informatyka Automatyka Pomiary w Gospodarce i Ochronie Środowiska · 2023 · 3 citations
- Multi-component matching queues in heavy traffic · Queueing Systems · 2024 · 1 citations
Most recent work
- Single-Server Queues with State-Dependent Hawkes Arrivals · Mathematics of Operations Research · 2026
- Analysis of a Two-server Queue with Consultation in Markovian Environment · Asian Research Journal of Mathematics · 2026
- Analysis of a Two-server Queue with Consultation by Main Server Having Protected Phases of Service · Journal of Advances in Mathematics and Computer Science · 2026
- A queue-battery model for electrified traffic flow considering endogenous congestion propagation · Transportation Research Part C: Emerging Technologies · 2026
- On the Optimal Policies of Time-Inhomogeneous Unreliable Service Systems · Mathematics · 2026
- Stationary analysis for the fluid flow system regulated by a double-ended queue subject to catastrophic failures and repairs · Probability in the Engineering and Informational Sciences · 2026
- Steady-State Analysis of Multi-Server Semi-Open Queueing Networks with Environment-Dependent Parameters · Operations Research Forum · 2026
- Optimal resident physician supervision when patient care is non-preemptive · Annals of Operations Research · 2026
- A Queuing Theory Approach to Optimizing Service Efficiency in Restaurants · Journal of Research in Science and Engineering · 2026
- Performance analysis of an · Springer Link (Chiba Institute of Technology) · 2026
Find a gap in your own Advanced Queuing Theory Analysis sub-topic
This page shows what the Advanced Queuing Theory Analysis literature already flags as unresolved. To narrow it to your specific question, run the guided finder — it searches the gap library on demand and checks candidates against 250M+ OpenAlex works.
Open the Research Gap Finder →