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

Routing method and device for congestion avoidance

A technology to avoid congestion and routing, applied in the field of communication, can solve problems such as inability to provide, waste of network resources, and decline in link utilization.

Active Publication Date: 2013-11-27
SHANGHAI HUAWEI TECH CO LTD
View PDF3 Cites 41 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] From the above-mentioned existing technical solutions to the congestion problem, the simple method of discarding tail algorithm to avoid congestion will cause synchronous packet loss in the network. Small window, which causes the network to periodically swing between congestion and idle states, resulting in a decrease in link utilization
The AQM algorithm can avoid synchronous packet loss in the network, but this algorithm starts packet loss in advance when the network is not congested, which will cause a waste of network resources.
[0008] Therefore, the prior art cannot provide a more reasonable and optimized technical solution

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 and device for congestion avoidance
  • Routing method and device for congestion avoidance
  • Routing method and device for congestion avoidance

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0227] The embodiment of the present invention provides a routing method for avoiding congestion. The method is an operation process written from the perspective of each switch in the network. The network element acts as the execution subject, and the first network element can be a switch, a network node, or a controller, etc. It should not be understood here that the present embodiment of the present invention is similar to other embodiments herein. understand.

[0228] Such as Figure 5As shown, the method includes:

[0229] Step 101, the switch obtains neighbor node information, generates a link state announcement LSA message according to the obtained neighbor node information; and sends the LSA message to the controller;

[0230] Among them, each switch in the network periodically, or when the neighbor node changes, sends its own neighbor node information to the controller through the LSA message, which is used by the controller to construct a global network based on the...

Embodiment 2

[0244] The embodiment of the present invention provides a routing method for avoiding congestion. This method and the method described in the first embodiment above are based on different execution subjects. In this embodiment, the controller is used as the execution subject to coordinate the forwarding strategy for each switch. , make the forwarding policy into a flow table entry, and send it to each switch as a flow table entry in the switch. The switch utilizes the forwarding control of the controller to effectively avoid congestion and at the same time ensure the effective transmission of data.

[0245] For a detailed description of the method, refer to the Figure 6 As shown, the method includes:

[0246] Step 201, receiving the LSA message sent by each switch in the network; constructing a global network topology map according to the LSA message;

[0247] Step 202, receiving an NCA message sent by each switch in the network; obtaining global congestion information acco...

Embodiment 3

[0285] The embodiment of the present invention provides a routing method for avoiding congestion. This method is mainly to explain that the switch receives the flow table entries made according to the forwarding policy sent by the controller, so that when the switch receives data flow subsequently, it can query the stored The flow table entry performs data flow forwarding.

[0286] The method includes:

[0287] Step 301, receiving the flow table entry sent by the controller,

[0288] Step 302, storing the flow table entry.

[0289] Through the routing method for avoiding congestion provided by this embodiment, the switch receives the flow table entry sent by the controller, and when the switch subsequently receives the data flow, it can query the stored flow table entry to forward the data flow.

[0290] Example four

[0291] The embodiment of the present invention provides a routing method for avoiding congestion. The method is explained from the perspective of the switch....

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

Provided is a routing method and device for congestion avoidance. The method comprises the steps of receiving LSA messages sent by all first network elements in a network, structuring a global network topological graph, receiving NCA messages sent by all the first network elements in the network, obtaining global congestion information, obtaining the optimal path of other nodes in a network accessed by each node, obtaining the maximum inflow speed allowed by the optimal path, removing all nodes in congestion states in the network from the topological graph to obtain a network topological graph of a non-congestion state according to the global congestion information, obtaining the optimal path in non-congestion according to the network topological graph of the non-congestion state, obtaining a forwarding strategy according to the obtained optimal path, the maximum inflow speed of the optimal path and the optimal path in the non-congestion, sending the forwarding strategy to the corresponding first network elements to enable the first network elements to obtain flow chart entries according to the forwarding strategy, and carrying out storage. Therefore, congestion is avoided, and data transmission efficiency is improved.

Description

technical field [0001] The invention relates to the technical field of communication, in particular to a routing method and device for avoiding congestion. Background technique [0002] With the growth of the scale of the Internet, users and applications on the Internet are increasing rapidly, and congestion has become a very important problem. In recent years, a lot of research work has been carried out in the field of congestion control, and congestion algorithms can be divided into two main parts, namely: source algorithms used on end systems and link algorithms used on network devices. [0003] The source algorithm can be understood as reducing the rate of sending data at the source when congestion occurs, so that a large number of connections can share the link. Through the source's perception and detection of the current state of the network, the size of the window in which packets occur is adjusted in response. There is no doubt that the scalability provided by this ...

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/801H04L12/823H04L12/721H04L47/32
Inventor 洪佩琳朱超周伟
Owner SHANGHAI 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