Automatic on-Demand Selection of Suitable Wireless Scheduling Algorithm to Minimize Queue Overflow Probability
DOI:
https://doi.org/10.26438/ijcse/v8i9.4853Keywords:
Line saturation, wireless algorithm, Round Robin programming, Scheduling greed.Abstract
In this paper, it is been studied the robustness of light traffic obtained by the tuning algorithm for various traffic networks. Since processing the programming algorithm is unaffected using the standard mathematical tool, the aim is to reduce the maximum likelihood of saturation obtained by the algorithm. In large deviation settings, this problem is equivalent to increasing the amount of asymptotic decomposition of the maximum possible. It is start by getting more of the decaying level of the fullness of the line as the line's fullness decays closer to infinity. Subsequently, made study several structural properties of the low-cost method of linear saturation in a large length, which is an approximation to the decay rate of the largest saturation point. Given these properties, proven that the line with the largest length follows the sample path that extends through the line. At a certain parameter value, the sorting algorithm is very good at reducing the length of the largest line. For numerical results, it is have shown the large-scale deviation properties of the line lengths that are commonly used while varying one algorithm parameter.
References
[1] Venkataramanan VJ, Lin X, “Structural properties of LDP for queue-length based wireless scheduling algorithms”. InProceedings of Allerton 2007 Sep 25.
[2] X. Lin, N. B. Shroff, and R. Srikant, “A tutorial on cross-layer optimization in wireless networks,” IEEE J. Sel. Areas Communication., vol. 24, no. 8, pp. 1452–1463, Aug. 2006.
[3] L. Tassiulas and A. Ephremides, “Stability properties of constrained queuing systems and scheduling policies for maximum throughput in multihop radio networks,” IEEE Transactions Automatic Control, vol. 37, no. 12, pp. 1936–1948, Dec. 1992.
[4] M. J. Neely, E. Modiano, and C. E. Rohrs, “Dynamic power allocation and routing for time-varying wireless networks,” in Proc. IEEE INFOCOM, San Francisco, CA, vol. 1, pp. 745–755. Apr. 2003,
[5] A. Eryilmaz, R. Srikant, and J. Perkins, “Stable scheduling policies for fading wireless channels,” IEEE/ACM Trans. Netw., vol. 13, no. 2, pp. 411–424, Apr. 2005.
[6] T. Ramesh and S.Sumithra, OPKNOT – Schemata Method for Mutation Testing Experimented on Event Driven Web Applications”, International Journal of Innovative Research in Computer and Communication Engineering, ISSN 2320-9798,Vol 5, Issue 1, , PP 761-770, January 2017
[7] A. L. Stolyar, “MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic,” Ann. Appl. Probab., vol. 14, no. 1, pp. 1–53, 2004.
[8] T. Ramesh and S.Sumithra, “A Review on Different Approaches of Mutation Cost Reduction Techniques”, International Journal of Innovative Research in Computer and Communication Engineering, Vol.5, Issue.1, pp.771-775, January 2017.
[9] D. Shah and D. Wischik, “Optimal scheduling algorithms for inputqueued switches,” in Proceedings IEEE INFOCOM, Barcelona, Spain, Apr. 2006.
[10] S. P. Meyn, “Stability and asymptotic optimality of generalized MaxWeight policies,” SIAM J. Control Optimization., vol. 47, no. 6, pp. 3259–3294, Jan. 2009.
[11] M. J. Neely, “Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks,” IEEE/ACM Transactions Networks., vol. 16, no. 5, pp. 1188–1199, Oct. 2008.
[12] M. J. Neely, “Delay analysis for maximal scheduling in wireless networks with bursty traffic,” in Proceedings IEEE INFOCOM, Phoenix, AZ, April pp. 6–10. 2008.
[13] R. Kumari1 , P. Nand, “Performance Analysis of Existing Routing Protocols”, International Journal of Scientific Research in Computer Science and Engineering, Vol.5, Issue.5, pp.47-50, October 2017.
[14] S.D.N. Hayath Ali , M. Giri, “A Study on Current Challenging Issues and Optimal Methods for Video Streaming over Heterogenous Wireless Network”, International Journal of Scientific Research in Network Security and Communication, Vol.6, Issue.2, April 2018.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
