MANAGING REDUNDANCY AND CONFLICTS IN DISTRIBUTED FIREWALLS

The use of firewall has been widespread in all the emerging technologies such as Service Oriented Architecture, web services, cloud computing and so on. The term security itself is the most important task that has to be maintained in the real-time applications. Policies are enrolled in the security of the firewall where the quality of policies is to be maintained. The network administrator defines the policy as a rule. Managing the firewall policies, maintaining the risk analysis and also the conflicting nature that arise in the network, lack of systematic analysis mechanisms and tools used are often error prone. The distributed firewall is used to overcome the shortcomings of the traditional firewall. In this paper we represent a set of techniques such as, rule-based segmentation technique to identify the policy anomalies and effectively derive the anomaly resolution. Grid-based visualization technique, provide the policy anomaly information in a grid form, which helps in identifying the policy conflicts and finally the techniques to resolve the conflicts and the redundancy that arise in a single- or multi-firewall environment. We also discuss about the implementation of the visualization-based firewall policy analysis tool called Firewall Anomaly Management Framework (FAME), where all the techniques are used in a single tool and an approach to resolve the anomalies in an effective and efficient way.

INCREASING ACCURACY OF K-NEAREST NEIGHBOR CLASSIFIER FOR TEXT CLASSIFICATION

k - Nearest Neighbor Rule is a well-known technique for text classification. The reason behind this is its simplicity, effectiveness, easily modifiable. In this paper, we briefly discuss text classification, k-NN algorithm and analyse the sensitivity problem of k value. To overcome this problem, we introduced inverse cosine distance weighted voting function for text classification. Therefore, Accuracy of text classification is increased even if any large value for k is chosen, as compared to simple k Nearest Neighbor classifier. The proposed weighted function is proved as more effective when any application has large text dataset with some dominating categories, using experimental results.

MODEL BASED TEST CASE PRIORITIZATION USING UML ACTIVITY DIAGRAM AND EVOLUTIONARY ALGORITHM

With the exponential growth in size and complexity of softwares, the testing activity is no more limited to testing phase of SDLC (Software Development Life Cycle). Testing process has been made iterative and incremental in Object Oriented development scenario. This leads to increase in effort and time required for testing as well as explosion in test case. But when it comes to regression testing, it has the additional issue of test case retesting which further increasing the effort and time. So a suitable prioritization technique should be used to address these issues. In this paper we had given a proposal which is based on prioritization of test cases using GA (Genetic Algorithm). This process is found to be very effective during regression testing. In this paper we found an optimized independent path having maximum critical path value, which further leads to prioritization of test cases. The three component of regression testing i.e effort, time, cost will be gradually reduce by using this approach.

ASPECT MINING USING UML COMMUNICATION DIAGRAM

Aspect-Oriented Programming (AOP) focuses on precise constructs for modularization of the crosscutting concerns of a program. Crosscutting concerns can be defined as the functionalities that navigate the principal decomposition of software and therefore cannot be assigned to a single modular unit. Aspect mining attempts to find and isolate crosscutting concerns dwelling in legacy systems which in turn help in the adoption of an aspect-oriented design. Functionalities originally scattered across different modules and tangled with each other can be factored out into a distinct, separate unit, called an aspect. Identifying and refactoring the existing system into AOP considerably ease the debugging, testing and maintenance of the large legacy system. The goal of this paper is to find the aspects at the design level using aspect mining techniques for already existing non-aspect applications. The main advantage of this approach is that without understanding the underlying code, we can separate the crosscutting concerns at the architectural level. The novelty in our approach is that we are finding the aspects of an existing system at the architectural level using UML Communication Diagram. Also, the number of nodes in Control Flow Graph (CFG) drawn from the existing Communication diagram is reduced after finding the aspects resulting in the new reduced CFG.

COMPARATIVE STUDY OF MULTI USER BROADCAST AUTHENTICATION IN WIRELESS SENSOR NETWORK

Wireless sensor network (WSN) is an emerging technology consisting of spatially distributed sensor nodes, which can cooperatively monitor physical or environmental conditions. The major resource constrain of WSN are, low processing, energy and storage capabilities. Broadcast is widely used communication method in WSN environment. In most of the sensor networks, the sink node sends broadcast information to all other sensor nodes. Broadcast authentication is an important security mechanism in WSN, as it allows mobile users to broadcast messages to multiple sensor nodes in a secured way. While variety of multiuser broadcast authentication approaches are being developed, a lot of research is going on in the security field at rapid pace. However this field lacks a common integrated platform to provide a comprehensive comparison of seemingly unconnected but linked issues .In this article a pilot survey is performed to classify the, already proposed multiuser broadcast authentication approaches. This comparative survey is based on the objective, design principles and the performance of multiuser broadcast authentication approaches.

