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 21 for “"queueing models"”.

  1. Queueing models for call centres

    This research develops and evaluates queueing models that can be used to model characteristics of basic call centres, i.e. multi-server systems with time-dependent arrival rates, general service time distribution and state-dependent abandonments on arrival (balking). The discrete-time modelling …

    lancaster Repository record for Queueing models for call centres (opens in a new tab)

  2. Discrete-time queueing models with priorities

    … of several discrete-time two-class priority queueing systems. We analyze non-preemptive, preemptive resume as well as preemptive repeat priority queues. The analyses are heavily based on probability generating functions that allow us to calculate moments and tail probabilities of the system …

    ghent Repository record for Discrete-time queueing models with priorities (opens in a new tab)

  3. Some queueing models of airport delays

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

    mit Repository record for Some queueing models of airport delays (opens in a new tab)

  4. Queueing Models for Large Scale Call Centers

    In the first half of this thesis, we extend the results of Halfin and Whitt to generally distributed service times. This is accomplished by first writing the system equations for the G/GI/N queue in a manner similar to the system equations for G/GI/Infinity queue. We next identify a key …

    gatech Repository record for Queueing Models for Large Scale Call Centers (opens in a new tab)

  5. Analysis and Approximations of Time Dependent Queueing Models

    … congestion measures for the general G/G/s/c queueing model and networks of such nodes has always been a challenge. One approach to analyzing such systems is to approximate the model-specified general input processes and distributions by processes and distributions from the more …

    vt Repository record for Analysis and Approximations of Time Dependent Queueing Models (opens in a new tab)

  6. Computational Methods for Control of Queueing Models in Bounded Domains

    The study of stochastic queueing networks is quite important due to the many applications including transportation, telecommunication, and manufacturing industries. Since there is often no explicit solution to these types of control problems, numerical methods are needed. Following the method of …

    vt Repository record for Computational Methods for Control of Queueing Models in Bounded Domains (opens in a new tab)

  7. Approximating Deterministic Changes to Ph(t)/Ph(t)/1/c and Ph(t)/M(t)/s/c Queueing Models

    A deterministic change to a time-varying queueing model is described as either changing the number of entities, the queue capacity, or the number of servers in the system at selected times. We use a surrogate distribution for N(t), the number of entities in the system at time t, to approximate …

    vt Repository record for Approximating Deterministic Changes to Ph(t)/Ph(t)/1/c and Ph(t)/M(t)/s/c Queueing Models (opens in a new tab)

  8. The Ph(t)/Ph(t)/s/c Queueing Model and Approximation

    Time-dependent queueing models are important since most of real-life problems are time-dependent. We develop a numerical approximation algorithm for the mean, variance and higher-order moments of the number of entities in the system at time t for the Ph(t)/Ph(t)/s/c queueing model. This model can …

    vt Repository record for The Ph(t)/Ph(t)/s/c Queueing Model and Approximation (opens in a new tab)

  9. Papers published in 1972-1985 submitted for the Degree of Doctor of Science

    … (such as application of Markov processes in queueing models) to the very practical (such as the description of cattle movements or Polynesian populations using Markov chain models).

    aus-cath Repository record for Papers published in 1972-1985 submitted for the Degree of Doctor of Science (opens in a new tab)

  10. High Performance, High Availability Distributed Processor Systems

    … system workload. Analytic as well as simulation models are being used to study the behavior of various distributed load sharing algorithms. In particular, an optimal deterministic scheduling algorithm has been designed which assigns tasks to processors for minimal execution time. Also a new class …

    uiuc Repository record for High Performance, High Availability Distributed Processor Systems (opens in a new tab)

  11. DECENTRALIZED CONTROL OF DISTRIBUTED PROCESSING SYSTEMS

    … state as a set of distributions and using a queueing model to predict the future behaviour of the system. The predicted state is used to schedule the individual job tasks based on minimum predicted job response time.</p><p>A hypothetical real system is simulated. The methodology was tested …

    unh-thes Repository record for DECENTRALIZED CONTROL OF DISTRIBUTED PROCESSING SYSTEMS (opens in a new tab)

  12. Many-Server Queues with Time-Varying Arrivals, Customer Abandonment, and non-Exponential Distributions

    … fluid approximations for many-server stochastic queueing models. The queueing models, with many homogeneous servers working independently in parallel, are intended to model large-scale service systems such as call centers and health care systems. Such models also have been employed to study …

    columbia-diss Repository record for Many-Server Queues with Time-Varying Arrivals, Customer Abandonment, and non-Exponential Distributions (opens in a new tab)

  13. A framework for generating operational characteristic curves for semiconductor manufacturing systems using flexible and reusable discrete event simulations

    … operating curves are generated using analytical queueing models that are difficult to implement and hence, can only be used for benchmarking purposes. Alternatively, DES models are more capable of capturing the complexities of a semiconductor manufacturing facility such as re-entrancy, rework and …

    dcu Repository record for A framework for generating operational characteristic curves for semiconductor manufacturing systems using flexible and reusable discrete event simulations (opens in a new tab)

  14. From cognitive to docitive radios: the role of machine learning in intelligent wireless multimedia networks

    … and non-preemptive resume priority M/G/1 queueing models are proposed to for modeling the spectrum usage behavior for prioritized multimedia applications in wireless networks. Reinforcement learning is adapted to enable users to learn from their experience and the environment and …

    alabama Repository record for From cognitive to docitive radios: the role of machine learning in intelligent wireless multimedia networks (opens in a new tab)

  15. A study of some M[x]/G/1 type queues with random breakdowns and bernouilli schedule server vacations based on a single vacation policy

    Queueing systems arise in modelling of many practical applications related to computer sciences, telecommunication networks, manufacturing and production, human computer interaction, and so on. The classical queueing system, even vacation queues or queues subject to breakdown, might not be …

    brunel Repository record for A study of some M[x]/G/1 type queues with random breakdowns and bernouilli schedule server vacations based on a single vacation policy (opens in a new tab)

  16. The method of sequential systematic sampling in digital simulation

    … autoregressive, simple moving average and M/M/1 queueing models. From the computational and simulation results reported in this research, the methods for means and variances suggested by this research have led to an improvement in the predictability of the analysis.

    vt Repository record for The method of sequential systematic sampling in digital simulation (opens in a new tab)

  17. 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 …

    vt Repository record for Vacation queues with Markov schedules (opens in a new tab)

  18. Toward sustainable networking : coded storage and high-traffic networks

    … had no intuitive examples, problem formulations, models, nor results. We will argue that some kind of queueing model can be applied to high-traffic networks that use coded storage. Strictly speaking, such queueing models could also be applied to networks without significant traffic congestion, but …

    mit Repository record for Toward sustainable networking : coded storage and high-traffic networks (opens in a new tab)

  19. Resource allocation in stochastic processing networks : performance and scaling

    … networks. Switched networks are constrained queueing models that have been used successfully to describe the detailed packet-level dynamics in systems such as input-queued switches and wireless networks. Bandwidth-sharing networks have primarily been used to capture the long-term behavior of …

    mit Repository record for Resource allocation in stochastic processing networks : performance and scaling (opens in a new tab)

  20. Improving the Real-time Performance of a Wireless Local Area Network

    … a particular situation is discussed. Simulation models are developed to study the performance of our protocol RT-MAC (real-time medium access control). RT-MAC is a novel, simple, and elegant MAC protocol for use in transmitting real-time data in point to point ad hoc WLAN. Our enhancement of IEEE …

    vt Repository record for Improving the Real-time Performance of a Wireless Local Area Network (opens in a new tab)

Page 1 of 2