International Journal of Computer Networks and Communications Security

Volume 4, Issue 10, October 2015

 

 

 

IP Packet Capture on High Throughput Networks by Using NUMA Architectures

Pages: 248-255 (8) | [Full Text] PDF (402 KB)
M Mezzalama, G Oglietti, E Venuto
Politecnico di Torino - DAUIN, Corso Duca degli Abruzzi, 24 - 10129 Torino (TO)

Abstract -
Capture packets from IP networks is a commonly used technique in many IT fields for monitoring and analysis the IP traffic flows exchanged over computer networks. The new infrastructures for high throughput networks, however, have made this important technique more and more complex to carry out (also in small or medium sized local networks) even if using the newest multi-core systems developed today. This paper therefore shows some limits of a recent packet capture system, implemented by using a NUMA architecture, and suggests a possible solution that could be adopted to obtain a full functional IP packet capture system on high throughput networks.
 
Index Terms - Packet Capture, Networks, High Throughput, Security, NUMA Architecture, Multi-core

Citation - M Mezzalama, G Oglietti, E Venuto. "IP Packet Capture on High Throughput Networks by Using NUMA Architectures." International Journal of Computer Science and Software Engineering 4, no. 10 (2015): 248-255.

 

Coverage Criteria for Search Based Automatic Unit Testing of Java Programs

Pages: 256-263 (8) | [Full Text] PDF (253 KB)
I Papadhopulli, E Mece
Department of Computer Engineering, Polytechnic University of Tirana, Tirana, Albania

Abstract -
Genetic Algorithms are among the most efficient techniques to automatically generate unit test cases today. The aim of automatically unit testing is to generate test suites which achieve high coverage and to minimize the length of the test suites. The chosen coverage criterion guides the search and directly affects the results. Among the existing criteria the mutation criterion is the strongest, but it is difficult to be applied practically. Combining several criteria is possible since usually they aim at different parts of the unit under test. In this article we have used EvoSuite with different configurations to automatically generate test suites for six open source projects in order to investigate how the combination of coverage criteria influences the coverage achieved and the test suite length. Based on our experiments we find that the usage of multiple criteria increases the overall coverage and mutation score with the cost of a considerable increase in test suite length.
 
Index Terms - Structural Testing, Test Case Generation, Search Based Software Testing, Coverage Criteria, Mutation Score

Citation - I Papadhopulli, E Mece. "Coverage Criteria for Search Based Automatic Unit Testing of Java Programs." International Journal of Computer Science and Software Engineering 4, no. 10 (2015): 256-263.

 

Modifying an Agent-Based Method of Disturbance Handling with Alternative Techniques of Learning

Pages: 264-271 (8) | [Full Text] PDF (554 KB)
M Mohamed, I Badr, M Sami, A Drwaish
Department of Computer science, Higher Institute of computer science and information system, NCA academy, Cairo, Egypt
Department of Computer science, Faculty of Science, Helwan University, Cairo, Egypt
Department of Computer science, faculty of computer and information, Helwan University, Cairo, Egypt

Abstract -
In this paper we proposed modifying an agent based method for disturbance handling of FMS towards learning technologies, we present alternative learning techniques to improve disturbance handling. We are using here two techniques; the first is learning by training instance, and other is learning by future estimation. In first technique, we proposed method that work at the beginning on traditional method for handling disturbance, the resulting solution are used as training instances for creating the knowledge base, and then we derive learning action groups from it. At occurrence disturbance, we check learning actions to apply one from it; if not, we handle disturbance and record its as newer learning action. In second technique; it depends on sensing identified indications and merge it with learning action, whereas if this indications occur again, the system will apply the estimation scenario.
 
Index Terms - Disturbance Handling, Decision Tree, Estimation Mechanism, Learning Action, Rescheduling

Citation - M Mohamed, I Badr, M Sami, A Drwaish. "Modifying an Agent-Based Method of Disturbance Handling with Alternative Techniques of Learning." International Journal of Computer Science and Software Engineering 4, no. 10 (2015): 264-271.

 

Cognitive Weighted Method Hiding Factor Complexity Metric

Pages: 272-279 (8) | [Full Text] PDF (534 KB)
F Thamburaj, A Aloysius
Computer Science Department, Bharathidasan University, St. Joseph s College, Tiruchirappalli, Tamil Nadu 620002, India

Abstract -
Method hiding plays a key role by serving the foundation for several guidelines in object-oriented software design. It brings about plethora of benefits such as easy comprehension, secured accessibility, modifiability without side-effects, modular testing, higher reliability etc. But, it has to be handled carefully since very low method hiding may result in insufficiently abstracted implementation and very high method hiding will lead to very little functionality. Hence, the method hiding factor has to be measured accurately in order to produce quality software. This article, proposes a new Cognitive Weighted Method Hiding Factor (CWMHF) complexity metric. It measures not only the software structural complexity, but also the cognitive complexity on the basis of type. The cognitive weights are calibrated based on 27 empirical studies with 120 persons. A case study and experimentation of the new software metric shows encouraging results. Further, a comparative study is made and the correlation test has proved that CWMHF complexity metric is a better, more realistic, and more comprehensive indicator of the software complexity than the existing Abreu s Method Hiding Factor complexity metric.
 
Index Terms - Cognitive Method Hiding Factor, Cognitive Metrics, Information Hiding, Software Complexity Metrics, Software Engineering

Citation - F Thamburaj, A Aloysius. "Cognitive Weighted Method Hiding Factor Complexity Metric." International Journal of Computer Science and Software Engineering 4, no. 10 (2015): 272-279.