Heuristic routing method avoiding key nodes in complex network

A complex network and key node technology, applied in the field of heuristic routing to avoid key nodes, can solve problems such as complex implementation, large difference between route length and shortest path, and achieve congestion relief, good defense, and large network capacity Effect

Active Publication Date: 2013-07-10
NANJING UNIV OF SCI & TECH
View PDF2 Cites 28 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] However, the above-mentioned effective routing methods for complex networks have completely changed the shortest path first routing method that is mostly used in reality. The implementation is more complicated, and the obtained route length is quite different from the shortest path.

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
  • Heuristic routing method avoiding key nodes in complex network
  • Heuristic routing method avoiding key nodes in complex network
  • Heuristic routing method avoiding key nodes in complex network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0021] The present invention will be described in further detail below in conjunction with the accompanying drawings. For the convenience of description, the following definitions and descriptions are given.

[0022] Definition 1: Complex Network Model

[0023] The complex network model is represented by graph G, G=(V,E). V={v 1 ,v 2 ,...,v n} is a set of nodes, E={e 1 ,e 2 ,...,e m}?V×V is the set of edges. v i ∈V, (i=1,2,...,n), represents a node in the network, (v i ,v j )∈E, means to node v i to node v j An edge of w(v i ,v j ) represents the side (v i ,v j ) weights.

[0024]Definition 2: Network traffic dynamics model: the Internet is modeled as a complex network, each node is regarded as a host or a router, and a queue satisfying the first-in-first-out rule is assigned to each node in the network, and each step in the network has R data packets are generated, and the source node and destination node of each information packet are randomly assigned. Once...

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

To solve the problem of routing optimization in a complex network, the invention discloses a heuristic routing method avoiding key nodes in the complex network. On the basis of maintaining original network connection unchanged and based on the routing of the shortest path, by changing weight of the edges connecting key nodes and reducing the maximum node in the network, the flow load is distributed again between the key nodes and non-key nodes, and flow of the key nodes is reduced. By adopting the heuristic routing method, larger network capacity, a routing length closer to the shortest path and higher transmission performance under load attack can be provided, network congestion can be relieved effectively, and good defense effect on cascade invalidation caused by congestion of the key nodes can be achieved.

Description

technical field [0001] The invention relates to a complex network routing optimization technology, in particular to a heuristic routing method for avoiding key nodes in a complex network. Background technique [0002] Complex networks have become a research hotspot for scientists in many fields in recent years, and the research on complex networks has huge potential application value. However, the vulnerability of complex networks has become a major defect in its practical application, especially in the face of Under various complex attacks such as random attacks, deliberate attacks, coordinated attacks, and distributed attacks, the security of complex networks is increasingly threatened. Research on defense and protection methods for complex networks is a hot and difficult point that people are now facing one of the problems. [0003] A large-scale communication network can be regarded as a complex network. This complex communication network with different types of nodes, ...

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): H04L12/721H04L12/803
Inventor 张琨徐建赵学龙田春山严悍张宏
Owner NANJING UNIV OF SCI & TECH
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