Minimum Delay Multiaccess Communication for General Packet Length Distributions

摘要

We consider a multiaccess communication scenario where a central controller dynamically allocates transmission rates from the information-theoretic multiaccess capacity region to multiple transmitters. In a symmetric two-user setting, we show that a modified version of the Longer Queue Higher Rate (LQHR) allocation policy minimizes the steady state average bit delay even when arriving packets assume general length distributions. The proof entails a new analytical technique combining dynamic programming and renewal process theory.