Data Locality Table for Telecommunication Network Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Stateful application servers in telecommunications networks face challenges in scaling linearly with existing scalable computing resources, due to the need for maintaining session stores and ensuring high availability, which limits their ability to adapt to changing demands and workload.
Innovation Solution
The implementation of a system that uses logical scalable units with a data locality table and database proxy architecture to route communication messages efficiently, allowing stateful application servers to scale elastically by storing data in close proximity to the application components, reducing latency and improving response times.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If stateful application servers maintain session stores for high availability, then reliability is improved, but scalability deteriorates
Solution Approach 1:
The patent segments the session store into distributed partitions across multiple servers. Each server maintains only a portion of the session data, allowing the system to scale horizontally by adding more servers while maintaining high availability through distributed redundancy. This resolves the contradiction by enabling both reliability (through distribution) and scalability (through modular growth).
Solution Approach 2:
The patent introduces a session management intermediary layer that sits between application servers and session data. This intermediary handles session routing, creation, and deletion operations, allowing application servers to scale independently while the intermediary maintains session availability. The intermediary acts as a mediator that decouples the scalability requirements of application servers from the reliability requirements of session storage.
2Adaptability or versatility
If data is stored remotely in distributed databases, then scalability is improved, but latency increases
Solution Approach 1:
The patent implements local session stores on each application server that cache frequently accessed session data. This local quality approach allows servers to access hot data without remote database calls, reducing latency for common operations while maintaining the scalability benefits of the underlying distributed database for persistent storage and capacity expansion.
3Loss of time
If session stores are centralized, then data locality is improved, but scalability deteriorates
Solution Approach 1:
The patent transitions from a single-dimensional centralized storage model to a multi-dimensional distributed architecture. Session data is organized across multiple dimensions including server instances, data partitions, and replication factors. This dimensional expansion allows the system to maintain efficient data locality within each partition while achieving overall scalability through the distributed structure.
Data Source
AI summary
A combination of an independent key routing (IKR) method and a data locality table (DLT) method may be used to route communication messages in a telecommunication network to achieve improved data locality and reduce secondary key lookups. A processor a multiprocessor computing system may receive a first communication message that includes subscriber identifiers that uniquely identify a subscriber, generate a plurality of keys for a plurality of message types based on the subscriber identifiers, identify a first logical scalable unit that includes a first database memory that stores a first type of data relating to the subscriber by using a first key of the plurality of keys to query a data locality table, identify a first application processor in the multiprocessor computing system that is part of the first logical scalable unit, and send the first communication message and the plurality of keys to the first application processor.