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

Rapid route convergence method

A routing and fast technology, applied in the communication field, can solve problems such as wasting CPU, reducing convergence speed, and inability to selectively process, and achieve rapid topology changes, reduce CPU load, and respond to topology changes.

Active Publication Date: 2013-02-06
FENGHUO COMM SCI & TECH CO LTD
View PDF2 Cites 15 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In the process of routing calculation in the existing technology, most of the recalculations are unnecessary. Since they cannot be processed selectively, a lot of CPU is wasted and the convergence speed is reduced.

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
  • Rapid route convergence method
  • Rapid route convergence method
  • Rapid route convergence method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0063] The present invention will be described in further detail below in conjunction with the accompanying drawings.

[0064] The fast route convergence method of the present invention comprises the following steps:

[0065] Step 1, pre-evaluate the changes in the network topology: when any routing node in the network receives a new link state packet LSP, the routing node that receives the new link state packet LSP does not start the Dijkstra algorithm immediately Recalculate the route of the entire topology, but analyze the changes of the network topology according to the current shortest path first tree SPT, link state information database LSDB information and the information of neighbor nodes contained in the new link state grouping LSP. The changes in are divided into the following four categories:

[0066] One is that a leaf node joins the network;

[0067] Second, the network topology has not changed, but some routing information has changed;

[0068] Third, the link...

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 a rapid route convergence method. After any routing node in a network receives a new link status packet LSP, the routing node receiving the new link status packet LSP does not start a Dijkstra algorithm immediately to conduct route recalculation of a whole topology, and the routing node analyzes change situations of the network topology according to a current shortest path first tree SPT, a link status information base LSDB information and information of an adjacent node contained in the new link status packet LSP, and the change situations of the network topology are divided into the following four classes: first, one leaf node is added in the network; second, the network topology has no changes and any parts of routing information is changed; third, a link is broken; and fourth other situations exist. The change situations of the network topology determine nodes participating in storage protect feature (SPF) calculation and calculate the route. The rapid route convergence method optimizes calculation and updating of the algorithm, can rapidly responds to topology changes and can reduce central processing unit CPU load.

Description

technical field [0001] The invention relates to the technical field of communication, in particular to a fast route convergence method. Background technique [0002] The existing routing algorithms can be divided into two categories: routing algorithms based on distance vector and routing algorithms based on link state. [0003] In the distance vector routing algorithm, each routing node (referred to as a node) obtains routing information from its neighbors, and superimposes the distance vector from itself to the neighbor on each routing information to form its own routing information, such as routing Routing Information Protocol (RIP). [0004] Based on the link state routing algorithm, each routing node notifies the link information between itself and its neighbor nodes to all other routing nodes in the network, and then each routing node executes the Shortest Path First (Shortest Path First, SPF) algorithm to find Find the optimal route from itself to all other 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/721
Inventor 刘剑华张峰
Owner FENGHUO COMM SCI & TECH CO LTD
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