netdev - [RFC] Simple Path Compression Algorithm for Network Routes

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [day] [month] [year] [list]

Message-Id: <9GBBVS.PKEI5BX1FR3T@lavabit.com>
Date: Sat, 26 Apr 2025 09:31:21 +0300
From: Валери Владев <vdev@...abit.com>
To: netdev@...r.kernel.org
Subject: [RFC] Simple Path Compression Algorithm for Network Routes

Hello netdev,

Following my previous email, I'm sharing a simplified C implementation 
of a path compression algorithm, designed for compact storage of 
network routes or similar sequences. It uses bitmasks (letters_table) 
and a skipping mechanism (count_uper_bits) to reduce memory usage.

Key features:
- Inserts paths (e.g., [0,1,2]) with weights (e.g., latency).
- Compresses shared prefixes for efficiency.
- Licensed under GPL v2.

Potential applications:
- Network routing tables (e.g., BGP).
- Sequence storage (e.g., dictionaries).

The code (pathcomp.c) is attached. It's minimal to encourage community 
feedback and extensions, such as adding search, deletion, or 
optimizations for large networks.

I'd appreciate any comments or suggestions for integration in Linux 
networking projects.

Thanks,
Валери Владев <vdev@...abit.com>

View attachment "pathcomp.c" of type "text/x-csrc" (3209 bytes)