• Login
    View Item 
    •   Shocker Open Access Repository Home
    • Engineering
    • Electrical Engineering and Computer Science
    • EECS Faculty Scholarship
    • EECS Research Publications
    • View Item
    •   Shocker Open Access Repository Home
    • Engineering
    • Electrical Engineering and Computer Science
    • EECS Faculty Scholarship
    • EECS Research Publications
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Distributed throughput optimal scheduling in the presence of heavy-tailed traffic

    Date
    2015-06
    Author
    Xia, Shuang
    Wang, Pu
    Metadata
    Show full item record
    Citation
    S. 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-3496
    Abstract
    The 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.
    Description
    Click on the DOI link to access the article (may not be free).
    URI
    http://dx.doi.org/10.1109/ICC.2015.7248865
    http://hdl.handle.net/10057/12019
    Collections
    • EECS Research Publications

    Browse

    All of Shocker Open Access RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsBy TypeThis CollectionBy Issue DateAuthorsTitlesSubjectsBy Type

    My Account

    LoginRegister

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    DSpace software copyright © 2002-2023  DuraSpace
    DSpace Express is a service operated by 
    Atmire NV