Routing Device Request Queue for Information-Centric Network Congestion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In information-centric communication networks that use name routing, congestion caused by excessive data segments leads to delayed or lost transmissions, affecting multiple client entities requesting the same data segment due to the aggregation function of routing nodes, which is not addressed in conventional communication models with physical addressing.
Innovation Solution
A communication method where a routing device verifies the input bit rate for a link and delays requests if it exceeds a threshold, using a queue to manage requests and retransmit them based on available residual bit rate, ensuring equitable access and reducing memory requirements by storing smaller request packets rather than full data segments.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If routing nodes aggregate requests for data segments, then network efficiency is improved through request consolidation, but multiple client entities are affected when data segments are deleted due to congestion
Solution Approach 1:
The patent applies preliminary action by checking the input bit rate before routing requests and delaying requests when congestion is detected. This preventive approach checks bandwidth availability in advance and holds requests in a queue until conditions are favorable, preventing data segment loss before it occurs rather than dealing with failures after aggregation
Solution Approach 2:
The patent introduces an intermediary mechanism in the form of a request queue that mediates between incoming requests and the network transmission. This queue acts as a buffer, allowing requests to be held and released in a controlled manner based on bit rate conditions, thus protecting against congestion while maintaining the aggregation benefit
2Speed
If requests are transmitted without delay, then client entities receive data segments quickly, but network congestion occurs when too many data segments are routed simultaneously
Solution Approach 1:
The patent applies periodic action by transmitting requests in periodic batches rather than continuously. Requests are held in a queue and released periodically when bit rate conditions permit, creating a rhythm of transmission that prevents overwhelming the network while still maintaining overall fast delivery through efficient batch processing
Solution Approach 2:
The patent applies dynamics by making the request transmission rate adaptive rather than fixed. The system dynamically adjusts transmission timing based on real-time bit rate conditions, accelerating transmission when bandwidth is available and delaying when congestion is detected, thus optimizing both speed and congestion avoidance
3Productivity
If routing nodes store pending requests, then request aggregation is improved, but memory requirements increase when storing full data segments
Solution Approach 1:
The patent applies segmentation by dividing the request processing into separate components: a compact request identifier that is stored in memory, and the actual data segment that flows through the network. This allows multiple requests to be aggregated and tracked using small identifiers without requiring large memory capacity, while the full data segments are transmitted only when needed
Solution Approach 2:
The patent uses copying by creating and storing only lightweight copies of request information (identifiers and metadata) in the pending request table, rather than storing full data segments. This allows efficient aggregation and tracking of multiple requests using minimal memory, while the actual data segments are obtained from the network only when required
Data Source
Figure 1~4
Figure 2a~3b
Figure 5a~5b
AI summary
The invention concerns a communication method implemented by a routing device (20-28) in an information-centred communication network (1). The method comprises the following steps implemented to process a request relative to a data segment from a given stream, said request being to be routed on a link of the routing device: - a step of checking that an input bit rate for said link is higher than a threshold, the input bit rate for said link corresponding to that which is necessary for the device to receive, by means of said link, a set of data segments corresponding to pending requests; - a step of timing said request to be routed. In a first embodiment, the threshold corresponds to the bit rate available on this link at the device input. In a second embodiment, the input bit rate is determined for pending requests related to data segments from the given stream, and the threshold corresponds to a fair bit rate.