Reputation-based link congestion control method

A technology for link congestion and control methods, applied in digital transmission systems, electrical components, transmission systems, etc., can solve problems such as congestion, burst traffic on the sender, and high overhead, achieve link packet loss avoidance, and simple hardware implementation. , throughput and latency improvements

Active Publication Date: 2014-03-19
INST OF COMPUTING TECH CHINESE ACAD OF SCI
View PDF4 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0010] The technical problem to be solved by the present invention is to provide a credit-based link congestion control method, which can overcome the problems of lagging and high overhead

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
  • Reputation-based link congestion control method
  • Reputation-based link congestion control method
  • Reputation-based link congestion control method

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0051] The structural principle and working principle of the present invention will be described in detail below in conjunction with the accompanying drawings:

[0052] See figure 1 , figure 1 It is a flowchart of a method according to an embodiment of the present invention. The reputation-based link congestion control method of the present invention integrates congestion control and reputation flow control between each hop of the link, and adjusts the sending rate of the sender through the reputation value of the receiver to avoid link congestion. Including the following steps:

[0053] Step S100: The sender initializes the initial information maintained by itself, the initial information includes the sending count, the receiver's reputation value and the current sending window size;

[0054] Step S200: Calculate and maintain a sending threshold, determine a sending threshold according to the number of receivable buffers of the receiver, and use the sending threshold as a basis for...

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

Disclosed is a reputation-based link congestion control method, in which congestion control and reputation flow control are integrated between hops of a link and a transmission rate of a sender is adjusted through a reputation value of a receiver to avoid link congestion. The method comprises the steps of initializing initial information the sender maintains by the sender, the initial information including a transmission count, the reputation value of the receiver and a current transmission window size; calculating and maintaining transmission thresholds, determining a transmission threshold based on the number of receivable buffers of the receiver, and considering the transmission threshold as a basis for adjusting the transmission rate of the sender; and adjusting the transmission rate of the sender according to the transmission threshold, and automatically adjusting the transmission window size based on the transmission threshold to avoid packet loss due to a buffer overflow of the receiver.

Description

technical field [0001] The invention relates to the field of data transmission of network switches, in particular to a credit-based link congestion control method for network switches. Background technique [0002] In the current network, most of the data transmission should try to avoid the occurrence of congestion to ensure the efficiency of data transmission. However, in order to reduce hardware costs and data buffering delays, most switches are configured with a limited number of buffers. Therefore, when there is a burst of traffic in the network, congestion is easy to occur, and data packets may be dropped. Existing studies have shown that burst traffic is the main cause of data packet loss at the network edge layer and aggregation layer. Therefore, it is necessary to avoid the impact of packet loss caused by burst traffic on the network as much as possible. [0003] In terms of network congestion control methods, the existing technologies mainly have the following i...

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/801
Inventor 江国龙付斌章陈明宇张立新
Owner INST OF COMPUTING TECH CHINESE ACAD OF SCI
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