Title: Improved Algorithm for Thai Characters to Encryption and Decryption Processes
<br>Cover Date: 2025-03-01
<br>Cover Display Date: March 2025
<br>DOI: 10.58346/JOWUA.2025.I1.019
<br>Description: This article introduces a method for converting Thai characters into pseudo-integers for encryption and decryption processes. These integers exhibit a compatible length. The proposed method includes two different parts. Initially, Thai characters are converted into pseudo numbers, which are then combined to create the plaintext. The second step requires separating the results obtained from the decryption process to reconstruct the plaintext. This method is simple because each pseudo-integer maintains a uniform size, consisting of two-digit numbers. RSA with modulus values of 1024, 2048, and 4096 bits was implemented to analyze the results. The experiment was divided into two parts. The first section evaluated the time required for processing both proposed approaches, particularly the conversion between Thai characters and numerical values. The analysis demonstrated that both methods had execution durations under one second, especially when processing 1000 characters. With the considerable input size, the average processing time remained under 10 milliseconds. Therefore, it can be claimed that proposed methods require little processing time. The second phase of the experiment included evaluating the pseudo-integer obtained from the initial study for encryption and decryption. The results demonstrated that both the encryption and decryption processes were executed within 1 second, considering an initial message is less than 1417 characters. Therefore, it can be concluded that the encryption and decryption of Thai characters, represented by pseudo-integers, can be performed rapidly and securely.
<br>Citations: 0
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: Secure Supply Chain Information Interchange using Distributed Trust Backbone
<br>Cover Date: 2025-01-01
<br>Cover Display Date: Jan 2025
<br>DOI: 10.37936/ecti-cit.2025191.257456
<br>Description: International trade requires transparent visibility of the goods transportation. High-quality data related to containers is essential for container movement across the border speed. However, customs and port authorities face information incorrectness and inconsistency, which are significant determinants that decrease the performance of container clearance in supply chain activities. The Seamless Integrated Data Pipeline principle has been proposed to overcome the mentioned data quality shortcomings and enhance supply chain visibility. Based on the Data Pipeline idea, we proposed the Distributed Trust Backbone (DTB) as a model of secure information exchange between parties within the supply chain activity. However, the supply chain data is highly dynamic. Access control on dynamic resources is the key to enabling secure data exchange and clear visibility. We take this challenge up in this paper. We propose an access control mechanism based on the supply chain Data Pipeline concept and apply it to the DTB model. The elaboration on the concrete detail of the system is presented in this paper. The prototype has been developed and performed in the simulation tests. It reduces 58% of requesting data for supply chain activities. The results of the experiments show that our proposed method performs 100% access control to data with BigO(1) accessing the Access Control List. It can ensure that the information for decision-making in the supply chain is of high quality. The supply chain visibility is clearer and speeds up a modern information exchange system of supply chains.
<br>Citations: 0
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: The special method with the fake key to attack RSA
<br>Cover Date: 2024-10-01
<br>Cover Display Date: Oct 2024
<br>DOI: 10.47974/JIM-1689
<br>Description: Because RSA is the cryptographic algorithm that is still extensively employed today, several attack techniques against RSA are continually being developed. These algorithms are divided into two distinct groups. The first group is a general group unaffected by RSA parameters. The other group is unique due to at least one characteristic that represents a vulnerability. The aim of this research is to reveal the new vulnerabilities in RSA and to provide ways for recovering the original plaintext. The first vulnerability occurs when the sum of the private key and Euler totient function is near to the modulus but lower than the modulus. If this result is found, it can be selected as the exponent which is called the fake key. The second situation occurs whenever the key is larger than the modulus. The experimental results indicate that if a new weak point is found, the fake key may be disclosed quickly despite the modulus’s size. In addition, when the sum of the public key and the Euler totient function is relatively near to the modulus, the proposed method can be also used to break the modulus. Additionally, the other vulnerability is demonstrated. It occurs when the product of the unknown integer j and the modulus is near to the addition of the key and the product of the other unknown integer and the Euler totient function. However, the issue with the second weak point is the mechanism for finding j.
<br>Citations: 0
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: Ladybug: An Automated Cultivation Robot for Addressing the Manpower Shortage in the Agricultural Industry
<br>Cover Date: 2024-04-01
<br>Cover Display Date: April 2024
<br>DOI: 10.37936/ecti-cit.2024182.254769
<br>Description: The agricultural sector is projected to need more labor as a result odeclining interest in careers within this domain. Despite the escalating demand for agricultural goods, previous endeavors to mitigate this challenge through the deployment of robotic prototypes have encountered hindrances such as issues pertaining to automation, adaptability to varying tasks, and the financial burdens associated with development. To address this exigency, we have developed an automated cultivation robot utilizing advancements in the Internet of Things (IoT), Image Processing, and Artificial Intelligence (AI) for seeding in pots. The robot demonstrates the capacity to sow seeds in 257 pots per hour, accomplish a mission within 12.53 minutes, traverse at a velocity of 360 meters per hour, and seed pots at a rate of 13.37 seconds per pot. It possesses an operational duration oapproximately two hours, completing nine cycles and seeding 486 pots on a single charge. Notably, the robot exhibits a mission success rate of 1.00 and a seeding accuracy 0.78. Moreover, it features an adaptable workspace and a lightweight frame weighing 20 kg, rendering it a cost-effective solution for mass production.
<br>Citations: 0
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: Developing an Intelligent Farm System to Automate Real-time Detection of Fungal Diseases in Mushrooms
<br>Cover Date: 2024-01-01
<br>Cover Display Date: 2024
<br>DOI: 10.55003/cast.2023.255708
<br>Description: Mushrooms are economically valuable crops of high nutritional value. However, during cultivation they are continually threatened by fungal diseases, even in controlled-condition farm ecosystems. Fungal diseases significantly affect mushroom growth and can rapidly contaminate an entire crop. Farmer inspections can be hazardous to farmer health. This paper contributes an automated fungal disease detection system for the Sajor-caju mushrooms together with an intelligent farm system for precise cultivation environment control. The objective was to create and test a detection system that could detect fungal diseases rapidly, reduce farmer exposure to fungal spores, and alert farmers when fungal disease was detected. The system is composed of three parts: (i) a high-precision environment control system, (ii) an innovative imaging robot system, and (iii) a real-time fungal disease prognosis system using deep learning, with an alarm system. The trial results show that the real-time disease prognosis system has 94.35% precision (89.47% F1-score, n=13,500), and its twice daily inspections detect and report fungal disease typically within 6 to 12 h. The innovative farm’s overall capability for mushroom cultivation (environment control) is regarded as excellent and has precise control (99.6% capability, over 3-months). The innovative imaging robot’s overall operational trial performance is effective (at 99.7%). Moreover, the system effectively notifies farmers via smartphone when a fungal disease is detected.
<br>Citations: 5
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: The enhancement of quantum key distribution protocol to increase communication security between two parties
<br>Cover Date: 2024-01-01
<br>Cover Display Date: 2024
<br>DOI: 10.47974/JIM-1640
<br>Description: In this research, a new technique based on quantum key distribution (QKD) is described to lower the likelihood that eavesdroppers can intercept two-party communications without being detected by the sender and the recipient. The central idea is to enhance BB84 by increasing two quantum gates, Pauli-X gate and Pauli-Z gate, on both the sender and receiver sides to change the direction of each quantum state. This signifies that three control parameters must be specified to control three gates on both sides, excluding the control parameter for the quantum gate that generates a random bit on the sender side. In fact, the possibility that eavesdroppers may discreetly capture the information is 0.5 for nearly all methods. However, the probability of information captured by an eavesdropper decreases to 0.25 when all conceivable cases from Tables 1 through 7 are considered. Therefore, the proposed technique for exchanging the secret key is more secure and should be chosen for the implementation.
<br>Citations: 0
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: The Variant of Digital Signature Algorithm for Constant Message
<br>Cover Date: 2023-05-01
<br>Cover Display Date: 1 May 2023
<br>DOI: 10.58346/JISIS.2023.I2.005
<br>Description: This study aims to present a modified technique for signing constant messages. In general, intruders may often steal the digital signature of a constant message with relative ease. Assuming there is a constant message that must always be signed by the signer, the digital signature must equally have a constant value. If it is communicated through an insecure channel to the recipient or verifier and is intercepted along the way by attackers, they can assume the identity of the signer and use this signature for authentication. In fact, the proposed method, Digital Signature Algorithm for Constant Message (DSACM) and DSACMV2, are the result of the combination between RSA and OTP. In addition, OTP is selected for signing and validating procedures in which the secret key must be regenerated for each process. Thus, the ciphertext is constantly changing, but the message remains fixed. Moreover, RSA is chosen to protect the transmission of the secret key across an insecure channel. The experimental findings indicate that DSACM and DSACMV2 are suitable for signing a message with a constant value because the signature is an undetermined value. Although it takes two encryption procedures and two decryption processes, the time required to generate the secret key and perform the exclusive or operation increases little. In addition, the proposed methods have the benefit that the constant message is not modified. In fact, it must be combined with an integer such as a timestamp and a random number for the other techniques for changing the ciphertext, and it cannot be signed a single time if its length exceeds the private key.
<br>Citations: 3
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: Deep learning for classifying thai deceptive messages
<br>Cover Date: 2023-05-01
<br>Cover Display Date: May 2023
<br>DOI: 10.11591/ijeecs.v30.i2.pp1232-1241
<br>Description: Online deception has become a major problem affecting people, society, the economy, and national security. It is mostly done by spreading deceptive messages because message are quickly spread on social networks and are easily accessed by anyone. Detecting deceptive messages is challenging as the messages are unstructured, informal, and complex; this extends into Thai language messages. In this paper, various deep learning models are proposed to detect deceptive messages under two feature extraction trials. A balanced two-class dataset of deceptive and truthful Thai messages (n=2378) is collected from Facebook pages. Instance features are encoded using word embeddings (Thai2Fit) and one-hot encoding techniques. Five classification models, convolutional neural network (CNN), bidirectional long short-term memory (BiLSTM), bidirectional gated recurrent units (BiGRU), CNN-BiLSTM, and CNN-BiGRU, are proposed and evaluated upon the dataset with each feature extraction technique. The experimental results show that all the proposed models had excellent accuracy (95.59% to 98.74%) and BiLSTM with one-hot encoding gave the best performance, achieving 98.74% accuracy.
<br>Citations: 0
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: A progressive learning for structural tolerance online sequential extreme learning machine
<br>Cover Date: 2023-01-01
<br>Cover Display Date: 2023
<br>DOI: 10.12928/TELKOMNIKA.v21i5.24564
<br>Description: This article discusses the progressive learning for structural tolerance online sequential extreme learning machine (PSTOS-ELM). PSTOS-ELM can save robust accuracy while updating the new data and the new class data on the online training situation. The robustness accuracy arises from using the householder block exact QR decomposition recursive least squares (HBQRD-RLS) of the PSTOS-ELM. This method is suitable for applications that have data streaming and often have new class data. Our experiment compares the PSTOS-ELM accuracy and accuracy robustness while data is updating with the batch-extreme learning machine (ELM) and structural tolerance online sequential extreme learning machine (STOS-ELM) that both must retrain the data in a new class data case. The experimental results show that PSTOS-ELM has accuracy and robustness comparable to ELM and STOS-ELM while also can update new class data immediately.
<br>Citations: 0
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: The Optimal Equations with Chinese Remainder Theorem for RSA’s Decryption Process
<br>Cover Date: 2023-01-01
<br>Cover Display Date: 2023
<br>DOI: 10.58346/JOWUA.2023.I2.009
<br>Description: This research was designed to provide an idea for choosing the best two equations that can be used to finish the RSA decryption process. In general, the four strategies suggested to accelerate this procedure are competitors. Chinese Remainder Theorem (CRT) is among four rivals. The remains are improved algorithms that have been adjusted from CRT. In truth, the primary building block of these algorithms is CRT, but the sub exponent of CRT is substituted with the new value. Assuming the modulus is obtained by multiplying two prime numbers, two modular exponentiations must be performed prior to combining the results. Three factors are chosen to determine the optimal equation: modular multiplications, modular squares, and modular inverses. In general, the proposed method is always the winner since the optimal equation is selected from among four methods. The testing findings show that the proposed technique is consistently 10-30% faster than CRT.
<br>Citations: 4
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: FUNGAL DISEASE DETECTION SYSTEM FOR FAIRY MUSHROOMS USING DEEP LEARNING, ROBOTICS AND IOT FOR REAL SMART FARMING
<br>Cover Date: 2022-12-01
<br>Cover Display Date: December 2022
<br>DOI: 10.24507/icicelb.13.12.1301
<br>Description: Mushrooms are highly nutritious and vital cash crops in many countries. However, a critical problem for mushroom cultivation is fungal diseases. They can inflict widespread damage on mushrooms within a relatively short period (within 48 hours), even though mushrooms are grown in precision farming systems. Besides, mushroom spores are also harmful to the health of mushroom farmers. In this paper, a fungal disease diagnosis and detection system (Case study: Fairy mushroom) is developed using various deep learning techniques, working with robots (Photographic robots) and precise Internet of Things (IoT) systems under the conditions of an intelligent farming environment. The aims are to reduce the cost of mushroom wastage caused by fungal diseases, alleviate the health problems of farmers caused by mushroom spores, and address the vulnerabilities of the current intelligent farm system. The system consists of seven parts: 1) collecting fungal disease data from real farms, 2) designing and developing intelligent farms and photography robots, 3) data pre-processing, 4) image pre-processing, 5-6) choosing a CNN model, and 7) real-time prediction. The classification algorithms to recognize fungal diseases include DenseNet201, ResNet50, InceptionV3, and VGG19 based on the image database of 1,000 images of non-fungus and fungal mushrooms equally. The experimen-tal results of the classification of fungal diseases show that DenseNet201 has the highest accuracy of 89.74% (DenseNet201 is most suitable for detecting fungal diseases for exist-ing smart farms). In particular, the proposed system can detect fungal diseases rapidly in only 1-6 hours. As a result, mushroom growers can reduce the number of mushrooms damaged by fungal diseases and the risk of direct exposure to mushroom spores.
<br>Citations: 2
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: High-speed Firewall Rule Verification Technique Improves Throughput Performance for IP Version 6
<br>Cover Date: 2022-08-27
<br>Cover Display Date: September 2022
<br>DOI: 10.37936/ecti-cit.2022163.248690
<br>Description: Throughput performance of firewalls depend on the execution speed of verify rules. Internet Protocol Version 6 (IPv6) and IPv4 ruleset memory requirements differ and affect rule access and execution time in a wide range of common firewalls. This paper contributes a high-speed firewall named FW6 to execute rules for IPv6 with constant O(1) access time. FW6 con-sumes optimal O(n<inf>bit</inf> ) memory for 64-bit architectures. Results are based on actual performance evaluations in conjunction with other high-speed firewalls (IPSets, IPack, and F<sup>3</sup> ), comparing metrics such as processing time, memory consumption and throughput. Throughput measurements in IPv6 TCP/UDP packet trials (across ruleset and window sizes) show FW6 significantly outperforms IPSets. The trials have shown that FW6 improves throughput performance over IPSets by 0.44% (mean) and 0.39% (median) across all test variables. Nevertheless, the results suggest simi-larity and a minor performance increase by FW6 over IPSets. In addition, FW6 and IPSets throughputs are similar to IPack and F<sup>3</sup> in IPv4 ruleset execution comparisons. As a result, FW6 can be used to replace previous high-speed firewalls.
<br>Citations: 0
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: FFF: Fast Firewall Framework to Enhance Rule Verifying over High-speed Networks
<br>Cover Date: 2022-03-01
<br>Cover Display Date: Mar 2022
<br>DOI: 10.37936/ecti-cit.2022161.246990
<br>Description: The current trafic trend on computer networks is growing exponentially, affecting network firewalls because they constantly have to filter out mas-sive amounts of data. In this paper, we implement a firewall framework to improve trafic processing speed, named the Fast Firewall Framework (FFF or F3). FFF can verify rules at Big-O(1) worst-case access time, and it also consumes a small amount of memory, which is only Big-O(nbit). To evaluate the firewalls' effectiveness, we benchmark the proposed fire-wall framework against the two fastest open source firewalls, IPSets and IPack. The experimental results show that FFF can execute rules faster than both firewalls and consumes less memory. In addition, the proposed firewall framework has a simple structure that makes it easier to imple-ment.
<br>Citations: 1
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: DSSF: Decision Support System to Detect and Solve Firewall Rule Anomalies based on a Probability Approach
<br>Cover Date: 2022-03-01
<br>Cover Display Date: March 2022
<br>DOI: 10.37936/ecti-cit.2022161.246996
<br>Description: Currently, establishing a private network on the Internet is highly haz- ardous as attackers continuously scan computers for vulnerabilities within the connected network. The rewall ranked the highest as a network de-vice is selected to protect unauthorized accesses and attacks. However, rewalls can eectively protect against assaults based on adequately de- ned rules without any anomalies. In order to resolve anomaly problems and assist rewall administrators manage the rules eectively, in this pa-per, a prototype of a decision support system has been designed and de-veloped for encouraging administrators to optimize rewall rules and min-imize deciencies that occur in rules by using a probability approach. The experimental results clearly show that the developed model encourages ex-perts and administrators of rewalls to make signicant decisions to resolve rule anomalies. As a result, expert's condence increases by 14.8%, and administrators' condence soars similarly about 44.2%. The accuracy of correcting rule anomalies is 83%.
<br>Citations: 3
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: Decision making system for improving firewall rule anomaly based on evidence and behavior
<br>Cover Date: 2020-01-01
<br>Cover Display Date: 2020
<br>DOI: 10.25046/AJ050460
<br>Description: Firewalls are controlled by rules which often incur anomalies. The anomalies are considered serious problems that administrators do not desire to happen over their firewalls because they cause more vulnerabilities and decrease the overall performance of the firewall. Resolving anomaly rules that have already occurred on the firewall is difficult and mainly depends on the firewall administrator's discretion. In this paper, a model is designed and developed to assist administrators to make effective decisions for optimizing anomaly rules using the probability approach (Bayesian). In this model, the firewall needs to add four property fields (Extra fields) to the firewall rules: frequency of packets matching against rules, evidence of creating rules, the expertise of rules creator and protocol priority. These fields are used to calculate the probability of each firewall rule. The probability for each rule is used while the rules conflict and administrators need to resolve them. The rule having the highest probability value indicates that it has the highest priority in consideration. Experimental results show that the proposed model allows firewall administrators to make significant decisions about solving anomaly rules. The data structure of this model is based on k-ary tree, therefore the speed of building tree, time complexity and space complexity: O(n), O(logmn) and O(m*n) respectively. Besides, the confidence of the proposed firewall for resolving firewall rule anomalies of the administrator increase by 29.6% against the traditional firewall, and the reliability value between the inter-raters also increase by 13.1%.
<br>Citations: 5
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: The semantics loss tracker of firewall rules
<br>Cover Date: 2019-01-01
<br>Cover Display Date: 2019
<br>DOI: 10.1007/978-3-319-93692-5_22
<br>Description: Frequently, firewall rules are overlapped and duplicated. The problems are usually resolved by merging rules. However, sometimes merged rules lead to the semantics loss. This paper proposed the tracker system for analyzing and alerting the semantics loss of firewall rules while they are being merged, namely SELTracker. SELTracker data structure is built from the Path Selection Tree (PST). PST does only keep all anomaly rules but also maintain normal rules. While firewall rules are being merged, SELTracker analyzes merging rules against PST. Based on the testing results, the proposed system has the ability to effectively detect the semantics loss. Moreover, SELTracker can also detect all other anomalies.
<br>Citations: 7
<br>Aggregation Type: Book Series
<br>-------------------
<br><br><br>Title: IP packing technique for high-speed firewall rule verification
<br>Cover Date: 2019-01-01
<br>Cover Display Date: 2019
<br>DOI: 10.3966/160792642019102006006
<br>Description: A network bottleneck is often caused by firewalls installed between network gateways. As a result, the overall performance of networks is significantly dropped. The following solution to resolve such the problem can be achieved by increasing the speed of firewall rule verification. Nowadays, there is an open-source matching framework which is the fastest of rule verification, namely IPSets. It can verify a number of firewall rules against huge packets with O(1) worst case access time. However, IPSets still displays several drawbacks of usability such as rule management, subnet IP address, rule conflicts, and memory usage. This paper proposes a novel firewall structure that can resolve all drawbacks of IPSets, and obtains the optimal speed of firewall rule verification at O(1) of access time, called IPack. According to IPack implementation, the paper applies the sparse matrix to be data structures to maintain firewall rules, the Path Selection Diagram (PSD) to eliminate rule conflicts and IP packing technique to reduce the size of memory space. The experimental results show that IPSets drawbacks can be solved by IPack. Especially, the size of memory space is reduced from O(2<sup>n</sup>) to be O(n) with the same optimal access time and the speed of IPack is still equal to IPSets.
<br>Citations: 3
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: Chatting with Plants (Orchids) in Automated Smart Farming using IoT, Fuzzy Logic and Chatbot
<br>Cover Date: 2019-01-01
<br>Cover Display Date: 2019
<br>DOI: 10.25046/aj040522
<br>Description: Plants are living organisms that can hear and recognize the environment around them but cannot communicate to inform their needs. Thus, in the past, humans thought that it was impossible to communicate with plants. However, in this modern era, humans can be able to communicate with these plants. In this paper, we propose a model that can interact (Chat) with plants cultivated in the automated farm system based on Internet of Things (IoT) and Fuzzy Logic. According to the communication of plants and humans, we apply a chatbot algorithm for sending/receiving messages between users and automated smart farming. The messages are processed by the natural language processing (NLP) to parse and interpret the meaning of the conversation. The experimented plant in this paper is orchid, namely Dendrobium Sonia (Bomjo). The result from the evaluation shows that the average accuracy (Harmonic mean) of chatting between the user and the orchid is equal to 0.71, the precision and recall are 0.75 and 0.6 respectively.
<br>Citations: 10
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: Automated Smart Farming for Orchids with the Internet of Things and Fuzzy Logic
<br>Cover Date: 2018-12-20
<br>Cover Display Date: 20 December 2018
<br>DOI: 10.23919/INCIT.2018.8584881
<br>Description: In this paper, we propose an automated smart farming for Orchids (Dendrobium Sonia "Bomjo") cultivation by applying Fuzzy logic and Internet of things (IoT) to control all the essential environment variables inside a greenhouse. Sensors for capturing environments are temperature, humidity, light, and soil moisture. The actuators consist of fogs, light bulbs (heaters), fans, sprinkler pumps, LEDs, and motors for controlling plastic curtains. The proposed system can automatically control the growth factors of orchids' inflorescences. The results show that orchids can thrive constantly by the average growth rate about 27.38 cm. per a week.
<br>Citations: 13
<br>Aggregation Type: Conference Proceeding
<br>-------------------
<br><br><br>Title: High-speed firewall rule verification with o(1) worst-case access time
<br>Cover Date: 2017-01-01
<br>Cover Display Date: 2017
<br>DOI: 10.6633/IJNS.201701.19(1).08
<br>Description: Firewalls enforced by rules are a security measure for verifying huge packets at gateway networks. Therefore, they probably act as bottlenecks of the networks. In this paper, we have presented several techniques to improve the speed of firewall rule verification with O(1) worstcase access time. The techniques are: policy mapping (PMAP), sparse matrix packing firewall (SMPF), perfect hashing firewall (PHF) and minimal perfect hashing firewall (MPHF). The experimental results show that they are as fast as IPSet, one of the most famous high-speed firewalls at present. However, they can get rid of IPSet limitations such as IP address classes, subnet size of each rule set and so on. Besides, on average, SMPF, MPHF and PFH can reduce the amount of memory usage of PMAP by 99.9, 87.7 and 62.3 percent respectively.
<br>Citations: 0
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: The policy mapping algorithm for high-speed Firewall policy verifying
<br>Cover Date: 2016-01-01
<br>Cover Display Date: 2016
<br>DOI: N/A
<br>Description: In this paper, we have proposed a novel algorithm and data structures to improve the speed of firewall policy verification. it is called the policy mapping (PMAP). Time complexity of the proposed technique is O(1) to verify incoming-outgoing packets against the firewall policy. Besides, the algorithm is not limited to handle IP network classes as IPSET which is the top of high-speed firewall open source today. PMAP can also optimize the firewall rule decision by employing the firewall decision state diagram (FDSD) to clarify ordering of policy verifying. The consumed memory of PMAP is reasonable. It consumes the memory usage around 3.27 GB for maintaining rule data structures processing the firewall rule at 5,000 rules.
<br>Citations: 2
<br>Aggregation Type: Journal
<br>-------------------
<br><br><br>Title: Towards a new design of firewall: Anomaly elimination and fast verifying of firewall rules
<br>Cover Date: 2013-09-09
<br>Cover Display Date: 2013
<br>DOI: 10.1109/JCSSE.2013.6567326
<br>Description: Network security is usually protected by a firewall, which checks in-out packets against a set of defined policies or rules. Hence, the overall performance of the firewall generally depends on its rule management. For example, the performance can be decreased when there are firewall rule anomalies. The anomalies may happen when two sets of firewall rules are overlapped or their decision parts are both an acceptance and a denial simultaneously. In this paper, we propose a new paradigm of the firewall design, consisting of two parts: (1) Single Domain Decision firewall (SDD) - a new firewall rule management policy that is certainly not conflicts, and (2) the Binary Tree Firewall (BTF) - a data structure and an algorithm to fast check the firewall rules. Experimental results have indicated that the new design can fix conflicting anomaly and increase the speed of firewall rule checking from O(N<sup>2</sup>) to O(log<inf>2</inf> N). © 2013 IEEE.
<br>Citations: 17
<br>Aggregation Type: Conference Proceeding
<br>-------------------
<br><br><br>Title: Performance comparison of the diskless technology
<br>Cover Date: 2013-09-09
<br>Cover Display Date: 2013
<br>DOI: 10.1109/JCSSE.2013.6567327
<br>Description: Currently, the traditional disk-full technology will be replaced by the diskless technology because of its advantage such as controlling from the Central Control System, managing large number of computer systems, reducing the redundancy of computer system, reducing the energy consumption and costs. However, the disadvantage of diskless technology is slow speed when lot of client machines boot to ready state. This research is proposed with the architectural and structural design of the diskless technology on Ethernet topology and tested the efficiency algorithm with the boot up time. From the result, we found that the link aggregation structural connections shows the high performance in term of the minimum average of times. © 2013 IEEE.
<br>Citations: 0
<br>Aggregation Type: Conference Proceeding
<br>-------------------
<br><br><br>