Flow engineering full network counting method and system between regions

Abstract

This invention relates to a whole network computation method and a system for flow engineering among regions including the following steps: A, a computation client end of said route sends a parallel flow engineering route computing request to multiple route computation units in its region, B, said request is transferred to other route computation units of other regions, C, the uits receiving the request carries out route computation according to its maintained network resource state information and returns available routes to the route computation client end, besides, this invention also provides a whole net computing system.

Description

technical field [0001] The invention belongs to the technical field of network communication, and relates to a calculation method and system for the whole network of inter-area traffic engineering including a path calculation unit. Background technique [0002] With the continuous expansion of the network, the continuous growth of data traffic and the increasingly complex business, the existing network is overwhelmed, and people can no longer tolerate this best effort (Best Effort) transmission mode. On the other hand, Internet service providers pay more attention to profit than ever before, and the Internet urgently needs to expand bandwidth occupation and network optimization on demand. [0003] Traffic Engineering (TE-Traffic Engineering) focuses on the optimization of the overall performance of the network. Its main goal is to provide efficient and reliable network services conveniently, optimize the use of network resources, and optimize network traffic. This is divide...

AI Technical Summary

Problems solved by technology

[0011] 1. When a label switching router (LSR-Label Switching Router) sends a calculation path request to the PCE as the PCC, only one path can be returned, and the failure of the PCE calculation of a certain path calculation unit will cause the LSR to repeat to different PCEs again. The interactive process of sending computing requests, the utilization of network resources is not flexible enough

[0012] 2. After the network has been repeatedly established and removed, the inter-area TE path established based on the original resources may no longer be optimal at present. For example, some services may use multiple LSPs with smaller bandwidth due to network resource constraints. Spliced ​​together, a re-optimization process is required to recalculate and establish certain traffic engineering TE paths based on the existing network resource status

In the process of re-optimization, since there is only one alternative path, the utilization rate of network resources is not high enough

[0013] 3. Due to certain considerations, the traffic engineering TE path that the operator wishes to plan for certain services may be inconsistent with the result calculated by the path calculation unit PCE. In this case, the calculation result can only be limited by manual configuration, which is cumbersome

[0014] 4. The existing constrained path calculation method based on the PCE model cannot query the status of the current available resources in the network and the available bandwidth on each path, which makes the analysis of the status of network resources lack of basis

Images