Service-Aware DHT Routing via Segmented Sub-Rings
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Distributed Hash Table (DHT) protocols lack mechanisms to optimize data retrieval latency and service-level differentiation, as they do not consider locality or network conditions, leading to inefficient storage and retrieval of objects in geographically dispersed networks.
Innovation Solution
Implementing a service-aware DHT system that creates coherent service-based sub-rings within a global ring, allowing objects to be stored and retrieved based on service classes, with nodes participating in multiple service levels and maintaining separate routing tables and databases for each service class, thereby routing operations to the most appropriate sub-ring.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If basic DHT protocols are used to store and retrieve objects based on a single key, then the system is simple to implement, but data retrieval latency is high and service-level differentiation is not supported
Solution Approach 1:
The patent segments the single global DHT ring into multiple service-based sub-rings, where each sub-ring handles a specific service class (e.g., file sharing, messaging, streaming). This segmentation allows objects to be stored and retrieved in the appropriate sub-ring based on their service requirements, reducing retrieval latency by avoiding unnecessary routing through unrelated service nodes while maintaining manageable complexity through modular organization.
Solution Approach 2:
The patent introduces a service class dimension to the traditional single-dimension DHT key-space. Instead of organizing nodes solely by their cryptographic key identifiers, the system adds a service class layer that groups nodes by their functional capabilities and geographical locations. This dimensional extension enables service-aware routing that reduces latency by directing requests to geographically and functionally appropriate nodes.
2Loss of time
If objects are stored in a global DHT ring without service-based organization, then the routing table is simple to maintain, but objects cannot be stored closer to retrieval points
Solution Approach 1:
The routing table is segmented into service-specific routing information. Each node maintains routing tables organized by service class, allowing it to route requests differently based on the service type. This segmentation enables objects to be stored closer to retrieval points by service class while keeping the routing logic manageable through service-based organization rather than a monolithic routing structure.
Solution Approach 2:
The patent applies local quality by having nodes maintain different routing characteristics for different service classes. Each service sub-ring develops localized routing optimizations based on its specific requirements and node distributions. This allows routing to be optimized locally for each service type while maintaining overall system coherence through the global ring structure.
3Productivity
If all nodes participate in a single DHT ring, then the network structure is simple, but service-level differentiation and optimized resource utilization cannot be achieved
Solution Approach 1:
The network structure is segmented into service-based sub-rings that overlay the global DHT ring. Each sub-ring contains nodes that are optimized for specific service classes, enabling differentiated resource utilization. Nodes can participate in multiple sub-rings based on their capabilities, allowing efficient resource allocation while maintaining a manageable overlay structure on top of the simple global ring.
Solution Approach 2:
Nodes in the system are designed with multi-functionality, capable of participating in multiple service sub-rings simultaneously. A single node can serve different service classes (e.g., both file sharing and messaging services), which improves network resource utilization by allowing nodes to contribute their resources to multiple services while maintaining a relatively simple underlying global ring structure.
Data Source
AI summary
In one embodiment, a node in a computer network joins a global ring associated with a distributed hash table (DHT), and maintains a DHT routing table and DHT database for the global ring. In addition, the node may determine a particular service class for which the node is configured, and may join a particular service-based sub-ring according to the particular service class, where all nodes of the particular service-based sub-ring are within the global ring. As such, a service-based DHT routing table and service-based DHT database may be maintained for the particular service-based sub-ring, such that DHT operations identified by the particular service class are routed to the particular service-based sub-ring (e.g., by a portal node).