Hierarchical Distributed Indexing for Location-Aware Peer-to-Peer Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current location-based solutions in peer-to-peer networks rely on hash functions that do not preserve location information, making it impossible to perform searches by specifying end-user location, thus limiting the effectiveness of distributed indexing in scalable and robust network configurations.
Innovation Solution
A method for building DNS-like distributed indexing in peer-to-peer networks through hierarchical network address labeling, where each peer node maintains a pointer to other nodes at all levels of the network address space, allowing for location-aware indexing by exchanging peer table information and updating distributed indexing tables.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If hash functions are used for indexing in peer-to-peer networks, then scalability is improved, but location information is lost
Solution Approach 1:
The patent segments the indexing structure into multiple hierarchical levels (first level, second level, third level, etc.) where each level stores indexing information for specific geographic regions. This segmentation allows the system to maintain scalability through distributed storage while preserving location information at each hierarchical level, resolving the contradiction between scalability and location information retention.
Solution Approach 2:
The patent introduces a hierarchical dimension to the traditional flat hash-based indexing structure. By organizing indexing tables across multiple levels representing different geographic granularities, the system adds a dimensional layer that simultaneously supports scalability (through distribution) and location-awareness (through hierarchical organization), thereby resolving the information loss problem.
2Ease of operation
If centralized management is used for indexing, then ease of operation is improved, but scalability deteriorates
Solution Approach 1:
The patent implements self-service by enabling each peer node to autonomously maintain and update its own distributed indexing table without requiring centralized management. Each node independently stores and updates indexing information for itself and other nodes, allowing the system to scale horizontally while maintaining operational simplicity through decentralized autonomy, thus resolving the scalability-ease of operation contradiction.
3Speed
If service points are deployed close to end users, then latency is reduced, but device complexity increases
Solution Approach 1:
The patent applies preliminary action by pre-establishing a hierarchical distributed indexing structure before service deployment. The indexing tables are pre-organized across multiple levels representing different geographic regions, enabling nodes to quickly locate and connect to nearest service points without complex real-time calculations, thereby reducing latency while managing device complexity through pre-computed organizational structures.
Data Source
AI summary
A system and method for creating and updating a distributed indexing table for peer nodes in a peer-to-peer network. In one embodiment, a method includes providing, from a first node to a second node of the peer-to-peer network, a first level of a first plurality of levels for a first designator identifying the first node and entered in a first distributed indexing table stored in the first node. The method also includes receiving, at the first node from the second node, a corresponding first level of a second plurality of levels for a second designator identifying the second node and entered in a second distributed indexing table stored in the second node, and updating the corresponding first level of the second plurality of levels for the second designator within the first distributed indexing table of the first node.