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 34 for “"Queueing systems"”.

  1. An axiomatic approach to queueing systems

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1995.

    mit Repository record for An axiomatic approach to queueing systems (opens in a new tab)

  2. Multiserver queueing systems in heavy traffic

    In the study of queueing systems, a question of significant current interest is that of large scale behavior, where the size of the system increases without bound. This regime has becoming increasingly relevant with the rise of massive distributed systems like server farms, call centers, and health …

    mit Repository record for Multiserver queueing systems in heavy traffic (opens in a new tab)

  3. Large deviation theory for queueing systems

    … with a nonnegative state space as a model for a queueing system. The motivation of this study is about useful estimates of system performance. For example, in a system with finite queues, the probability of the system of queues going from an empty state to a state in which the population of at …

    vt Repository record for Large deviation theory for queueing systems (opens in a new tab)

  4. Large scale queueing systems : asymptotics and insights

    … in a variety of applications, including service systems and telecommunication networks. A particular application that has received considerable attention in recent years is the analysis of call centers. A feature common to these models is the notion of the 'trade-off' between quality and …

    mit Repository record for Large scale queueing systems : asymptotics and insights (opens in a new tab)

  5. Transient analysis of some open queueing systems

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1988.

    mit Repository record for Transient analysis of some open queueing systems (opens in a new tab)

  6. Access size and order in queueing systems

    General queueing systems are discussed in order to familiarize the reader with the problem. Various access arrangements including straight, graded, slipped, and random access multiples are discussed and compared. Blocking probability curves for slipped multiple access order are generated. Cost of …

    vt Repository record for Access size and order in queueing systems (opens in a new tab)

  7. Staffing queueing systems with cyclical demand and unreliable servers

    … (SIPP) method for staffing a multi-server delay queueing system with time-varying demand and server absence. Using the M(t)/M/c(t) queueing model, we systematically examine the SIPP method across various scenarios, including realistic ones, considering cyclical customer arrival rates and multiple …

    uoit Repository record for Staffing queueing systems with cyclical demand and unreliable servers (opens in a new tab)

  8. Algorithmic issues in queueing systems and combinatorial counting problems

    (cont.) However, these randomized algorithms can never provide proven upper or lower bounds on the number of objects they are counting, but can only give probabilistic estimates. We propose a set of deterministic algorithms for counting such objects for three classes of counting problems. They are …

    mit Repository record for Algorithmic issues in queueing systems and combinatorial counting problems (opens in a new tab)

  9. Problems in feedback queueing systems with symmetric queue disciplines

    In this paper we study properties of a queue with instantaneous Bernoulli feedback where the service discipline is one of two symmetric disciplines. For the processor sharing queue with exponentially distributed service requirements we analyze the departure process, imbedded queue lengths, and the …

    vt Repository record for Problems in feedback queueing systems with symmetric queue disciplines (opens in a new tab)

  10. Control of multiclass queueing systems with abandonments and adversarial customers

    … model the surveillance scenario as a multiclass queueing system with customer abandonments, wherein the operational problem translates into developing service policies for a server in order to minimise the expected damage an adversarial customer can inflict on the system. We consider three …

    lancaster Repository record for Control of multiclass queueing systems with abandonments and adversarial customers (opens in a new tab)

  11. Extended Entropy Maximisation and Queueing Systems with Heavy-Tailed Distributions

    Numerous studies on Queueing systems, such as Internet traffic flows, have shown to be bursty, self-similar and/or long-range dependent, because of the heavy (long) tails for the various distributions of interest, including intermittent intervals and queue lengths. Other studies have addressed …

    bradford Repository record for Extended Entropy Maximisation and Queueing Systems with Heavy-Tailed Distributions (opens in a new tab)

  12. An investigation of the transient behavior of stationary queueing systems

    Thesis (Ph.D.)--Massachusetts Institute of Technology, Alfred P. Sloan School of Management, 1981.

    mit Repository record for An investigation of the transient behavior of stationary queueing systems (opens in a new tab)

  13. Dynamic queueing systems : behavior and approximations for individual queues and for networks

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1995.

    mit Repository record for Dynamic queueing systems : behavior and approximations for individual queues and for networks (opens in a new tab)

  14. Guidelines for the design of flexibility in queueing systems : model, measures, and analysis

    … in revenue management techniques for operational systems, we show that such operational control policies can have disproportionate influence on revenue and cost measures of performance; this fact further underscores the importance of having such models, measures, and analytical tools to examine …

    mit Repository record for Guidelines for the design of flexibility in queueing systems : model, measures, and analysis (opens in a new tab)

  15. Analysis of Alternative Queue Systems in Simulated Amusement Parks

    … seeks to analyze the effects of alternative queueing systems on guest welfare in amusement parks. Many parks have implemented these systems, allowing some guests to skip the traditional lines for attractions. This project entailed building an amusement park simulation system, permitting …

    mit Repository record for Analysis of Alternative Queue Systems in Simulated Amusement Parks (opens in a new tab)

  16. Approximate solutions for multi-server queuing systems with Erlangian service times and an application to air traffic management

    … of certain M(t)/G(t)/n(t)/n(t) + q queueing systems. More specifically, we are interested in such systems under very general conditions such as time-varying demand and capacity, and high utilization, including occasional oversaturation. Conditions such as these cannot be addressed …

    mit Repository record for Approximate solutions for multi-server queuing systems with Erlangian service times and an application to air traffic management (opens in a new tab)

  17. Applications of robust optimization to queueing and inventory systems

    … optimization in the performance analysis of queueing and inventory systems. In the first part of the thesis, we propose a new approach for performance analysis of queueing systems based on robust optimization. We first derive explicit upper bounds on performance for tandem single class, …

    mit Repository record for Applications of robust optimization to queueing and inventory systems (opens in a new tab)

  18. Analysis of a feed-forward priority queueing system

    … the problem of analyzing feed-forward priority queueing systems. In this type of system incoming units enter one of n priority queues if the service facility is busy. Units in the highest priority queue are served on a first-come-first-served basis while units in the lower priority queues will …

    vt Repository record for Analysis of a feed-forward priority queueing system (opens in a new tab)

Page 1 of 2