A method for realizing cross-region cspf network computing based on igp

An implementation method and cross-area technology, which are applied in the field of cross-area CSPF network-wide computing implementation to achieve the effects of reducing protocol communication traffic, reducing network protocol complexity, and simplifying network configuration

Active Publication Date: 2019-05-14
FENGHUO COMM SCI & TECH CO LTD
View PDF7 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The technical problem to be solved by the present invention is to solve the problems of large traffic overhead, long calculation time and high network configuration complexity in the network during the implementation process of the existing cross-region constrained path calculation method

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
  • A method for realizing cross-region cspf network computing based on igp
  • A method for realizing cross-region cspf network computing based on igp
  • A method for realizing cross-region cspf network computing based on igp

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0022] The present invention will be described in detail below in conjunction with the accompanying drawings and specific embodiments.

[0023] The embodiment of the present invention provides an IGP-based cross-area CSPF network-wide computing implementation method, such as figure 1 shown, including the following steps:

[0024] S1. Using two nodes in different areas as the starting point and the destination node respectively, schedule the CSPF algorithm.

[0025] S2. The CSPF checks whether the starting point and the destination node are in the same area. If yes, go to step S3; otherwise, go to step S4.

[0026] S3. The CSPF calculates the intra-area LSP according to the local TED (Traffic Engineering Database, traffic engineering database), and returns the calculation result to the RSVP (Resource ReServation Protocol, resource reservation protocol), and goes to step S13.

[0027] S4. Calculate the edge node from the start point to the edge node connecting the backbone are...

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 IGP-based cross-area CSPF whole-network calculation implementation method, which includes the following steps: using two nodes in different areas as the starting point and the destination node, scheduling the CSPF algorithm, and calculating the LSP from the starting point to the edge node of the area where the starting point is located , return the result to RSVP; if the destination node is in the backbone area, calculate the LSP from the edge node to the destination node, and end the CSPF calculation, otherwise return the path from the edge node to the directly connected backbone node to RSVP; Find the end area where the destination node is located in the internal node table, calculate the LSP from the backbone node to the edge node in the end area where the destination node is located, and then calculate the LSP from the edge node to the destination node, and return the result to RSVP, and RSVP returns to the starting point step by step to form the LSP Complete route. The invention eliminates the time overhead caused by the entire communication process of the request initiated by LSP calculation, the forwarding request, and the return of the calculation result, can establish an inter-area LSP faster, simplify network configuration, and reduce protocol communication flow.

Description

technical field [0001] The invention relates to the communication field, in particular to an IGP-based cross-area CSPF whole-network calculation implementation method. Background technique [0002] Traffic engineering is mainly to allocate network resources according to business needs, and map communication traffic to special paths and dedicated resources to achieve load balancing, so that network resources can be used more efficiently, thereby providing reliable network services. With the expansion of network deployment scale and the development of MPLS (Multiple Protocol Label Switch, Multi-Protocol Label Switching) technology, service traffic may cross different regions, and traffic engineering between regions is becoming more and more common. [0003] CSPF (Constrained Shortest Path First, constraint-based shortest path first calculation) is the core part of MPLS traffic engineering. CSPF discovers the topology relationship in the network through IGP (Internal Gateway Pr...

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/721H04L12/723H04L12/801H04L12/911H04L45/50
CPCH04L45/12H04L45/50H04L47/10H04L47/825
Inventor 彭浩林程友清王一鸣
Owner FENGHUO COMM SCI & TECH CO LTD
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

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap