No abstract

No abstract

No abstract

Scheduling number of jobs in a single machine is a "Uni-machine job scheduling problem". The mean of variation of job's waiting time is called Waiting time Variance (WTV). Minimization of WTV directly improves the quality of service (QoS) of systems involved with job scheduling. WTV minimization is a NP-hard problem. As a matter of fact minimization of the WTV on computer networks can lead to stable and predictable network performance. The main objective of this paper is to provide a secure and predictable computer and network systems by proposing a heuristic based novel approach to minimize the WTV. This approach illustrated with small size problems along with randomly new generated problems. The experimental results are compared with existing approaches. The experimental result shows the proposed approach gives best performance for the compared approaches and problems tested. The findings of intended algorithm are shown in the form of table for consonant problems.

Over the last two decades, computer and network security has become a main issue, especially with the increase number of intruders and hackers, therefore systems were designed to detect and prevent intruders. This chapter per the authors investigated the most important design approaches, by mainly focusing on their collecting, analysis, responding capabilities and types of current IDS products. For the collecting capability, there were two main approaches, namely host- and network-based IDSs. Therefore, a combination of the two approaches in a hybrid implementation is ideal, as it will offer the highest level of protection at all levels of system functions. The analysis capability of an IDS can be characterised by the misuse and anomaly detection approaches. Therefore, a combination of the two approaches should improve the analysis capability of an IDS i.e. hybrid of misuse and anomaly detection.

No abstract

No abstract

No abstract