Journal of Network Security Computer Networks (e-ISSN: 2581-639X)

Expert System

R. Kanchana — 2015-08-19

Computers can be programmed with rules to use information to make simple decisions. This is knowledge that has been passed on from the programmer. A simple example is a spreadsheet application that monitors pupils' test marks and calculates average scores. This is where computers are programmed to accept a large number of items of information and based on rules set in the program, make decisions, then further decisions. Examples of these are automatic pilots in aero planes and diagnosis applications used to help doctors. In both cases these systems are only as good as the rules programmed by the human computer programmer and cannot deal with the unexpected. They need to be used as aids to human decision making only. The actual doctor must confirm a diagnosis and treatment suggested by an expert system. Expert systems are part of a general category of computer applications known as AI. To design an ES, one needs a knowledge engineer, an individual who studies how human experts make decisions and translates the rules into terms that a computer can understand.

Variants of ACO Comparisons for Network Routing Problem, An Analysis

Sneha Patnaik — 2015-02-24

Ant Colony Optimization (ACO) is a soft computing technique which enables to sketch out the shortest path. It is carried out by observing the ants. When ants find food at a particular place, they go in a single line following each other in order to reach the destination. If there is an obstruction in between then an ant changes its path. All the ants’ starts following the ant in order to reach the place fast considering the path as the shortest path. This basically happens due to the chemical secretion "Pheromones" by the ants. This is the whole mechanism of Ant Colony Optimization. There are many ant based algorithms. Previously these ant based algorithms were used to solve classical problems such as Travelling Salesman Problem (TSP), Classical Vehicle routing problems (VRP) etc. But algorithms have been gradually developed to solve Computer networking related problems including congestion problems too. It helps modifying continuously the routing table which in turn results in decreasing congestion problem. Congestion Problems includes Queuing delay, packet loss or blocking of new connections. These problems are the result of overloaded node. This leads to decrease in throughput of the system. The fundamental limitation leading to the above mentioned problem is limited resources including router processing time and link throughput. Using the limited resource and rescheduling the router repeatedly by using the Ant Colony Optimization technique will not only solve the problem but also will increase the system throughput.

A Novel Approach for Conserving Spring Location Privacy in Wireless Sensor Networks

G. Narendran — 2015-11-26

In wireless sensor network, adversaries try to kill the monitored object by use of traffic information. In this paper, we first define hotspot event that causes a clear variation in the network traffic pattern due to large volume of packets generating from a small area. And then using realistic adversary model, we introduce a hotspot-locating attack where the adversary analyse the traffic information to locate hotspots. Finally, we introduce a cloud-based scheme for preserving source node location privacy against hotspot-locating attack by creating a cloud with an irregular shape of fake traffic and hide the source node in the nodes forming the cloud. Due to reduce the energy cost, the clouds are active only during data transmission and the intersection of clouds creates a larger merged cloud, to reduce the number of fake packets and also strong privacy preservation. In this scheme can provide stronger privacy protection than routing based scheme and requires much less energy than global-adversary based schemes.

An Analysis of Denial-of-Service Attacks Using TCP Reflectors

I. Lakshmi — 2015-05-16

Attackers can render denial-of-service attacks more difficult to defend against by bouncing their flooding traffic off of reflectors; that is, by spoofing requests from the victim to a large set of internet servers that will in turn send their combined replies to the victim. The resulting dilution of locality in the flooding stream complicates the victim’s abilities both to isolate the attack traffic in order to block it and to use trace back techniques for locating the source of streams of packets with spoofed source addresses, such as ITRACE, probabilistic packet marking and SPIE. We discuss a number of possible defences against reflector attacks, finding that most prove impractical, and then assess the degree to which different forms of reflector traffic will have characteristic signatures that the victim can use to identify and filter out the attack traffic. Our analysis indicates that three types of reflectors pose particularly significant threats: TCP-based servers (particularly Web servers) running on TCP implementations that suffer from predictable initial sequence numbers. We argue in conclusion in support of “reverse ITRACE” and for the utility of packet trace back techniques that work even for low volume flows, such as SPIE.

Data Security Issues in Cloud Computing

Vinay s — 2015-12-05

A cloud storage system is a collection of servers capable of storing huge volume of data. Data security is the main issue in cloud. This paper makes an attempt to identify security issues of cloud with respect to authentication, integrity, availability and auditing. Brief discussion on the methods proposed to address these issues is also highlighted in this paper.