Dynamic priority congestion control method for programmable switching network

A dynamic priority and congestion control technology, applied in data exchange networks, digital transmission systems, electrical components, etc., can solve problems such as inability to complete, fixed functions, and lack of flexible parameter modification.

Inactive Publication Date: 2021-07-06
WUXI VOCATIONAL & TECHN COLLEGE
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, traditional switching devices have fixed functions and do not have the function of modifying parameters flexibly, so the above operations cannot be completed

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
  • Dynamic priority congestion control method for programmable switching network
  • Dynamic priority congestion control method for programmable switching network
  • Dynamic priority congestion control method for programmable switching network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0060] Embodiment 1: as image 3 An example of dynamic priority adjustment is shown

[0061] If time T 1 When, the flow f in a link b and f c Delay-sensitive services and non-delay-sensitive services are respectively set to priority P 2 and P 3 , while flow f a Because the number of remaining packets is small, it is set to priority P 1 . When the link rate is allocated, the priority is to satisfy the flow f a , then satisfies the flow f b , and finally if there is a surplus, the flow f is satisfied c .

[0062] If the remaining link rate is 500Mbps, flow f a , f b , f c The expected rates are 120Mbps, 120Mbps, and 200Mbps respectively. Since there are currently no other stream requests, the final allocated rates are 120Mbps, 120Mbps, and 260Mbps.

[0063] As time goes by, reaching time T 2 , at this time flow f b and f c There are fewer packets left to be transmitted, so they are assigned to priority P 1 . To this end, during link rate allocation, the flow f...

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 dynamic priority congestion control method for a programmable switching network. The method comprises the steps that a sending end carries service related parameters in a data packet; the priority is calculated after parameters are extracted by each SDN programmable switching device, and the link rate of the flow in the next RTT period is pre-allocated by adopting different link rate allocation principles according to different priorities; when confirming the data packet, the receiving end returns the final rate which is obtained from the forward link and can be distributed for the flow; and each SDN programmable switching device carries out confirmation according to the final rate. According to the invention, the service related data is carried by the data packet and is modified by the programmable switching equipment on the transmission link as required, so that the service volume in the network does not need to be increased greatly; the rate allocation among various types of services can be efficiently completed, and the link congestion is reduced.

Description

technical field [0001] The invention relates to a dynamic priority congestion control method of a programmable switching network, belonging to the technical field of congestion control of a programmable switching network. Background technique [0002] In traditional network congestion control or flow control algorithms, the method of distinguishing traffic is fixed. Either the short flow is scheduled first among the long and short flows, or the delay-sensitive flow is scheduled first among the delay-sensitive flow and the non-delay-sensitive flow, and there is a problem of "single priority index". In practical applications, there are situations in which long-flow services cannot enter the next stage because the tail data cannot be scheduled for a long time, that is, the phenomenon of "long tail delay", which causes resources to be occupied and cannot be released. In addition, the existing algorithms usually consider setting the priority of the service at the sending end, an...

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/825H04L12/855H04L47/2466
CPCH04L47/263H04L47/2466
Inventor 高雅肖颖刁春娟
Owner WUXI VOCATIONAL & TECHN COLLEGE
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