Packet Buffer Memory With Package Descriptors For DRAM Scheduling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing packet buffer systems face challenges in high bit rate communication networks due to the slow access time of DRAM and the high cost and power consumption of SRAM, with limitations in memory utilization and scalability, especially when dealing with multiple queues.
Innovation Solution
The introduction of packages as logical storage containers that aggregate multiple packets, allowing for contiguous memory usage and reduced scheduling frequency, enabling the use of DRAM for higher memory utilization and scalability by employing a package scheduler and queue manager to manage physical memory pages.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Use of energy by stationary object
If DRAM is used as main buffer memory to reduce cost and power dissipation, then cost and power consumption are reduced, but access time increases making it unsuitable for high bit rate networks
Solution Approach 1:
The patent segments the buffer memory into multiple queues, where each queue is managed independently with its own head and tail pointers. This segmentation allows the system to serve multiple traffic flows simultaneously through parallel access patterns, effectively masking the slow access time of DRAM and enabling high bit rate operation without requiring expensive SRAM.
2Speed
If SRAM is used to provide fast access time for high bit rate networks, then access speed is improved, but cost and power consumption increase significantly
Solution Approach 1:
The patent implements dynamic queue management where the buffer allocates memory space to queues based on actual traffic demand rather than static pre-allocation. The queue manager dynamically adjusts the head and tail positions within the DRAM buffer, allowing the system to achieve SRAM-like responsiveness for active queues while maintaining the cost and power efficiency of DRAM for the overall buffer structure.
3Reliability
If fixed portion of buffer memory is allocated to each queue, then queue isolation is ensured, but elastic sharing of buffer memory is reduced
Solution Approach 1:
The patent allows queues to exceed their allocated portion of the buffer when sufficient memory space is available, implementing elastic sharing. The queue manager monitors buffer utilization and permits queues to expand into unused space dynamically, ensuring that high-priority queues can utilize more buffer space when needed while maintaining isolation guarantees when the buffer is full.
4Adaptability or versatility
If DRAM with random access properties is used, then flexible memory allocation is enabled, but access time exceeds maximum permitted time for line-rate transmission
Solution Approach 1:
The patent implements a queue manager that performs preliminary actions by pre-positioning packet data and maintaining ready queues in DRAM before transmission is needed. The system pre-allocates buffer spaces and prepares packet sequences in advance, so that when line-rate transmission is required, the data is already positioned for immediate sequential access, eliminating the need for slow random access operations during critical transmission windows.
Data Source
AI summary
The present invention relates to a data buffer memory (104) and method for storing data in a data communications network, and to a data buffer system (100) comprising such a data buffer memory. The data buffer memory comprising a data section (104a′) comprising a number of memory pages (104a); and a package descriptor section (104b′) comprising a 5 number of package descriptors (104b); wherein at least one queue (103) of packets is stored in the data section (104a′) as an ordered set of packages, and wherein a package is an ordered set of packets.


