Network Flow Queue Memory Allocation Prioritization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing techniques for differentiated services in communications networks, such as Diffserv, are difficult to implement due to the need for explicit packet marking, and they do not efficiently manage flows with varying quality of service requirements, especially when new services appear or when flows consist of multiple services with different processing needs.
Innovation Solution
A method that selects flows based on the memory space allocated in a queue, allowing real-time flows with limited memory to be prioritized and non-real-time flows to be managed by eliminating packets when memory is scarce, eliminating the need for explicit packet marking and enabling flexible processing of flows with mixed service requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If explicit packet marking is used to differentiate flows according to quality of service requirements, then flow differentiation capability is improved, but implementation complexity increases significantly
Solution Approach 1:
The patent extracts the quality of service differentiation mechanism from the packet marking approach. Instead of marking packets individually, the system extracts and monitors the cumulative memory space allocated to each flow in the queue, using this aggregate metric to infer service type and apply appropriate processing priority.
Solution Approach 2:
The system uses the queue memory allocation mechanism itself to provide quality of service differentiation. The memory space allocation automatically reflects the service requirements of different flows, allowing the system to self-differentiate without external marking mechanisms or complex configuration.
2Ease of manufacture
If fixed association between service and quality of service class is used, then processing is simplified, but adaptability to new services is reduced
Solution Approach 1:
The patent transitions from static service-class associations to dynamic differentiation based on real-time memory space monitoring. The system continuously monitors the memory space allocated to each flow and dynamically adjusts processing priority based on the observed memory consumption patterns, which reflect the actual service requirements.
Solution Approach 2:
The system uses memory space allocation as a dynamic parameter to differentiate services. Instead of relying on fixed service identifiers, the system monitors changes in memory space allocation across different flows and uses these parameter changes to infer service types and apply appropriate processing.
3Device complexity
If all flows are treated equally in the queue, then processing is simplified, but quality of service requirements for real-time services are not met
Solution Approach 1:
The patent applies local quality differentiation based on the memory space characteristics of each flow. Instead of uniform processing, the system monitors the memory space allocated to each flow and applies different processing priorities locally to flows with small memory allocation (real-time services) versus those with large allocation (non-real-time services).
4Ease of manufacture
If memory space is not managed efficiently, then packet storage is simple, but network resources are wasted
Solution Approach 1:
The system implements feedback-based memory management by continuously monitoring the memory space allocated to each flow and using this information to adjust processing priorities. Flows with excessive memory allocation receive lower priority processing, while flows with limited memory (real-time services) receive higher priority, optimizing network resource utilization.
Data Source
AI summary
The disclosure relates to an apparatus and associated methodology for processing flows. Data packets belonging to various flows are received by a device of a communications network and stored in a queue so as the device retransmits them. In order to re-transmit a data packet, a flow is selected, to which the least memory space in the queue is allocated. A packet from the selected flow is retransmitted and extracted from the queue, and when the memory space available in the queue does not allow a received packet to be stored. Further a flow is selected to which the most memory space in the queue is allocated and a data packet of the selected flow is eliminated from the queue.


