Transport coding reduces message delay in packet-switched networks by introducing controlled redundancy at the transport layer: $k$ original packets are encoded into $n\ge k$ coded packets, and the message is reconstructed after the first $k$ successful deliveries, effectively shifting latency from the maximum packet delay to the $k$-th order statistic. We present a concise, reproducible discrete-event implementation of transport coding in OMNeT++, including a multi-hop Kleinrock-type network, FIFO queues, exponential service and link delays, and explicit receiver-side reconstruction that records message delay and deadline violations. Using paired uncoded ($n{=}k$) and coded ($n{>}k$) configurations at the same message generation rate, we compare delay, reliability, and saturation effects across code rates and input loads. Simulation results show consistent reductions of average delay and late-delivery probability for moderate redundancy, while keeping the saturation throughput close to the uncoded baseline. The proposed model provides a transparent bridge between analytical transport-coding formulas and executable simulation for tuning redundancy in low-latency services.

翻译：传输编码通过在传输层引入受控冗余来降低分组交换网络中的消息延迟：将$k$个原始数据包编码为$n\ge k$个编码数据包，并在前$k$个数据包成功交付后即可重构消息，从而将延迟从最大包延迟有效转移至第$k$阶统计量。我们提出了一种在OMNeT++中简洁、可复现的传输编码离散事件实现方案，包含多跳Kleinrock型网络、FIFO队列、指数型服务与链路延迟，以及记录消息延迟和截止时间违规的显式接收端重构机制。通过在同一消息生成速率下对比未编码（$n{=}k$）与编码（$n{>}k$）配置，我们分析了不同码率与输入负载下的延迟、可靠性和饱和效应。仿真结果表明，适度冗余能在保持饱和吞吐量接近未编码基准的同时，持续降低平均延迟和超时交付概率。所提模型为解析传输编码公式与可执行仿真之间建立了透明桥梁，可用于优化低延迟服务中的冗余配置。