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

Multi-domain routing computation method and system

A computing method and computing system technology, applied in the field of communications, can solve the problem of inability to achieve end-to-end separation of routing calculations, and achieve the effects of easy separation of routing calculations, reduction of traffic, and elimination of rollback risks.

Active Publication Date: 2007-12-05
HUAWEI TECH CO LTD
View PDF0 Cites 40 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The present invention can perform routing calculation based on complex traffic engineering constraints, and solves the problem that end-to-end separation routing calculation cannot be realized in DDRP technology
The invention layers the path calculation units, thereby having good scalability and calculation efficiency, and can solve the routing problem in large-scale networking

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
  • Multi-domain routing computation method and system
  • Multi-domain routing computation method and system
  • Multi-domain routing computation method and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 2

[0048] In the case of method embodiment 2, when the user initiates an order to establish a service from N10 to N53, the route calculation includes the following steps:

[0049] Step A: Determine the path computation unit whose computation domain can include both N10 and N53. This includes steps:

[0050] Step A1. The source node N10 requests the path computation unit P11 corresponding to its computation domain to perform route computation;

[0051] Step A2.P11 finds that N53 is not in its own computing domain, that is to say, the computing domain of P11 cannot contain both N10 and N53, so it will forward the routing calculation request to the direct upper layer path computing unit, that is, the path computing unit P21;

[0052] Step A3.P21 finds that N10 is in the calculation domain of its own directly lower-level path calculation unit P11, and finds that N53 is in the calculation domain of its own directly lower-level path calculation unit P14, that is to say, P21 finds that...

Embodiment 3

[0062] In the case of method embodiment 3, when the user initiates an order to establish a service from N10 to N53, the route calculation includes the following steps:

[0063] Step A: Determine the path computation unit whose computation domain can include both N10 and N53. This includes steps:

[0064] Step A1. The source node N10 requests the path calculation unit P11 corresponding to its calculation domain to perform route calculation; the source node notifies the sink node N53 to perform route calculation (here can also be notified by P11), and N53 requests the calculation domain that contains it. The corresponding path calculation unit P14 performs route calculation;

[0065] Step A2.P11 finds that N53 is not in its own computing domain, that is to say, the computing domain of P11 cannot contain both N10 and N53, so it will forward the routing calculation request to the direct upper layer path computing unit, that is, the path computing unit P21, and at the same time it...

Embodiment 4

[0076] In the case of method embodiment 4, when the user initiates an order from the network manager to establish a service from N10 to N53, the route calculation includes the following steps:

[0077] Step A: Determine the path computation unit whose computation domain can include both N10 and N53. At this time, the network management determines that P21 is a path computation unit whose computation domain can include both N10 and N53 through pre-saved information.

[0078] Step B: P21 and each path calculation unit in the lower layer of P21 jointly complete route calculation. This step is basically the same as step B in method embodiment 2, and will not be repeated here.

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 multi-domain route computing method and system. It includes the following steps: delaminating route computing unit to make computing area map in it; decomposing computing task layering to finish multi-domain route computing. It separates the route from the signaling to eliminate the corresponding risk caused by area-area route technique. In addition, it has good expandability and computing efficiency. Thus the invention can be used in automatic exchange optical network, multi-protocol label exchange network for flow rate engineering expanding.

Description

technical field [0001] The invention relates to the technical field of communication, in particular to a multi-domain route calculation method and system in a communication network. Background technique [0002] A communication network is a collection of geographically distributed nodes and communication links between these nodes for data transmission. Nodes in the communication network can communicate through intermediate nodes, which can make the communication network resources more economical and have a higher utilization rate. There are many types of existing communication networks, such as SDH / SONET network and IP network. The nodes of the communication network generally communicate on the network by exchanging data frames or data packets, and these frames or packets are specified by a specific protocol, such as the TCP / IP protocol. The protocol mentioned in this article refers to a set of rules similar to the TCP / IP protocol that defines how nodes interact. [0003]...

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/24H04L12/28H04L12/56H04L45/42
CPCH04L45/04
Inventor 李启铭徐慧颖
Owner HUAWEI 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