Distributed Network Register Using Hash Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Centralized databases in mobile telecommunications networks are costly, complex, and prone to failure, making them inefficient for storing and managing user data across a large network.
Innovation Solution
A decentralized peer-to-peer network with distributed register nodes, using hash tables to store and manage user data, allowing for efficient storage and retrieval of user information across the network, reducing reliance on a single central entity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If a centralized database is used to store user data, then data management is simplified and access is centralized, but the system becomes costly, complex, and prone to failure
Solution Approach 1:
The centralized database is segmented into multiple decentralized register nodes distributed across the network. Each node stores a portion of the user data, eliminating the single point of failure while maintaining data management functionality through distributed hash tables that enable efficient data location and retrieval across the decentralized structure.
2Ease of operation
If a centralized database is used, then all user data can be managed from a single location, but hardware costs and technical complexity increase due to the enormous size required
Solution Approach 1:
The enormous centralized database is divided into smaller data segments distributed across multiple register nodes. Each node manages a manageable portion of the total data, reducing individual hardware requirements while collectively providing the same total storage capacity. The segmentation is organized using distributed hash tables that map data to appropriate nodes.
Solution Approach 2:
The system transitions from a single-dimension centralized storage model to a multi-dimensional distributed architecture. Data is organized across multiple dimensions including geographic distribution of nodes, hierarchical layering with gateway nodes and regular nodes, and functional separation using hash tables, thereby reducing the complexity burden on any single component.
3Productivity
If a centralized database is used, then data access is streamlined, but the network collapses if the database fails
Solution Approach 1:
The system implements redundancy by distributing data across multiple register nodes before any failure occurs. Each node maintains copies or portions of user data, and the distributed hash table structure enables automatic rerouting of data access requests to available nodes, cushioning against failures and preventing network collapse.
4Reliability
If decentralized register nodes are used, then reliability and fail-safety are improved, but data retrieval requires distributed lookup mechanisms
Solution Approach 1:
The system uses distributed hash tables that create virtual copies of the data index across the decentralized network. Each node maintains hash table entries that map user data to the appropriate owning node, enabling efficient data retrieval without requiring complex distributed lookup protocols. The hash table copying mechanism simplifies the retrieval process while maintaining decentralization.
Data Source
AI summary
The invention relates to a method for operating a telecommunications network and a telecommunications network for mobile telecommunication, having a network register in which identifier of mobile terminals and network-related user data of the terminals are stored. The network register is formed from a peer-to-peer network having a multiplicity of decentralized register nodes which are networked with one another and are each associated with a geographic region. Hash tables are held in the register nodes, in which hash tables the identifiers of the terminals are stored as hash values and the user data is stored associated with these hash values. The network has at least a first node associated with a geographic region at which a terminal can register, and a second node, which is permanently assigned to the terminal and is associated with a geographic region. The terminal registers with the first node by transmitting the identifier, when it is located in the first region. The first node then determines network-related user data of the mobile terminal on registration, and determines the hash value for that identifier. This hash value is used to determine the second node. The first node either transmits the network-related user data to this second node or itself stores this user data in his hash table together with the hash value and transmits only its own address in the network to the second node. Either the network-related user data or the address of the first node is then stored, associated with the hash value, in the hash table of the second node.