Delay-Optimal Scheduling for Two-Hop Relay Networks with Randomly Varying Connectivity: Join the Shortest Queue-Longest Connected Queue Policy

We consider a scheduling problem for a two-hop queueing network where the queues have randomly varying connectivity. Customers arrive at the source queue and are later routed to multiple relay queues. A relay queue can be served only if it is in connected state, and the state changes randomly over time. The source queue and relay queues are served in a time-sharing manner; that is, only one customer can be served at any instant. We propose Join the Shortest Queue-Longest Connected Queue (JSQ-LCQ) policy as follows: (1) if there exist nonempty relay queues in connected state, serve the longest queue among them; (2) if there are no relay queues to serve, route a customer from the source queue to the shortest relay queue. For symmetric systems in which the connectivity has symmetric statistics across the relay queues, we show that JSQ-LCQ is strongly optimal, that is, minimizes the delay in the stochastic ordering sense. We use stochastic coupling and show that the systems under coupling exist in two distinct phases, due to dynamic interactions among source and relay queues. By careful construction of coupling in both phases, we establish the stochastic dominance in delay between JSQ-LCQ and any arbitrary policy

Congestion Control and Routing over Challenged Networks

This dissertation is a study on the design and analysis of novel, optimal routing and rate control algorithms in wireless, mobile communication networks. Congestion control and routing algorithms upto now have been designed and optimized for wired or wireless mesh networks. In those networks, optimal algorithms (optimal in the sense that either the throughput is maximized or delay is minimized, or the network operation cost is minimized) can be engineered based on the classic time scale decomposition assumption that the dynamics of the network are either fast enough so that these algorithms essentially see the average or slow enough that any changes can be tracked to allow the algorithms to adapt over time. However, as technological advancements enable integration of ever more mobile nodes into communication networks, any rate control or routing algorithms based, for example, on averaging out the capacity of the wireless mobile link or tracking the instantaneous capacity will perform poorly. The common element in our solution to engineering efficient routing and rate control algorithms for mobile wireless networks is to make the wireless mobile links seem as if they are wired or wireless links to all but few nodes that directly see the mobile links (either the mobiles or nodes that can transmit to or receive from the mobiles) through an appropriate use of queuing structures at these selected nodes. This approach allows us to design end-to-end rate control or routing algorithms for wireless mobile networks so that neither averaging nor instantaneous tracking is necessary

Software Defined Resource Allocation for Attaining QoS and QoE Guarantees at the Wireless Edge

Wireless Internet access has brought legions of heterogeneous applications all sharing the same resources. However, current wireless edge networks that provide Quality of Service (QoS) guar-antees that only cater to worst or average case performance lack the agility to best serve these diverse sessions. Simultaneously, software reconfigurable infrastructure has become increasingly mainstream to the point that dynamic per packet and per flow decisions are possible at multiple layers of the communications stack. In this dissertation, we explore several problems in the space of cross-layer optimization of reconfigurable infrastructure with the objective of maximizing user-perceived Quality of Experience (QoE) under the resource constraints of the Wireless Edge. We first model the adaptive reconfiguration of system infrastructure as a Markov Decision Pro-cess with a goal of satisfying application requirements, and whose transition kernel is discovered using a reinforcement learning approach. Our context is that of reconfigurable (priority) queueing, and we use the popular application of video streaming as our use case. Self declaration of states by all participating applications is necessary for the success of the approach. This need motivates us to design an open market-based system which promotes the truthful declaration of value (state). We show in an experimental setup that the benefits of such an approach are similar to those of the learning approach. Implementations of these techniques are conducted on off-the-shelf hardware, which have inherent restrictions on reconfigurability across different layers of the network stack. Consequently, we exploit a custom hardware platform to achieve finer grained reconfiguration capabilities like per packet scheduling and develop a platform for implementation and testing of scheduling protocols with ultra-low latency requirements. Finally, we study a distributed approach for satisfying strict application requirements by leveraging end user devices interested in a shared objective. Such a system enables us to attain the necessary performance goals with minimal use of centralized infrastructure