Show simple item record

dc.contributor.authorXia, Shuang
dc.contributor.authorWang, Pu
dc.identifier.citationS. Xia and P. Wang, "Distributed throughput optimal scheduling in the presence of heavy-tailed traffic," 2015 IEEE International Conference on Communications (ICC), London, 2015, pp. 3490-3496en_US
dc.descriptionClick on the DOI link to access the article (may not be free).en_US
dc.description.abstractThe heavy tailed traffic in wireless networks fundamentally challenges the applicability of conventional throughput optimal scheduling algorithms. To encounter this, the stability performance of distributed maximum weight scheduling algorithms (DMWS), which are known to be throughput optimal under light tailed environment, is first analyzed. More specifically, it is shown that heavy tailed traffic can significantly degrade the stability performance of DMWS. In particular, it is proven that if a user with light-tailed traffic arrivals has the average traffic rate lambda below a threshold lambda*, it will experience bounded queueing delay. Otherwise, if lambda is larger than a threshold. lambda', its queueing delay is necessarily of infinite mean. To address this problem, the distributed maximum weight-alpha scheduling (DMWS-alpha) algorithm is proposed, which makes the scheduling decision based on the queue lengths raised to the alpha-th power. It is demonstrated that DMWS-alpha is throughput optimal with respect to moment stability in the sense that if the traffic arrivals rates are within the network stability region, all network users with light-tailed traffic arrivals always have bounded queueing delay with finite mean and variance.en_US
dc.relation.ispartofseriesIEEE International Conference on Communications (ICC), London, 2015;
dc.subjectMaximum throughputen_US
dc.titleDistributed throughput optimal scheduling in the presence of heavy-tailed trafficen_US
dc.typeConference paperen_US
dc.rights.holder© Copyright 2016 IEEE - All rights reserved.en_US

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record