Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Random Shortest Path Routing Method

A shortest path and routing technology, applied in digital transmission systems, data exchange networks, electrical components, etc.

Inactive Publication Date: 2019-05-24
GUANGDONG ELINK INFORMATION TECH
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although OSPF itself has password authentication, if the password is too simple, or the intruder uses some professional packet capture tools and has strong cracking tools, they can still crack this encryption method and obtain sensitive data. Information security poses a serious test

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
  • Random Shortest Path Routing Method
  • Random Shortest Path Routing Method
  • Random Shortest Path Routing Method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0024] Embodiment 1: as figure 1 and figure 2 Shown:

[0025] With V0 as the starting point S and Vn as the destination point D, the user enters n=2, and the path is calculated and counted by the Dijikstra algorithm, and the following paths and path lengths can be obtained:

[0026] V0V1Vn=210; V0V2Vn=130; V0V3Vn=70.

[0027] Among them, the two paths V0V2Vn=130 and V0V3Vn=70 are the second shortest and the shortest respectively, so V2 and V3 are selected as the jumping points.

[0028] In summary, the determined paths are V0V2Vn and V0V3Vn, and after updating the routing table, data packets are randomly sent on these two paths.

Embodiment 2

[0029] Embodiment 2: as figure 1 and image 3 Shown:

[0030] With V0 as the starting point S and V4 as the destination point D, the user enters n=2, and the path is calculated and counted by the Dijikstra algorithm. Since the adjacent take-off points are insufficient for the required number of take-off points, n>the number of available paths k, so μ=k=1, only the only path can be obtained:

[0031] V0V2V4=15.

[0032] In summary, the determined path is V0V2V4, and the data packet is sent on this path after the routing table is updated.

Embodiment 3

[0033] Embodiment 3: as figure 1 and Figure 4 Shown:

[0034] With V0 as the starting point S and V3 as the destination point D, the user enters n=2, and the path is calculated and counted by the Dijikstra algorithm, and the following paths and path lengths can be obtained:

[0035] V0V5V4V3=180; V0V5V3=130; V0V4V3=50;

[0036] V0V6V3=25; V0V2V3=60; V0V6V2V3=65.

[0037] Among them, the two paths V0V4V3=50 and V0V6V3=25 are the second shortest and the shortest respectively, so V4 and V6 are selected as the jumping points.

[0038] Taking V4 as the starting point S and V3 as the destination point D, after calculating and counting the paths through the Dijikstra algorithm, the following paths and path lengths can be obtained:

[0039] V4V3=20; V4V7V3=15. Select V4V7V3 as the path.

[0040] Taking V6 as the starting point S and V3 as the destination point D, after calculating and counting the paths through the Dijikstra algorithm, the following paths and path lengths can b...

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 relates to the technical field of wireless network communication, in particular to a random shortest path routing method. The method comprises the steps that 1, a random value n is set by a user, and the n represents the number of transmission paths of a data packet; 2, the number k of all usable paths of the data packet from an initial point to a destination point is determined; 3, mu random paths are determined, n is compared with k, if n is larger than k, mu is equal to k, otherwise, mu is equal to n; 4, a routing table is updated; 5, the data packet is sent on the mu random paths determined in the third step in a random mode. According to the random shortest path routing method, randomness is introduced, transmission of the data packet is unpredictable, the transmission paths of the data packet is jointly determined by the n set by the user and a network topological structure, the paths passed by the data packet are unpredictable, data passing through each path is only one part of the data packet, and a network intruder cannot obtain a complete data packet.

Description

technical field [0001] The invention relates to the technical field of wireless network communication, in particular to a random shortest path routing method. Background technique [0002] Today, with the rapid development of Internet technology, the number of customers accessing the Internet is increasing, and the network structure is becoming more and more complex. Some sensitive and valuable data in the network are easy to attract malicious attacks, and the openness of the network provides conditions for malicious attacks. Network security has always been a research topic that cannot be ignored. Some current technologies, such as SSL (Secure Socket Layer) and IPSec (IP Security), provide a good security mechanism for network applications, but also affect the efficiency to a certain extent. . [0003] For data transmission efficiency and to reduce network delay, the general routing algorithm will follow the OSPF protocol. The routing algorithm that follows OSPF takes eff...

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 Patents(China)
IPC IPC(8): H04L12/721
CPCH04L45/12
Inventor 方妍
Owner GUANGDONG ELINK INFORMATION TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com