Paper Info
Title
Qos-Alert Markov Chain Based Scheduling Scheme In Internet Of Things
Abstract
Guaranteeing quality of service (QoS) to transmit real time applications which are delay sensitive is of utmost importance in Internet of Things (IoT) environment. This paper presents a dynamic Markov Chain based scheduling scheme for ensuring QoS for the delay sensitive traffic in IoT. The traffic is classified into prioritized and non-prioritized traffic. By estimating previous bandwidth allocated to prioritized traffic and the amount of decrease/increase in probability of average queue length of prioritized packets in consecutive cycles, the scheduler dynamically adjusts the percentage of link bandwidth allocated to it in each cycle. This helps in providing guaranteed services to real time traffic in IoT applications and simultaneously provide better throughput for non real time traffic as well. The proposed QoS-alert scheduling mechanism is able to optimize the desired performance in IoT network. For different experiments the simulation is performed which verifies and satisfies the blocking probability requirements of prioritized traffic for IoT data.
Year
Venue
Keywords
2015
2015 IEEE GLOBECOM WORKSHOPS (GC WKSHPS)
Internet of Things, Average Queue Length, Quality of service, Delay Sensitive Applications, Service Differentiation
Field
DocType
ISSN
Markov process,Fair-share scheduling,Computer science,Scheduling (computing),Network packet,Quality of service,Computer network,Real-time computing,Two-level scheduling,Throughput,Dynamic priority scheduling
Conference
2166-0069
Citations 
PageRank 
References 
2
0.35
8
Authors
2
Name
Order
Citations
PageRank
Reema Sharma1102.22
Navin Kumar2124.96