Research Article
Finite buffer queue analysis and scheduling for heavy-tailed traffic in packet-switching wireless networks
@INPROCEEDINGS{10.1109/QSHINE.2005.25, author={S. Teymori and Weihua Zhuang }, title={Finite buffer queue analysis and scheduling for heavy-tailed traffic in packet-switching wireless networks}, proceedings={2nd International ICST Conference on Quality of Service in Heterogeneous Wired/Wireless Networks}, publisher={IEEE}, proceedings_a={QSHINE}, year={2005}, month={12}, keywords={}, doi={10.1109/QSHINE.2005.25} }- S. Teymori
Weihua Zhuang
Year: 2005
Finite buffer queue analysis and scheduling for heavy-tailed traffic in packet-switching wireless networks
QSHINE
IEEE
DOI: 10.1109/QSHINE.2005.25
Abstract
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 wireline system to a wireless system, taking into account wireless propagation channel characteristics. We also investigate the multiplexing of heavy-tailed 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
