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 7 of 7 for “"MaxWeight"”.
-
Optimal heavy-traffic queue length scaling in an incompletely saturated switch
… an input queued switch operating under the MaxWeight scheduling algorithm. This system is interesting to study because it is a model for Internet routers and data center networks. Recently, it was shown that the MaxWeight algorithm has optimal heavy-traffic queue length scaling when all …
-
Optimal scheduling algorithms for ad hoc wireless networks
It is well known that the MaxWeight scheduling algorithm is throughput-optimal in wireless networks. However, its complexity is exponential in the number of links in an ad hoc network. In this work, we consider a greedy variant of the MaxWeight algorithm, called Longest Queue First (LQF). A …
-
Network optimization in adversarial environments
… of several network control policies (e.g., MaxWeight and Drift-plus-Penalty). It is proved that these policies are throughput-optimal and achieve good utility-delay tradeoffs even under adversarial dynamics. Second, we study network optimization in a partially-controllable environment where …
-
The delay performance of adaptive routing and scheduling in communication networks
… networks. A collection of algorithms called MaxWeight Scheduling (MWS) algorithms is known to be throughput optimal. A particular algorithm in this class was conjectured to be delay-optimal as well. We disprove this conjectured by constructing a delay-optimal algorithm for a specific network …
-
Optimal Control for Uncooperative Networks
… limited observability. We propose the Tracking MaxWeight* (TMW*) algorithm that does not require direct observations of underlay nodes and only operates on overlay nodes. TMW* maintains virtual queues that track the dynamics of the underlay nodes using estimates of the underlay queue backlogs. …
-
Analysis and Optimization of Networks in Overload
… buffer sizes. We propose a policy that combines Maxweight scheduling and Backpressure routing which can reach the most balanced queue overload in networks with bounded buffers. (iii) Stability: We demonstrate that the introduction of bounded node buffers affects the transmission policies that can …
-
Model reduction of Markov chains with applications to building systems
… are based on recent generalizations of the MaxWeight policy for decentralized routing. These results are illustrated with the aid of simulations using realistic building models.