SBR Database Reconfiguration Using Dual Assignment Algorithms
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current solutions for reconfiguring subscriber binding repository (SBR) databases in data communications networks fail to efficiently manage data distribution across multiple servers without disrupting real-time access, especially during changes in network capacity or site relationships.
Innovation Solution
The method involves using multiple assignment algorithms to select and reconfigure SBR servers, associating records with creation signatures to ensure seamless data relocation during reconfiguration, allowing for operations like resizing, mating, and moving database partitions without interrupting service.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If SBR database reconfiguration is performed by changing server assignments or mated site relationships, then SBR capacity and data distribution are improved, but real-time access to existing sessions and bindings is disrupted
Solution Approach 1:
The system performs preliminary actions by creating a new assignment algorithm alongside the existing one before reconfiguration begins. During the transition, both old and new assignment algorithms are supported, allowing the system to prepare for changes without immediately disrupting service. This enables seamless switching from the old assignment to the new assignment once the transition is complete.
Solution Approach 2:
The patent introduces an intermediary mechanism by supporting multiple assignment algorithms simultaneously during the transition period. The system acts as a mediator between the old and new server assignments, allowing requests to be routed appropriately regardless of which assignment algorithm was used to create the session or binding. This intermediary approach prevents service disruption during reconfiguration.
2Productivity
If SBR database reconfiguration is performed to add or move database partitions, then SBR capacity and network growth accommodation are improved, but data location determination becomes more complex
Solution Approach 1:
The system segments the assignment algorithm functionality by maintaining separate, distinct assignment algorithms for different time periods or configurations. Each assignment algorithm is independent and can be managed separately, allowing the system to handle multiple server configurations without creating a monolithic complex system. This segmentation simplifies the overall complexity by breaking it into manageable, independent components.
Solution Approach 2:
The patent applies parameter changes by modifying the assignment algorithm parameters (such as the number of servers or their identities) rather than changing the fundamental algorithm structure. The system can adjust parameters like server count, server identities, and mated site relationships while maintaining the same assignment logic, thereby accommodating network growth and reconfiguration without significantly increasing system complexity.
3Productivity
If traditional database reconfiguration methods are used, then server capacity changes are achieved, but data loss or access interruption occurs
Solution Approach 1:
The system ensures continuity of useful action by maintaining support for both the old and new assignment algorithms during the transition period. This allows the SBR database to continue serving requests without interruption while the reconfiguration progresses. The useful action of handling session and binding requests continues uninterrupted even as the underlying server assignments change.
Solution Approach 2:
The patent implements beforehand cushioning by preparing the system to handle both old and new assignment algorithms simultaneously before the actual reconfiguration completes. This cushioning mechanism protects against data loss or access interruption by ensuring that requests can be successfully routed regardless of which assignment algorithm is being used, providing a buffer during the vulnerable transition period.
Data Source
AI summary
Methods, systems, and computer readable media for reconfiguring a session binding repository (SBR) database for a data communications network. In one example, a method includes, before reconfiguring the SBR database, selecting a first plurality of SBR servers for storage of a first plurality of SBR records using a first assignment algorithm. While reconfiguring the SBR database, the method includes selecting a second plurality of SBR servers for storage of a second plurality of SBR records using a second assignment algorithm and searching for a first plurality of stored records in the SBR database based on both the first and second assignment algorithms. After reconfiguring the SBR database, the method includes selecting a third plurality of SBR servers for storage of a third plurality of SBR records using the second assignment algorithm and searching for a second plurality of stored records in the SBR database based on the second assignment algorithm and ceasing searching in the SBR database based on the first assignment algorithm.