Dynamic Network Separation for IPv6 Network Security Enhancement

Author(s):  
S. Suzuki ◽  
S. Kondo
2018 ◽  
Vol 150 ◽  
pp. 06005
Author(s):  
Athirah Rosli ◽  
Abidah Mat Taib ◽  
Wan Nor Ashiqin Wan Ali ◽  
Ros Syamsul Hamid

The deployment of Internet Protocol version 6 (IPv6) has raised security concerns among the network administrators. Thus, in strengthening the network security, administrator requires an appropriate method to assess the possible risks that occur in their networks. Aware of the needs to calculate risk in IPv6 network, it is essential to an organization to have an equation that is flexible and consider the requirements of the network. However, the existing risk assessment equations do not consider the requirement of the network. Therefore, this paper presents the adaptation of grounded theory to search for elements that are needed to develop IPv6 risk assessment (IRA6) equation. The attack scenarios’ experiments; UDP Flooding, TCP Flooding and Multicast attacks were carried out in different network environment to show how the IPv6 risk assessment equation being used. The result shows that the IRA6 equation is more flexible to be used regardless the network sizes and easier to calculate the risk value compared to the existing risk assessment equations. Hence, network administrators can have a proper decision making and strategic planning for a robust network security.


2014 ◽  
Vol 926-930 ◽  
pp. 2434-2437
Author(s):  
Jin Meng ◽  
Yu Yang Du ◽  
Xiao Zhang

IPV6 is the next generation networking protocol. It can provide more address space than IPV4 and more secure service. This paper studies the technical features of the IPv6 protocol, discusses IPv6 network security mechanisms.


2018 ◽  
Vol 16 (1) ◽  
pp. 656-668 ◽  
Author(s):  
M.T. Trobajo ◽  
J. Cifuentes-Rodríguez ◽  
M.V. Carriegos

AbstractRandom Decentering Algorithm (RDA) on a undirected unweighted graph is defined and tested over several concrete scale-free networks. RDA introduces ancillary nodes to the given network following basic principles of minimal cost, density preservation, centrality reduction and randomness. First simulations over scale-free networks show that RDA gives a significant decreasing of both betweenness centrality and closeness centrality and hence topological protection of network is improved. On the other hand, the procedure is performed without significant change of the density of connections of the given network. Thus ancillae are not distinguible from real nodes (in a straightforward way) and hence network is obfuscated to potential adversaries by our manipulation.


2013 ◽  
pp. 387-420
Author(s):  
Artur Arsénio ◽  
Diogo Teixeira ◽  
João Redol

Sign in / Sign up

Export Citation Format

Share Document