Control systems are being changed from wired to wireless communications because of flexibility, mobility and extensibility of wireless communication systems; however the reliability of wireless communications is suspected. In this paper, we propose cooperative communication scheme for wireless control systems which consist of a controller and multiple machines; these machines cooperatively work in a group and for the same duty. In the proposed method, the controller can communicate with machines directly or via other machines, whereas in the conventional method, the controller only communicates with machines directly. The simple 2-link arm plant is used to evaluate our proposed system, and the simulation results indicate that the proposed method is more accurate, and more stable than the conventional method.
{"title":"Proposal of Cooperative Communication to Enhance Accuracy of Wireless Control Systems","authors":"Nguyen Cong Dinh","doi":"10.4236/CN.2019.112005","DOIUrl":"https://doi.org/10.4236/CN.2019.112005","url":null,"abstract":"Control systems are being changed from wired to wireless communications because of flexibility, mobility and extensibility of wireless communication systems; however the reliability of wireless communications is suspected. In this paper, we propose cooperative communication scheme for wireless control systems which consist of a controller and multiple machines; these machines cooperatively work in a group and for the same duty. In the proposed method, the controller can communicate with machines directly or via other machines, whereas in the conventional method, the controller only communicates with machines directly. The simple 2-link arm plant is used to evaluate our proposed system, and the simulation results indicate that the proposed method is more accurate, and more stable than the conventional method.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"23 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90589665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Multilayer network is a frontier direction of network science research. In this paper, the cluster ring network is extended to a two-layer network model, and the inner structures of the cluster blocks are random, small world or scale-free. We study the influence of network scale, the interlayer linking weight and interlayer linking fraction on synchronizability. It is found that the synchronizability of the two-layer cluster ring network decreases with the increase of network size. There is an optimum value of the interlayer linking weight in the two-layer cluster ring network, which makes the synchronizability of the network reach the optimum. When the interlayer linking weight and the interlayer linking fraction are very small, the change of them will affect the synchronizability.
{"title":"Synchronizability of Two-Layer Cluster Ring Networks","authors":"Yang Deng, Zhen Jia, Lin Liao","doi":"10.4236/CN.2019.112004","DOIUrl":"https://doi.org/10.4236/CN.2019.112004","url":null,"abstract":"Multilayer network is a frontier direction of network science research. In this paper, the cluster ring network is extended to a two-layer network model, and the inner structures of the cluster blocks are random, small world or scale-free. We study the influence of network scale, the interlayer linking weight and interlayer linking fraction on synchronizability. It is found that the synchronizability of the two-layer cluster ring network decreases with the increase of network size. There is an optimum value of the interlayer linking weight in the two-layer cluster ring network, which makes the synchronizability of the network reach the optimum. When the interlayer linking weight and the interlayer linking fraction are very small, the change of them will affect the synchronizability.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"181 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76009179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Due to the ever growing number of cyber attacks, especially of the online systems, development and operation of adaptive Intrusion Detection Systems (IDSs) is badly needed so as to protect these systems. It remains as a goal of paramount importance to achieve and a serious challenge to address. Different selection methods have been developed and implemented in Genetic Algorithms (GAs) to enhance the rate of detection of the IDSs. In this respect, the present study employed the eXtended Classifier System (XCS) for detection of intrusions by matching the incoming environmental message (packet) with a classifiers pool to determine whether the incoming message is a normal request or an intrusion. Fuzzy Clustering by Local Approximation Membership (FLAME) represents the new selection method used in GAs. In this study, Genetic Algorithm with FLAME selection (FGA) was used as a production engine for the XCS. For comparison purposes, different selection methods were compared with FLAME selection and all experiments and evaluations were performed by using the KDD’99 dataset.
{"title":"A New FLAME Selection Method for Intrusion Detection (FLAME-ID)","authors":"W. Alsharafat","doi":"10.4236/CN.2019.111002","DOIUrl":"https://doi.org/10.4236/CN.2019.111002","url":null,"abstract":"Due to the ever growing number of cyber attacks, especially of the online systems, development and operation of adaptive Intrusion Detection Systems (IDSs) is badly needed so as to protect these systems. It remains as a goal of paramount importance to achieve and a serious challenge to address. Different selection methods have been developed and implemented in Genetic Algorithms (GAs) to enhance the rate of detection of the IDSs. In this respect, the present study employed the eXtended Classifier System (XCS) for detection of intrusions by matching the incoming environmental message (packet) with a classifiers pool to determine whether the incoming message is a normal request or an intrusion. Fuzzy Clustering by Local Approximation Membership (FLAME) represents the new selection method used in GAs. In this study, Genetic Algorithm with FLAME selection (FGA) was used as a production engine for the XCS. For comparison purposes, different selection methods were compared with FLAME selection and all experiments and evaluations were performed by using the KDD’99 dataset.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84171098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the rapid development of big data, the scale of realistic networks is increasing continually. In order to reduce the network scale, some coarse-graining methods are proposed to transform large-scale networks into mesoscale networks. In this paper, a new coarse-graining method based on hierarchical clustering (HCCG) on complex networks is proposed. The network nodes are grouped by using the hierarchical clustering method, then updating the weights of edges between clusters extract the coarse-grained networks. A large number of simulation experiments on several typical complex networks show that the HCCG method can effectively reduce the network scale, meanwhile maintaining the synchronizability of the original network well. Furthermore, this method is more suitable for these networks with obvious clustering structure, and we can choose freely the size of the coarse-grained networks in the proposed method.
{"title":"Coarse-Graining Method Based on Hierarchical Clustering on Complex Networks","authors":"Lin Liao, Zhen Jia, Yang Deng","doi":"10.4236/CN.2019.111003","DOIUrl":"https://doi.org/10.4236/CN.2019.111003","url":null,"abstract":"With the rapid development of big data, the scale of realistic networks is increasing continually. In order to reduce the network scale, some coarse-graining methods are proposed to transform large-scale networks into mesoscale networks. In this paper, a new coarse-graining method based on hierarchical clustering (HCCG) on complex networks is proposed. The network nodes are grouped by using the hierarchical clustering method, then updating the weights of edges between clusters extract the coarse-grained networks. A large number of simulation experiments on several typical complex networks show that the HCCG method can effectively reduce the network scale, meanwhile maintaining the synchronizability of the original network well. Furthermore, this method is more suitable for these networks with obvious clustering structure, and we can choose freely the size of the coarse-grained networks in the proposed method.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"34 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89347111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In recent years, opportunities for using cloud services as computing resources have increased and there is a concern that private information may be leaked when processes data. The data processing while maintaining confidentiality is called secret computation. Cryptosystems can add and multiply plaintext through the manipulation of ciphertexts of homomorphic cryptosystems, but most of them have restrictions on the number of multiplications that can be performed. Among the different types of cryptosystems, fully homomorphic encryption can perform arbitrary homomorphic addition and multiplication, but it takes a long time to eliminate the limitation on the number of homomorphic operations and to carry out homomorphic multiplication. Therefore, in this paper, we propose an arithmetic processing method that can perform an arbitrary number of homomorphic addition and multiplication operations based on ElGamal cryptosystem. The results of experiments comparing with the proposed method with HElib in which the BGV scheme of fully homomorphic encryption is implemented showed that, although the processing time for homomorphic addition per ciphertext increased by about 35%, the processing time for homomorphic multiplication was reduced to about 1.8%, and the processing time to calculate the statistic (variance) had approximately a 15% reduction.
{"title":"Acceleration of Homomorphic Arithmetic Processing Based on the ElGamal Cryptosystem","authors":"Takuma Jogan, Tomofumi Matsuzawa, Masayuki Takeda","doi":"10.4236/CN.2019.111001","DOIUrl":"https://doi.org/10.4236/CN.2019.111001","url":null,"abstract":"In recent years, opportunities for using cloud services as computing resources have increased and there is a concern that private information may be leaked when processes data. The data processing while maintaining confidentiality is called secret computation. Cryptosystems can add and multiply plaintext through the manipulation of ciphertexts of homomorphic cryptosystems, but most of them have restrictions on the number of multiplications that can be performed. Among the different types of cryptosystems, fully homomorphic encryption can perform arbitrary homomorphic addition and multiplication, but it takes a long time to eliminate the limitation on the number of homomorphic operations and to carry out homomorphic multiplication. Therefore, in this paper, we propose an arithmetic processing method that can perform an arbitrary number of homomorphic addition and multiplication operations based on ElGamal cryptosystem. The results of experiments comparing with the proposed method with HElib in which the BGV scheme of fully homomorphic encryption is implemented showed that, although the processing time for homomorphic addition per ciphertext increased by about 35%, the processing time for homomorphic multiplication was reduced to about 1.8%, and the processing time to calculate the statistic (variance) had approximately a 15% reduction.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81812251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Imoize, T. Oyedare, Michael E. Otuokere, S. Shetty
In this paper, we consider a cost-based extension of intrusion detection capability (CID). An objective metric motivated by information theory is presented and based on this formulation; a package for computing the intrusion detection capability of intrusion detection system (IDS), given certain input parameters is developed using Java. In order to determine the expected cost at each IDS operating point, the decision tree method of analysis is employed, and plots of expected cost and intrusion detection capability against false positive rate were generated. The point of intersection between the maximum intrusion detection capability and the expected cost is selected as the optimal operating point. Considering an IDS in the context of its intrinsic ability to detect intrusions at the least expected cost, findings revealed that the optimal operating point is the most suitable for the given IDS. The cost-based extension is used to select optimal operating point, calculate expected cost, and compare two actual intrusion detectors. The proposed cost-based extension of intrusion detection capability will be very useful to information technology (IT), telecommunication firms, and financial institutions, for making proper decisions in evaluating the suitability of an IDS for a specific operational environment.
{"title":"Software Intrusion Detection Evaluation System: A Cost-Based Evaluation of Intrusion Detection Capability","authors":"A. Imoize, T. Oyedare, Michael E. Otuokere, S. Shetty","doi":"10.4236/CN.2018.104017","DOIUrl":"https://doi.org/10.4236/CN.2018.104017","url":null,"abstract":"In this paper, we consider a cost-based extension of intrusion detection capability (CID). An objective metric motivated by information theory is presented and based on this formulation; a package for computing the intrusion detection capability of intrusion detection system (IDS), given certain input parameters is developed using Java. In order to determine the expected cost at each IDS operating point, the decision tree method of analysis is employed, and plots of expected cost and intrusion detection capability against false positive rate were generated. The point of intersection between the maximum intrusion detection capability and the expected cost is selected as the optimal operating point. Considering an IDS in the context of its intrinsic ability to detect intrusions at the least expected cost, findings revealed that the optimal operating point is the most suitable for the given IDS. The cost-based extension is used to select optimal operating point, calculate expected cost, and compare two actual intrusion detectors. The proposed cost-based extension of intrusion detection capability will be very useful to information technology (IT), telecommunication firms, and financial institutions, for making proper decisions in evaluating the suitability of an IDS for a specific operational environment.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"18 1","pages":"211-229"},"PeriodicalIF":0.0,"publicationDate":"2018-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85199826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The introduction of new technologies has had a significant influence on teaching, learning and research activities in universities. This has offered university libraries opportunities to provide information resources in a variety of formats. This study investigated the influence of information literacy skills on postgraduate students’ use of electronic resources in private university libraries in Nigeria. The study adopted the survey research design. The study population comprised 2805 postgraduate students in five private universities offering postgraduate programmes in South-West, Nigeria. Multistage sampling technique was used in the selection process. A purposive selection of four faculties from each of the five universities was carried out. Proportionate sampling technique was used to select the sample size of 550 postgraduate students as the respondents for the study. Findings revealed that there was a significant positive correlation between information literacy skills and use of electronic resources (r = 0.28, p < 0.05). The study concluded that the utilization of electronic resources promoted access to current information among postgraduate students in the selected private universities in South-West, Nigeria. The study recommended that the management of private university libraries should ensure a continuous provision of electronic resources with adequate information communication technology tools to facilitate their use.
新技术的引入对大学的教学、学习和研究活动产生了重大影响。这为大学图书馆提供了以多种形式提供信息资源的机会。本研究调查尼日利亚私立大学图书馆信息素养技能对研究生使用电子资源的影响。本研究采用调查研究设计。研究人口包括2805名研究生，来自尼日利亚西南部五所提供研究生课程的私立大学。在选择过程中采用多级抽样技术。有目的地从五所大学中各选出四所学院。采用比例抽样技术，选取550名研究生作为调查对象。结果显示，信息素养技能与电子资源使用存在显著正相关(r = 0.28, p < 0.05)。这项研究的结论是，电子资源的利用促进了尼日利亚西南部选定私立大学的研究生获取最新信息的机会。该研究建议，私立大学图书馆的管理应确保持续提供电子资源，并配备足够的资讯通讯科技工具，以方便读者使用。
{"title":"Influence of Information Literacy Skills on Postgraduate Students’ Use of Electronic Resources in Private University Libraries in South-West, Nigeria","authors":"P. Adeniran, U. D. Onuoha","doi":"10.4236/CN.2018.104014","DOIUrl":"https://doi.org/10.4236/CN.2018.104014","url":null,"abstract":"The introduction of new technologies has had a significant influence on teaching, learning and research activities in universities. This has offered university libraries opportunities to provide information resources in a variety of formats. This study investigated the influence of information literacy skills on postgraduate students’ use of electronic resources in private university libraries in Nigeria. The study adopted the survey research design. The study population comprised 2805 postgraduate students in five private universities offering postgraduate programmes in South-West, Nigeria. Multistage sampling technique was used in the selection process. A purposive selection of four faculties from each of the five universities was carried out. Proportionate sampling technique was used to select the sample size of 550 postgraduate students as the respondents for the study. Findings revealed that there was a significant positive correlation between information literacy skills and use of electronic resources (r = 0.28, p < 0.05). The study concluded that the utilization of electronic resources promoted access to current information among postgraduate students in the selected private universities in South-West, Nigeria. The study recommended that the management of private university libraries should ensure a continuous provision of electronic resources with adequate information communication technology tools to facilitate their use.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"44 1","pages":"164-179"},"PeriodicalIF":0.0,"publicationDate":"2018-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85354793","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Long Term Evolution (LTE) is designed to revolutionize mobile broadband technology with key considerations of higher data rate, improved power efficiency, low latency and better quality of service. This work analyzes the impact of resource scheduling algorithms on the performance of LTE (4G) and WCDMA (3G) networks. In this paper, a full illustration of LTE system is given together with different scheduling algorithms. Thereafter, 3G WCDMA and 4G LTE networks were simulated using Simulink simulator embedded in MATLAB and performance evaluations were carried out. The performance metrics used for the evaluations are average system throughput, packet delay, latency and allocation of fairness using Round Robin, Best CQI and Proportional fair Packet Scheduling Algorithms. The results of the evaluations on both networks were analysed. The results showed that 4G LTE network performs better than 3G WCDMA network in all the three scheduling algorithms used.
{"title":"Performance Evaluation of Scheduling Algorithms for 4G (LTE)","authors":"B. Kuboye","doi":"10.4236/cn.2018.104013","DOIUrl":"https://doi.org/10.4236/cn.2018.104013","url":null,"abstract":"Long Term Evolution (LTE) is designed to revolutionize mobile broadband technology with key considerations of higher data rate, improved power efficiency, low latency and better quality of service. This work analyzes the impact of resource scheduling algorithms on the performance of LTE (4G) and WCDMA (3G) networks. In this paper, a full illustration of LTE system is given together with different scheduling algorithms. Thereafter, 3G WCDMA and 4G LTE networks were simulated using Simulink simulator embedded in MATLAB and performance evaluations were carried out. The performance metrics used for the evaluations are average system throughput, packet delay, latency and allocation of fairness using Round Robin, Best CQI and Proportional fair Packet Scheduling Algorithms. The results of the evaluations on both networks were analysed. The results showed that 4G LTE network performs better than 3G WCDMA network in all the three scheduling algorithms used.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"84 1","pages":"152-163"},"PeriodicalIF":0.0,"publicationDate":"2018-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85541712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The purpose of this study is to analyze and then model, using neural network models, the performance of the Web server in order to improve them. In our experiments, the parameters taken into account are the number of instances of clients simultaneously requesting the same Web page that contains the same SQL queries, the number of tables queried by the SQL, the number of records to be displayed on the requested Web pages, and the type of used database server. This work demonstrates the influences of these parameters on the results of Web server performance analyzes. For the MySQL database server, it has been observed that the mean response time of the Web server tends to become increasingly slow as the number of client connection occurrences as well as the number of records to display increases. For the PostgreSQL database server, the mean response time of the Web server does not change much, although there is an increase in the number of clients and/or size of information to be displayed on Web pages. Although it has been observed that the mean response time of the Web server is generally a little faster for the MySQL database server, it has been noted that this mean response time of the Web server is more stable for PostgreSQL database server.
{"title":"Analysis and Neural Networks Modeling of Web Server Performances Using MySQL and PostgreSQL","authors":"Fontaine Rafamantanantsoa, Maherindefo Laha","doi":"10.4236/CN.2018.104012","DOIUrl":"https://doi.org/10.4236/CN.2018.104012","url":null,"abstract":"The purpose of this study is to analyze and then model, using neural network models, the performance of the Web server in order to improve them. In our experiments, the parameters taken into account are the number of instances of clients simultaneously requesting the same Web page that contains the same SQL queries, the number of tables queried by the SQL, the number of records to be displayed on the requested Web pages, and the type of used database server. This work demonstrates the influences of these parameters on the results of Web server performance analyzes. For the MySQL database server, it has been observed that the mean response time of the Web server tends to become increasingly slow as the number of client connection occurrences as well as the number of records to display increases. For the PostgreSQL database server, the mean response time of the Web server does not change much, although there is an increase in the number of clients and/or size of information to be displayed on Web pages. Although it has been observed that the mean response time of the Web server is generally a little faster for the MySQL database server, it has been noted that this mean response time of the Web server is more stable for PostgreSQL database server.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"12 1","pages":"142-151"},"PeriodicalIF":0.0,"publicationDate":"2018-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89703979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In recent years, the number of users connected to the Internet has experienced a phenomenal growth. The security of systems and networks become essential. That is why the performance of Linux firewall and Berkeley Software Distribution (BSD) are of paramount importance in security systems and networks in all businesses. The following evaluates the firewall based tool that we have developed in Python and Scapy, which performs time measurements by serving packets traversing the firewall test. Several results were presented: the speed of the firewall under FreeBSD in terms of service time compared to the speed of the firewall under Linux as the number of rules increases; the speed of the filtering rule of a firewall stateless in terms of service time compared to the filtering rule of an active firewall gradually as the number of rules increases. Then, for care of simplicity, we have presented the queue M/M/1/K to model the performances of firewalls. The resulting model was validated using Simulink and mean squared error. The analytical model and Simulink of the firewalls are presented in the article.
近年来，连接到互联网的用户数量经历了惊人的增长。系统和网络的安全变得至关重要。这就是为什么Linux防火墙和Berkeley Software Distribution (BSD)的性能在所有企业的安全系统和网络中都是至关重要的。下面的代码评估了我们用Python和Scapy开发的基于防火墙的工具，该工具通过提供遍历防火墙测试的数据包来执行时间测量。给出了几个结果:随着规则数量的增加，FreeBSD下的防火墙在服务时间方面的速度与Linux下的防火墙的速度相比;随着规则数量的增加，防火墙的过滤规则相对于主用防火墙的过滤规则的运行速度逐渐呈无状态状态(以服务时间衡量)。然后，为了简单起见，我们使用队列M/M/1/K来模拟防火墙的性能。利用Simulink和均方误差对模型进行了验证。本文给出了防火墙的解析模型和Simulink。
{"title":"Performance Comparison and Simulink Model of Firewall Free BSD and Linux","authors":"Fontaine Rafamantanantsoa, H. Rabetafika","doi":"10.4236/CN.2018.104015","DOIUrl":"https://doi.org/10.4236/CN.2018.104015","url":null,"abstract":"In recent years, the number of users connected to the Internet has experienced a phenomenal growth. The security of systems and networks become essential. That is why the performance of Linux firewall and Berkeley Software Distribution (BSD) are of paramount importance in security systems and networks in all businesses. The following evaluates the firewall based tool that we have developed in Python and Scapy, which performs time measurements by serving packets traversing the firewall test. Several results were presented: the speed of the firewall under FreeBSD in terms of service time compared to the speed of the firewall under Linux as the number of rules increases; the speed of the filtering rule of a firewall stateless in terms of service time compared to the filtering rule of an active firewall gradually as the number of rules increases. Then, for care of simplicity, we have presented the queue M/M/1/K to model the performances of firewalls. The resulting model was validated using Simulink and mean squared error. The analytical model and Simulink of the firewalls are presented in the article.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"3 1","pages":"180-195"},"PeriodicalIF":0.0,"publicationDate":"2018-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87666568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：