Optimal Packetization Towards Low Latency in Random Access Networks (extended version)
Zihong Li, Anshan Yuan, and Xinghua Sun

TL;DR
This paper investigates how packet size affects mean queueing delay in random access networks and proposes optimal packetization strategies to minimize delay, considering both connection types and real-world scenarios like NTN.
Contribution
It establishes a mathematical relationship between packetization and delay, introduces optimal packet size determination, and re-evaluates RA schemes from a packetization perspective.
Findings
Optimal packet size minimizes mean queueing delay.
Packetization significantly impacts jitter and delay performance.
Re-evaluation of RA schemes with packetization insights.
Abstract
As the demand for low-latency services grows, ensuring the delay performance of random access (RA) networks has become a priority. Existing studies on the queueing delay performance of the Aloha model universally treat packets as atomic transmission units, focusing primarily on delay measured in time slots. However, the impact of packetization on queueing delay has been consistently overlooked, particularly for the mean queueing delay measured in seconds, which serves as a more precise and practically relevant performance metric than its slot-based counterpart. Here, packetization refers to the process of determining the number of bits assembled into a packet. To optimize queueing delay from the perspective of packetization, this paper establishes the mathematical relationship between packetization and mean queueing delay in seconds for both connection-free and connection-based Aloha…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
