In this paper, we characterize the performance of an important class of scheduling schemes,
called greedy maximal scheduling (GMS), for multihop wireless networks. While a lower …

Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest
Queue First (LQF), has been studied extensively for wireless networks. However, GMS can …

This paper considers the problem of scheduling real-time traffic in wireless networks. We
consider an ad hoc wireless network with general interference and general one-hop traffic …

Efficient operation of wireless networks requires distributed routing and scheduling
algorithms that take into account interference constraints. Recently, a few algorithms for …

Greedy maximal matching (GMM) is an important scheduling scheme for multi-hop wireless
networks. It is computationally simple, and has often been numerically shown to achieve …

Efficient operation of wireless networks and switches requires using simple scheduling
algorithms. In general, simple greedy algorithms (known as Greedy Maximal Scheduling …

We consider the problem of throughput-optimal scheduling in wireless networks subject to
interference constraints. We model the interference using a family of-hop interference …

In recent years, there have been many efforts to develop low-complexity scheduling
schemes that can approximate optimal performance in multi-hop wireless networks. A …

Packet scheduling is a critical component in multi-session video streaming over mesh
networks. Different video packets have different levels of contribution to the overall video …

This paper proposes a new class of online policies for scheduling in input-buffered crossbar
switches. Given an initial configuration of packets at the input buffers, these policies drain all …