Delay-based maximum power-weight scheduling with heavy-tailed traffic

dc.contributor.authorLin, Shih-Chun
dc.contributor.authorWang, Pu
dc.contributor.authorAkyildiz, Ian F.
dc.contributor.authorLuo, Min
dc.date.accessioned2017-09-18T02:13:41Z
dc.date.available2017-09-18T02:13:41Z
dc.date.issued2017-08
dc.descriptionClick on the DOI link to access the article (may not be free).en_US
dc.description.abstractHeavy-tailed (HT) traffic (e.g., the Internet and multimedia traffic) fundamentally challenges the validity of classic scheduling algorithms, designed under conventional light-tailed (LT) assumptions. To address such a challenge, this paper investigates the impact of HT traffic on delay-based maximum weight scheduling (DMWS) algorithms, which have been proven to be throughput-optimal with enhanced delay performance under the LT traffic assumption. First, it is proven that the DMWS policy is not throughput-optimal anymore in the presence of hybrid LT and HT traffic by inducing unbounded queuing delay for LT traffic. Then, to solve the unbounded delay problem, a delay-based maximum power-weight scheduling (DMPWS) policy is proposed that makes scheduling decisions based on queuing delay raised to a certain power. It is shown by the fluid model analysis that DMPWS is throughput-optimal with respect to moment stability by admitting the largest set of traffic rates supportable by the network, while guaranteeing bounded queuing delay for LT traffic. Moreover, a variant of the DMPWS algorithm, namely the IU-DMPWS policy, is proposed, which operates with infrequent queue state updates. It is also shown that compared with DMPWS, the IU-DMPWS policy preserves the throughput optimality with much less signaling overhead, thus expediting its practical implementation.en_US
dc.identifier.citationS. C. Lin, P. Wang, I. F. Akyildiz and M. Luo, "Delay-Based Maximum Power-Weight Scheduling With Heavy-Tailed Traffic," in IEEE/ACM Transactions on Networking, vol. 25, no. 4, pp. 2540-2555, Aug. 2017en_US
dc.identifier.issn1063-6692
dc.identifier.otherWOS:000408419600044
dc.identifier.urihttp://dx.doi.org/10.1109/TNET.2017.2706743
dc.identifier.urihttp://hdl.handle.net/10057/14093
dc.language.isoen_USen_US
dc.publisherIEEEen_US
dc.relation.ispartofseriesIEEE/ACM Transactions on Networking;v.25:no.4
dc.rights.holderCopyright © 2017, IEEEen_US
dc.subjectHeavy tailsen_US
dc.subjectDelay-based maximum weight (MaxWeight) policyen_US
dc.subjectPower-weight schedulingen_US
dc.subjectFluid-limit approximationsen_US
dc.subjectThroughput-optimalen_US
dc.subjectSwitched networksen_US
dc.titleDelay-based maximum power-weight scheduling with heavy-tailed trafficen_US
dc.typeArticleen_US
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.59 KB
Format:
Item-specific license agreed upon to submission
Description: