Credit-Based Queue Management for Name-Based Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In content-centric communication networks, routing nodes face congestion issues due to aggregation of requests, leading to the inability to store and route new data segments, which affects multiple client entities and increases network load during segment renewal.
Innovation Solution
A method where a routing device determines a credit associated with a stream based on client requests, selects a stream with the lowest credit for storage, and removes data segments from that stream when queue memory is full, ensuring that new data segments can be stored and routed to client entities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If routing nodes aggregate requests and queue data segments, then routing efficiency is improved, but queue overflow occurs when memory space is insufficient, causing data segment loss
Solution Approach 1:
The patent introduces a credit-based mechanism that tracks the number of active requests for each stream. When queue memory is full, the system removes data segments from streams with the lowest credit values (fewest active requests), thereby dynamically adjusting queue management based on real-time demand parameters and preventing arbitrary data loss.
2Productivity
If routing nodes aggregate requests from multiple client entities, then network load is reduced, but congestion occurs during data segment transmission affecting multiple clients simultaneously
Solution Approach 1:
The patent applies different quality treatment to different streams based on their credit values. Streams with higher credit (more active requests) are prioritized for data segment retention, while streams with lower credit are more likely to have segments removed when queue capacity is exceeded. This localized differentiation ensures that congestion management protects the most demanding streams while allowing lower-priority streams to be discarded.
3Ease of operation
If routing nodes store data segments in queues, then data segment routing is enabled, but memory space constraints limit the number of storable segments
Solution Approach 1:
The patent uses credit values as a parameter to dynamically determine which data segments to retain or remove from the queue. By tracking the number of active requests per stream and using this information to make eviction decisions, the system optimizes queue utilization and extends effective storage capacity beyond physical memory constraints.
Data Source
Figure 1~4
Figure 2
AI summary
The invention relates to a communication method to be implemented by a routing device (20-23) in a communication network (1) implementing name-based routing. Said device is suitable for aggregating a plurality of requests relating to one data segment of a stream into another request, and for storing data segments belonging to different streams in a queue before the device routes said data segments toward client entities having requested same. The method includes: a step of determining a credit associated with a stream, said credit varying according to a number of requests transmitted by client entities and relating to data segments belonging to the stream; and, upon receiving a data segment in response to said other request, when the available memory space of the queue does not make it possible to store the received data segment: a step of selecting a stream, wherein a stream having at least one data segment stored in the queue, and for which the associated credit is the smallest, is selected; and a step of removing a data segment belonging to the selected stream from the queue, said method also including a step of routing the data segment towards client entities having requested same after the extraction thereof from the queue.