Anju Muraleedharan ¹, Neenu Antony ¹, R. Nandakumar ²

Affiliations
1 Department of Computer Science & IT, Amrita School of Arts and Sciences Kochi, IN
2 Department of Computer Science & IT, Sciences Faculty, Amrita School of Arts and Sciences Kochi, IN

Abstract

Background: If the processer knows in advance how much time each process takes then the best approach is shortest job first scheduling (SJFS). But knowing the burst time before hand is usual unrealistic. Round Robin scheduling algorithm (RR) is the most commonly used scheduling algorithm in an environment with time sharing among more than one process. RR algorithm is free from starvation, since all processes always get equal time quantum. But the selection of time quantum can influence the performance of the algorithm. If too short, an inordinate fraction of the time is spent in context switches. If too large, it behaves like first come first served (FCFS). We try to improve this aspect of the algorithm. Methods: We propose a variant of RR algorithm -Dynamic Time Slice Round Robin Scheduling Algorithm with Unknown Burst Time which could be used if the burst times of the processes are unknown at the beginning. This involves tuning the time quantum at run time.

Keywords

Context Switch, CPU,Dynamic Time Slice Round Robin Scheduling Algorithm with Unknown Burst Time, Round Robin Scheduling, Scheduling Criteria, Scheduling Algorithm,

Full Text

   

R. Nandakumar ¹, K. Nirmala ²

Affiliations
1 R & D Centre, Bharathiar University, Coimbatore - 641046, Tamil Nadu, IN
2 Quaid-E-Millath College (W), Chennai - 600002, Tamil Nadu, IN

Abstract

Objectives: To enhance the improved security-aware packet scheduling for improving the packet level security in Mobile Ad-hoc Networks (MANET). The dependency and anonymity issues in security-aware packet scheduling are considered and removed by the proposed approach. Methods: The major challenge in MANET was the packet level security in multiple levels. The network performance was degraded due to contravene in packet level security which causes high packet loss. To overcome this challenge, an Improved Security-Aware Packet Scheduling (ISAPS) was proposed for achieving high level security and effective packet scheduling. Findings: In ISAPS, the packets from the multiple nodes were considered as independent to each other. In addition, the computational complexity and energy consumption were high. The correlation of the multiple dependency packets were degraded the network performance due to representing the dependencies and scalability. The efficiency of security was less since the source node and their packets were easily identified by the attacker. Improvements: These issues are avoided by proposed inter and intra service dependencies based ISAPS algorithm. Furthermore, the anonymity concept is included with the security-aware packet scheduling algorithm for improving the efficiency of security by secure routing protocol.

Keywords

Anonymity, Attacker, Dependency, Packet Level Security, Packet Scheduling

Full Text