To cope with growing wireless bandwidth demand, millimeter wave (mmWave) communication has been identified as a promising technology to deliver Gbps throughput. However, due to the susceptibility of mmWave signals to blockage, applications can experience significant performance variability as users move around due to rapid and significant variation in channel conditions. In this context, proactive schedulers that make use of future data rate prediction have potential to bring a significant performance improvement as compared to traditional schedulers. In this work, we explore the possibility of proactive scheduling that uses mobility prediction and some knowledge of the environment to predict future channel conditions. We present both an optimal proactive scheduler, which is based on an integer linear programming formulation and provides an upper bound on proactive scheduling performance, and a greedy heuristic proactive scheduler that is suitable for practical implementation. Extensive simulation results show that proactive scheduling has the potential to increase average user data rate by up to 35% over the classic proportional fair scheduler without any loss of fairness and incurring only a small increase in jitter. The results also show that the efficient proactive heuristic scheduler achieves from 60% to 75% of the performance gains of the optimal proactive scheduler. Finally, the results show that proactive scheduling performance is sensitive to the quality of mobility prediction and, thus, use of state-of-the-art mobility prediction techniques will be necessary to realize its full potential.
more »
« less
Efficient and Effective Proactive Scheduling for mmWave WLANs
To cope with growing wireless bandwidth demand, millimeter wave (mmWave) communication has been identified as a promising technology to deliver Gbps throughput. However, due to the susceptibility of mmWave signals to blockage, applications can experience significant performance variability as users move around due to rapid and significant variation in channel conditions. In this context, proactive schedulers that make use of future data rate prediction have potential to bring a significant performance improvement as compared to traditional schedulers. In this work, we propose an efficient proactive algorithm that prioritizes the scheduling of scarce resources to achieve better performance than traditional schedulers. The results show that our scheduler can increase average data rate by up to 20% compared to non-proactive scheduling and achieves from 60% to 75% of the performance gain of an optimal proactive scheduler.
more »
« less
- Award ID(s):
- 2016381
- PAR ID:
- 10556583
- Publisher / Repository:
- ACM
- Date Published:
- ISBN:
- 9798400703669
- Page Range / eLocation ID:
- 57 to 64
- Format(s):
- Medium: X
- Location:
- Montreal Quebec Canada
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Although the millimeter wave (mmWave) band has great potential to address ever-increasing demands for wireless bandwidth, its intrinsically unique propagation characteristics call for different scheduling strategies in order to minimize performance drops caused by blockages. A promising approach to mitigate the blockage problem is proactive scheduling, which uses blockage predictions to schedule users when they are experiencing good channel conditions. In this paper, we formulate an optimal scheduling problem with fairness constraints that allows us to find a schedule with maximum aggregate rate that achieves approximately the same fairness as the classic proportional fair scheduler. The results show that, for the problem settings studied, up to around 30% increase in aggregate rate compared to classic proportional fair scheduling (PFS) is possible with no decrease in fairness when blockages can be accurately predicted 0.5 seconds in advance. Furthermore, aggregate rate could be doubled compared to PFS if blockages can be accurately predicted 5 seconds in advance. While these results demonstrate the very promising potential of proactive scheduling, we also discuss several future research directions that must be pursued to effectively realize the approach.more » « less
-
Kernel task scheduling is important for application performance, adaptability to new hardware, and complex user requirements. However, developing, testing, and debugging new scheduling algorithms in Linux, the most widely used cloud operating system, is slow and difficult. We developed Enoki, a framework for high velocity development of Linux kernel schedulers. Enoki schedulers are written in safe Rust, and the system supports live upgrade of new scheduling policies into the kernel, userspace debugging, and bidirectional communication with applications. A scheduler implemented with Enoki achieved near identical performance (within 1% on average) to the default Linux scheduler CFS on a wide range of benchmarks. Enoki is also able to support a range of research schedulers, specifically the Shinjuku scheduler, a locality aware scheduler, and the Arachne core arbiter, with good performance.more » « less
-
Recently, Graph Neural Networks (GNNs) have been applied for scheduling jobs over clusters, achieving better performance than hand-crafted heuristics. Despite their impressive performance, concerns remain over whether these GNN-based job schedulers meet users’ expectations about other important properties, such as strategy-proofness, sharing incentive, and stability. In this work, we consider formal verification of GNN-based job schedulers. We address several domain-specific challenges such as networks that are deeper and specifications that are richer than those encountered when verifying image and NLP classifiers. We develop vegas, the first general framework for verifying both single-step and multi-step properties of these schedulers based on carefully designed algorithms that combine abstractions, refinements, solvers, and proof transfer. Our experimental results show that vegas achieves significant speed-up when verifying important properties of a state-of-the-art GNN-based scheduler compared to previous methods.more » « less
-
In this paper, we focus on the end-to-end simulation of millimeter-wave (mmWave) out-of-band backhaul networks in ns-3. We first introduce a design for an out-of-band backhaul module in ns-3. A custom backhaul network device is proposed that can be added to nodes to enable out-of-band backhaul transmissions. Since the new backhaul module is still under development, we extended the existing mmWave integrated-access-and-backhaul (IAB) module to enable mmWave out-of-band backhaul simulation and produce some preliminary results on throughput performance. We also modified the existing scheduler in the IAB module to support customizable scheduling for logical links in out-of-band backhaul networks. We used the customizable scheduler to implement an optimal scheduling algorithm from prior work and demonstrate that it increases throughput performance by up to 40% in certain scenarios.more » « less
An official website of the United States government

