The road to earning a PhD is filled with many twists and turns, dead ends, pit falls, some
uphill rides, and some dangerous slides. My journey to a PhD would have been terrifying …

Fair scheduling algorithms have been proposed to tackle the problem of bursty and location-
dependent errors in wireless packet networks. Most of those algorithms ensure the fairness …

In a distributed mobile computing system, an efficient packet scheduling policy is a crucial
component to achieve a high utilization of the precious bandwidth resources while satisfying …

In this section, we consider the fundamental problem of scheduling single-hop traffic over
general interference graphs. The objective is to guarantee that at least a certain fraction of …

This paper focuses on the design of provably efficient online link scheduling algorithms for
multi-hop wireless networks. We consider single-hop traffic and the one-hop interference …

In this paper, we consider opportunistic downlink scheduling in a cellular network that
exploits multiuser diversity using one-bit feedback. To reduce the feedback overhead …

Deterministic Networking (DetNet) aims to provide an end-to-end ultra-reliable data network
with ultra-low latency and jitter. However, implementing DetNet in wireless networks …

Wireless networks are characterized by bursty and location-dependent errors. Although
many fair scheduling algorithms have been proposed to address these issues, most of them …

In this paper we introduce and analyze frame-based fair queueing, a novel tra c scheduling
algorithm for packet-switched networks. The algorithm provides end-to-end delay bounds …

Consumer demand for wireless networks has experienced an exponential increase in recent
years, and such trend is expected to continue in the coming years. Therefore, there is a …