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 13 of 13 for “"throughput optimality"”.
-
Optimal Control for Wireless Software Defined Networks: Theory and Implementation
… constraints, or are only sub-optimal in throughput due to quasi-static shortest path routing. Though throughput-optimal and well-established in the literature, the BackPressure (BP) algorithm is not compatible with wireless SDN architecture. In contrast, the recently developed Universal …
-
Fundamental limits of random access in wireless networks
… the striking capability to match the optimal throughput performance (maximum stability region) of centralized scheduling mechanisms. The throughput optimality however has been established for activation rules that are relatively sluggish, and may yield excessive queues and delays. More …
-
Scheduling algorithms for throughput maximization in data networks
… thesis considers the performance implications of throughput optimal scheduling in physically and computationally constrained data networks. We study optical networks, packet switches, and wireless networks, each of which has an assortment of features and constraints that challenge the design …
-
The delay performance of adaptive routing and scheduling in communication networks
Throughput and latency are two important QoS metrics in communication networks. Ideally, we would like to deliver a large amount of data from a source to its destination within a short time period. During the past decades, researchers have designed a number of network-layer routing algorithms and …
-
Scheduling algorithms for arbitrary communication networks
… and scheduling constraints. We address the optimality of scheduling schemes for packet networks in terms of throughput, delay and fairness. Specifically, we design two scheduling schemes. The first one achieves simultaneous throughput and delay optimization. The second scheme provides …
-
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
… network and meet the increasing demand for high throughput and low delay, it is necessary to develop efficient network layer strategies that fully utilize the physical layer capabilities of each network element. In this thesis, we develop the notion of network layer capacity and describe capacity …
-
Towards practical policies for network control
… control policies geared towards achieving throughput optimality have been developed. However, rarely any of these policies have been used in practice. We study three different issues that impede this transition and propose solutions that can facilitate the move. Throughput optimal routing …
-
Optimal resource allocation algorithms for cloud computing
… in such a system. An algorithm is said to be throughput-optimal if it can stabilize the system whenever the load is within the capacity region. We show that the widely-used Best-Fit scheduling algorithm is not throughput-optimal. We first consider the problem where the jobs need to be …
-
Scheduling algorithms for throughput maximization in time-varying networks with reconfiguration delays
… reconfiguration delays. These algorithms provide throughput-optimality without requiring knowledge of arrival rates since they dynamically adapt inter-switching durations to stochastic arrivals. Finally, we present optimal scheduling under time-varying channels and reconfiguration delays, which is …
-
Optimal control for wireless networks
… link scheduling policy, that maximizes net throughput. Currently, the only known throughput-optimal policy is the Backpressure policy for the unicast problem. In this thesis, we propose provably optimal algorithms for the broadcast and the generalized flow problems. Our study begins with the …
-
Matrix multiplication with Asynchronous Logic Automata
… in a parametric way and execute very dense, high-throughput computation at a lesser energy cost than that of today's supercomputers. This architecture aligns physics and computation in a way that makes it inherently scalable, unlike existing architectures. An ALA circuit is a network of 1-bit …
-
Optimal Control for Uncooperative Networks
… on the virtual queues. We show that TMW* is throughput optimal. We further extend our analysis to the setting that the estimates of the underlay state are erroneous and show that as long as the errors scale sub-linearly in time, TMW* preserves throughput optimality. We extend to uncooperative …
-
On the throughput efficiency of greedy maximal scheduling in wireless ad hoc networks
… networks. However, GMS can result in degraded throughput performance in general wireless networks. In this thesis, we derive performance bounds of GMS for wireless networks under the general k-hop interference model. In particular, we prove that GMS achieves 100% throughput in all networks with …