TUTORIALS 》 Circular Ring Buffers Architecture - Linux Kernel - Device Drivers - Network Stack
A circular buffer, circular queue, cyclic buffer or ring buffer is a data structure is a fixed-size buffer as if it were connected end-to-end or can be a dynamic one if implemented via Linked Lists. This is a data-structure quite popularly used in many parts of Linux Kernel such as Device Drivers, especially Network Hardware drivers, Network Packet Buffer such as sk_buff and so on. We can use a Ring Buffer in user-space application programming too. These kind of buffers are more suited for holding steady stream of incoming data. For example Network Packets. If the buffer gets full, we can discard the oldest buffer elements (such as packets). And to avoid we can increase the buffer size. So circular ring buffers plays a major role especially in Network Appliances such as Routers, Firewalls, etc.
Here is an extensive Youtube video of mine on Circular Ring Buffers, its Architecture and the big picture:
Circular Ring Buffers Live Visual Demo | Linux Kernel | Device Drivers | Network Stack:
Here is yet another series of videos in which I did Live Visual Demo or animation of Circular Ring buffers. This depects real-world
use-case scenarios such as Device Drivers, some Linux Kernel Data-structures, Network Stack Packet buffers and so on.
Also recommend to watch:
Featured Video:
Suggested Topics:
Join The Linux Channel :: Facebook Group ↗
Visit The Linux Channel :: on Youtube ↗
💗 Help shape the future: Sponsor/Donate
Recommended Topics:
Featured Video:
Trending Video:
Recommended Video: