Anti-traceability security controlled network access channel resource optimal configuration algorithm

A resource-optimized and secure technology, applied in data exchange networks, digital transmission systems, electrical components, etc., can solve problems such as infringement of user privacy and damage to security interests

Active Publication Date: 2021-03-09
CHINA ACADEMY OF ELECTRONICS & INFORMATION TECH OF CETC +1
View PDF7 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

It traces the source by scanning the ports of servers and routers, and obtains equipment information such as IP addresses and MAC addresses of Internet users' network devices by illegal means, which damages the user's security interests and violates the user's personal privacy

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Anti-traceability security controlled network access channel resource optimal configuration algorithm
  • Anti-traceability security controlled network access channel resource optimal configuration algorithm
  • Anti-traceability security controlled network access channel resource optimal configuration algorithm

Examples

Experimental program
Comparison scheme
Effect test

experiment example 1

[0136] Experimental example 1: Study the influence of data packet generation rate on average delay

[0137] Experimental results such as Figure 5 As shown, first analyze the impact of the packet generation rate on the average delay. Two cases where the number of sessions are 2 and 3 respectively are considered. Generally, the time delay for simultaneous transmission of three sessions is greater than the time delay for simultaneous transmission of two sessions. We assume that the number of hops required for all sessions is 2. Under the data packet generation rate λ of [1,10], it can be easily obtained from the figure that when λ is less than or equal to 2, the delay in both cases increases slowly. When λ When it is greater than 2, the average session delay increases almost linearly with the increase of λ. This is because under light load, there are enough idle links to transmit data, and the waiting time is negligible. As the generation rate increases, the system starts to ...

experiment example 2

[0138] Experimental example 2: Scheduling results when link resources are scarce

[0139] Assume that two sessions need to be provided at the same time, and the hop count requirements of the two sessions are 2 and 3 respectively. The packet generation rate of the two sessions is 6, and there are 6 available links in the network, among which links 1, 4, and 5 are internal links, and links 2, 3, and 6 are inter-environmental links.

[0140] The scheduling results under resource scarcity are as follows: Figure 6 as shown in Figure 6 In Figure a, session 1 activates the link 12 times in total. Since the minimum hop count requirement is 2 and the packet generation rate is 6, the scheduling algorithm meets the minimum hop count requirement for session 1. Similarly, Figure 5 The b diagram can also be used to draw the conclusion that the scheduling algorithm meets the minimum hop count of session 2. combine Figure 6 a map of and Figure 6 In Figure b, it can be seen that the ...

experiment example 3

[0141] Experimental example 3: Scheduling results when link resources are sufficient

[0142] Assume that two sessions need to be provided at the same time, and the hop count requirements of the two sessions are 2 and 3 respectively. The packet generation rate of both sessions is 8, and there are 10 available links in the network, among which links 1, 2, 3, 4, 5, and 6 are internal links, and links 7, 8, 9, and 10 are external links. link between.

[0143] The result is as Figure 7 As shown, we can get similar results as Figure 7 a map of and Figure 7 As shown in Figure b, the link is activated 17 times in session 1, and the link is activated 24 times in session 2. Since the minimum hop count requirements are 2 and 3 respectively, and the packet generation rate is 8, they all meet the minimum hop count of the link. constraint. Depend on Figure 7 It can be seen that in order to reduce delay and save costs, domestic links 1, 2, 3, 4, 5, and 6 are activated more times t...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an anti-traceability security controlled network access channel resource optimal configuration algorithm, which comprehensively considers a link type, transmission constraintsand a queue model, establishes a mathematical model between transmission hops and security level requirements, and can provide an access path recommendation length meeting the security level requirements for a system. On the basis, a minimum delay scheduling strategy meeting user security level demand constraints is provided, and finally, a piecewise linearization technology is adopted to solve the delay optimization problem with the security level constraints. According to different security level requirements of users, the lengths of links and access paths can be dynamically scheduled, and by using the resource allocation algorithm, the system delay can be optimized, the link resource load balance can be ensured, the security requirements of the users can be met, and finally, the hidingof user traces, namely anti-tracing, can be realized. Experimental results show that the algorithm can effectively allocate resources and select a proper path to ensure the security level under the conditions of lack of system resources and sufficient resources, the transmission delay is minimized, and the system performance is improved.

Description

technical field [0001] The invention belongs to the technical field of directional covert collection of domestic and foreign Internet data for anti-traceability and safe Internet access environment services, and mainly relates to a resource optimization configuration algorithm for anti-traceability security controlled network access channels. Background technique [0002] With the continuous development of the Internet, VPN, as a virtual private network based on the public network, has realized the Internet interconnection across countries and regions. Due to the mixed information and uneven performance of the node components in the public network, the security and reliability of VPN have always been a matter of great concern to enterprises and government departments. [0003] In order to defend against DDos attacks, the Industrial Internet has been configured with traceability technology. This traceability method reconstructs user access paths by collecting routing logs an...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04L29/06H04L29/08H04L12/26H04L12/24
CPCH04L63/0272H04L43/0888H04L43/0852H04L43/08H04L41/145H04L67/1001
Inventor 金昊尹小燕金博罗茜韩青洁王亚珅李阳阳
Owner CHINA ACADEMY OF ELECTRONICS & INFORMATION TECH OF CETC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products