Networking and Communication Engineering

M. Kasi Viswanadh ¹, P. Harini ²

Affiliations
1 JNTUK, St.Ann‘sCollege of Engineering & Technology Chirala, Andhra Pradesh, IN
2 JNTUK, St.Ann‘s College of Engineering & Technology Chirala, Andhra Pradesh, IN

Abstract

World is running on internet in real sense since all the important and major tasks of life are carried out through internet. All the major and huge businesses depend on internet but at the same time internet is a big threat for these conglomerates. Because hackers and scams can ruin the online businesses and they could face great deal of data loss. In order to avoid such sort of internet corruption, firewalls are designed as to protect the networks from hackers and scams. Firewall is basically a blockade which restricts the outside forces from accessing your network and attacking your data. By filtering packets the firewalls can improve security and performance. However, as the size of the rule list increases, it becomes difficult to maintain and validate the rules. Ordered binary decision diagrams (BDDs) – a compact method of representing and manipulating Boolean expressions – are a potential method of representing the rules. Geometric Efficient Matching Algorithm (GEM) uses near-linear space, and only needs approximately 13 MB of space for rule-bases of 5,000 rules. Moreover, with use of additional space improving heuristics, the space requirement can be reduced to 2-3 MB for 5,000 rules. This paper presents a new approach not only to analyze and to validate rule sets and also resultant rule sets are passed as an input for Geometric Efficient Matching Algorithm for improving the efficiency of firewalls.

Keywords

Firewall, BDDs, Internet Corruption, GEM.

Full Text

     

S. K. Hameeda ¹, Y. Chitti Babu ², P. Harini ², Syed Azahad ³

Affiliations
1 St. Anns College of Engg & Technology, JNTU Kakinada, IN
2 St. Anns College of Engineering & Technology, JNTU Kakinada, IN
3 NIMRA College of Engineering & Technology, IN

Abstract

Data replication drastically improves data availability in a mobile ad hoc network. However, since mobile hosts’ mobility causes frequent network partitioning, consistency management of data operations on replicas becomes a crucial issue. In such an environment, the global consistency of data operations on replicas is not desirable by many applications. Thus, new consistency maintenance based on local conditions such as location and time need to be investigated. This paper attempts to classify different consistency levels according to requirements from applications and provides protocols to realize them.

Keywords

Mobile Ad Hoc Networks, Consistency Management, Data Replication, Mobile Computing.

Full Text

     

M. Raghavendra Rao ¹, K. Eswar ², P. Harini ³, Syed. Azhad ⁴

Affiliations
1 St. Anns College of Engineering & Technology, IN
2 St. Anns College of Engg. & Technology, IN
3 St. Anns College of Engineering. & Technology, IN
4 NIMRA College of Engineering & Technology, IN

Abstract

The proposal of this paper presents a measurement-based routing algorithm to load balance intra domain traffic along multiple paths for multiple multicast sources. Multiple paths are established using application - layer overlaying. The proposed algorithm is able to converge under different network models, where each model reflects a different set of assumptions about the multicasting capabilities of the network. The algorithm is derived from simultaneous perturbation stochastic approximation and relies only on noisy estimates from measurements. Simulation results are presented to demonstrate the additional benefits obtained by incrementally increasing the multicasting capabilities. The main application of mobile ad hoc network is in emergency rescue operations and battlefields. This paper addresses the problem of power awareness routing to increase lifetime of overall network. Since nodes in mobile ad hoc network can move randomly, the topology may change arbitrarily and frequently at unpredictable times. Transmission and reception parameters may also impact the topology. Therefore it is very difficult to find and maintain an optimal power a ware route. In this work a scheme has been pro posed to maximize the network lifetime and minimizes the power consumption during the source to destination route establishment. The proposed work is aimed to provide efficient power aware routing considering real and non real time data transfer.

Keywords

Consumption, Lifetime, Perturbation, Stochastic.

Full Text