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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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