No abstract

Long-Term Evolution (LTE) was implemented to fulfill and satisfy users' needs as well as their demands for an improvised, fast and efficient Quality of service (QoS). A minimal aggregate of waiting time in return would give users a better Quality of experience (QoE). Real-time service packet scheduling is an important process in allocating resources to users. An efficient packet scheduling scheme will be able to cater fairly and efficiently to its users in the LTE network. Hence, studies are performed focusing on real-time traffic which includes video as well as Voice over Internet Protocol (VoIP) transmissions. In this work, the existing exponential rule (EXP rule) is utilized to benchmark our proposed packet scheduling techniques so that we are able to further evaluate the scheduling performance. In response to the increasing likelihood of losing packets in the EXP rule's algorithm and maximizing the throughput rate, several schemes have been experimented with. The proposed schemes include 1) simplified EXP rule (sEXP Rule), 2) modified EXP rule (mEXP Rule), 3) EXP rule with maximum throughput (MT) (EXP_MT Rule), and 4) enhanced EXP rule with MT (E2M). By adding MT as a weight to the EXP rule, the throughput is maximized, thus providing higher throughput rates for real-time and non-real-time traffic. The simulation results show that the sEXP rule has a better performance in throughput, packet loss rate (PLR), and spectral efficiency for video traffic. Aside from this, our proposed E2M rule performs better than the benchmark EXP rule and outperforms the other proposed schemes, as well. It is observed that the E2M rule has better QoS support for real-time transmission in terms of delay, packet loss, throughput and spectral efficiency, within the LTE network. Hence, our proposed E2M rule is an enhancement of the benchmark EXP rule, which is commonly used in LTE packet scheduling.

Computer security is essential in information technology world today; confidentiality, availability and integrity of data are the aspects concerned. Firewall has been widely deployed as a protection but it is no longer adequate to against the intelligent intrusions and attacks which keep changing and transforming. A network intrusion detection and analysis system has been introduced in this paper to resolve the problems of data confidentiality, availability and integrity. The challenge of the study is; first, to model the network intrusion detection domain and second, to perform causal reasoning for intrusion detection and analysis based on the domain model constructed earlier. In this paper, a methodology has been proposed to resolve the two problems mentioned above. Both problems will be addressed under causal knowledge driven approach where intrusion detection is viewed as fault diagnosis and prognosis processes. We have proposed Bayesian network for the modeling of network intrusion domain. Also, powerful reasoning capabilities of Bayesian network have been applied to discover intrusion attacks. Since the capabilities of causal reasoning using Bayesian network have not been fully discovered in the domain of intrusion detection by most of the researchers before, this research work is to bridge the gap. From the results of the experiment, we have concluded that the capability of Bayesian learning is reasonably accurate and efficient.

No abstract

IEEE 802.16e is an advanced wireless access technology that provides high-speed data transmission in long distance and offers quality of service (QoS) to subscribers. The provisioning of QoS is one of the great features by IEEE 802.16 to support both real-time and non-real-time applications. In IEEE 802.16, the common part sublayer in the MAC layer is responsible for maintaining the QoS services. There are many functions in the common part sublayer; the most popular topics discussed by researchers are the uplink and downlink scheduling algorithms. Many discussions had been made and focused on these two classes of schedulers. Another equally important component but overlooked so far is the bandwidth request and grant module. Bandwidth request and grant module arbitrates the amount of bandwidth to be granted, besides handling the bandwidth requests. This bandwidth request and grant process has always been developed in a conventional way, and its importance has been underestimated. In addition, the bandwidth distribution within a same service class or category also attracted little attention thus far. Many algorithms for interclass scheduling have been studied and proposed but not as much for intraclass scheduling. However, in bandwidth request and grant process, constraints on the required knowledge by the schedulers limit the intraclass scheduling algorithms to be applied onto them. We view the bandwidth request and grant process as an important part of the QoS architecture. In this paper, we proposed a new bandwidth granting scheme for the bandwidth request and granting process, which enables bandwidth to be fairly granted based on the necessity to all the requests from the same service class or category. By applying our scheme, significant improvements have been observed and recorded. Experiment results have proven and confirmed the effectiveness of our proposed scheme as compared to the conventional scheme.