Sökning: "Queueing"

Visar resultat 1 - 5 av 37 avhandlingar innehållade ordet Queueing.

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

   Författare :Dan Mattsson; Göteborgs universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Markov chain; Monte Carlo methods; Propp-Wilson algorithm; perfect simulation; queueing theory; Jackson networks; birth and death processes; Jackson networks;

   Sammanfattning : 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. LÄS MER

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

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

   Sammanfattning : 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. LÄS MER

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

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

   Sammanfattning : 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. LÄS MER

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

   Författare :Mats Pihlsgård; Matematisk statistik; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Statistics; operations research; programming; actuarial mathematics; Statistik; Matematik; Mathematics; Naturvetenskap; Natural science; Reflection; Stochastic processes; Applied probability; Queueing; operationsanalys; programmering; aktuariematematik;

   Sammanfattning : 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. LÄS MER

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

   Författare :Gyan Thapa; Sergei Silvestrov; Anatoliy Malyarenko; George Fodor; Mälardalens högskola; []
   Nyckelord :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;

   Sammanfattning : 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. LÄS MER