Cluster Buffer Management for Network Packet Storage

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current network devices face challenges in efficiently managing buffer pools due to resource consumption issues when handling packets of varying sizes, leading to suboptimal storage space utilization and bandwidth inefficiencies.

Innovation Solution

A method and apparatus for dynamically allocating buffers to form cluster buffers based on data amounts, with conditions to end storage operations when remaining space or buffer quantity thresholds are met, enhancing space utilization and alleviating transmission delays.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If a small-capacity buffer is used to store huge data packets, then multiple buffers need to be connected, but this increases resource consumption in managing the buffers

Engineering Contradiction:
Improvebuffer capacityVSAvoidbuffer management complexity
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent merges multiple small-capacity buffers into a cluster buffer that functions as a single large-capacity buffer. The buffer management unit manages multiple physical buffers as one logical buffer, reducing the number of buffer allocation and management operations needed when handling huge data packets, thereby decreasing resource consumption while maintaining the ability to store large amounts of data

Inventive Principle:
Principle #5Merging (Combining)

2Quantity of substance

If a large-capacity buffer is used to store small data packets, then storage space of the large-capacity buffer cannot be used effectively, but this improves storage availability

Engineering Contradiction:
Improvestorage space utilizationVSAvoidbuffer adaptability to different packet sizes
Core Design Contradiction:
Quantity of substanceVSAdaptability or versatility

Solution Approach 1:

The patent segments a large-capacity buffer into multiple smaller buffer units that can be dynamically allocated. The buffer management unit divides the large buffer into multiple physical buffers, each capable of handling small data packets independently. When small packets are received, only the necessary portion of the buffer is used, improving storage space utilization while maintaining adaptability to different packet sizes through dynamic allocation

Inventive Principle:
Principle #1Segmentation

3Quantity of substance

If buffers are dynamically allocated based on data amount, then space utilization increases, but this requires complex allocation logic

Engineering Contradiction:
Improvebuffer space utilizationVSAvoidallocation logic complexity
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The buffer management unit implements self-service mechanisms where buffers automatically allocate and deallocate based on predefined thresholds and data characteristics. The system monitors buffer usage and automatically performs allocation or merging operations without requiring complex external control logic, thereby improving space utilization while keeping the allocation logic relatively simple through automated decision-making

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS11954032B2Apparatus for managing buffers and method thereof
Publication Date: 2024.04.09 REALTEK SINGAPORE PTE LTD
  • US11954032B2 patent drawing
  • US11954032B2 patent drawing
  • US11954032B2 patent drawing

AI summary

An apparatus for managing buffers and a method thereof are provided. The method for managing buffers includes: receiving a plurality of pieces of data, where the plurality of pieces of data includes a first piece of data and a second piece of data; allocating at least one buffer to establish a cluster buffer according to a data amount of the first piece of data; and if at least one of a first condition and a second condition is satisfied, ending a storage operation of the cluster buffer, where the first condition is that a total remaining space of the at least one buffer that has stored the data in the cluster buffer is less than a remaining space threshold, and the second condition is that the quantity of the at least one buffer that has stored the data in the cluster buffer reaches a cluster threshold.