Slice Admission Control

SAC validates every incoming session request against the slice's maximum resource quota—a hard ceiling on compute, storage, and radio resources. If accepting the session would exceed the quota, the request is rejected immediately. This prevents the noisy neighbor problem, where one slice's traffic surge starves others sharing the same physical infrastructure. Quotas are typically defined in terms of Physical Resource Blocks (PRBs) in the RAN, virtual CPU cores in the core, and throughput guarantees in the transport network.

Admission decisions are not binary accept/reject—they are SLA-aware. The controller evaluates whether the new session can be accommodated without violating existing Guaranteed Bit Rate (GBR) commitments or latency bounds for in-progress sessions. For example, a URLLC slice may reject a new session even if resources are nominally available, because the additional scheduling overhead would risk breaching the 1ms latency SLA for existing industrial automation traffic. This requires real-time telemetry from the Network Data Analytics Function (NWDAF).

When resources are scarce, SAC implements priority-based preemption. Sessions are assigned an Allocation and Retention Priority (ARP) value. A high-priority emergency services session can trigger the preemption of a lower-priority eMBB streaming session to free resources. The preempted session is not dropped silently—it receives a cause code indicating resource unavailability, allowing the UE to reattempt on a different slice or after a backoff period. This ensures critical services maintain continuity during congestion events.

In energy-efficient slicing architectures, SAC incorporates power consumption models into its decision logic. Rather than simply checking resource availability, the controller evaluates the marginal energy cost of accepting a session. It may steer the request to a slice instance hosted on hardware operating at a more efficient point on its Dynamic Voltage and Frequency Scaling (DVFS) curve, or defer admission to consolidate load and enable Cell Discontinuous Transmission (Cell DTX) on underutilized carriers. This aligns session admission with sustainability targets.

A slice spans RAN, transport, and core domains. SAC must therefore coordinate admission across all three simultaneously. A session accepted in the RAN but rejected in the core due to User Plane Function (UPF) overload creates a wasteful signaling storm. Modern SAC functions interface with the Slice Orchestrator to perform atomic admission checks—resources are reserved across all domains before a success response is sent to the UE. This transactional approach prevents stranded resources and ensures end-to-end slice integrity.

Reactive SAC—checking current load—is insufficient for slices with bursty traffic. Predictive admission control uses time-series forecasting models, often deployed within the NWDAF, to anticipate resource contention seconds or minutes in advance. If a surge in URLLC traffic is predicted, the SAC can proactively throttle eMBB admissions before congestion materializes. This closed-loop approach, combining prediction with preemptive action, is a cornerstone of Zero-Touch Network Provisioning and self-optimizing slice management.

The NSSAI is the primary identifier used by User Equipment (UE) to request a specific slice. During the admission control process, the Slice Admission Control Function (SACF) validates the requested Single-NSSAI (S-NSSAI) against the UE's subscription and the slice's available resources. A mismatch or unauthorized request results in immediate rejection, enforcing strict tenant isolation from the very first signaling message.

The Service Level Agreement defines the quantitative boundaries for admission control. It specifies the Guaranteed Bit Rate (GBR), maximum packet loss, and latency budgets. The admission control algorithm uses these thresholds to calculate the required resources for a new PDU session. If admitting the session would cause the slice to violate its SLA for existing users, the request is denied to maintain contractual performance guarantees.

A capacity management strategy where the orchestrator allocates more virtual resources than physically available, relying on statistical multiplexing. Slice Admission Control must be tightly integrated with the overbooking policy to decide when to safely oversubscribe. A conservative admission policy rejects sessions early to prevent congestion, while an aggressive one leverages overbooking to maximize infrastructure utilization, risking SLA violations during peak loads.

The NWDAF provides predictive analytics that transform admission control from a reactive to a proactive function. By consuming NWDAF insights on predicted slice load and user mobility patterns, the admission controller can preemptively reserve resources or redirect requests. For example, if the NWDAF forecasts a surge in URLLC traffic, the admission control can temporarily restrict new eMBB sessions to safeguard mission-critical communications.

The ability of a slice to dynamically scale its resources is a direct input to admission control logic. When a slice reaches its current capacity limit, the admission controller can trigger a scale-out request to the Slice Orchestrator instead of rejecting the session. The admission decision then becomes a function of the orchestrator's response time and the feasibility of acquiring additional virtualized resources without violating the Slice SLA of co-located instances.

A core design principle enforced by admission control. The mechanism must ensure that a new session in one slice does not degrade the performance of another slice sharing the same physical infrastructure. This requires the admission controller to have a global view of resource partitioning. It rejects requests not only when the target slice is full, but also when admitting the session would consume shared physical resource blocks needed to maintain the isolation guarantees of a neighboring high-priority slice.