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

Inactive Publication Date: 2012-06-27
BEIJING UNIV OF POSTS & TELECOMM
View PDF3 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0012] (4), only the hop count of the link is considered, an

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
  • Routing method based on hop count constraint
  • Routing method based on hop count constraint
  • Routing method based on hop count constraint

Examples

Experimental program
Comparison scheme
Effect test

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...

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 a routing method based on a hop count constraint and relates to an optical communication field. The method comprises the following steps: determining whether there is a direct connected label switched path (LSP) which satisfies a requirement on a virtual topology layer; if there is the direct connected label switched path (LSP) which satisfies the requirement on the virtual topology layer, establishing the new LSP on the virtual topology layer based on the LSP; otherwise, determining whether there is an undirected-connected LSP which satisfies the requirement; if there is the undirected-connected LSP, calculating a hop count corresponding to the undirected-connected LSP on a physical topology layer and executing a step D; otherwise, establishing the new LSP on the physical topology layer; D. calculating a shortest path, calculating the hop count of the shortest path, calculating a normalization hop count ratio and determining whether the hop count ratio is greater than a preset threshold; if the hop count ratio is greater than the preset threshold, establishing the new LSP on the physical topology layer; otherwise, establishing the new LSP based on the undirected-connected LSP. By using the method of the invention, a problem that the current LSP is used to establish the new LSP blindly so as to lead to flow redundancy can be avoided; a blocking rate of a network can be reduced and a resource utilization rate can be increased.

Description

technical field [0001] The invention relates to the technical field of optical communication, in particular to a route selection method based on hop number constraints. Background technique [0002] The wide application of the Internet increases the demand for bandwidth, and the development of GMPLS (Generalized Multiprotocol Label Switching, general multi-protocol label switching network) promotes the development of optical networks. A transmission node in an optical network is composed of multiple data planes and a control plane, and a collection of multi-layer networks supports LSPs (Label Switched Path, Label Switched Path) of different switching technologies. [0003] In a multi-layer network, in order to obtain efficient resource utilization, effective TE (Traffic Engineering, traffic engineering) and traffic grooming solutions are required. However, due to the invisibility of multi-layer network resources, network nodes themselves cannot provide a multi-layer network...

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
IPC IPC(8): H04L12/56H04L12/721
Inventor 张民陈馨谢久雨王磊陈雪
Owner BEIJING UNIV OF POSTS & TELECOMM
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