Search for dissertations about: "Queueing"

Showing result 1 - 5 of 33 swedish dissertations containing the word Queueing.

  1. 1. On Perfect Simulation of Markovian Queueing Networks with Blocking

    University dissertation from Göteborg : Chalmers University of Technology

    Author : Dan Mattsson; Göteborgs universitet.; Gothenburg University.; [2002]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Markov chain; Monte Carlo methods; Propp-Wilson algorithm; perfect simulation; queueing theory; Jackson networks; birth and death processes; Jackson networks; perfect simulation; queueing theory; birth and death processes; Propp-Wilson algorithm; Monte Carlo methods;

    Abstract : Perfect simulation of a class of Markovian queueing networks with finite buffers is examined in this monograph. The network processes defined are modelled by restricted multivariate birth and death processes with intensities depending on a random environment. The random environments are mainly a set of independent onoff processes. READ MORE

  2. 2. On the Bleeding Edge Debloating Internet Access Networks

    University dissertation from Göteborg : Chalmers University of Technology

    Author : Toke Høiland-Jørgensen; Anna Brunstrom; Per Hurtig; Michael Welzl; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Bufferbloat; WiFi; AQM; queueing; network measurement; performance evaluation; fairness; Computer Science; Datavetenskap;

    Abstract : As ever more devices are connected to the internet, and applications turn ever more interactive, it becomes more important that the network can be counted on to respond reliably and without unnecessary delay. However, this is far from always the case today, as there can be many potential sources of unnecessary delay. READ MORE

  3. 3. Bufferbloat and Beyond Removing Performance Barriers in Real-World Networks

    University dissertation from Göteborg : Chalmers University of Technology

    Author : Toke Høiland-Jørgensen; Anna Brunström; Per Hurtig; Luca Muscariello; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Bufferbloat; AQM; WiFi; XDP; TSQ; Flent; network measurement; performance evaluation; fairness; queueing; programmable packet processing; Computer Science; Datavetenskap;

    Abstract : The topic of this thesis is the performance of computer networks. While network performance has generally improved with time, over the last several years we have seen examples of performance barriers limiting network performance. In this work we explore such performance barriers and look for solutions. READ MORE

  4. 4. Two-Barrier Problems in Applied Probability: Algorithms and Analysis

    University dissertation from Centre for Mathematical Sciences, Lund University

    Author : Mats Pihlsgård; [2005]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Statistics; operations research; programming; actuarial mathematics; Statistik; Matematik; Mathematics; Naturvetenskap; Natural science; Reflection; Stochastic processes; Applied probability; Queueing; operationsanalys; programmering; aktuariematematik;

    Abstract : This thesis consists of five papers (A-E). In Paper A, we study transient properties of the queue length process in various queueing settings. We focus on computing the mean and the Laplace transform of the time required for the queue length starting at $x0. We define the loss rate due to the reflection. READ MORE

  5. 5. Optimization of Just-in-Time Sequencing Problems and Supply Chain Logistics

    University dissertation from Västerås : Mälardalen University

    Author : Gyan Thapa; Sergei Silvestrov; Anatoliy Malyarenko; George Fodor; [2015]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Just-in-time; JIT sequencing; apportionment; product rate variation; output rate variation; algorithms; heuristics; supply chain; logistics; queueing; non-linear integer programming; Mathematics Applied Mathematics; matematik tillämpad matematik;

    Abstract : This dissertation presents a comprehensive and comparative progress in sequencing approaches of mixed-model just-in-time (JIT) sequencing problem together with discrete apportioment problem (DAP). The goal of JIT sequencing problem (JITSP) is to keep the rate of usage of parts as constant as possible along the assembly lines, and the goal of DAP is to divide a given integer number of delegates proportionally among the states or the parties according to their population or votes. READ MORE