Showing papers on "Queue management system published in 2022"
TL;DR: Considering a queuing approach in this problem, even for a small-scale problem derived from a real case study, can improve the average waiting time of trucks in the queue considerably compared with the situation in which all parameters are assumed deterministic.
14 citations
TL;DR: In this paper , a bi-objective mixed integer programming model is developed that optimizes the allocation of appointment quotas simultaneously with the deployment of (yard) cargo handling equipment to ensure a successful dual transaction operation and smooth external truck arrivals.
7 citations
TL;DR: The simulation results of NS2 show that in complex and dynamic network environments, the performance of AC-RED algorithm in the average queue length, packet loss rate, delay, and delay jitter is improved in most load conditions compared with the other five algorithms.
Abstract: The rapid development of information technology has promoted the transformation of traditional networks into intelligent networks. Huge data traffic is generated by various types of traffic services in the intelligent networks, which can easily lead to network congestion, system instability, and other problems. These problems may incur great requirements and pose challenges for queue management algorithms. Most traditional active queue management (AQM) algorithms judge the congestion level of the network based only on the size of the average queue length while ignoring the network traffic variations. This makes these algorithms difficult to achieve effective improvement of congestion control efficiency. To address this problem, a novel network congestion control algorithm, namely the average queue length and change rate-RED (AC-RED) is proposed in this paper. AC-RED can better relieve network congestion by reconfiguring the packet loss strategy model based on the average queue length change rate. The simulation results of NS2 show that in complex and dynamic network environments, the performance of AC-RED algorithm in the average queue length, packet loss rate, delay, and delay jitter is improved in most load conditions compared with the other five algorithms.
5 citations
TL;DR: In this article , the authors studied two heterogeneous nodes queuing system with arrivals as a Poisson process and the service with exponential service times and analyzed the system using spectral expansion method to study various parametric measures.
Abstract: Network systems with overflow arrivals are the utmost imperative problems in high priority queuing system, where the customers are reluctant to join the queue. If the servers are free then arrived customers are serviced by one of the multiple servers. If all servers are busy then arrived customers will not join in the queue and quit the system without service and never return for the service. If the main server completes its work and no customer arrives for service then the work assigned to the lower service server is transformed to the main server and it becomes free for next arrival customer. In this paper, we studied two heterogeneous nodes queuing system with arrivals as a Poisson process and the service with exponential service times. The system is analysed using spectral expansion method to study various parametric measures and the results are presented in the graphical form.
5 citations
TL;DR: In this article , an integrated and interconnected stochastic queuing-inventory system with a fresh item, a returned item, and a refurbished item is presented. But the assumption of a system that allows a customer to sell their used item and purchase a new item will increase the number of customers approaching the system.
Abstract: This paper deals with an integrated and interconnected stochastic queuing-inventory system with a fresh item, a returned item, and a refurbished item. This system provides a multi-type service facility to an arriving multi-class customer through a dedicated channel. It sells fresh and refurbished items, buys used items from customers, refurbishes the used items for resale, and provides a repair service for defective items. The assumption of purchasing a used item from the customer and allowing them to buy a fresh item is a new idea in stochastic queuing-inventory modeling. To do so, this system has four parallel queues to receive four classes of customers and five dedicated servers to provide a multi-type service facility. Customers are classified according to the type of service they require. Each class of arrival follows an independent Poisson process. The service time of each dedicated server is assumed to be exponentially distributed and independent. This system assumes an instantaneous ordering policy for the replenishment of a fresh item. In the long run of this considered system, the joint probability distribution of the seven-dimensional stochastic process, significant system performance measures, and the optimum total cost are to be derived using the Neuts matrix geometric technique. The main objective of the system was to increase the occurrence of all kinds of customers by providing a multi-type service facility in one place. Buying a used item is unavoidable in an emerging society because it helps form a green society. Furthermore, the numerical result shows that the assumption of a system that allows a customer to sell their used item and purchase a new item will increase the number of customers approaching the system.
4 citations
01 Jan 2022
TL;DR: In this paper , an active queue management (AQM) model is proposed to estimate congestion using Random Early Detection (RED) and mitigate congestion in WSNs, and the results obtained outperform the existing methods in terms of delay between intermediate nodes, end-to-end delay, packet loss ratio, packet losses probability, queue size and energy consumption.
Abstract: In Wireless Sensor Networks (WSNs), issues including energy management, topology management, bandwidth estimation, packet loss calculation, etc. are dealt. Only a few works have paid attention to mitigating congestion while estimating delay and bandwidth for transmitting data packets in WSNs. Several works on queue management and congestion control have incorporated Soft Computing (SC) techniques to solve some of the problems in WSNs. In this paper, an Active Queue Management (AQM) model to estimate congestion using Random Early Detection (RED) and mitigate congestion is proposed. It is found that the results obtained outperform the existing methods in terms of delay between intermediate nodes, end-to-end delay, packet loss ratio, packet loss probability, queue size and energy consumption.
3 citations
TL;DR: In this article , the authors consider the regulation of arrivals into a queuing network in order to maintain a desired level of occupancy (queue length) in the system and develop a robust controller for tracking the desired queue length.
Abstract: Queuing networks have been widely-used to model congestion in transportation systems. Due to their interconnected nature, delays in a queuing network can propagate as customers traverse through the network; similarly, downstream resources can be underutilized due to poor control policies. This paper considers the regulation of arrivals into a queuing network in order to maintain a desired level of occupancy (queue length) in the system. The dynamics of the queuing network is represented by a fluid-flow model, which is then used to develop a robust controller for tracking the desired queue length. The controller is based on a sliding mode control approach, with predictor-based feedback to account for propagation delays. For a single queue, we determine sufficient conditions for tracking the queue length, and bounds on the tracking error. We also present an analysis of the tracking performance for queues in tandem. We demonstrate our approach for the example of airport surface congestion control. The proposed robust control framework is based on a queuing network model of the airport, and is used to tactically manage aircraft departures in order to reduce congestion on the airport tarmac.
2 citations
TL;DR: The findings of this study provide a signal for optimizing airport operator runway utilization by developing runway capacity and adding infrastructure as well as adding taxiways, aprons, and runways.
Abstract: This study aims to analyze the queuing system, service performance, and utilization of the two runways at Soekarno-Hatta Airport, Tangerang, Indonesia. The number of aircraft movements at the airport at busy hours exceeds capacity, resulting in long queues. This study uses a quantitative approach and queuing theory with a single server multi-channel queuing system. Discussion of runway service performance at Soekarno-Hatta Airport, by calculating the Queuing System State Probalilities to determine the probability of n units (arrivals) in the system. Five equations have been analyzed in order to Evaluation of the Two Runway Queue System. The findings of this study provide a signal for optimizing airport operator runway utilization by developing runway capacity and adding infrastructure as well as adding taxiways, aprons, and runways. The increase in runway capacity will have an impact on more aircraft services, which also means more effective and efficient runway utilization. To improve the queuing system, it is necessary to improve queuing system services with regular training of directly related officers so that the queuing system can be more effective and efficient. To improve the performance of runway services, it is necessary to increase the capacity of the navigation tools currently owned.
2 citations
01 May 2022
TL;DR: In this paper , a group-shopping model was proposed to simulate the shopping behavior in open areas with bending effects, including a motion state model, bending effect model, leader-follower model, and virtual linear obstacle model.
Abstract: Orderly queuing behavior in open areas with bending effects is studied in this paper. Models are proposed to simulate such behavior, including a motion state model, bending effect model, leader–follower model, virtual linear obstacle model, and group-shopping model. By comparing a simulated queue with an actual one, the entire processes of a pedestrian walking to a queue tail, joining the queue, orderly moving in the queue, shopping, and leaving the queue can be simulated. Additionally, the “arc bending” effect with one or multiple obstacles, the “stop-and-go” behavior and its backward propagation along the queue, and the “group shopping” effect around the shopping point are reproduced, similarly to the behavior observed in actual queues. Moreover, factors affecting queuing efficiency are studied, including the minimum distance between leaders and followers, the shopping duration and its randomness, the time interval for a new pedestrian to appear, and the size of pedestrian groups. Compared with the other factors, shopping duration is the most critical factor. Therefore, measures to shorten shopping duration should be taken to improve queuing efficiency.
2 citations
TL;DR: In this article , a transient discrete-time simulation model is proposed based on queuing theory served by single-server system and single first-in first-out (FIFO) queue.
Abstract: Optimal queue management is crucial for improving the network operation since packet loss is commonly attributed to the likelihood of buffer overflow at intermediate routers on end-to-end communication path. In this paper, a transient discrete-time simulation model is proposed based on queuing theory served by single-server system and single first-in first-out (FIFO) queue. This queuing service framework effectively enforces the best-effort service to the streams of incoming data packets across the network with disparate quality of service (QoS) requirements. We plot the network performance measures such as queue length, delay, server utilisation and packet lifetime to validate the practical wireless systems. Besides, we employ conventional multiple-objective genetic algorithm to model the trade-off among key queuing system parameters including queuing delay, packet drop rate and network bandwidth. Finally, the efficiency of our queuing optimisation model is significantly compared with previous works in terms of bandwidth utilisation, delay, and packet loss rate.
1 citations
TL;DR: In this article , the authors evaluated an alternative queuing concept for marine container terminals that utilize a truck appointment system (TAS), where walk-in lanes are provided to serve those trucks with no appointments or trucks with appointments but arrived late due to traffic congestion.
Abstract: PurposeThis paper evaluates an alternative queuing concept for marine container terminals that utilize a truck appointment system (TAS). Instead of having all lanes providing service to trucks with appointments, this study considers the case where walk-in lanes are provided to serve those trucks with no appointments or trucks with appointments but arrived late due to traffic congestion.Design/methodology/approachTo enable the analysis of the proposed alternative queuing strategy, the queuing system is shown mathematically to be stationary. Due to the complexity of the model, a discrete event simulation (DES) model is used to obtain the average waiting number of trucks per lane for both types of service lanes: TAS-lanes and walk-in lanes.FindingsThe numerical experiment results indicated that the considered queuing strategy is most beneficial when the utilization of the TAS lanes is expected to be much higher than that of the walk-in lanes.Originality/valueThe novelty of this study is that it examines the scenario where trucks with appointments switch to the walk-in lanes upon arrival if the TAS-lane server is occupied and the walk-in lane server is not occupied. This queuing strategy/policy could reduce the average waiting time of trucks at marine container terminals. Approximation equations are provided to assist practitioners calculate the average truck queue length and the average truck queuing time for this type of queuing system.
TL;DR: In this article , the authors propose a reliable hypercube queuing problem where servers can be dispatched either individually or jointly as cooperative units, and these servers are subjected to probabilistic disruptions.
Abstract: This paper proposes a reliable hypercube queuing problem where servers (e.g., vehicles) can be dispatched either individually or jointly as cooperative units, and these servers are subjected to probabilistic disruptions. The probability of a server disruption depends on the amount of resources (e.g., firefighter staffing number) allocated to this server. If any server in a cooperation unit is disrupted, a less preferred (e.g., based on capabilities and source station) but functioning and available unit will be dispatched instead. This paper derives formulas for steady-state system performance metrics for this new hypercube queuing system. The queuing model is embedded into a mixed-integer non-linear program to optimize the allocation of resources so as to minimize the total costs under server disruptions. An empirical case study is used to compare the system performance measures under a range of implementation scenarios, and sensitivity analyses are conducted to reveal insights.
TL;DR:
Abstract: In the present study, quantitative model and methods that analyze dynamic system of communication flow have been developed in the domain of queuing theory under uncertain environment. The study approach supports model-based queue design as opposed to creative engineering. Some critical aspects and results of queue model and fuzzy set theory has been reviewed in brief and the application of bulk queue model to communication network under imprecise data has been discussed. We have assumed that the arrival pattern, service pattern as well covariance between incoming and transmitted packets all are fuzzy in nature. The system characteristics with defuzzification process have been explored on the basis of lower and upper bound at possibility level alpha and signed distance method. The validity of the results has been analyzed through numerical illustration and graphical study.
TL;DR: In this paper , the M|M|1 system utilization factor model is considered under the assumption of a low intensity of the flow of incoming requests and a high speed of their service, the model is estimated for a small part of the observation time.
Abstract: Under the assumption of a low intensity of the flow of incoming requests and a high speed of their service, the M|M|1 system utilization factor model is considered. It is estimated for a small part of the observation time. Approximate relations are obtained for the system utilization factor. Its simple probabilistic model in the form of a probabilistic mixture is proposed. A comparison with the results of simulation is carried out.
TL;DR: Some significant performance measures (PMs) of a bulk arrival queueing system with constant batch size b are delved into, according to arrival rates and service rates being fuzzy parameters.
Abstract: This paper delves into some significant performance measures (PMs) of a bulk arrival queueing system with constant batch size b, according to arrival rates and service rates being fuzzy parameters. The bulk arrival queuing system deals with observation arrival into the queuing system as a constant group size before allowing individual customers entering to the service. This leads to obtaining a new tool with the aid of generating function methods. The corresponding traditional bulk queueing system model is more convenient under an uncertain environment. The $alpha$-cut approach is applied with the conventional Zadeh's extension principle (ZEP) to transform the triangular membership functions (Mem. Fs) fuzzy queues into a family of conventional bulkqueues. This new model focus on mixed-integer non-linear programming (MINLP) tenders a mathematical computational approach is known as (0 -1) variables. To measures the efficiency of the method, the efficient solution strategy plays a crucial role in the adequate application of these techniques. Furthermore, different stages of the $alpha$-cut intervals were analyzed and the final part of the article gives a numerical solution of the proposed model to achieve practical issues.
TL;DR: In this article , the authors analyzed integrated queuing-inventory systems with lost sales validated under a deterministic and uniformly distributed order size scheme under continuous review, where the model's demand was based on Poisson, wherein service times and lead times are exponentially distributed.
Abstract: The primary goal of business organization is optimally maximizing their productivity and profit whilst reducing the cost resulting from lost sales and services given to their customers, which can be achieved by exceeding the balance between the demand and supply. Analyzing real-world situations, including integrated queuing-inventory systems, such as M/M/1-systems and M/M/1/∞-systems, can help business organizations reach this goal. This research analyzes integrated queuing-inventory systems with lost sales validated under a deterministic and uniformly distributed order size scheme under continuous review. The limited integrated inventory-queuing M/M/1/N-1-system was chosen as subject of our interest due to its closeness to reality. Thus, this system with exponentially distributed deteriorating products and random planning time with lost sales was simulated. This research aimed to analyze customers’ sanctification by studying the addition of the deterioration parameter γ to the model under consideration. The proposed model’s demand was based on Poisson, wherein service times and lead times are exponentially distributed. We also examined M/M/1/∞ and M/M/1/N-1-systems investigated by Shwarz et al. using the proposed method to solve the linear system of equations obtained from the steady-state system balance equations results obtained are compared to those obtained from simulating the Schwarz approach. The analyzed model was tested for different values of Q, demand rate λ, and γ. The obtained results showed a strong dependency between γ, Q, and λ, providing the needed information for decision-makers to reach their goals depending on the performance measure of interest.
TL;DR: The present methodologies and strategies are intended to be applicable to a variety of contemporary decision-making challenges in areas of economic share, finance, administration, and ecology, which are the focus of the future study.
Abstract: : This research provides a two-class single transmit queuing model. We also calculate the model’s execution proportions under a vague environment. The main purpose of this inquiry is to compare the results of a single transmit queuing model based on fuzzy queuing theory and intuitionistic fuzzy queuing theory. Triangular fuzzy numbers and triangular intuitionistic fuzzy numbers are used to describe the entry (arrival) and administration (service) rates. The fuzzy queuing theory model’s evaluation metrics are supplied as a range of values, but the intuitionistic fuzzy queuing theory model offers a wide range of values. An analysis is offered to discover quality measures utilizing a proposed methodology in which the fuzzy values are retained as is without being altered into crisp values, hence we can use the proposed method to draw scientific conclusions in an uncertain environment. Two numerical problems are solved to demonstrate the sustainability of the suggested method. Subsequently, prototype components were exposed to sensitivity analyses. Sensitivity testing is used to find discrepancies between the two groups when calculating their execution proportions. We employed the triangular fuzzy number in an intuitionistic fuzzy environment in this study, accounting for the degree of comfort and refusal so that the sum of both values is always less than 1. For this type of fuzzy integer, we gave various non-normal arithmetic procedures. The proposed formulations are simple and direct, having been devised using classical algebraic mathematics. This strategy is simple and straightforward to use in actual situations. The nearest interval number is then used to round a TIFN. The key benefit of this approach is that using a multi-section algorithm, we can quickly solve a bound unbridled optimization problem with coefficients as TIFN. The present methodologies and strategies are intended to be applicable to a variety of contemporary decision-making challenges in areas of economic share, finance, administration, and ecology, which are the focus of our future study.
TL;DR: In this article , the authors used the internet of things (IoT) system to display the queue number served on a P10 LED display, which can be ordered online through an application on a smartphone.
Abstract: Queuing is a phenomenon that we can encounter anywhere and anytime, such as queuing to get food orders, ticketing services, and so on. However, unfortunately not everyone likes to queue, especially queuing for public agency services. This is because of various kinds, such as irregular queues, the number of people queuing so that it makes people lazy to queue, or even because there is a sudden need so they cannot queue for long. Especially during the Covid-19 pandemic, people avoid physical contact between each other, so to overcome this, an organized queue number system is needed and can be ordered online through an application on a smartphone. Customers can order a queue number and monitor the queue number being served through an application on a smartphone, there is also a call to each queue number to be served. This research also applies the internet of things (IoT) system which is used to display the queue number served on a P10 LED Display.
02 Dec 2022
TL;DR: In this article , the authors proposed a task queueing system with the help of Redis as the message broker, which reduces the time taken for queuing significantly relative to existing solutions such as Celery which has high overhead due to the various other tasks that it must perform.
Abstract: Existing solutions for a task queue have overheads that slow down the task queueing process. The system proposed is built with the help of Redis as the message broker. The Redis Zset data structure reduces the time taken for queuing significantly relative to existing solutions such as Celery which has a high overhead due to the various other tasks that it must perform. Celery will be used as the benchmark for comparison against the proposed system’s performance. The time taken for the task in the queue will be calculated and compared for both Celery and the proposed system for 1, 2, 4, and 8 workers. From the results, it can be observed that the tasks in the proposed system spent less time in the queue for all four cases when compared with the relative performance of Celery’s, which has increasing queue time with an increase in the number of workers.
01 Jul 2022-Tehnìko-tehnologìčnì aspekti rozvitku ta viprobuvannâ novoï tehnìki ì tehnologìj dlâ sìlʹsʹkogo gospodarstva Ukraïni
TL;DR: In this paper , a model of a closed queuing system is presented, which can be used to describe the operation of a stationary workshop, specialized shop, plant, point, dead-end maintenance area or other set of concentrated stationary service devices with an arbitrary distribution of service time.
Abstract: Purpose of the study. The aim of the work is to substantiate the modern organization of technical operation of combine harvesters, which is carried out by a network of parallel-functioning queuing chains. The practical result will be the formation of a model of technical control of the requirements of individual systems, which will initially be addressed using the terminology adopted by the theory of queuing, and recommendations will be given on the specific use of the solutions. Research methods. The methodological basis of the work is the generalization and analysis of known scientific results regarding the modern organization of technical operation of combine harvesters, carried out by a network of parallel queuing chains, and the use of requirements division algorithm and queuing theory. Analytical method and comparative analysis were used to form a scientific problem, determine the purpose and set research objectives. When creating empirical models, the main provisions of the theory of queuing, systems of stationary service devices, block diagrams of the failure distribution algorithm are used. The results of the study. The article considers the data, which is considered to be the modern organization of technical operation control of combine harvesters by network, which consists of a finite number of parallel operating queuing chains with serial numbers . In the network at random moments of time from an external source receives service requirements. The issues of choosing a chain for service requirements were considered. Since each chain is designed to restore a particular model of machine by performing one or another type of technical control of the combine harvester, the choice of chain was determined by the parameters ω_i and ξ_i received applications. It was taken into account that the total number of queuing chains Β, as a rule, is less than the number of types of technical control of the number of models of combine harvesters in the park ε, because in the same chain can perform technical control of several types and models of combine harvesters. For each specific case of organization of the network of technical operation in accordance with the accepted specialization of individual chains, a matrix of chain selection for servicing the application according to its parameters and can be compiled. A similar matrix, in which each pair of possible values corresponds to a specific chain number ε, can be easily constructed for any specific case of a given organization and specialization of the network of technical operation of combine harvesters. Conclusions. As a result of the research, new scientifically sound technical and technological solutions and mathematical models were obtained, which are aimed at improving the efficiency of production processes of restoring the efficiency of combine harvesters in agricultural enterprises Modeling of technical control of requirements of separate systems of the combine harvester will be initially solved in a form with use of the terminology accepted by the theory of queuing, and recommendations concerning concrete use of the received decisions will be given. A model of a closed queuing system is obtained, which can be used to describe the operation of a stationary workshop, specialized shop, plant, point, dead-end maintenance area or other set of concentrated stationary service devices with an arbitrary law of distribution of service time. Key words: closed queuing system, requirement, combine harvester, model, efficiency.
14 Dec 2022
TL;DR: In this article , the authors deal with the systematic study on queueing systems and an application of queuing model and the results are observed in various time intervals and the analysis is done for five different days using five different counters (servers).
Abstract: This paper deals with the systematic study on queueing systems and an application of queuing model. Here, the single stage queuing model with single queue and multiple servers is considered as a real time illustration. The average number of consumers in the system and in the queue along with the average waiting time of the consumers in the system and in the queue is calculated in a departmental store. The results are observed in various time intervals and the analysis is done for five different days using five different counters (servers). Finally, a comparative study on Last of Maxima method, Mean of Maxima method and fuzzy approximation method is done for five days and the approximation curve is manipulated based on our study.
TL;DR: In this paper , the authors used the queuing theory to reduce the waiting time in queue line at bank ATMS and demonstrated how this issue can be resolved using the queue theory.
Abstract: Abstract: In order to receive the requested service, which may be processed or supplied one at a time, consumers or people frequently queue up. Bank ATMS wouldn’t lose clients as a result of lengthy queue waits. When we apply M/M/S model (i.e., MULTI SERVER QUEUING MODEL) we can reduce the waiting time in queue line. To implement this method the bank should places two ATM in each branch. This essay demonstrates how this issue was resolved using the queuing theory. Getting the data from a city’s bank ATM. Next we determine the frequency of arrival, level of service, rate of utilization, and duration of waiting queue as well as the typical clientele.
TL;DR: In this paper, an adaptive fractional-order controller is proposed to enhance the efficiency of nonlinear transmission control protocol/active queue management (TCP/AQM) in these networks.
Abstract: In this study, the congestion problem of computer networks is solved by introducing an adaptive fractional-order controller. The controller is designed to enhance the efficiency of nonlinear transmission control protocol/active queue management (TCP/AQM) in these networks. External disturbances can perturb the data transmission. Moreover, factors such as undetermined link capacity can affect the congestion control problem. Hence, the proposed controller should guarantee robustness against disturbances and uncertainties. Besides, small elapsed time to reach the desired queue length as well as convergence of tracking error to zero are essential in queue management. These objectives are fulfilled by designing a fractional-order controller. High tracking capability and robustness make the controller an effective method for TCP/AQM networks. Furthermore, asymptotic stability of the network is precisely proven based on the fractional-order Lyapunov lemma. A variety of simulations are performed to examine capability of the proposed method confronting disturbances and uncertainties while providing a fast and stable response with zero tracking error. The results are also compared with the results of two recently developed control approaches for congestion problem, using performance indices, which confirm the efficiency and superiority of the introduced controller.
TL;DR: The Bayesian method combines information from current research and previous studies with similar cases, and produces a posterior distribution to form a queuing system model and measure of service system performance.
Abstract: The queuing system relates to customers and service facilities. Queuing theory designs service facilities to address service requests. Queues occur if the service capacity is not sufficient to provide services to many customers. The queuing phenomenon occurs on non-patas buses on the eastern route of Tirtonadi Terminal, Surakarta with Surabaya, Karanganyar, Wonogiri, Purwodadi and Pedesaan buses. The Bayesian method combines information from current research and previous studies with similar cases, and produces a posterior distribution to form a queuing system model and measure of service system performance. The bus queuing system model for Surabaya, Karanganyar, Wonogiri and Purwodadi has a Gamma-distributed arrival and service pattern. Pedesaan buses has an arrival pattern with a Gamma distribution and a service pattern with an Inverse Gamma distribution. Each line has 1 bus line as a service system, FIFO queue discipline, the number of customer capacity and call sources is not limited. The Surabaya buses has the highest probability of 93.49% that the line is idle and the Pedesaan buses has the highest probability that the line will be busy serving at 89.50%. The queuing system are considered good because the five lines of service facilities are able to meet customer needs. Keywords: Tirtonadi Terminal, Bayesian, Posterior Distribution, Queue Models, System Performance Measures
23 May 2022
TL;DR: In this paper , a new approach to estimating the average queue in data transmission systems, the traffic in which is highly correlated and practically not described by classical models of queuing theory, is presented.
Abstract: The report presents a new approach to estimating the average queue in data transmission systems, the traffic in which is highly correlated and practically not described by classical models of queuing theory. In particular, this situation occurs in video traffic transmission systems. An approach is proposed in which the data transmission system model is described not by two random processes - the input stream and the service process, but by one combined process. To derive a generalized formula for the estimation of the average queue, the generalized interval method is used. The estimate of the dependence of the average queue on the correlation characteristics of the combined process is obtained.
01 Jan 2022
TL;DR: In this paper , a deep Q-network (DQN) is used as the foundation to control and auto-tune the parameters of the RED active queue control algorithm.
Abstract: Network traffic is growing with every passing day, making it more critical than ever to deal with the exploding amounts of Internet traffic and reduce delays; thus, self-learning network management systems are a must for efficient network management; such systems are called active queue management systems or AQM. This paper discusses the use of machine learning to auto-tune the parameters of AQM algorithms by training a deep reinforcement learning model to balance the queuing delay and through putto get the maximum possible network score which is also known as the reward system. Deep Q-Network (DQN) is used as the foundation to control and auto-tune the parameters of the RED algorithm. Results from the NS3 simulation suggest that the DQN algorithm has better network reliability and is thus preferable to the RED active queue control algorithm.
TL;DR: In this paper , the authors evaluated the queuing system in Portofino Eatery- Bread section with a view to determine its operating characteristics and to improve customers' satisfaction during waiting time using the lens of queuing theory.
Abstract: This study evaluated the queuing system in Portofino Eatery- Bread section with a view to determine its operating characteristics and to improve customers’ satisfaction during waiting time using the lens of queuing theory. The model of operation was detected to be M/M/s model while the arrival rate, service rate, utilization rate and waiting time in the queue were derived. Data was collected by direct observation at the Portofino Eatery service facility, Ado – Ekiti. The arrival rate (λ) at Portofino Eatery- Bread section was about 43 customers per hour, while the service rate was about 40 customers per hour for each server. The system includes four different servers. The average number of customers in the system in an hour window was 43 customers with a utilization rate of 0.722. This research work concludes with a discussion on the benefits of performing queuing analysis to a restaurant. In order to avoid congestion and reduce customer’s waiting time, increase patronage and boost customer’s confidence in Portofino eatery service delivery.
12 Apr 2022
TL;DR: In this article , a queue model of customer queuing behavior is proposed to reduce customer losses in random service systems, and three queuing models are developed: MG1, GM1, and GG1 for estimating service quality control.
Abstract: Customers are compelled to queue when a service system is at its busiest. This issue not only reduces customer pleasure, but it also causes the company to lose money. For consumer losses, this study proposes a queue model of customer queuing behavior. The goal is to reduce customer losses, hence researchers are looking at queue setup and optimization in random service systems. We developed three queuing models: MG1, GM1, and GG1 for estimating service quality control. We investigate queuing systems for predicting replies for service quality control based on queue models of customer behavior. The study found that the MG1 queue model yields the best service quality, however the GM1 and GG1 results are relatively close behind.
01 Jan 2022
TL;DR: In this article , the authors used queuing theory and simulation to reduce patients' waiting time at the registration desk and increase the number of servers in both the registration and consultation phase especially during the peak hours.
Abstract: In a public hospital, patients always have to wait for a long time at the registration desk before being served by physicians. Hence, it is necessary to overcome this problem by improving its queuing system to increase effectiveness. In this research, the methods used are queuing theory and simulation. Based on the data collected, most of the patients waited for 1 h 20 min to receive treatment. So, to reduce patients’ waiting time, it is necessary to increase the number of servers in both the registration and consultation phase especially during the peak hours, and allocate resources in the best way as well.
13 Oct 2022
TL;DR: Based on the theory of queuing theory and the characteristics of aircraft logistics support maintenance, the authors studies the needs of logistics support personnel in aircraft operation and establishes the demand model of airline maintenance personnel.
Abstract: Based on the theory of queuing theory and the characteristics of aircraft logistics support maintenance, this paper studies the needs of logistics support personnel in aircraft operation. The demand model of airline maintenance personnel is established. χ 2 fit is applied to test the maintenance data, the input flow follows the Poisson distribution, and the aircraft maintenance time follows the negative exponential distribution. In the simulation part, the effects of service order, system load, and the completeness of system maintenance on the performance of the queuing system are studied, it is concluded that the service sequence and system load have a significant impact on the system performance.