Finite buffer queue analysis and scheduling for heavy-tailed traffic in packet-switching wireless networks

Recent research based on traffic measurements shows that Internet traffic flows have a fractal nature (i.e., self-similarity property), which causes an underestimation of network engineering parameters when using the conventional Poisson model. Preliminary field measurements demonstrate that packet data traffic in wireless communications also exhibits self-similarity. In this paper; we investigate the queuing behavior of self-similar traffic flows for data applications in packet-switching wireless networks. The traffic is generated by an on-off source with heavy-tailed on periods. We extend a previous relationship among the asymptotic distribution of loss,probability, finite buffer size, traffic specifications, and transmission rate for a wire-line system to a wireless system, taking into account wireless propagation channel characteristics. Me also investigate the multiplexing of heavy-failed traffic flows with a finite buffer for the downlink transmission of a cellular network. Computer simulation results demonstrate that assumptions made in the theoretical analysis are reasonable and the derived relationship is accurate.