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 33 for “"Processor sharing"”.
-
Limited processor sharing queues and multi-server queues
… 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 system, a …
-
User Equilibria in Systems of Parallel Processor Sharing Queues
This thesis considers a system of processor sharing queues under selfish routing, where the users choice of queue depends on their expected waiting times in each queue - in the simplest case they will seek just to minimize their expected waiting time. We assume that users have full knowledge of the …
-
Flow-level performance analysis of data networks using processor sharing models
… between multiple parallel discriminatory processor sharing queues and compare different balancing policies. In the final part of the thesis, we analyze the performance of wireless networks carrying elastic data traffic. Wireless networks are gaining more and more popularity, as their …
-
Optimal control of queueing systems with non-collaborating servers
… networks with infinite buffers, a processor sharing scheme that achieves an upper bound on the long-run average throughput is introduced. For Markovian systems with two stations, finite buffers, and homogeneous tasks, processor sharing attains the non-collaborative optimal …
-
Problems in feedback queueing systems with symmetric queue disciplines
… 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 input and output processes. We determine the semi-Markov kernel of the internal flow processes and compute …
-
Performance evaluation of multicast networks and service differentiation mechanisms in IP networks
… flows based on their age. We study Multi Level Processor Sharing (MLPS) disciplines, where jobs are classified into levels based on their age or attained service. Between levels, a strict priority discipline is applied; the level containing the youngest jobs has the highest priority. Inside a …
-
Dynamical Modeling of Cloud Applications for Runtime Performance Management
… networks. The queues are allowed to follow the processor sharing or delay disciplines, and can have multiple classes with phase-type service times. An improvement to this fluid model is then presented to increase accuracy when the \emph{system size}, i.e., number of servers, initial population, …
-
Performance modeling and control of web servers
… are presented. The first paper gives an M/G/1/K processor sharing model of a single web server. The model is validated against measurements ands imulations on the commonly usedw eb server Apache. A description is given on how to calculate the necessary parameters in the model. The second paper …
-
General queueing networks with priorities. Maximum entropy analysis of general queueing network models with priority preemptive resume or head-of-line and non-priority based service disciplines.
… and non-priority (first-come-first-served, processor-sharing, last-come-first-served with, or without preemtion) servers. The ME solutions are interpreted in terms of a decomposition of the original network into individual stable GIG11 queueing stations with assumed renewal arrival …
-
Stability and Robustness of Fluid Networks: A Lyapunov Perspective
… work-conserving, priority and proportional processor-sharing disciplines define strict GFNs. Furthermore, we provide an alternative proof for the fact that the Markov process underlying a multiclass queueing network is positive Harris recurrent if the associate fluid network defining a …
-
Voice Capacity and Data Response Time in Cognitive Radio Networks
… CRN is studied, considering the shortest processor time with and without preemption and shortest remaining processor time service disciplines, in comparison with the processor sharing service discipline. Effects of the traffic load at the base station and file length (service time …
-
Performance Modelling and Analysis of Weighted Fair Queueing for Scheduling in Communication Networks. An investigation into the Development of New Scheduling Algorithms for Weighted Fair Queueing System with Finite Buffer.
… is a theoretical construct based on a form of processor sharing for finite capacity. Furthermore, the solutions for classes with Poisson arrivals and exponential service are derived and verified against global balance solution. This thesis shows that the analytical models proposed can give very …
-
Admission control and profitability analysis in dynamic spectrum access data networks
… conditions of spectrum leasing. We consider a processor sharing network where bandwidth is equally shared among all users with no partitioning. We further consider homogeneous and elastic data traffic: All the users have the same traffic characteristics and adjust their access rate to the …
-
Resource sharing in network slicing and human-machine interactions
… addresses challenges associated with dynamic sharing of network resources by multiple tenants/services via network slicing. The second focuses on a data-driven approach to the optimization of resource allocation in interactive human-machine processes. In our first thrust we investigate how to …
-
Innovative Opportunistic Scheduling Algorithms for Networks with Packet-Level Dynamics
… of certain users. Typical fairness involve processor sharing time fairness, proportional fairness, and minimum performance guarantee. On the other hand, delay performance is not a appropriate factor to evaluate the effectiveness of a scheduling algorithm because of the infinite backlog …
Page 1 of 2