Extensible full-flow priority dispatching method

A priority scheduling and priority technology, applied in the field of scalable full-flow priority scheduling, can solve problems such as high processing complexity and large tree structure height

Active Publication Date: 2010-05-26
CERTUS NETWORK TECHNANJING
View PDF0 Cites 22 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, this algorithm is only suitable for processing highly clustered flows. If fine-grained flows are to be processed, such as a flow with the same five-tuple (source IP, source port, destination IP, destination port, protocol), the height of the tree structure will become very large, resulting in high processing complexity

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
  • Extensible full-flow priority dispatching method
  • Extensible full-flow priority dispatching method
  • Extensible full-flow priority dispatching method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0052] The scalable full-flow priority scheduling method proposed by the present invention, referred to as AFL-SFQ-DRR (Active Flow Table-Strict Priority Queue-Difference Round Robin Scheduling) method, divides the flows of the same priority into a group, and the group Scheduling according to priority, within the group according to the balance round-robin scheduling. The description is as follows in conjunction with the accompanying drawings.

[0053] like figure 1 As shown, step S1 receives the network data packet p, and parses the network data packet flow label fi, and the flow label is described by the following data structure:

[0054] Header

[0055] {

[0056] int32 sIP, dIP; / / 32-bit source and destination addresses

[0057] int16 sPort, dPort; / / 32-bit source port and destination port

[0058] int8 protocol; / / 8-bit protocol

[0059]};

[0060] Step S2 calculates the dequeuing sequence in the network data packet group according to the flow label, and inser...

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 an extensible full-flow priority dispatching method. The method comprises the following steps: dividing flow with the same priority into a group, dispatching according to the priority between groups, dispatching according to difference polling mode in groups. The dispatching method comprises the following steps: receiving a network data packet, checking flow label of the network data packet, inserting the network data packet into the belonged flow queue according to the flow label, simultaneously calculating queuing sequence in the groups, queuing according to the priority between the groups and queuing sequence in the groups from the network data packet, and transmitting the network data packet. According to the method, physical queues are dynamically bound to the flows simultaneously existing in the system by using an active flow list, thereby realizing the full-flow queue. Moreover, two-layer dispatching strategy is added, so the fine-grained full-flow service distinction and guaranteed bandwidth are realized. According to an experiment of combined flow, the extensible full-flow priority dispatching method actually has higher performance on service assurance.

Description

technical field [0001] The invention relates to the technical field of network management and network monitoring, in particular to an expandable full-flow priority scheduling method. Background technique [0002] The rapid increase in the number of users and traffic has seriously affected the normal use of key services. Traffic management is the key to ensuring key services. Increased bandwidth may temporarily solve the phenomenon of slow network speed, and the network quality of key services has improved. However, the increased bandwidth is quickly occupied by the endless growth of non-critical business traffic. Therefore, the key to rationally allocating network resources and ensuring key services lies in: (1) how to reasonably allocate bandwidth to each flow; (2) how to implement monitoring and direct control of various application flows, and set different priorities according to different applications level to ensure fast and accurate network services for business-cri...

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/56H04L12/863
Inventor 李国栋陈震薛一波李军
Owner CERTUS NETWORK TECHNANJING
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