Distributed Server Routing Table for Data Processing Latency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional message queue systems face inefficiencies in data processing speed due to high communication overhead and latency, particularly in large-scale distributed systems like online stock trading and streaming processing, where the Chord method often results in multiple hops and increased latency.
Innovation Solution
An information processing apparatus that adds an identifier based on reception order to access requests, retrieves and stores information about the processing server in a distributed network, and replies with the stored information to the client terminal, optimizing data processing by reducing internal transfer overhead and improving communication efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If the Chord method is used for data distribution in a large-scale distributed system, then data can be distributed across multiple servers, but communication overhead increases and latency increases due to multiple hops
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing routing information in a routing table at each server before data transmission occurs. When a data transmission request is received, the server uses the pre-stored routing table to determine the optimal path and next hop server, eliminating the need for real-time multi-hop queries and reducing communication latency significantly.
Solution Approach 2:
The routing table acts as an intermediary mechanism between data transmission requests and the actual data path selection. Instead of directly querying the entire distributed system for routing information, the routing table provides a localized intermediary structure that mediates the routing decision process, enabling fast lookup and reducing the number of communication hops required.
2Speed
If each server manages destination information for all servers in the distributed system, then routing can be optimized, but the amount of destination information to manage increases significantly
Solution Approach 1:
The patent applies segmentation by dividing the complete routing information into segments stored at individual servers. Instead of requiring each server to manage destination information for all servers in the system, each server maintains a routing table containing only the routing information relevant to its local operations and immediate neighbors, significantly reducing the information management burden while maintaining efficient routing capability.
3Reliability
If a large amount of destination information is managed at each server, then routing accuracy improves, but communication traffic for life-and-death monitoring and synchronizing processing increases
Solution Approach 1:
The patent applies partial action by having each server manage and store only the routing information it needs for local operations rather than complete destination information for all servers. This partial information management approach maintains sufficient routing accuracy for reliable data transmission while dramatically reducing the communication traffic required for monitoring and synchronizing processing across the distributed system.
Data Source
AI summary
An information processing apparatus includes a memory; and a processor to execute a process including: adding an identifier based on a reception order to an access request indicating a transmission request or a reception request of a block of data received from a client terminal; retrieving, from among information processing apparatus which is included in a distribution-type network which distributes transmitting and receiving processing of a data, an information of the information processing apparatus which processes an access request added with the identifier which is scheduled to be added; storing, in the memory, the information of the information processing apparatus in association with the identifier which is scheduled to be added; and replying the information, which is stored in association with the identifier in the memory when the identifier is added to an access request, to the client terminal.