Published January 6, 2026
| Version v1
Journal article
Open
Simplemux traffic optimization protocol
Description
This paper presents a user-space C implementation of Simplemux, an experimental network protocol designed to improve efficiency and reliability in packet-switched networks. It provides two main functionalities: (i) traffic saving, by aggregating small packets into larger ones to reduce bandwidth consumption and packets per second; and (ii) fast delivery grant, by redundantly sending critical packets to minimize latency over unreliable links. The implementation includes three flavors (compressed, fast, blast), multiple transport modes, Robust Header Compression, and configurable multiplexing policies. Simplemux has been applied in research on online gaming, VoIP optimization, and smart grid communications.
Highlights
-
Simplemux is a protocol designed to address network inefficiency and delivery uncertainty.
-
The traffic saving functionality improves the low network efficiency caused by small packets.
- The fast delivery grant functionality is useful for services with critical latency constraints.
-
A user-space implementation of Simplemux in C is provided.
-
Perl and Lua scripts, and also Wireshark captures are included in the repository.
Files
1-s2.0-S2352711025004601-main.pdf
Files
(3.2 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:1f5966577a50d06d293087f0affdf097
|
3.2 MB | Preview Download |
Additional details
Funding
Dates
- Available
-
2026-01-06
- Accepted
-
2025-12-16
- Submitted
-
2025-10-06
- Updated
-
2025-12-05