Title :
Improve real-time packet scheduling algorithm with security constraint
Author :
Singh, S. ; Ranvijay
Author_Institution :
Dept. of Comput. Sci. & Eng., Motilal Nehru Nat. Inst. of Technol., Allahabad, India
Abstract :
The real-time packet scheduling algorithm with security constraint can enhance the scheduling as well as security of the real-time packets over the wireless network, especially wireless local area network (WLAN). The existing real-time packet scheduling algorithms focus on scheduling and paid less attention on security when system is heavily loaded and when the system is under light work load, the security is the main goal. Some existing algorithm offers the high security, which increases the packets drop when the system is heavily loaded, which is not meaning full. To solve this problem we proposed an “Improve Real-Time Packet Scheduling Algorithm with Security Constraint” (IPSASC). The ISPAS paid high attention on security when system is light work loaded, when system is heavily loaded, the algorithm deal with scheduling and security both which can improve the guarantee ratio of the system and also decreases the numbers of packets drop. IPSASC gave the excellence scheduling and security result under the heavily work loaded system.
Keywords :
computer network security; real-time systems; scheduling; wireless LAN; ISPAS; WLAN; heavily work loaded system; light work load; real-time packet scheduling algorithm; real-time packets security; security constraint; wireless local area network; Communication system security; Real-time systems; Scheduling; Scheduling algorithms; Security; Wireless networks; Algorithms; Packet Scheduling; Security Constraint; Soft-Deadline; Wireless Network;
Conference_Titel :
India Conference (INDICON), 2014 Annual IEEE
Conference_Location :
Pune
Print_ISBN :
978-1-4799-5362-2
DOI :
10.1109/INDICON.2014.7030461