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 10 of 10 for “"Server allocation"”.
-
Combinatorial Algorithms for Server Allocation Problem
… recognition, and statistics, we consider the server allocation problem. In this problem, we are given $k$ servers (with capacities) and $n$ requests, which are points in a metric space. A server serves a request by moving to the request location, and the goal is to serve all requests while …
-
Optimal Server Allocation in Zero-Buffer Tandem Queues
<p>We study the server allocation problem for tandem queues in the absence of intermediate buffer space. Servers are assumed to be homogeneous and non-collaborative. We provide policies to maximize the throughput. We break down our work into four stages. First, we assume that all servers are …
-
Optimal and Heuristic Resource Allocation Policies in Serial Production Systems
We have studied the optimal server allocation policies for a tandem queueing system under different system settings. Motivated by an industry project, we have studied a two stage tandem queueing system with arrival to the system and having two flexible servers capable of working at either of the …
-
Control of servers in a two node queueing network
Server control in a two-node Markovian queueing network with a limited total number of servers is considered. Two problems have been studied; the first problem is to find a quasi-steady-state control policy for a periodic review of server allocation. This policy can be regarded as a feedback …
-
Optimization of flexible production and supply systems
… and supply systems. In particular, we study serverallocation problems in tandem queueing systems and the use of backup supply sources tohedge against supply risks.For the first category of problems we consider two-stage queueing systems with one dedicated server in each station and a flexible …
-
Optimal control of queueing systems with non-collaborating servers
… queueing networks with cross-trained (flexible) servers are analyzed. For finite-buffered Markovian tandem networks with two stations, non-collaborative flexible servers, and no setups; the optimal server assignment policy is identified. For larger tandem networks, myopic server assignment …
-
Solutions for improved quality high bitrate multimedia delivery in MEC networks
… highlighting the need for efficient resource allocation in telecommunication networks. MEC offers a solution by storing video content at the network edge, reducing delivery delay and backhaul congestion while enhancing Quality of Service (QoS) and Quality of Experience (QoE). This research …
-
Managing server energy and reducing operational cost for online service providers
… past decade has seen the energy consumption in servers and Internet Data Centers (IDCs) skyrocket. A recent survey estimated that the worldwide spending on servers and cooling have risen to above $30 billion and is likely to exceed spending on the new server hardware . The rapid rise in energy …
-
Network resource optimization in cloud computing environments
… ways for user assignment and dynamic resource allocation, become exceedingly complex problems (NP-hard), since their solutions are affected by a large number of criteria, parameters, and constraints. When also considering the high inherent dynamicity and frequent fluctuations in network traffic …
-
Scheduling in Queueing Systems with Specialized or Error-prone Servers
Consider a multi-server queueing system with tandem stations, finite intermediate buffers, and an infinite supply of jobs in front of the first station. Our goal is to maximize the long-run average throughput of the system by dynamically assigning the servers to the stations. For the first part of …