The Effect of Delayed Feedback Information on Network Performance

The performance of a network subject to either state dependent or state independent flow control is investigated. In the state dependent case, the flow control policy is a function of the total number of packets for which the controller has not yet received an acknowledgement. In this case it is shown that the optimal flow control is a sliding window mechanism. The effect of the delayed feedback on the network performance as well as the size of the window are studied. The state independent optimal rate is also derived. The performance of the state dependent and state independent flow control policies are compared. Conditions for employing one of the two types of flow control policies for superior end-to-end network performance are discussed. All the results obtained are demonstrated using simple examples

On the Effect of Delayed Feedback Information of Network Performance

The performance of a network subject to either state dependent or state independent flow control is investigated. In the state dependent case, the flow control policy is a function of the total number of packets for which the controller has not yet received an acknowledgment. In this case it is shown that the optimal flow control is a sliding window mechanism. The effect of the delayed feedback on the network performance as well as the size of the window are studied. The state independent optimal rate is also derived. The performance of the state dependent and state independent flow control policies are compared. Conditions for employing one of the two types of flow control policies for superior end-to-end network performance are discussed. All the results are demonstrated using simple examples

On distributed scheduling for wireless networks with time-varying channels

textWireless scheduling is a fundamental problem in wireless networks that involves scheduling transmissions of multiple users in order to support data flows with as high rates as possible. This problem was first addressed by Tassuilas and Ephremides, resulting in the celebrated Back-Pressure network scheduling algorithm. This algorithm schedules network links to maximize throughput in an opportunistic fashion using instantaneous network state information (NSI), i.e., queue and channel state knowledge across the entire network. However, the Back-Pressure (BP) algorithm suffers from various drawbacks - (a) it requires knowledge of instantaneous NSI from the whole network, i.e. feedback about time-varying channel and queue states from all links of the network, (b) the algorithm requires solving a global optimization problem at each time to determine the schedule, making it highly centralized. Further, Back-pressure algorithm was originally designed for wireless networks where interference is modeled using protocol interference model. As recent break-throughs in full-duplex communications and interference cancelation techniques provide greatly increased capacity and scheduling flexibility, it is not clear how BP algorithm can be modified to improve the data rates and reduce the delay. In this thesis, we address the drawbacks of Back-Pressure algorithm to some extent. In particular, our first work provides a new scheduling algorithm (similar to BP) that allows users to make individual decisions (distributed) based on heterogeneously delayed network state information (NSI). Regarding the complexity issue, in our second work, we analyze the performance of the greedy version of BP algorithm, known as Greedy Maximal Scheduling (GMS) and understand the effect of channel variations on the performance of GMS. In particular, we characterize the efficiency ratio of GMS in wireless networks with fading. In our third and fourth work, we propose and analyze new scheduling algorithms that can benefit from new advancements in interference cancelation techniques.Electrical and Computer Engineerin

Control and measurement delay compensation in bilateral position control

The main aim of this study is the improvement of the previously presented disturbance observer based bilateral control approaches of the authors with a delay regulator and a model tracking control (MTC) that runs on the slave side. These improvements eliminate the problems related to variable time delay inherent to such systems and model mismatch, respectively, and, hence, addressing the control and measurement delay problems in bilateral control applications. The performance is evaluated experimentally on a single-link arm controlled over the internet. The results demonstrate a significant improvement over the previously presented results obtained under load uncertainties and randomly varying network delays both in the control and feedback loop