Unlock instant, AI-driven research and patent intelligence for your innovation.

Routing Planning Method Based on Link Congestion Coefficient

A technology of link congestion and congestion coefficient, applied in the field of communication, can solve problems such as not considering flow correlation

Active Publication Date: 2020-09-11
BEIJING UNIV OF POSTS & TELECOMM
View PDF9 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to provide a routing planning method based on the link congestion coefficient to solve the technical problem that the traditional routing algorithm does not consider the flow correlation when the network is congested

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 Planning Method Based on Link Congestion Coefficient
  • Routing Planning Method Based on Link Congestion Coefficient
  • Routing Planning Method Based on Link Congestion Coefficient

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0025] The present invention will be further described below in conjunction with the accompanying drawings and specific embodiments.

[0026] Such as figure 1 As shown, the present invention provides a kind of route planning method based on link congestion coefficient, comprises the following steps:

[0027] (1) Obtain relevant information about network topology and existing services in the network, including at least service required bandwidth, service priority, and service path information;

[0028] Among them, the adjacency matrix is ​​used to represent the connection relationship between nodes in the network topology. For example figure 2 Shown a 16-node undirected network connectivity graph, a 16×16 matrix B=[b ij ] indicates the node connection relationship in the graph: if there is a link between the i-th node and the j-th node, then b ij The value is the cost measure of the link connecting i and j nodes, otherwise b ij The value is 0; the value of elements on the...

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 route planning method based on a link congestion coefficient. The steps are as follows: determining network topology information and service information; calculating congestion coefficients of all links according to the network topology information and service information; accepting new service request information, according to k ‑shortest paths algorithm finds K paths from the starting node of the new service to the destination node as alternative paths; comprehensively considers the sum of the link congestion coefficients of the paths and the path length to determine the target path. When the routing method of the present invention selects a path, the ubiquitous coupling between data streams in the network is considered, thereby reducing the influence of newly added data streams on existing data streams in the network. Especially when the network is congested, the method can ensure the stability of network QoS, effectively balance the load and improve the utilization of network resources.

Description

technical field [0001] The invention relates to a route planning method in a communication network, belonging to the technical field of communication. Background technique [0002] With the rapid development of the Internet, the bandwidth requirements of users have increased significantly. Considering the deployment cost of network resources and the corresponding service revenue, it is not a feasible solution to meet the ever-increasing user bandwidth transmission demand only by increasing network capacity. Even in a network with sufficient bandwidth resources, the uncertainty and suddenness of user demand will lead to network congestion. In addition, limited network resources and data transmission rules in the network lead to local correlation of quality of service (QoS) at links and nodes. The end-to-end continuity and consistency of the data flow itself makes this local correlation affect other data flows through network nodes and links, and finally forms a global corre...

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 Patents(China)
IPC IPC(8): H04L12/721H04L12/711H04L12/725H04L12/729H04L45/125H04L45/247
CPCH04L45/123H04L45/22H04L45/70H04L45/125H04L45/302H04L45/30
Inventor 顾仁涛郑豪豪纪越峰
Owner BEIJING UNIV OF POSTS & TELECOMM