Deep packet inspection directs, persists, filters and logs IP-based applications and Web services traffic based on content
encapsulated in a packet's header or payload, regardless of the protocol or application type. In content scanning, the packet payload is
compared against a set of patterns specified as regular expressions. With deep packet inspection in place through a single intelligent
network device, companies can boost performance without buying expensive servers or additional security products. They are typically
matched through deterministic finite automata (DFAs), but large rule sets need a memory amount that turns out to be too large for
practical implementation. Many recent works have proposed improvements to address this issue, but they increase the number of
transitions (and then of memory accesses) per character. This paper presents a new representation for DFAs, orthogonal to most of the
previous solutions, called delta finite automata (FA), which considerably reduces states and transitions while preserving a transition
per character only, thus allowing fast matching. A further optimization exploits Nth order relationships within the DFA by adopting
the concept of temporary transitions.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Our area of interest for the paper is the improvement of performance of DSR routing protocol by
changing in algorithm and this Improved DSR protocol should compare with remaining protocols
taken in this research paper.
2. In this paper we made changesin traditional DSR protocol and generation of new improved DSR the
different performance parameters and compare with AODV/DSR/DSDV protocols in mobility and
non- mobility scenarios nodes up to 300.
3. We can plot the graphs throughput, End to end Delay, Packet delivery Ratio, Dropping Ratio, and
average energy consumption on Mobility and Non-Mobility scenario by using Network Simulator
version 2.34 for Modified DSR protocols. M-DSR, DSDV perform well when Mobility is low.
AN INVERTED LIST BASED APPROACH TO GENERATE OPTIMISED PATH IN DSR IN MANETS –...Editor IJCATR
In this paper, we design and formulate the inverted list based approach for providing safer path and effective
communication in DSR protocol.Some nodes in network can participate in network more frequenctly whereas some nodes are not
participating. Because of this there is the requirement of such an approach that will take an intelligent decision regarding the sharing of
bandwidth or the resource to a node or the node group. Dynamic source routing protocol (DSR) is an on-demand, source routing
protocol , whereby all the routing information is maintained (continually updated) at mobile nodes.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Our area of interest for the paper is the improvement of performance of DSR routing protocol by
changing in algorithm and this Improved DSR protocol should compare with remaining protocols
taken in this research paper.
2. In this paper we made changesin traditional DSR protocol and generation of new improved DSR the
different performance parameters and compare with AODV/DSR/DSDV protocols in mobility and
non- mobility scenarios nodes up to 300.
3. We can plot the graphs throughput, End to end Delay, Packet delivery Ratio, Dropping Ratio, and
average energy consumption on Mobility and Non-Mobility scenario by using Network Simulator
version 2.34 for Modified DSR protocols. M-DSR, DSDV perform well when Mobility is low.
AN INVERTED LIST BASED APPROACH TO GENERATE OPTIMISED PATH IN DSR IN MANETS –...Editor IJCATR
In this paper, we design and formulate the inverted list based approach for providing safer path and effective
communication in DSR protocol.Some nodes in network can participate in network more frequenctly whereas some nodes are not
participating. Because of this there is the requirement of such an approach that will take an intelligent decision regarding the sharing of
bandwidth or the resource to a node or the node group. Dynamic source routing protocol (DSR) is an on-demand, source routing
protocol , whereby all the routing information is maintained (continually updated) at mobile nodes.
Hardware Implementations of RS Decoding Algorithm for Multi-Gb/s Communicatio...RSIS International
In this paper, we have designed the VLSI hardware for a novel RS decoding algorithm suitable for Multi-Gb/s Communication Systems. Through this paper we show that the performance benefit of the algorithm is truly witnessed when implemented in hardware thus avoiding the extra processing time of Fetch-Decode-Execute cycle of traditional microprocessor based computing systems. The new algorithm with less time complexity combined with its application specific hardware implementation makes it suitable for high speed real-time systems with hard timing constraints. The design is implemented as a digital hardware using VHDL
In a Mobile Ad hoc Network (MANET), due to mobility, limited battery power and poor features of nodes,
network partitioning and nodes disconnecting occur frequently. To improve data availability, database
systems create multiple copies of each data object and allocate them on different nodes. This paper
proposes Automated Re-allocator of Replicas Over MANET (ARROM), that addresses these issues.
ARROM reduces the average response time of requests between clients and database servers by
reallocating replicas frequently. In addition, ARROM increases the average throughput in the network. Our
performance study indicates that ARROM improves average response time and average network
throughput in MANET as compared to resent existing scheme.
Shortest Tree Routing With Security In Wireless Sensor NetworksIJERA Editor
We propose STR to resolve the main reasons of overall network performance degradation of ZTR, which are the detour path problem and the traffic concentration problem. Second, we prove that the 1-hop neighbor nodes used by STR improve the routing path efficiency and alleviate the traffic load concentrated on tree links in ZTR. Third, we analyze the performance of ZTR, STR, and AODV by differentiating the network conditions such as network density, ZigBee network constraints, traffic types, and the network traffic. For modification security purpose we are also encrypting the data packets during transmission. So that the intermediate nodes are not able to view the data during transmission. For Encryption process, we are using RC4 Algorithm. Short cut tree routing is used for minimizing the routing path from source to destination.
A Compression & Encryption Algorithms on DNA Sequences Using R 2 P & Selectiv...IJMERJOURNAL
ABSTRACT: The size of DNA (Deoxyribonucleic Acid) sequences is varying in the range of millions to billions of nucleotides and two or three times bigger annually. Therefore efficient lossless compression technique, data structures to efficiently store, access, secure communicate and search these large datasets are necessary. This compression algorithm for genetic sequences, based on searching the exact repeat, reverse and palindrome (R2P) substring substitution and create a Library file. The R2P substring is replaced by corresponding ASCII character where for repeat, selecting ASCII characters ranging from 33 to 33+72, for reverse from 33+73 to 33+73+72 and for palindrome from 179 to 179+72. The selective encryption technique, the data are encrypted either in the library file or in compressed file or in both, also by using ASCII code and online library file acting as a signature. Selective encryption, where a part of message is encrypted keeping the remaining part unencrypted, can be a viable proposition for running encryption system in resource constraint devices. The algorithm can approach a moderate compression rate, provide strong data security, the running time is very few second and the complexity is O(n2 ). Also the compressed data again compressed by renounced compressor for reducing the compression rate & ratio. This techniques can approach a compression rate of 2.004871bits/base.
Fuzzy-Controlled Scheduling of Route-Request Packets (FSRR) in Mobile Ad Hoc ...A. Sufian
In ad hoc networks, the scheduling of route-request packets should be different from that of message packets, because during
transmission of message packets the location of the destination is known whereas in route discovery this is not known in
most of the cases. The router has to depend upon the last known location, if any, of the destination to determine the center
and radius of the circle that embeds all possible current position of the destination. Route-request packets generated from
the source are directed towards this circle i.e., directional route discovery can be applied. Otherwise, when no earlier location
of the destination is known the route-requested has to be broadcast in the whole network consuming a significant amount of
time than directional route discovery. The present article proposes a fuzzy controlled scheduling of route-request packets inparticular that greatly reduces the average delay in route discovery in ad hoc networks.
Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1...Syeful Islam
Abstract—In this paper we consider a local area network (LAN) of dual mode service
where one is a token bus and the other is a carrier sense multiple access with a collision
detection (CSMA/CD) bus. The objective of the paper is to find the overall cell/packet
dropping probability of a dual mode LAN for finitelength queue M/G/1(m) traffic. Here, the
offered traffic of the LAN is taken to be the equivalent carried traffic of a one-millisecond
delay. The concept of a tabular solution for two-dimensional Poisson’s traffic of circuit
switching is adapted here to find the cell dropping probability of the dual mode packet
service. Although the work is done for the traffic of similar bandwidth, it can be extended
for the case of a dissimilar bandwidth of a circuit switched network.
Hardware Implementations of RS Decoding Algorithm for Multi-Gb/s Communicatio...RSIS International
In this paper, we have designed the VLSI hardware for a novel RS decoding algorithm suitable for Multi-Gb/s Communication Systems. Through this paper we show that the performance benefit of the algorithm is truly witnessed when implemented in hardware thus avoiding the extra processing time of Fetch-Decode-Execute cycle of traditional microprocessor based computing systems. The new algorithm with less time complexity combined with its application specific hardware implementation makes it suitable for high speed real-time systems with hard timing constraints. The design is implemented as a digital hardware using VHDL
In a Mobile Ad hoc Network (MANET), due to mobility, limited battery power and poor features of nodes,
network partitioning and nodes disconnecting occur frequently. To improve data availability, database
systems create multiple copies of each data object and allocate them on different nodes. This paper
proposes Automated Re-allocator of Replicas Over MANET (ARROM), that addresses these issues.
ARROM reduces the average response time of requests between clients and database servers by
reallocating replicas frequently. In addition, ARROM increases the average throughput in the network. Our
performance study indicates that ARROM improves average response time and average network
throughput in MANET as compared to resent existing scheme.
Shortest Tree Routing With Security In Wireless Sensor NetworksIJERA Editor
We propose STR to resolve the main reasons of overall network performance degradation of ZTR, which are the detour path problem and the traffic concentration problem. Second, we prove that the 1-hop neighbor nodes used by STR improve the routing path efficiency and alleviate the traffic load concentrated on tree links in ZTR. Third, we analyze the performance of ZTR, STR, and AODV by differentiating the network conditions such as network density, ZigBee network constraints, traffic types, and the network traffic. For modification security purpose we are also encrypting the data packets during transmission. So that the intermediate nodes are not able to view the data during transmission. For Encryption process, we are using RC4 Algorithm. Short cut tree routing is used for minimizing the routing path from source to destination.
A Compression & Encryption Algorithms on DNA Sequences Using R 2 P & Selectiv...IJMERJOURNAL
ABSTRACT: The size of DNA (Deoxyribonucleic Acid) sequences is varying in the range of millions to billions of nucleotides and two or three times bigger annually. Therefore efficient lossless compression technique, data structures to efficiently store, access, secure communicate and search these large datasets are necessary. This compression algorithm for genetic sequences, based on searching the exact repeat, reverse and palindrome (R2P) substring substitution and create a Library file. The R2P substring is replaced by corresponding ASCII character where for repeat, selecting ASCII characters ranging from 33 to 33+72, for reverse from 33+73 to 33+73+72 and for palindrome from 179 to 179+72. The selective encryption technique, the data are encrypted either in the library file or in compressed file or in both, also by using ASCII code and online library file acting as a signature. Selective encryption, where a part of message is encrypted keeping the remaining part unencrypted, can be a viable proposition for running encryption system in resource constraint devices. The algorithm can approach a moderate compression rate, provide strong data security, the running time is very few second and the complexity is O(n2 ). Also the compressed data again compressed by renounced compressor for reducing the compression rate & ratio. This techniques can approach a compression rate of 2.004871bits/base.
Fuzzy-Controlled Scheduling of Route-Request Packets (FSRR) in Mobile Ad Hoc ...A. Sufian
In ad hoc networks, the scheduling of route-request packets should be different from that of message packets, because during
transmission of message packets the location of the destination is known whereas in route discovery this is not known in
most of the cases. The router has to depend upon the last known location, if any, of the destination to determine the center
and radius of the circle that embeds all possible current position of the destination. Route-request packets generated from
the source are directed towards this circle i.e., directional route discovery can be applied. Otherwise, when no earlier location
of the destination is known the route-requested has to be broadcast in the whole network consuming a significant amount of
time than directional route discovery. The present article proposes a fuzzy controlled scheduling of route-request packets inparticular that greatly reduces the average delay in route discovery in ad hoc networks.
Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1...Syeful Islam
Abstract—In this paper we consider a local area network (LAN) of dual mode service
where one is a token bus and the other is a carrier sense multiple access with a collision
detection (CSMA/CD) bus. The objective of the paper is to find the overall cell/packet
dropping probability of a dual mode LAN for finitelength queue M/G/1(m) traffic. Here, the
offered traffic of the LAN is taken to be the equivalent carried traffic of a one-millisecond
delay. The concept of a tabular solution for two-dimensional Poisson’s traffic of circuit
switching is adapted here to find the cell dropping probability of the dual mode packet
service. Although the work is done for the traffic of similar bandwidth, it can be extended
for the case of a dissimilar bandwidth of a circuit switched network.
Optimized Design of 2D Mesh NOC Router using Custom SRAM & Common Buffer Util...VLSICS Design
With the shrinking technology, reduced scale and power-hungry chip IO leads to System on Chip. The design of SOC using traditional standard bus scheme encounters with issues like non-uniform delay and routing problems. Crossbars could scale better when compared to buses but tend to become huge with increasing number of nodes. NOC has become the design paradigm for SOC design for its highly regularized interconnect structure, good scalability and linear design effort. The main components of an NoC topology are the network adapters, routing nodes, and network interconnect links. This paper mainly deals with the implementation of full custom SRAM based arrays over D FF based register arrays in the design of input module of routing node in 2D mesh NOC topology. The custom SRAM blocks replace DFF(D flip flop) memory implementations to optimize area and power of the input block. Full custom design of SRAMs has been carried out by MILKYWAY, while physical implementation of the input module with SRAMs has been carried out by IC Compiler of SYNOPSYS.The improved design occupies approximately 30% of the area of the original design. This is in conformity to the ratio of the area of an SRAM cell to the area of a D flip flop, which is approximately 6:28.The power consumption is almost halved to 1.5 mW. Maximum operating frequency is improved from 50 MHz to 200 MHz. It is intended to study and quantify the behavior of the single packet array design in relation to the multiple packet array design. Intuitively, a
common packet buffer would result in better utilization of available buffer space. This in turn would translate into lower delays in transmission. A MATLAB model is used to show quantitatively how performance is improved in a common packet array design.
Optimized Design of 2D Mesh NOC Router using Custom SRAM & Common Buffer Util...VLSICS Design
With the shrinking technology, reduced scale and power-hungry chip IO leads to System on Chip. The design of SOC using traditional standard bus scheme encounters with issues like non-uniform delay and routing problems. Crossbars could scale better when compared to buses but tend to become huge with increasing number of nodes. NOC has become the design paradigm for SOC design for its highly regularized interconnect structure, good scalability and linear design effort. The main components of an NoC topology are the network adapters, routing nodes, and network interconnect links. This paper mainly deals with the implementation of full custom SRAM based arrays over D FF based register arrays in the design of input module of routing node in 2D mesh NOC topology. The custom SRAM blocks replace D FF(D flip flop) memory implementations to optimize area and power of the input block. Full custom design of SRAMs has been carried out by MILKYWAY, while physical implementation of the input module with SRAMs has been carried out by IC Compiler of SYNOPSYS.The improved design occupies approximately 30% of the area of the original design. This is in conformity to the ratio of the area of an SRAM cell to the area of a D flip flop, which is approximately 6:28.The power consumption is almost halved to 1.5 mW. Maximum operating frequency is improved from 50 MHz to 200 MHz. It is intended to study and quantify the behavior of the single packet array design in relation to the multiple packet array design. Intuitively, a
common packet buffer would result in better utilization of available buffer space. This in turn would translate into lower delays in transmission. A MATLAB model is used to show quantitatively how performance is improved in a common packet array design.
Enforcing end to-end proportional fairness with bounded buffer overflow proba...ijwmn
In this paper, we present a distributed flow-based
access scheme for slotted-time protocols, that prov
ides
proportional fairness in ad-hoc wireless networks u
nder constraints on the buffer overflow probabiliti
es at
each node. The proposed scheme requires local infor
mation exchange at the link-layer and end-to-end
information exchange at the transport-layer, and is
cast as a nonlinear program. A medium access contr
ol
protocol is said to be proportionally fair with res
pect to individual end-to-end flows in a network, i
f the
product of the end-to-end flow rates is maximized.
A key contribution of this work lies in the constru
ction of
a distributed dual approach that comes with low com
putational overhead. We discuss the convergence
properties of the proposed scheme and present simul
ation results to support our conclusions.
OPTIMIZING END-TO-END BIG DATA TRANSFERS OVER TERABITS NETWORK INFRASTRUCTURENexgen Technology
GET IEEE BIG DATA,JAVA ,DOTNET,ANDROID ,NS2,MATLAB,EMBEDED AT LOW COST WITH BEST QUALITY PLEASE CONTACT BELOW NUMBER
FOR MORE INFORMATION PLEASE FIND THE BELOW DETAILS:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com
Mobile: 9791938249
Telephone: 0413-2211159
www.nexgenproject.com
Orchestrating Bulk Data Transfers across Geo-Distributed Datacentersnexgentechnology
bulk ieee projects in pondicherry,ieee projects in pondicherry,final year ieee projects in pondicherry
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
ORCHESTRATING BULK DATA TRANSFERS ACROSS GEO-DISTRIBUTED DATACENTERSNexgen Technology
bulk ieee projects in pondicherry,ieee projects in pondicherry,final year ieee projects in pondicherry
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Orchestrating bulk data transfers acrossnexgentech15
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Text Mining in Digital Libraries using OKAPI BM25 ModelEditor IJCATR
The emergence of the internet has made vast amounts of information available and easily accessible online. As a result, most libraries have digitized their content in order to remain relevant to their users and to keep pace with the advancement of the internet. However, these digital libraries have been criticized for using inefficient information retrieval models that do not perform relevance ranking to the retrieved results. This paper proposed the use of OKAPI BM25 model in text mining so as means of improving relevance ranking of digital libraries. Okapi BM25 model was selected because it is a probability-based relevance ranking algorithm. A case study research was conducted and the model design was based on information retrieval processes. The performance of Boolean, vector space, and Okapi BM25 models was compared for data retrieval. Relevant ranked documents were retrieved and displayed at the OPAC framework search page. The results revealed that Okapi BM 25 outperformed Boolean model and Vector Space model. Therefore, this paper proposes the use of Okapi BM25 model to reward terms according to their relative frequencies in a document so as to improve the performance of text mining in digital libraries.
Green Computing, eco trends, climate change, e-waste and eco-friendlyEditor IJCATR
This study focused on the practice of using computing resources more efficiently while maintaining or increasing overall performance. Sustainable IT services require the integration of green computing practices such as power management, virtualization, improving cooling technology, recycling, electronic waste disposal, and optimization of the IT infrastructure to meet sustainability requirements. Studies have shown that costs of power utilized by IT departments can approach 50% of the overall energy costs for an organization. While there is an expectation that green IT should lower costs and the firm’s impact on the environment, there has been far less attention directed at understanding the strategic benefits of sustainable IT services in terms of the creation of customer value, business value and societal value. This paper provides a review of the literature on sustainable IT, key areas of focus, and identifies a core set of principles to guide sustainable IT service design.
Policies for Green Computing and E-Waste in NigeriaEditor IJCATR
Computers today are an integral part of individuals’ lives all around the world, but unfortunately these devices are toxic to the environment given the materials used, their limited battery life and technological obsolescence. Individuals are concerned about the hazardous materials ever present in computers, even if the importance of various attributes differs, and that a more environment -friendly attitude can be obtained through exposure to educational materials. In this paper, we aim to delineate the problem of e-waste in Nigeria and highlight a series of measures and the advantage they herald for our country and propose a series of action steps to develop in these areas further. It is possible for Nigeria to have an immediate economic stimulus and job creation while moving quickly to abide by the requirements of climate change legislation and energy efficiency directives. The costs of implementing energy efficiency and renewable energy measures are minimal as they are not cash expenditures but rather investments paid back by future, continuous energy savings.
Performance Evaluation of VANETs for Evaluating Node Stability in Dynamic Sce...Editor IJCATR
Vehicular ad hoc networks (VANETs) are a favorable area of exploration which empowers the interconnection amid the movable vehicles and between transportable units (vehicles) and road side units (RSU). In Vehicular Ad Hoc Networks (VANETs), mobile vehicles can be organized into assemblage to promote interconnection links. The assemblage arrangement according to dimensions and geographical extend has serious influence on attribute of interaction .Vehicular ad hoc networks (VANETs) are subclass of mobile Ad-hoc network involving more complex mobility patterns. Because of mobility the topology changes very frequently. This raises a number of technical challenges including the stability of the network .There is a need for assemblage configuration leading to more stable realistic network. The paper provides investigation of various simulation scenarios in which cluster using k-means algorithm are generated and their numbers are varied to find the more stable configuration in real scenario of road.
Optimum Location of DG Units Considering Operation ConditionsEditor IJCATR
The optimal sizing and placement of Distributed Generation units (DG) are becoming very attractive to researchers these days. In this paper a two stage approach has been used for allocation and sizing of DGs in distribution system with time varying load model. The strategic placement of DGs can help in reducing energy losses and improving voltage profile. The proposed work discusses time varying loads that can be useful for selecting the location and optimizing DG operation. The method has the potential to be used for integrating the available DGs by identifying the best locations in a power system. The proposed method has been demonstrated on 9-bus test system.
Analysis of Comparison of Fuzzy Knn, C4.5 Algorithm, and Naïve Bayes Classifi...Editor IJCATR
Early detection of diabetes mellitus (DM) can prevent or inhibit complication. There are several laboratory test that must be done to detect DM. The result of this laboratory test then converted into data training. Data training used in this study generated from UCI Pima Database with 6 attributes that were used to classify positive or negative diabetes. There are various classification methods that are commonly used, and in this study three of them were compared, which were fuzzy KNN, C4.5 algorithm and Naïve Bayes Classifier (NBC) with one identical case. The objective of this study was to create software to classify DM using tested methods and compared the three methods based on accuracy, precision, and recall. The results showed that the best method was Fuzzy KNN with average and maximum accuracy reached 96% and 98%, respectively. In second place, NBC method had respective average and maximum accuracy of 87.5% and 90%. Lastly, C4.5 algorithm had average and maximum accuracy of 79.5% and 86%, respectively.
Web Scraping for Estimating new Record from Source SiteEditor IJCATR
Study in the Competitive field of Intelligent, and studies in the field of Web Scraping, have a symbiotic relationship mutualism. In the information age today, the website serves as a main source. The research focus is on how to get data from websites and how to slow down the intensity of the download. The problem that arises is the website sources are autonomous so that vulnerable changes the structure of the content at any time. The next problem is the system intrusion detection snort installed on the server to detect bot crawler. So the researchers propose the use of the methods of Mining Data Records and the method of Exponential Smoothing so that adaptive to changes in the structure of the content and do a browse or fetch automatically follow the pattern of the occurrences of the news. The results of the tests, with the threshold 0.3 for MDR and similarity threshold score 0.65 for STM, using recall and precision values produce f-measure average 92.6%. While the results of the tests of the exponential estimation smoothing using ? = 0.5 produces MAE 18.2 datarecord duplicate. It slowed down to 3.6 datarecord from 21.8 datarecord results schedule download/fetch fix in an average time of occurrence news.
Evaluating Semantic Similarity between Biomedical Concepts/Classes through S...Editor IJCATR
Most of the existing semantic similarity measures that use ontology structure as their primary source can measure semantic similarity between concepts/classes using single ontology. The ontology-based semantic similarity techniques such as structure-based semantic similarity techniques (Path Length Measure, Wu and Palmer’s Measure, and Leacock and Chodorow’s measure), information content-based similarity techniques (Resnik’s measure, Lin’s measure), and biomedical domain ontology techniques (Al-Mubaid and Nguyen’s measure (SimDist)) were evaluated relative to human experts’ ratings, and compared on sets of concepts using the ICD-10 “V1.0” terminology within the UMLS. The experimental results validate the efficiency of the SemDist technique in single ontology, and demonstrate that SemDist semantic similarity techniques, compared with the existing techniques, gives the best overall results of correlation with experts’ ratings.
Semantic Similarity Measures between Terms in the Biomedical Domain within f...Editor IJCATR
The techniques and tests are tools used to define how measure the goodness of ontology or its resources. The similarity between biomedical classes/concepts is an important task for the biomedical information extraction and knowledge discovery. However, most of the semantic similarity techniques can be adopted to be used in the biomedical domain (UMLS). Many experiments have been conducted to check the applicability of these measures. In this paper, we investigate to measure semantic similarity between two terms within single ontology or multiple ontologies in ICD-10 “V1.0” as primary source, and compare my results to human experts score by correlation coefficient.
A Strategy for Improving the Performance of Small Files in Openstack Swift Editor IJCATR
This is an effective way to improve the storage access performance of small files in Openstack Swift by adding an aggregate storage module. Because Swift will lead to too much disk operation when querying metadata, the transfer performance of plenty of small files is low. In this paper, we propose an aggregated storage strategy (ASS), and implement it in Swift. ASS comprises two parts which include merge storage and index storage. At the first stage, ASS arranges the write request queue in chronological order, and then stores objects in volumes. These volumes are large files that are stored in Swift actually. During the short encounter time, the object-to-volume mapping information is stored in Key-Value store at the second stage. The experimental results show that the ASS can effectively improve Swift's small file transfer performance.
Integrated System for Vehicle Clearance and RegistrationEditor IJCATR
Efficient management and control of government's cash resources rely on government banking arrangements. Nigeria, like many low income countries, employed fragmented systems in handling government receipts and payments. Later in 2016, Nigeria implemented a unified structure as recommended by the IMF, where all government funds are collected in one account would reduce borrowing costs, extend credit and improve government's fiscal policy among other benefits to government. This situation motivated us to embark on this research to design and implement an integrated system for vehicle clearance and registration. This system complies with the new Treasury Single Account policy to enable proper interaction and collaboration among five different level agencies (NCS, FRSC, SBIR, VIO and NPF) saddled with vehicular administration and activities in Nigeria. Since the system is web based, Object Oriented Hypermedia Design Methodology (OOHDM) is used. Tools such as Php, JavaScript, css, html, AJAX and other web development technologies were used. The result is a web based system that gives proper information about a vehicle starting from the exact date of importation to registration and renewal of licensing. Vehicle owner information, custom duty information, plate number registration details, etc. will also be efficiently retrieved from the system by any of the agencies without contacting the other agency at any point in time. Also number plate will no longer be the only means of vehicle identification as it is presently the case in Nigeria, because the unified system will automatically generate and assigned a Unique Vehicle Identification Pin Number (UVIPN) on payment of duty in the system to the vehicle and the UVIPN will be linked to the various agencies in the management information system.
Assessment of the Efficiency of Customer Order Management System: A Case Stu...Editor IJCATR
The Supermarket Management System deals with the automation of buying and selling of good and services. It includes both sales and purchase of items. The project Supermarket Management System is to be developed with the objective of making the system reliable, easier, fast, and more informative.
Energy-Aware Routing in Wireless Sensor Network Using Modified Bi-Directional A*Editor IJCATR
Energy is a key component in the Wireless Sensor Network (WSN)[1]. The system will not be able to run according to its function without the availability of adequate power units. One of the characteristics of wireless sensor network is Limitation energy[2]. A lot of research has been done to develop strategies to overcome this problem. One of them is clustering technique. The popular clustering technique is Low Energy Adaptive Clustering Hierarchy (LEACH)[3]. In LEACH, clustering techniques are used to determine Cluster Head (CH), which will then be assigned to forward packets to Base Station (BS). In this research, we propose other clustering techniques, which utilize the Social Network Analysis approach theory of Betweeness Centrality (BC) which will then be implemented in the Setup phase. While in the Steady-State phase, one of the heuristic searching algorithms, Modified Bi-Directional A* (MBDA *) is implemented. The experiment was performed deploy 100 nodes statically in the 100x100 area, with one Base Station at coordinates (50,50). To find out the reliability of the system, the experiment to do in 5000 rounds. The performance of the designed routing protocol strategy will be tested based on network lifetime, throughput, and residual energy. The results show that BC-MBDA * is better than LEACH. This is influenced by the ways of working LEACH in determining the CH that is dynamic, which is always changing in every data transmission process. This will result in the use of energy, because they always doing any computation to determine CH in every transmission process. In contrast to BC-MBDA *, CH is statically determined, so it can decrease energy usage.
Security in Software Defined Networks (SDN): Challenges and Research Opportun...Editor IJCATR
In networks, the rapidly changing traffic patterns of search engines, Internet of Things (IoT) devices, Big Data and data centers has thrown up new challenges for legacy; existing networks; and prompted the need for a more intelligent and innovative way to dynamically manage traffic and allocate limited network resources. Software Defined Network (SDN) which decouples the control plane from the data plane through network vitalizations aims to address these challenges. This paper has explored the SDN architecture and its implementation with the OpenFlow protocol. It has also assessed some of its benefits over traditional network architectures, security concerns and how it can be addressed in future research and related works in emerging economies such as Nigeria.
Measure the Similarity of Complaint Document Using Cosine Similarity Based on...Editor IJCATR
Report handling on "LAPOR!" (Laporan, Aspirasi dan Pengaduan Online Rakyat) system depending on the system administrator who manually reads every incoming report [3]. Read manually can lead to errors in handling complaints [4] if the data flow is huge and grows rapidly, it needs at least three days to prepare a confirmation and it sensitive to inconsistencies [3]. In this study, the authors propose a model that can measure the identities of the Query (Incoming) with Document (Archive). The authors employed Class-Based Indexing term weighting scheme, and Cosine Similarities to analyse document similarities. CoSimTFIDF, CoSimTFICF and CoSimTFIDFICF values used in classification as feature for K-Nearest Neighbour (K-NN) classifier. The optimum result evaluation is pre-processing employ 75% of training data ratio and 25% of test data with CoSimTFIDF feature. It deliver a high accuracy 84%. The k = 5 value obtain high accuracy 84.12%
Hangul Recognition Using Support Vector MachineEditor IJCATR
The recognition of Hangul Image is more difficult compared with that of Latin. It could be recognized from the structural arrangement. Hangul is arranged from two dimensions while Latin is only from the left to the right. The current research creates a system to convert Hangul image into Latin text in order to use it as a learning material on reading Hangul. In general, image recognition system is divided into three steps. The first step is preprocessing, which includes binarization, segmentation through connected component-labeling method, and thinning with Zhang Suen to decrease some pattern information. The second is receiving the feature from every single image, whose identification process is done through chain code method. The third is recognizing the process using Support Vector Machine (SVM) with some kernels. It works through letter image and Hangul word recognition. It consists of 34 letters, each of which has 15 different patterns. The whole patterns are 510, divided into 3 data scenarios. The highest result achieved is 94,7% using SVM kernel polynomial and radial basis function. The level of recognition result is influenced by many trained data. Whilst the recognition process of Hangul word applies to the type 2 Hangul word with 6 different patterns. The difference of these patterns appears from the change of the font type. The chosen fonts for data training are such as Batang, Dotum, Gaeul, Gulim, Malgun Gothic. Arial Unicode MS is used to test the data. The lowest accuracy is achieved through the use of SVM kernel radial basis function, which is 69%. The same result, 72 %, is given by the SVM kernel linear and polynomial.
Application of 3D Printing in EducationEditor IJCATR
This paper provides a review of literature concerning the application of 3D printing in the education system. The review identifies that 3D Printing is being applied across the Educational levels [1] as well as in Libraries, Laboratories, and Distance education systems. The review also finds that 3D Printing is being used to teach both students and trainers about 3D Printing and to develop 3D Printing skills.
Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...Editor IJCATR
In underwater environment, for retrieval of information the routing mechanism is used. In routing mechanism there are three to four types of nodes are used, one is sink node which is deployed on the water surface and can collect the information, courier/super/AUV or dolphin powerful nodes are deployed in the middle of the water for forwarding the packets, ordinary nodes are also forwarder nodes which can be deployed from bottom to surface of the water and source nodes are deployed at the seabed which can extract the valuable information from the bottom of the sea. In underwater environment the battery power of the nodes is limited and that power can be enhanced through better selection of the routing algorithm. This paper focuses the energy-efficient routing algorithms for their routing mechanisms to prolong the battery power of the nodes. This paper also focuses the performance analysis of the energy-efficient algorithms under which we can examine the better performance of the route selection mechanism which can prolong the battery power of the node
Comparative analysis on Void Node Removal Routing algorithms for Underwater W...Editor IJCATR
The designing of routing algorithms faces many challenges in underwater environment like: propagation delay, acoustic channel behaviour, limited bandwidth, high bit error rate, limited battery power, underwater pressure, node mobility, localization 3D deployment, and underwater obstacles (voids). This paper focuses the underwater voids which affects the overall performance of the entire network. The majority of the researchers have used the better approaches for removal of voids through alternate path selection mechanism but still research needs improvement. This paper also focuses the architecture and its operation through merits and demerits of the existing algorithms. This research article further focuses the analytical method of the performance analysis of existing algorithms through which we found the better approach for removal of voids
Decay Property for Solutions to Plate Type Equations with Variable CoefficientsEditor IJCATR
In this paper we consider the initial value problem for a plate type equation with variable coefficients and memory in
1 n R n ), which is of regularity-loss property. By using spectrally resolution, we study the pointwise estimates in the spectral
space of the fundamental solution to the corresponding linear problem. Appealing to this pointwise estimates, we obtain the global
existence and the decay estimates of solutions to the semilinear problem by employing the fixed point theorem
Normal Labour/ Stages of Labour/ Mechanism of LabourWasim Ak
Normal labor is also termed spontaneous labor, defined as the natural physiological process through which the fetus, placenta, and membranes are expelled from the uterus through the birth canal at term (37 to 42 weeks
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...Dr. Vinod Kumar Kanvaria
Exploiting Artificial Intelligence for Empowering Researchers and Faculty,
International FDP on Fundamentals of Research in Social Sciences
at Integral University, Lucknow, 06.06.2024
By Dr. Vinod Kumar Kanvaria
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
Acetabularia Information For Class 9 .docxvaibhavrinwa19
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
Executive Directors Chat Leveraging AI for Diversity, Equity, and InclusionTechSoup
Let’s explore the intersection of technology and equity in the final session of our DEI series. Discover how AI tools, like ChatGPT, can be used to support and enhance your nonprofit's DEI initiatives. Participants will gain insights into practical AI applications and get tips for leveraging technology to advance their DEI goals.
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...Levi Shapiro
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Deep Packet Inspection with Regular Expression Matching
1. International Journal of Computer Applications Technology and Research
Volume 2– Issue 2, 137 - 140, 2013
www.ijcat.com 137
Deep Packet Inspection with Regular Expression
Matching
T. Nalini
Dept of Computer Science and Engineering
Bharath University
Chennai
M. Padmavathy
Dept of Computer Science and Engineering
Bharath University
Chennai
Abstract: Deep packet inspection directs, persists, filters and logs IP-based applications and Web services traffic based on content
encapsulated in a packet's header or payload, regardless of the protocol or application type. In content scanning, the packet payload is
compared against a set of patterns specified as regular expressions. With deep packet inspection in place through a single intelligent
network device, companies can boost performance without buying expensive servers or additional security products. They are typically
matched through deterministic finite automata (DFAs), but large rule sets need a memory amount that turns out to be too large for
practical implementation. Many recent works have proposed improvements to address this issue, but they increase the number of
transitions (and then of memory accesses) per character. This paper presents a new representation for DFAs, orthogonal to most of the
previous solutions, called delta finite automata (δFA), which considerably reduces states and transitions while preserving a transition
per character only, thus allowing fast matching. A further optimization exploits Nth order relationships within the DFA by adopting
the concept of temporary transitions.
Keywords: Regular Expressions, Deep Packet Inspection, Differential Encoding, Finite Automata (FA), Pattern Matching
1. INTRODUCTION
Nowadays, deep packet inspection is required in an
increasing number of network devices (intrusion prevention
systems, traffic monitors, application recognition systems).
Traditionally, the inspection was done with common multiple-
string matching algorithms, but state-of-the-art systems use
regular expressions (regexes) [1] to describe signature sets.
They are adopted by well-known tools, such as Snort [2] and
Bro [3], and in devices by different vendors such as Cisco [4].
Typically, finite automata (FAs) are employed to implement
regexes matching. In particular, deterministic FAs (DFAs)
allow for fast matching by requiring one state transition per
character, while nondeterministic FAs (NFAs) need more
transitions per character. The drawback of DFAs is that for
the current regex sets they require an excessive amount of
memory. Therefore, many works have been recently presented
with the goal of memory reduction for DFAs, by exploiting
the intrinsic redundancy in regex sets. However, most of these
solutions can require more than one memory reference, thus
lowering search speed.
This paper introduces a novel compact representation
scheme (named δFA), which is based on the observation that
since most adjacent states share several common transitions,
it is possible to delete most of them by taking into account the
different ones only (the δ in δFA just emphasizes that it
focuses on the differences between adjacent states). Reducing
the redundancy of transitions appears to be very appealing
since the recent general trend in the proposals for compact
and fast DFAs construction suggests that the information
should be moved toward edges rather than states. In
particular, our idea comes from D2
FA [5], which introduce
default transitions.
We add the concept of “temporary transition,” to
improve the δFA. Instead of specifying the transition set of a
state with respect to its direct parents (also defined 1-step
ancestors), relaxing this requirement to the adoption of N-step
“ancestors” increases the chances of compression. As we will
show in the following, the best approach to exploit this Nth-
order dependence is to define the transitions of the states
between ancestors and child as “temporary.” This, however,
introduces a new problem during the construction process.
The optimal construction (in terms of memory or transition
reduction) appears to be an NP-complete problem. Therefore,
a direct and oblivious approach is chosen for simplicity.
Results on real rule-sets show that our simple approach does
not differ significantly from the optimal construction. Since
this optimized technique is an extension to δFA that exploits
Nth-order dependence, we name it δN
FA. While many other
proposed algorithms for DFA compression require more
transitions per character, δFA and δN
FA examine one state per
character only, thus reducing the number of memory accesses
and speeding up the overall lookup process. This
improvement comes at the cost of wider memory accesses
(with respect to previous schemes).
The rest of this paper is organized as follows. Section II
explains the background of the work. Section III describes the
algorithms for the creation of transition and lookup table.
Section IV describes the experiments and results. Section V
concludes this paper.
2. BACKGROUND WORK
Deep packet inspection has recently gained popularity as
it provides the capability to accurately classify and control
traffic in terms of content, applications, and individual
subscribers. Cisco and others today see deep packet inspection
happening in the network and they argue that “Deep packet
inspection will happen in the ASICs, and that ASICs need to
be modified” [6]. Some applications requiring deep packet
inspection are listed below:
• Network intrusion detection and prevention systems
(NIDS/NIPS) generally scan the packet header and
payload in order to identify a given set of signatures
of well known security threats.
• Layer 7 switches and firewalls provide content-
based filtering, load-balancing, authentication and
monitoring. Application-aware web switches, for
example, provide scalable and transparent load
balancing in data centers.
2. International Journal of Computer Applications Technology and Research
Volume 2– Issue 2, 137 - 140, 2013
www.ijcat.com 138
Deep packet inspection often involves scanning every byte of
the packet payload and identifying a set of matching
predefined patterns. Traditionally, rules have been represented
as exact match strings consisting of known patterns of
interest. Naturally, due to their wide adoption and importance,
several high speed and efficient string matching algorithms
have been proposed recently. Some of the standard string
matching algorithms such as Aho-Corasick [7] Commentz-
Walter [8], and Wu-Manber [9], use a preprocessed data-
structure to perform high-performance matching. A large
body of research literature has concentrated on enhancing
these algorithms for use in networking. Tuck et.al presents
techniques to enhance the worst-case performance of Aho-
Corasick algorithm. Their algorithm was guided by the
analogy between IP lookup and string matching and applies
bitmap and path compression to Aho-Corasick. Their scheme
has been shown to reduce the memory required for the string
sets used in NIDS by up to a factor of 50 while improving
performance by more than 30%.
3. PROPOSED SYSTEM
As discussed, several works in the recent years have focused
on memory reduction of DFAs by trading size for number of
memory accesses. The most important and cited example of
such a technique is D2FA [6], where an input character
(hereafter simply “char”) can require a (configurable) number
of additional steps through the automaton before reaching the
right state.
3.1 Motivating Example
In this section, we introduce δFA, a D2
FA-inspired
automaton that preserves the advantages of D2
FA while
requiring a single memory access per input char. In order to
make clearer the rationale behind δFA construction and the
differences with D2
FA, we start by analyzing the example of
[6] given below.
Fig. 1(a) represents a DFA on the alphabet {a,b,c,d} that
recognizes the regular expressions (a+
),
(b+
c), and (c*d+
). In
Fig. 1(b), the D2
FA for the same set of regexes is shown. The
main idea is to reduce the memory footprint of states by
storing only a limited number of transitions for each state and
by taking a default transition for all input chars for which a
transition is not defined. When, for example, in Fig. 1(b) the
state machine is in state 3 and the input is d, the default
transition to state 1 is taken. State 1 has a specified transition
for char d, therefore we jump to state 4 (as in the standard
DFA).
In this example, taking a default transition costs one more hop
(one more memory access) for a single input char. However, it
may happen that also after taking a default transition, the
destination state for the input char is not specified and another
default transition must be taken, and so on. In the example,
the number of transitions was reduced to nine in the D2
FA
(while the DFA has 20 edges), thus achieving a remarkable
compression.
However, observing the graph in Fig. 1(a), it is evident that
most transitions for a given input lead to the same state,
regardless of the starting state. In particular, adjacent states
share the majority of the next-hop states associated with the
same input chars. Then, if we jump from state 1 to state 2 and
we “remember” (in a local memory) the entire transition set of
1, we will already know all the transitions defined in 2 (which
has the same set of 1). This means that state 2 can be
described with a very small amount of bits. Instead, if we
jump from state 1 to 3, and the next input char is c, the
transition will not be the same as the one that c produces
starting from 1. Then, state 3 will have to specify its transition
for c.
Fig-1: Automata Recognizing (a+), (b+c), and (c*d+) (a) DFA,
(b) D2FA and (c) δFA
The result of what we have just described is shown in Fig.
1(c) (except for the local transition set), which is the δFA
equivalent to the DFA in Fig. 1(a). We have eight edges only
in the graph, and every input char requires a single state
traversal.
3.2 Main Idea of δFA
The target of δFA is to obtain a similar compression as
D2
FA without giving up the single state traversal per
character of DFA. The idea of δFA comes from the following
observations on D2
FAs and DFAs.
• Most default transitions are directed to states closer
to the initial state.
• In a DFA, most transitions for a given input char are
directed to the same state. Therefore, it becomes
evident that most adjacent states share a large part
of the same transitions. Thus, we can store only the
differences between adjacent states. This requires,
however, the introduction of a supplementary
structure that locally stores the transition set of the
current state. The main idea is to let this local
transition set evolve as a new state is reached. If
there is no difference with the previous state for a
given character, then the corresponding transition
defined in the local memory is taken. Otherwise, the
transition stored in the state is chosen. In all cases,
as a new state is read, the local transition set is
updated with all the stored transitions of the state.
The δFA in Fig. 1(c) only stores the transitions that
must be defined for each state in the original DFA.
3.3 Construction
In Algorithm 1, the process for creating a δFA from an N-
states DFA (for a char set of C elements) is shown. The
algorithm works with the transition tablet[s, c] of the input
DFA (i.e., an N × N matrix that has a row per state and where
the ith item in a given row stores the state number to reach
upon the reading of input char i). The final result is a
“compressible” transition table tc[s, c] that stores the
transitions required by the δFA only. All the other cells of the
tc[s, c] matrix are filled with the special LOCAL_TX symbol
and can be simply eliminated through a bitmap.
Algorithm 1: Creation of the Transition Table tc of a δFA
1: for c ← 1, C do
3. International Journal of Computer Applications Technology and Research
Volume 2– Issue 2, 137 - 140, 2013
www.ijcat.com 139
2: tc[1, c] ← t[1, c]
3: for s ← 2, N do
4: for c ← 1, C do
5: tc[s, c] ← EMPTY
6: for Sparent ← 1, N do
7: for c ← 1, C do
8: Schild ← t[Sparent, c]
9: for y ← 1, C do
10: if t[Sparent, y] ≠ t[Schild, y] then
11: tc[Schild, y] ← t[Schild, y]
12. else
12: if tc[Schild, y] == EMPTY then
14: tc[Schild, y] ←
LOCAL_TX
The construction requires a step for each transition
(C) of each pair of adjacent states (N × C) in the input DFA,
thus it costs O (N × C2
) in terms of time complexity. The
space complexity is O (N ×C) because the structure upon
which the algorithm works is another N ×C matrix. In detail,
the construction algorithm first initializes the tc matrix with
EMPTY symbols and copies the first (root) state of the
original DFA in the tc (it will act as base for subsequently
storing the differences). Then, the algorithm observes the
states in the original DFA one at a time. It refers to the
observed state as parent. Then, it checks the children states
(i.e., the states reached in one transition from parent state).
If, for an input char c, the child state stores a
different transition than the one associated with any of its
parent nodes, we cannot exploit the knowledge we have from
the previous state, and this transition must be stored in the tc
table. On the other hand, when all of the states that lead to the
child state for a given character share the same transition, then
we can omit to store that transition. In Algorithm 1, this is
done by using the special symbol LOCAL_ TX.
After the construction, since the number of
transitions per state is significantly reduced, it may happen
that some of the states have the same identical transition set. If
we find j identical states, we can simply store one of them,
delete the other j-1, and substitute all the references to those
with the single state we left. Notice that this operation again
creates the opportunity for a new state-number reduction
because the substitution of state references makes it more
probable for two or more states to share the same transition
set. Hence, we iterate the process until the duplicate states
end.
3.4 Lookup
The lookup in a δFA is shown in Algorithm 2. First, the
current state must be read with its whole transition set. Then,
it is used to update the local transition set tloc: For each
transition defined in the set read from the state, we update the
corresponding entry in the local storage. This procedure
comes at virtually no cost since it requires a number of
operations on a fast local memory and its execution is easily
masked in threaded systems or hardware implementations.
Finally, the next state snext is computed by simply observing
the proper entry in the local storage tloc .
Algorithm 2: Pseudocode for the lookup in a δFA. The
current state is s and the input char is c
1. read(s)
2. for i ← 1, C do
3. if tc[s,i] ≠ LOCAL_TX then
4. tloc[i] ← tc[s,i]
5. snext←tloc[c]
return snext
4. EXPERIMENTS AND RESULTS
The language used is java sdk2.0. Java is related to C++,
which is a direct descendant of C. The trouble with C and
C++ is that they are designed to be compiled for a specific
target. But Java is a portable, platform-independent language
that could be used to produce code that would run on a variety
of CPUs under differing environments. Java can be used to
create two types of programs: applications and applets. An
application is a program that runs on our computer, under the
operating system of that computer. Java is Simple, Secure,
Portable, Object-oriented, Robust, Multithreaded,
Architectural-neutral, Interpreted, High Performance,
Distributed, and Dynamic.
As the number of network security threats rises, the
NIDS has become one of the most important applications of
packet inspection. Therefore, this study demonstrates the
feasibility of integrating the proposed as the matching regular
expression sets, introduces a novel compact representation
scheme (named FA), which is based on the observation that
since most adjacent states share several common transitions, it
is possible to delete most of them by taking into account the
different ones only (the in FA just emphasizes that it focuses
on the differences between adjacent states). Reducing the
redundancy of transitions appears to be very appealing since
the recent general trend in the proposals for compact and fast
DFAs construction suggests that the information should be
moved toward edges rather than states.
Fig-2: Packet construction Fig-3 Transmission
Packet Construction:
Fig-2 shows the packet construction, we are
constructing the packets with a regular expression. The header
information of a data packet is added in this phase. A packet
consists of two kinds of data: control information and user
data (also known as payload). The control information
provides data the network needs to deliver the user data, for
example: source and destination addresses, error detection
codes like checksums, and sequencing information. Typically,
control information is found in packet headers and trailers,
with user data in between. The algorithms shown in Section II
C.1 and D.1 are used to construct the transition table, lookup
table respectively. It initializes the number of transitions in the
DFA construction.
Transmission:
Fig-3 shows the transmission, the sender transmits
the data to the receiver through the intermediate nodes.To find
which source data is send into particular destination in the
network. Here the data is received in all the intermediate
4. International Journal of Computer Applications Technology and Research
Volume 2– Issue 2, 137 - 140, 2013
www.ijcat.com 140
nodes and it must be checked for the illegitimate packets. The
GUI provides the facility to send the packets to be inspected.
Here the transitions will be checked and default transition will
be added. The result of this will sent to look up table.
Fig-4: Packet Inspection Fig-5: Evaluation
Packet Inspection:
Fig-4 shows the packet inspection. This is the phase of
classifying intruder packet from the transmission. In the high-
layer intrusion detection, expression may appear anywhere in
the packet payload and making the attacking packets difficult
to recognize. It may not only examine the header information
but also the contents of the packet in order to determine more
about the packet than just information about its source and
destination. If the packets are matched with our expression
and the packet is alive then it will be forwarded to the client
else that will be discarded.
5. CONCLUSION
In this paper, we considered the implementation of fast
regular expression matching for packet payload scanning
applications. While NFA based approaches are usually
adopted for implementation because naïve DFA
implementations can have exponentially growing memory
costs, we showed that with our rewriting techniques, memory-
efficient DFA-based approaches are possible. While we do
not claim to handle all possible cases of dramatic DFA growth
(in fact the worse case cannot be improved), rewrite rules do
over those patterns present in common payload scanning rule
sets thus making fast DFA-based pattern matching feasible for
today’s payload scanning applications. It is possible that a
new type of attack also generates signatures of large DFAs.
For those cases, unfortunately, we need to study the signature
structures before we can rewrite them.
6. REFERENCES
[1] R. Sommer and V. Paxson, “Enhancing byte level network
intrusion detection signatures with context,’’in Proc.
ACM CCS, 2003, pp. 262 – 271.
[2] “Snort: Lightweight intrusion detection for networks,”
Sourcefire, Inc., Columbia, MD[Online]. Available:
http://www.snort.org/.
[3] “Bro: A system for detecting network intruders in
real time,” Lawrence Berkeley National Laboratory,
Berkeley, CA [Online]. Available: http://www.bro-
ids.org
[4] J. William and W. Eatherton, “An encoded version of reg-
ex database from Cisco Systems provided for research
purposes,” 2005.
[5] S. Kumar, S. Dharmapurikar, F. Yu, P. Crowley, and J.
Turner, “Algorithms to accelerate multiple regular
expressions matching for deep packet inspection,”
in Proc. ACM SIGCOMM, 2006, pp. 339–350.
[6] Scott Tyler Shafer, Mark Jones, “Network edge courts
apps,”http://infoworld.com/article/02/05/27/020527newe
bdev_1.html
[7] A. V. Aho and M. J. Corasick, “Efficient string matching:
An aid to bibliographic search,” Comm. of the ACM,
18(6):333–340, 1975.
[8] B. Commentz-Walter, “A string matching algorithm fast
on the average,” Proc. of ICALP, pages 118–132, July
1979.
[9] S. Wu, U. Manber, “A fast algorithm for multi-pattern
searching,” Tech. R. TR-94-17, Dept. of Comp. Science,
Univ of Arizona, 1994.
[10] D.R. Sidhu and V. K. Prasanna, “Fast regular
expression matching using FPGAs,” In IEEE
Symposium on Field- Programmable Custom Computing
Machines, Rohnert Park, CA, USA, April 2001.
[11] Antichi, G. Di Pietro, A. Ficara, D. Giordano, S. Procissi,
G. Vitucci, "Second-Order Differential Encoding of
Deterministic Finite Automata," Dept. of Inf. Eng., Univ.
of Pisa, Pisa, Italy Nov. 30 2009-Dec. 4 2009.