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

Method and device for routing computation

A computing method and technology of a path computing unit, which are applied in digital transmission systems, data exchange networks, electrical components, etc., can solve problems such as affecting the normal establishment of other services and wasting resources, and achieve the goal of shortening resource reservation time and reducing resource occupation. Effect

Active Publication Date: 2013-04-03
ZTE CORP
View PDF5 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Such reservation will lead to waste of intra-domain and inter-domain resources in each domain, and affect the normal establishment of other services

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
  • Method and device for routing computation
  • Method and device for routing computation
  • Method and device for routing computation

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0099] Example 1: No requirement on resource utilization, electrical layer calculation

[0100] This embodiment describes the BRPC calculation process in which there is no requirement on resource utilization in the calculation request. Refer below figure 2 The scenario shown (assuming that the links in this scenario are all electrical layers) provides a description of the specific implementation process of this embodiment.

[0101] figure 2 AS(i) and VSPT(i+1) are given in . DN is the destination node, BN-en(1, i+1), BN-en(2, i+1) and BN-en(3, i+1) are the leaf nodes of VSPT(i+1), namely AS( The entry boundary nodes of i+1), BN-en(1, i), BN-en(2, i) and BN-en(3, i) are the entry boundary nodes of AS(i), BN-ex(1 , i) and BN-ex(2, i) are the egress border nodes of AS(i). Need to set up the shortest path tree from DN to AS (i) entrance border node now, form VSPT (i), in conjunction with BRPC algorithm and the method of the present invention, calculation process is as follo...

Embodiment 2

[0108] Example 2: There is a requirement for resource utilization, electrical layer calculation

[0109] This embodiment describes the BRPC calculation process in which the resource utilization rate is required in the path calculation request. Refer below figure 2 The scenario shown (assuming that the links in this scenario are all electrical layers) provides a description of the specific implementation process of this embodiment.

[0110] figure 2 AS(i) and VSPT(i+1) are given in . DN is the destination node, BN-en(1, i+1), BN-en(2, i+1) and BN-en(3, i+1) are the leaf nodes of VSPT(i+1), namely AS( The entry boundary nodes of i+1), BN-en(1, i), BN-en(2, i) and BN-en(3, i) are the entry boundary nodes of AS(i), BN-ex(1 , i) and BN-ex(2, i) are the egress border nodes of AS(i). Need to set up the shortest path tree from DN to AS (i) entrance border node now, form VSPT (i), in conjunction with BRPC algorithm and the method of the present invention, calculation process is ...

Embodiment 3

[0121] Embodiment 3: There are requirements for resource utilization and optical layer calculation

[0122] This embodiment describes a BRPC calculation process in which a calculation request has a resource utilization requirement. Refer below figure 2 The scenario shown (assuming that the links in this scenario are all optical layers) provides a description of the specific implementation process of this embodiment.

[0123] figure 2 AS(i) and VSPT(i+1) are given in . DN is the destination node, BN-en(1, i+1), BN-en(2, i+1) and BN-en(3, i+1) are the leaf nodes of VSPT(i+1), namely AS( The entry boundary nodes of i+1), BN-en(1, i), BN-en(2, i) and BN-en(3, i) are the entry boundary nodes of AS(i), BN-ex(1 , i) and BN-ex(2, i) are the egress border nodes of AS(i). Need to set up the shortest path tree from DN to AS (i) entrance border node now, form VSPT (i), in conjunction with BRPC algorithm and the method of the present invention, calculation process is as follows:

...

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 provides a method for routing computation. The method is used in routing computation from a source node to a destination node, a plurality of domains are contained from the source node to the destination node, and the method comprises that a path computation unit of the current domain determines bidirectional label switching paths from the current domain to adjacent domains of the current domain, and conducting resource reservation for bidirectional label switching paths, wherein all coincident path sections are subjected to resource reuse if coincident path sections exist in bidirectional label switching paths. The invention also provides a device for routing computation. According to the method and the device, resources are reused during resource reservation, so that the resource waste can be reduced.

Description

technical field [0001] The present invention relates to the communication field, in particular to a route calculation method and device. Background technique [0002] In a multi-domain network divided by AS (Autonomous System, autonomous system), if the domain sequence has been determined, BRPC (Backward-Recursive PCE-Based Computation, reverse recursive path algorithm) can be used for cross-domain path calculation to obtain the shortest Constrain the path. [0003] The BRPC algorithm is described in RFC5441 (Request For Comments, RFC for short), and the algorithm process depends on communication between cooperating PCEs (Path Computation Elements, Path Computation Elements). The PCC (Path Computation Clients, path computation client) sends a PCReq (Path Computation Request, path computation request) message to the PCE in its domain. The message is forwarded between PCEs in each domain until the request reaches the PCE in charge of calculating the domain where the destinat...

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/723H04L12/913H04L45/50H04L47/724
Inventor 邓练波卢刚
Owner ZTE CORP
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