A Study of Scheduling Algorithms to Maintain Small Overflow Probability in Cellular Networks with a Single Cell
Dublin Core | PKP Metadata Items | Metadata for this Document | |
1. | Title | Title of document | A Study of Scheduling Algorithms to Maintain Small Overflow Probability in Cellular Networks with a Single Cell |
2. | Creator | Author's name, affiliation, country | Nagarajan B.; Department of Computer Science and Engineering, Priyadarshini Engineering College, Vaniyambadi, Anna University, Chennai, Tamilnadu, India |
2. | Creator | Author's name, affiliation, country | Venkatesan G.; Department of Civil Engineering, Priyadarshini Engineering College, Vaniyambadi, Affiliated to Anna University, Chennai, Tamilnadu, India |
2. | Creator | Author's name, affiliation, country | Santhosh Kumar C.; Department of Computer Science and Engineering, Priyadarshini Engineering College, Vaniyambadi, Anna University, Chennai, Tamilnadu, India |
3. | Subject | Discipline(s) | |
3. | Subject | Keyword(s) | Asymptotically Optimal Algorithms; Cellular System; Large Deviations; Queue-Overflow Probability; Wireless Scheduling |
4. | Description | Abstract |
Wireless scheduling algorithms for the download of a single cell that can maximize the asymptotic decay rate of the queue-overflow probability as the overflow threshold approaches infinity. We first derive an upper bound on the decay rate of the queue-overflow probability over all scheduling policies. Specifically, we focus on the class of “α - algorithms,” the base station picks the user for service at each time that has the largest product of the transmission rate multiplied by the backlog raised to the power α. The α-algorithms arbitrarily achieve the highest decay rate of the queue-overflow probability. We design a scheduling algorithm that is both close to optimal in terms of the asymptotic decay rate of the overflow probability and to maintain small queue-overflow probabilities over queue-length ranges of practical interest. |
5. | Publisher | Organizing agency, location | |
6. | Contributor | Sponsor(s) | |
7. | Date | (YYYY-MM-DD) | 2016-02-09 |
8. | Type | Status & genre | Peer-reviewed Article |
8. | Type | Type | |
9. | Format | File format | |
10. | Identifier | Uniform Resource Identifier | http://technical.cloud-journals.com/index.php/IJACSIT/article/view/Tech-488 |
11. | Source | Journal/conference title; vol., no. (year) | International Journal of Advanced Computer Science and Information Technology; 2020: Published Papers |
12. | Language | English=en | en |
14. | Coverage | Geo-spatial location, chronological period, research sample (gender, age, etc.) | |
15. | Rights | Copyright and permissions |
Copyright Terms & Conditions Authors who publish with this journal agree to the following terms: a. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal. b. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal. c. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work Cloud Publications reserves the right to amend/change the copyright policy; with/without notice. |