Comparative analysis of UDP throughput on IPv4 and IPv6 operating systems in IEEE 802.11n wireless networks protected with WPA2 security protocol

2012 ◽  
Author(s):  
Dejan Tepsic ◽  
Mladen Veinovic
Keyword(s):  
Wireless Networks ◽  
Comparative Analysis ◽  
Operating Systems ◽  
Security Protocol ◽  
Ieee 802.11N

MULTI-HOP WIRELESS NETWORKS AUTOMATED SIMULATION

2017 ◽  
Vol 13 (3) ◽  
pp. 68-78
Author(s):  
A. A. Pavlov ◽  
I. O. Datyev ◽  
M. G. Shishaev
Keyword(s):  
Wireless Networks ◽  
Comparative Analysis ◽  
Simulation Model ◽  
Conceptual Model ◽  
Software Package ◽  
Software Tools ◽  
Specialized Software ◽  
Automated Simulation ◽  
Network Simulators ◽  
Modern Experience

Simulation is the main way for testing technologies in the field of multi-hop wireless networks (MWN). Creating a simulation model MWN - a time-consuming task associated with the use of specialized software tools, called network simulators. In this paper, the modern experience of modeling MWN and the main problems are formulated. One of the main problem is the comparative analysis' impossibility of the experiments results conducted by various researchers. This is due to the reasons associated with the models used for testing, the planning an imitation experiment and the principal differences in the network simulators. To solve this problem, authors propose a generalized conceptual model of MWN simulation and a specialized software package that automates the execution of experiment series in a heterogeneous modeling environment.

scholarly journals Address Space Layout Randomization Comparative Analysis on Windows 10 and Ubuntu 18.04 LTS

2021 ◽  
Vol 7 (1) ◽  
pp. 26
Author(s):  
Raquel Vázquez Díaz ◽  
Martiño Rivera-Dourado ◽  
Rubén Pérez-Jove ◽  
Pilar Vila Avendaño ◽  
José M. Vázquez-Naya
Keyword(s):  
Operating System ◽  
Comparative Analysis ◽  
Operating Systems ◽  
Memory Management ◽  
Address Space ◽  
Memory Protection ◽  
Partial Correlations ◽  
Feature Memory ◽  
Space Layout ◽  
Address Space Layout Randomization

Memory management is one of the main tasks of an Operating System, where the data of each process running in the system is kept. In this context, there exist several types of attacks that exploit memory-related vulnerabilities, forcing Operating Systems to feature memory protection techniques that make difficult to exploit them. One of these techniques is ASLR, whose function is to introduce randomness into the virtual address space of a process. The goal of this work was to measure, analyze and compare the behavior of ASLR on the 64-bit versions of Windows 10 and Ubuntu 18.04 LTS. The results have shown that the implementation of ASLR has improved significantly on these two Operating Systems compared to previous versions. However, there are aspects, such as partial correlations or a frequency distribution that is not always uniform, so it can still be improved.

scholarly journals Common Security Protocols for Wireless Networks: A Comparative Analysis

2021 ◽  
Author(s):  
Muhammad Ehsan Rana ◽  
Mohamed Abdulla ◽  
Kuruvikulam Chandrasekaran Arun
Keyword(s):  
Wireless Networks ◽  
Comparative Analysis ◽  
Security Protocols ◽  
Common Security

scholarly journals Comparative analysis of the essential CPU scheduling algorithms

2021 ◽  
Vol 10 (5) ◽  
pp. 2742-2750
Author(s):  
Hoger K. Omar ◽  
Kamal H. Jihad ◽  
Shalau F. Hussein
Keyword(s):  
Comparative Analysis ◽  
Operating Systems ◽  
Waiting Times ◽  
Stable State ◽  
Scheduling Algorithms ◽  
High Rate ◽  
Cpu Scheduling ◽  
Significant Function ◽  
Cpu Utilization ◽  
Maximum Utilization

CPU scheduling algorithms have a significant function in multiprogramming operating systems. When the CPU scheduling is effective a high rate of computation could be done correctly and also the system will maintain in a stable state. As well as, CPU scheduling algorithms are the main service in the operating systems that fulfill the maximum utilization of the CPU. This paper aims to compare the characteristics of the CPU scheduling algorithms towards which one is the best algorithm for gaining a higher CPU utilization. The comparison has been done between ten scheduling algorithms with presenting different parameters, such as performance, algorithm’s complexity, algorithm’s problem, average waiting times, algorithm’s advantages-disadvantages, allocation way, etc. The main purpose of the article is to analyze the CPU scheduler in such a way that suits the scheduling goals. However, knowing the algorithm type which is most suitable for a particular situation by showing its full properties.

Sign in / Sign up

Export Citation Format

Share Document