Research Article
Markov Chain Based Priority Queueing Model for Packet Scheduling and Bandwidth Allocation
@INPROCEEDINGS{10.1007/978-3-319-73423-1_9, author={Reema Sharma and Navin Kumar and T. Srinivas}, title={Markov Chain Based Priority Queueing Model for Packet Scheduling and Bandwidth Allocation}, proceedings={Ubiquitous Communications and Network Computing. First International Conference, UBICNET 2017, Bangalore, India, August 3-5, 2017, Proceedings}, proceedings_a={UBICNET}, year={2018}, month={1}, keywords={Internet of Things Average queue length Quality of service Packet scheduling algorithm Delay sensitive applications Service differentiation}, doi={10.1007/978-3-319-73423-1_9} }- Reema Sharma
Navin Kumar
T. Srinivas
Year: 2018
Markov Chain Based Priority Queueing Model for Packet Scheduling and Bandwidth Allocation
UBICNET
Springer
DOI: 10.1007/978-3-319-73423-1_9
Abstract
This paper considers classification of diverse traffic types in Internet of Things (IoT) based on importance of data rate, packet size and proposes a priority-based probabilistic packet scheduling strategy for efficient packet transmission. Reduction of peak resource usage, dynamic control of service rate corresponding to arrival rate and QoS buffer management are few main factors considered to develop this strategy. By calculating percentage of link bandwidth required for prioritized traffic in each cycle, we provide quality of service (QoS) to real time traffic in IoT and non-IoT applications. Different experiments including MPEG traffic traces and Poisson traffic are conducted to verify the proposed scheduler. Also, performance of scheduler for both IoT and Non-IoT applications is compared for different data rates. We observe that the proposed packet scheduler satisfies QoS requirements for both IoT and non-IoT traffic.
