Dynamic spectrum sharing has emerged as a promising solution to address the spectrum scarcity challenge. Currently, the FCC has designated several Spectrum Access Systems (SAS) administrators to deploy their SAS that coordinates the usage of the certificated shared band(s) such as the 3.55-3.7 GHz CBRS band. The SAS ensures that the incumbent’s access to the shared band is guaranteed while also granting commercial users access rights when the incumbents are not present. However, explicitly sharing the spectrum band(s) information among participants raises privacy concerns. Certain participants, such as curious SAS administrators, have the ability to deduce the confidential operational patterns of the incumbents through the Environmental Sensing Capability (ESC) or Incumbent Informing Capability (IIC) notifications. Additionally, a curious SAS administrator may obtain the client’s operational information of other SAS administrators throughout the process of inter-SAS coordination.
We propose Pri-Share, a novel privacy-preserving spectrum sharing paradigm that tailors the threshold-based private set union (PSU) and homomorphic encryption (HE) techniques to address the aforementioned privacy problems. Specifically, it enables all parties to jointly compute a unified spectrum allocation plan to resolve the potential conflicts between different parties while safeguarding the confidentiality of each stakeholder’s spectrum requirements and usage. Pri-Share also ensures that while a curious participant might ascertain the usage of a particular spectrum band, they are unable to deduce the precise identity of the party utilizing it. Besides, Pri-Share adheres to the key spectrum allocation regulations outlined by FCC (part 96), such as assurance of access rights for various priority levels.
Our implementation result shows that Pri-Share can be achieved with notable computational and communication efficiency,
more »
« less
This content will become publicly available on July 1, 2025
TriSAS: Toward Dependable Inter-SAS Coordination with Auditability
To facilitate dynamic spectrum sharing, the FCC has designated certified SAS administrators to implement their own spectrum access systems (SASs) that manage the shared spectrum usage in the novel CBRS band. As a premise, different SAS servers must conduct periodic inter-SAS coordination to synchronize service states and avoid allocation conflicts. However, SAS servers may inevitably stop service for regular upgrades, crash down, or even perform maliciously that deviate from the normal routines, posing a fundamental operation security problem — the system shall be robust against these faults to guarantee secure and efficient spectrum sharing service. Unfortunately, the incumbent inter-SAS coordination mechanism, CPAS, is prone to SAS failures and does not support real-time allocation. Recent proposals that rely on blockchain smart contracts or state machine replication mechanisms to realize fault-tolerant inter-SAS coordination require all SASs to follow a unified allocation algorithm. They however face performance bottlenecks and cannot accommodate the current fact that different SASs hold their own proprietary allocation algorithms.
In this work, we propose TriSAS—a novel inter-SAS coordination mechanism to facilitate secure, efficient, and dependable spectrum allocation that is fully compatible with the existing SAS infrastructure. TriSAS decomposes the coordination process into two phases including input synchronization and decision finalization. The firstphase ensures participants share a common input set while the second one fulfills a fair and verifiable spectrum allocation selec- tion, which is generated efficiently via SAS proposers’ proprietary allocation algorithms and evaluated by a customized designed allocation evaluation algorithm (AEA), in the face of no more than one-third of malicious participants. We implemented a prototype of TriSAS on the AWS cloud computing platform and evaluated its throughput and latency performance. The results show that TriSAS achieves high transaction throughput and low latency under various practical settings.
more »
« less
- NSF-PAR ID:
- 10520576
- Publisher / Repository:
- ACM
- Date Published:
- ISBN:
- 9798400704826
- Page Range / eLocation ID:
- 399 to 411
- Format(s):
- Medium: X
- Location:
- Singapore Singapore
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
To enforce incumbent protection through a spectrum access system (SAS) or future centralized shared spectrum system, dynamic protection area (DPA) neighborhood distances are employed. These distances are distance radii, in which citizen broadband radio service devices (CBSDs) are considered as potential interferers for the incumbent spectrum users. The goal of this paper is to create an algorithm to define DPA neighborhood distances for radio astronomy (RA) facilities with the intent to incorporate those distances into existing SASs and to adopt for future frameworks to increase national spectrum sharing. This paper first describes an algorithm to calculate sufficient neighborhood distances. Verifying this algorithm by recalculating previously calculated and currently used neighborhood distances for existing DPAs then proves its viability for extension to radio astronomy facilities. Applying the algorithm to the Hat Creek Radio Observatory (HCRO) with customized parameters results in distance recommendations, 112 kilometers for category A (devices with 30 dBm/10 MHz max EIRP) and 144 kilometers for category B (devices with 47 dBm/10MHz max EIRP), for HCRO’s inclusion into a SAS and shows that the algorithm can be applied to RA facilities in general. Calculating these distances identifies currently used but likely out-of-date metrics and assumptions that should be revisited for the benefit of spectrum sharing.more » « less
-
A primary design objective for Data-intensive User- facing (DU) services for cloud and edge computing is to maximize query throughput, while meeting query tail latency Service Level Objectives (SLOs) for individual queries. Unfortunately, the existing solutions fall short of achieving this design objective, which we argue, is largely attributed to the fact that they fail to take the query fanout explicitly into account. In this paper, we propose TailGuard based on a Tail-latency-SLO-and- Fanout-aware Earliest-Deadline-First Queuing policy (TF-EDFQ) for task queuing at individual task servers the query tasks are fanned out to. With the task queuing deadline for each task being derived based on both query tail latency SLO and query fanout, TailGuard takes an important first step towards achieving the design objective. TailGuard is evaluated against First-In-First-Out (FIFO) task queuing, task PRIority Queuing (PRIQ) and Tail-latency-SLO-aware EDFQ (T-EDFQ) policies by simulation. It is driven by three types of applications in the Tailbench benchmark suite. The results demonstrate that TailGuard can improve resource utilization by up to 80%, while meeting the targeted tail latency SLOs, as compared with the other three policies. TailGuard is also implemented and tested in a highly heterogeneous Sensing-as-a-Service (SaS) testbed for a data sensing service, with test results in line with the other ones.more » « less
-
null (Ed.)Low-latency online services have strict Service Level Objectives (SLOs) that require datacenter systems to support high throughput at microsecond-scale tail latency. Dataplane operating systems have been designed to scale up multi-core servers with minimal overhead for such SLOs. However, as application demands continue to increase, scaling up is not enough, and serving larger demands requires these systems to scale out to multiple servers in a rack. We present RackSched, the first rack-level microsecond-scale scheduler that provides the abstraction of a rack-scale computer (i.e., a huge server with hundreds to thousands of cores) to an external service with network-system co-design. The core of RackSched is a two-layer scheduling framework that integrates inter-server scheduling in the top-of-rack (ToR) switch with intra-server scheduling in each server. We use a combination of analytical results and simulations to show that it provides near-optimal performance as centralized scheduling policies, and is robust for both low-dispersion and high-dispersion workloads. We design a custom switch data plane for the inter-server scheduler, which realizes power-of-k- choices, ensures request affinity, and tracks server loads accurately and efficiently. We implement a RackSched prototype on a cluster of commodity servers connected by a Barefoot Tofino switch. End-to-end experiments on a twelve-server testbed show that RackSched improves the throughput by up to 1.44x, and scales out the throughput near linearly, while maintaining the same tail latency as one server until the system is saturated.more » « less
-
The recent framework for spectrum sharing in the 3.5 GHz band allows for Environment Sensing Capability operators (ESCs) to measure spectrum occupancy so as to enable commercial use of this spectrum when federal incumbent users are not present. Each ESC will contract with one or more Spectrum Access Systems (SASs) to provide spectrum occupancy data. Commercial firms using the band will in turn contract with a SAS to determine when it can access the spectrum. Initially, the decisions of which ESC and SAS to partner with will likely be based on long-term contracts. In this paper, we consider an alternative framework, in which an ESC sells its spectrum management information via a spot market so that from periodto- period a commercial user can select a different ESC from which to acquire spectrum measurements. We develop a game theoretic model to analyze such a market and show that using such a spot market may better enable multiple commercial firms to operate in a given spectrum band. We also show that this increased competition may not benefit consumer surplus unless firms adopt a non-stationary strategy profile.more » « less
