Routing method based on hop count constraint
A technology of hop count and shortest path algorithm, which is applied in the field of optical communication, can solve the problem of not considering the link weight and only considering the link hop count, so as to reduce the blocking rate, improve the resource utilization rate, and avoid the problem of traffic redundancy Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0046] The specific implementation manners of the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. The following examples are used to illustrate the present invention, but are not intended to limit the scope of the present invention.
[0047] image 3 It is a flow chart of the routing method based on the hop count constraint according to the embodiment of the present invention. As shown, the method includes:
[0048] Step A: The node sends a path establishment request for establishing a new LSP to the PCE.
[0049] Step B: The PCE judges whether there is a direct-connected LSP meeting the requirements in the virtual topology layer according to the path establishment request, and if so, establishes a new LSP in the virtual topology layer based on the direct-connected LSP; otherwise, executes step C.
[0050] Described step B specifically comprises:
[0051] Step B1: The PCE receives the path establish...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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