WEB BASED SERVICE FOR DIABETES PATIENT MONITORING SENSORS

Diabetes mellitus is a major cause of blindness, renal failure, amputation, heart attacks and stroke. For a diabetes patient, many factors are to be considered. Change in the meal may cause unpredictable changes in blood sugar levels. The diabetes patient monitoring considers these factors and proposes a solution using the sensors like glucometer sensor, blood Pressure sensor and the RFID tag with arduino given to the individual patients. The internet of things integrates many technologies, such as Internet, Zigbee, Bluetooth, infrared, Wi-Fi, GPRS, 3G, etc., This paper provides low cost global connectivity between the patients personal device and the patient’s web portal that updates the personal details, drugs remainder and the blood sugar level. When there is an increase, an automatic update is sent by a phone call or an SMS to the personal doctor.

BLACKBOX TESTING OF WEB SERVICE

Web Services and Service Oriented Computing (SOC) paradigm have received significant attention due to its wide spread adoption and promotion by major IT vendors. As more and more Service-Oriented Softwares are built to-day testing of web service have becomes crucial point. Web services are distributed, loosly coupled, autonomous, reusuable, discoverable, hides internal logic (Abstraction),minimize retaining information (Statelessness) and adhere to Service Level Aggrement (SLA).These inherent characterestics imposes great challenges to the tester.In this paper we try to impose hierarchical structure on Web Service Description Language(WSDL) in order to uncover more and more errors before its final deployment through blackbox testing.Our approach differes from others by imposing hierarchical structure on WSDL, finding various dependencies like data dependency, control dependency, and generation of Web Service Dependence Graph(WSDG) which are essential for testing.

DYNAMIC SLICING OF ASPECT-ORIENTED UML COMMUNICATION DIAGRAM

Aspect-oriented Programming (AOP) is a recent programming paradigm that focuses on modular implementations of various crosscutting concerns. The typical features of AOP such as join-point, advice, introduction, aspects etc. make it difficult for applying slicing. Program slicing is a method to extort statements that are relevant to a particular variable. Program slicing, as initially defined by Weiser is based on static dataflow examination on the flow graph of the program. Program slicing has been applied in parallel processing, program debugging, program integration,program understanding , software testing and maintenance etc.In this paper, we proposed a technique for dynamic slicing of aspectoriented software based on the UML 2.0 Communication diagram. Here, we can use slicing at the architectural level to find the slicing of communication diagram at an earlier stage of software development. To represent the various unique features of AOP in UML diagrams is very difficult and complex in nature. For this purpose, we first draw the communication diagram for aspect-oriented program considering the classes, pointcuts, advices and aspects. Next, we have generated an intermediate representation from the communication diagram. Then, we proposed an edge marking dynamic slicing algorithm that traverses the intermediate representation and finds the slices for the communication diagram of the given problem scenario. The novelty in our approach is that we present the communication diagram for the aspect-oriented software. Also, we proposed an algorithm to find the slice from it. The advantage of using communication diagram is that it mainly focuses on the interaction between the objects involved in the problem scenario.

VFG – INDEX: A NOVEL GRAPH INDEXING METHOD

The latest advancements in science and technology have observed large quantity of complicated structures and schema less data such as proteins, circuits, images, Web, and XML documents which can be modeled into various types of which one of the most dominant now a days are graphs. This has caused Graph Mining, one of the budding areas of research happening throughout. In this paper, we investigate the various algorithms for Graph Indexing which makes use of Frequent Sub graph as a key term for indexing, of which one the most dominant is FG-index algorithm. This algorithm is tested with AIDS dataset and an improved algorithm is proposed for effective indexing.

TEST SCENARIOS GENERATION USING PATH COVERAGE

Testing is one of the very important component of software development process. Properly generated test sequences may not only locate the defects in software, but also help in reducing the high cost associated with software testing. It is often desired that test sequences should be automatically generated to achieve required test coverage. Automatic test sequence generation is a major problem in software testing. The aim of this study is to generate test sequences for source code using ModelJunit. ModelJUnit is a extended library of JUnit. We have generate automatic test sequences and some testing criterion coverage such as node coverage, edge coverage and edge pair coverage. This paper describes a systematic test sequence generation technique using the path based approach.