Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 706 for “"Queues"”.
-
Limited processor sharing queues and multi-server queues
We study two classes of stochastic systems, the limited processor sharing system and the multi-server system. They share the common feature that multiple jobs/customers are being processed simultaneously, which makes the study of them intrinsically difficult. In the limited processor sharing …
-
Approximating Fluid Queues
… process is a continuous-time Markov chain. Fluid queues provide a model for a single continuous performance measure of a system in the presence of a random environment. Fluid queues have found a wide variety of applications including risk processes, telecommunications, and environmental modelling, …
-
Microservice decomposition and message queues.
… communication between services. Message queues play a vital role in facilitating asynchronous communication, enabling the development of scalable and resilient microservice systems. To identify the most suitable message queue for different scenarios, we conduct a comprehensive …
-
LOAD BALANCING FOR REMOTE QUEUES
Nowadays, mobile apps allow customers to access real-time information of service systems (e.g., estimated waiting times). In these systems, customers are usually distant from servers, and it takes time for them to reach a service station (e.g., traveling times). Based on the information, customers …
-
Steady state single channel queues
… channel, single phase, steady state, infinite queues with no feed-back. Previous work by A.K. Erlang had shown that queuing characteristics could be predicted for one case of an arbitrary service rate distribution, the constant service time. Also, F. Pollaczek had shown that, where arrival …
-
Markovian queues with arrival dependence.
A study of three Markovian queues wherein customers require two separate types of service upon arrival. The two service channels operate independently but receive demands through a common arrival process. Transient and steady state results are established in the case that the service channels have …
-
LEARNING AND OVERLAPS IN QUEUES
… system based on the theory of infinite server queues with time inhomogeneous Poisson arrival rates. With this model we are able to quantify how flattening the curve affects the peak demand for hospital resources. This allows us to characterize how aggressive societal policy needs to be to avoid …
-
Lock-Free Queues in Rust
… high-performance, safe, and verifiable lock-free queues are achievable in Rust. In doing so, this work takes a step toward addressing the fragmentation in Rust’s lock-free concurrency landscape.
-
Vacation queues with Markov schedules
Vacation systems represent an important class of queueing models having application in both computer communication systems and integrated manufacturing systems. By specifying an appropriate server scheduling discipline, vacation systems are easily particularized to model many practical situations …
-
General case of single channel queues
… queue models as well as the general arbitrary queues. The conclusion has been reached that in spite of the differences between the actual and expected results, the hypothesis is empirically true. Moreover, for any single channel queue with given values of C[formula omitted] and C[formula …
-
Tandem Queues with Non-Stationary Arrivals
We consider a network of K queues in tandem labeled Q1, Q2, ..,QK. The arrivals to Q 1 form a non-homogeneous Poisson process whose intensity is periodic. We conjecture that asymptotically the arrival process Aj to Qj, j= 1,2,..,K is cycle stationary. In addition, we conjecture that asymptotically …
-
Many-server queues with customer abandonment
… a queue. We first study a sequence of G/G/n+GI queues, where the customer patience times are independent and identically distributed (iid) following a general distribution. The focus is the abandonment and the queue length processes. We prove that under certain conditions, a deterministic …
-
Accurate Linearizations for Relaxed FIFO queues
… data structure is out-of-order relaxed FIFO queues, which enable high throughput by containing multiple access points. This results in a FIFO queue which allows the order of operations to not be exactly first-in-first-out, resulting in a rank error for operations which are out-of-order. Rank …
-
Optimization problems in networks and queues
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2026-02-19 without embargo terms
Page 1 of 36