Binding Information Cleanup for Stale 5G Session Registrations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In 5G networks, the binding information service fails to accurately manage UE and PDU session information due to PCF failures, leading to inactive but still registered data, causing resource waste and service denial.
Innovation Solution
A binding information service is implemented to detect and remove outdated or inactive binding information using criteria-based queries and responses between BSF and PCF, ensuring accurate and current data management.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the BSF passively waits for PCF to deregister binding information, then the system structure remains simple, but binding information becomes outdated and causes resource waste when PCF fails
Solution Approach 1:
The BSF implements a proactive feedback mechanism by periodically querying the PCF to verify whether binding information should still be retained. This feedback loop ensures that outdated binding information is detected and removed, resolving the contradiction between maintaining accurate binding information and avoiding excessive system complexity.
Solution Approach 2:
The BSF performs preliminary actions by proactively querying the PCF before binding information becomes completely outdated. By initiating verification queries at scheduled intervals, the system prevents the accumulation of stale binding information while maintaining a relatively simple operational structure.
2Reliability
If the BSF proactively queries PCF to verify binding information, then binding information accuracy improves, but network signaling overhead increases
Solution Approach 1:
The BSF implements periodic action by querying the PCF at scheduled time intervals rather than continuously or on every event. This periodic verification approach maintains binding information accuracy while significantly reducing network signaling overhead compared to continuous verification mechanisms.
Solution Approach 2:
The BSF applies partial action by querying only a subset of binding information entries at each interval rather than verifying all bindings continuously. This selective verification maintains sufficient accuracy while minimizing the network signaling overhead associated with comprehensive verification.
3Productivity
If multiple PCFs are deployed for load balancing, then service capacity increases, but the complexity of managing binding information across multiple PCFs increases
Solution Approach 1:
Each PCF independently manages its own binding information registrations and deregistrations with the BSF. The PCFs self-service their binding information without requiring complex centralized coordination, allowing multiple PCFs to operate in parallel while the BSF simply performs periodic verification on each binding entry regardless of which PCF owns it.
Solution Approach 2:
The system segments binding information management by PCF, where each PCF is responsible for its own bindings. The BSF handles multiple PCFs independently through standardized query and deregistration procedures, allowing the system to scale to multiple PCFs without proportionally increasing management complexity.
Data Source
AI summary
A method, a system, and a non-transitory storage medium are described in which an binding information service is provided. The binding information service may include applying one or multiple criteria to binding information stored by a binding service function. The binding information service may identify candidate binding information instances that may need deletion based on the one or multiple criteria. The binding information service may interrogate a policy control network device as to the current registrability of the binding information. The binding information service may delete or maintain the binding information based on a result of the interrogation. The binding information service may also include directing the binding service function to delete binding information based on one or multiple criteria. The one or multiple criteria may relate to the age of the binding information or a last time the registrability of the binding information was confirmed.