CN109246031A - A kind of switch port queues traffic method and apparatus - Google Patents
A kind of switch port queues traffic method and apparatus Download PDFInfo
- Publication number
- CN109246031A CN109246031A CN201811293243.3A CN201811293243A CN109246031A CN 109246031 A CN109246031 A CN 109246031A CN 201811293243 A CN201811293243 A CN 201811293243A CN 109246031 A CN109246031 A CN 109246031A
- Authority
- CN
- China
- Prior art keywords
- priority
- data packet
- subqueue
- queue
- default
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 title claims abstract description 46
- 230000007246 mechanism Effects 0.000 claims abstract description 17
- 230000015654 memory Effects 0.000 claims description 36
- 230000005540 biological transmission Effects 0.000 claims description 15
- 230000008569 process Effects 0.000 claims description 6
- 238000012546 transfer Methods 0.000 claims description 3
- 230000006870 function Effects 0.000 description 14
- 238000012545 processing Methods 0.000 description 11
- 238000004590 computer program Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 4
- 230000008859 change Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 238000007493 shaping process Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000002708 enhancing effect Effects 0.000 description 1
- 238000009499 grossing Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
- H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/215—Flow control; Congestion control using token-bucket
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/30—Peripheral units, e.g. input or output ports
- H04L49/3027—Output queuing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a kind of switch port queues traffic methods, this method realizes the flow scheduling to data flow using strict priority mechanism cooperation token bucket algorithm, the following steps are included: safeguarding multiple non-default priority queries and the minimum default priority queue of a priority on switch port, and multiple subqueues are safeguarded in non-default priority query, the corresponding token bucket of each subqueue；The data packet is sent into corresponding priority query according to the priority for the affiliated data flow of data packet for entering forwarding port, is divided into subqueue wherein the data packet for entering non-default priority is based on packet information；After entering respective queue or subqueue, data packet is sent by rule.The present invention provides a kind of port forwarding strategy for taking into account each priority class traffic, not only ensure that the efficient utilization of network link, but also reduce the packet loss for even avoiding network, and had shortened the time delay and delay variation of data flow.
Description
Technical field
Present invention relates in general to computer fields, and more particularly, to a kind of switch port queues traffic side
Method and device.
Background technique
Influence data stream transmitting time delay and a key factor of delay variation are the queuing mechanisms of interchanger forwarding port.
When the data packet from the multiple ports of interchanger is forwarded via the same port, since the transfer capability of port is limited, once
The speed that data packet reaches port is greater than it in the transmission speed of port, and data packet will start to be lined up on that port.Exchange
The queuing mechanism of machine is the important mechanisms of interchanger reply network flow burst.
The most common queuing mechanism is first in first out mechanism (FIFO), i.e., is ranked up according to the order of arrival of data packet,
As shown in Figure 1, well ensuring the fairness between data flow in this way.But the priority of data flow is different, and is surely belonged to
When before the data packet of low-priority data stream coming the data packet for belonging to high-priority traffic, high priority number will lead to
Increase according to the time delay and delay variation of stream, to reduce the performance of whole network.
If the data flow of different priorities is divided into multiple queues, and priority, the high number of priority are set for queue
Enter high-priority queue according to stream, the low data flow of priority enters Low Priority Queuing.Forward Port Priority scheduling high preferential
Grade queue, forwards the data packet in its queue, when queue is empty could the successively lower queue of dispatching priority, with such
It pushes away, finally dispatches default priority queue, as shown in Figure 2.This scheduling mode is referred to as strict priority mechanism (SP), the machine
System can be to avoid the data packet of the data packet congestion high-priority traffic of low-priority data stream, so as to shorten high priority
The time delay and delay variation of data flow, and priority is higher, time delay is smaller.It can guarantee data flow using strict priority mechanism
It is scheduled according to its priority orders, but if persistently there is data packet queuing in the queue of high priority, will lead to low
The long data packet time in priority query cannot forward, or even can be abandoned by interchanger.
Summary of the invention
In consideration of it, the purpose of the embodiment of the present invention is to solve more reasonably to distribute forwarding in switch port converting flow
The problem of bandwidth, had not only taken into account the forwarding right of various flows, but also guaranteed the flow of high priority in maximum on a priority basis
Guarantee forwarding in limit.
Based on above-mentioned purpose, the one side of the embodiment of the present invention provides a kind of switch port queues traffic method, packet
Include following steps:
Multiple non-default priority queries and the minimum default priority team of a priority are safeguarded on switch port
Column, and multiple subqueues are safeguarded in the non-default priority query, each corresponding token bucket of the subqueue；
It is sent in corresponding priority query according to the priority for the affiliated data flow of data packet for entering forwarding port,
Wherein packet information is based on into the data packet of non-default priority query to be divided into subqueue；
After entering respective queue or subqueue, the data packet is sent by following rule:
The sequence of the forwarding port from high to low according to priority successively handles the queue；
When handling the non-default priority query, data packet is chosen from each subqueue at random and is sent；
When it is sky that subqueue, which is empty or its corresponding token bucket, then the subqueue stops sending data packet；
When all subqueues in non-default priority query all stop sending data packet, the forwarding port transfers to locate
Manage the queue of next priority.
In some embodiments, the rule further include:
During the forwarding port handles Low Priority Queuing, there is data packet that can send in high-priority queue
When, the treatment process of the Low Priority Queuing is interrupted, the data packet in the high-priority queue is preferentially sent.
In some embodiments, the rule further include:
When only all non-default priority queries all stop sending data packet, forwarding port just handles default priority team
Column.
In some embodiments, the rule further include:
During handling the default priority queue, the data packet is sent out according to the sequence of first in first out
It send.
In some embodiments, there is no the difference of priority between the subqueue in same non-default priority query.
In some embodiments, phase is sent to according to the priority for the affiliated data flow of data packet for entering forwarding port
In the priority query answered, wherein the data packet for entering non-default priority query, which is based on packet information, is divided into subqueue
In include:
After the data packet is sent into corresponding priority query, believe further according to the five-tuple of the data packet
Breath is sent in corresponding subqueue.
In some embodiments, the actual bandwidth B of i-th of non-default priority queryiMeet:Wherein, there is n in i-th of non-default priority queryiA subqueue, each subqueue is by institute
The bandwidth for stating token bucket limitation is bij。
In some embodiments, the actual bandwidth B of the default priority queue0Meet:Wherein the bandwidth of the forwarding port is C, the forwarding port
On have non-default priority query described in m item.
In some embodiments, the method also includes: using ECN label replace random packet loss, introduce DCTCP mechanism
To control the transmission window of the forwarding port.
The another aspect of the embodiment of the present invention provides a kind of switch port queues traffic device, comprising:
At least one processor；With
Memory, the memory are stored with the program code that processor can be run, and said program code is by processor
Implement the above method when operation to execute flow forwarding.
The present invention has following advantageous effects: switch port queues traffic method provided in an embodiment of the present invention makes
It is realized with strict priority mechanism cooperation token bucket algorithm to the flow scheduling of data flow, takes into account the port of each priority class traffic
Forwarding strategy carries out bandwidth limitation to certainty flow, that is, non-default priority data flow, guarantees that the bandwidth of data flow does not surpass
Its bandwidth upper limit is crossed, so that the data flow of chain road high priority is all sent in defined bandwidth, avoids high priority
Data flow to the excessive occupancy of link bandwidth；The transmission window of network-based Congestion Level SPCC dynamic adjustment forwarding port simultaneously
Mouthful, the transmission window of forwarding port can be rationally controlled, not only ensure that the efficient utilization of network link, but also reduce and even avoid
The packet loss of network shortens the time delay and delay variation of data flow.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
Other embodiments are obtained according to these attached drawings.
Fig. 1 is in the prior art by the schematic diagram of first in first out mechanism forwarding data packet；
Fig. 2 is in the prior art by the schematic diagram of strict priority mechanism forwarding data packet；
Fig. 3 is a kind of flow chart of switch port queues traffic method according to an embodiment of the present invention；
Fig. 4 is a kind of hardware structural diagram of switch port queues traffic device according to an embodiment of the present invention.
Specific embodiment
The following describe embodiment of the disclosure.It should be appreciated, however, that the disclosed embodiments are only example, and
Other embodiments can take various alternative forms.The drawings are not necessarily drawn to scale；Certain functions may be exaggerated or minimum
Change the details to show particular elements.Therefore, specific structure and function details disclosed herein are not necessarily to be construed as restrictive,
And it is merely possible to for instructing those skilled in the art to use representative basis of the invention in various ways.As this field is general
It is logical the skilled person will understand that, the various features with reference to shown or described by any one attached drawing can with it is one or more other
Feature shown in the drawings is combined to produce the embodiment for not being explicitly illustrated or describing.The group of shown feature is combined into typical case
Provide representative embodiment.However, the various combinations and modification of the feature consistent with the introduction of the disclosure are for certain spies
Fixed application or embodiment may be desired.
To make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with specific embodiment, and reference
The embodiment of the present invention is further described in attached drawing.
Bandwidth limitation is carried out to certainty flow, that is, non-default priority data flow, guarantee that the bandwidth of data flow does not surpass
Its bandwidth upper limit is crossed, so that the data flow of chain road high priority is all sent in defined bandwidth, avoids high priority
Data flow to the excessive occupancy of link bandwidth.May be there are many data flow in the same priority, each data flow is corresponding
Business is different, if only carrying out speed limit to queue, still remains row between multiple data flows of same priority
Team and the phenomenon that influencing each other, therefore, this method classifies to data stream in the five-tuple of data flow, is directed to each respectively
Data flow carries out speed limit.
Speed limit, that is, traffic shaping is smoothly to forward the data packet of port, and guarantee that its transmission speed is no more than specified speed
Degree.Token bucket algorithm is one of most common algorithm in traffic shaping.Token bucket size is constant, and generates order with constant rate
Board, each data packet could be sent after being only assigned to token, and token is consumed after data packet is sent.If token disappears
Consumption speed is greater than its and generates speed, and after continuing for some time, token bucket is sky, then after data packet needs to wait in line token generation
It retransmits., whereas if the generation speed of token is greater than its depletion rate, then token constantly accumulates in token bucket, until token
Bucket is full.At this point, available tokens sum is not further added by even if token persistently generates.
Then, the first aspect of the embodiment of the present invention provides a kind of switch port queues traffic method, such as Fig. 3 institute
Show, comprising the following steps:
Step 301: multiple non-default priority queries and the minimum default of a priority are safeguarded on switch port
Priority query, and multiple subqueues are safeguarded in the non-default priority query, each subqueue is one corresponding
Token bucket；
Step 302: being sent to according to the priority for the affiliated data flow of data packet for entering forwarding port corresponding preferential
In grade queue, it is divided into subqueue wherein the data packet for entering non-default priority query is based on packet information；
Step 303: after entering respective queue or subqueue, the data packet is sent by rule, wherein the rule
Then include:
The sequence of forwarding port from high to low according to priority successively handles the queue；
When handling non-default priority query, data packet is chosen from each subqueue at random and is sent；
When it is sky that the subqueue, which is empty or its corresponding token bucket, then the subqueue stops sending data packet；
When all subqueues in non-default priority query all stop sending data packet, forwarding port is transferred under processing
The queue of one priority.
This method realizes the flow scheduling to data flow using strict priority mechanism cooperation token bucket algorithm.In interchanger
Multiple priority queries to be safeguarded on port, and multiple subqueues are safeguarded in each queue, these subqueues are divided based on five-tuple,
There is no the difference of priority, the corresponding token bucket of each subqueue.And the corresponding queue of default priority is more special, it is excellent
First grade is minimum therefore speed limit processing is not done to it, therefore thereon without subqueue.In one embodiment, turn when a data packet enters
It starts after mouth, two stages can be undergone: joining the team stage and team's stage out.The treatment process in two stages is introduced separately below.
(1) it joins the team the stage
It forwards port according to the priority of the affiliated data flow of data packet, data packet is sent into the queue of respective priority；
Further according to the five-tuple information of data packet, it is sent in different subqueues.If it is the data of default priority data flow
Packet, then be directly sent in default priority queue, no longer progress subqueue division.
(2) go out team's stage
Forward all priority queries of port polling, the queue of first processing highest priority, at random from each subqueue
Middle selection data packet is sent.If a subqueue is empty or its correspondence token bucket is sky, which stops hair
Data packet is sent, if all subqueues all stop sending data packet, port is forwarded to continue with the queue of next priority.
In some embodiments, the rule further include: only all non-default priority queries all stop sending data
Bao Shi, forwarding port just handle default priority queue.According to some embodiments, in the process of processing default priority queue
In, data packet is sent according to the sequence of first in first out.In some embodiments, the rule further include: if processing is low preferential
During grade queue, there is data packet that can send in high-priority queue, then the processing of interrupts low-priority queue, it is preferential to turn
Send out the data packet in high-priority queue.That is the queue that queue can be lower than its priority with preempting priority, can also be preferential
The grade queue higher than its priority is seized.But since subqueue has bandwidth limitation, priority query equally has band to extend the deadline
System.
In some embodiments, if the bandwidth (forwarding speed) of forwarding port is C, it is a non-default preferential that m is shared on port
A grade queue and default priority queue has n in i-th of queueiA subqueue, the bandwidth of each subqueue token bucket limitation
For bij, wherein i ∈ { 1,2 ..., m }, j ∈ { 1,2 ..., ni}.Since the corresponding all data flows of certainty flow are not to appoint
When carve and be all present in network, is not take up bandwidth, therefore the practical band of i-th of queue if data flow is not present
Wide BiMeet formula (1-1):.
Correspondingly, the actual bandwidth B of default priority queue0Meet formula (1-2):
Therefore, non-determined if the sum of the transmission speed (bandwidth) of all subqueues limitation is less than the total bandwidth of port
The bandwidth of property flow, that is, default priority data flow is not 0, therefore uncertainty flow can centainly may be used within the unit time
To be dispatched；And the size of the actual bandwidth of uncertainty flow then depends on the shape of certainty flow in current time network
State, if the corresponding data flow of certain subqueues is not present in network at current time, this corresponding portion of the subqueue
Point bandwidth can be borrowed by uncertainty flow, to avoid the waste of bandwidth.
Due to the Retransmission timeout mechanism of TCP, the packet loss in network is the time delay of data flow and a weight of delay variation
Want influence factor.If can reduce in the transmission speed of the reasonable control data bag of transmitting terminal and even avoid data packet in a network
Packet loss, then can be substantially reduced the time delay and delay variation of data flow.Therefore, in some embodiments, this method uses ECN
Label replaces random packet loss, introduces DCTCP mechanism to control the transmission window at forwarding end end.
For each queue on the forwarding port of interchanger, when its queue length is less than K, then it is assumed that network is not gathered around
Plug, interchanger do not carry out ECN label to the data packet in queue；Conversely, when its queue length is greater than K, then it is assumed that network hair
Raw congestion, interchanger carry out ECN label to the data packet in queue.It should be noted that label here is to institute in queue
Some data packets are marked, rather than only the data packet for being more than queue length is marked.
In the value α of port maintenance one mark network congestion condition of forwarding, 0 < α < 1 represents network congestion when α is close to 0
Degree is extremely low, and when α is close to 1, it is very high to represent network congestion degree.It is every to pass through a round-trip delay (RTT) to α according to formula
(1-3) is updated.
In α=(1- ω) × α+ω × F (1-3) formula, F is the data packet being labeled in current window and total transmission data packet
Ratio, ω is the coefficient of smoothing processing, is represented to the weight of upper primary α during each iteration, general value is
1/16。
Forward the transmission window cwnd of port as the change of α is updated according to formula (1-4).
When α is close to 0, the slight congestion of network, the value for sending window is slight decrease, and transmission speed slightly reduces.Work as α
When close to 1, network heavy congestion sends window and halves, and processing mode is consistent with the processing mode after traditional network generation packet loss.
The transmission window of network-based Congestion Level SPCC dynamic adjustment forwarding port, can rationally control the hair of forwarding port
Send window, not only ensure that the efficient utilization of network link, but also reduce the packet loss for even avoiding network, shorten data flow when
Prolong and delay variation.
Technically in feasible situation, it can be combined with each other above in relation to technical characteristic cited by different embodiments,
Or change, add and omit etc., to form the additional embodiment in the scope of the invention.
From above-described embodiment as can be seen that switch port queues traffic method provided in an embodiment of the present invention uses strictly
Priority mechanism cooperates token bucket algorithm to realize the flow scheduling to data flow, takes into account the port forwarding plan of each priority class traffic
Slightly, bandwidth limitation is carried out to certainty flow, that is, non-default priority data flow, guarantees that the bandwidth of data flow is no more than its band
The wide upper limit avoids the data of high priority so that the data flow of chain road high priority is all sent in defined bandwidth
Flow the excessive occupancy to link bandwidth；The transmission window of network-based Congestion Level SPCC dynamic adjustment forwarding port simultaneously, can be with
The transmission window of rationally control forwarding port, not only ensure that the efficient utilization of network link, but also reduce and even avoid network
Packet loss shortens the time delay and delay variation of data flow.
Based on above-mentioned purpose, the second aspect of the embodiment of the present invention proposes a kind of switch port queues traffic dress
The one embodiment set.
The switch port queues traffic device includes at least one processor and memory, and memory is stored with can be
The computer program run on processor, processor execute any one of the above method when executing program.
As shown in figure 4, the hardware configuration of one embodiment for switch port queues traffic device provided by the invention
Schematic diagram.
It in the apparatus include processor 401 and memory 402, and can also include: input dress by taking such as Fig. 4 as an example
Set 403 and output device 404.
Processor 401, memory 402, input unit 403 and output device 404 can pass through bus or other modes
It connects, in Fig. 4 for being connected by bus.
Memory 402 is used as a kind of non-volatile computer readable storage medium storing program for executing, can be used for storing non-volatile software journey
Sequence, non-volatile computer executable program and module, such as the switch port queues traffic in the embodiment of the present application
Corresponding program instruction/the module of method.Processor 401 by operation be stored in memory 402 non-volatile software program,
Instruction and module realize above method embodiment thereby executing the various function application and data processing of server
Switch port queues traffic method.
Memory 402 may include storing program area and storage data area, wherein storing program area can store operation system
Application program required for system, at least one function；Storage data area can be stored according to switch port queues traffic device
Use created data etc..In addition, memory 402 may include high-speed random access memory, it can also include non-volatile
Property memory, a for example, at least disk memory, flush memory device or other non-volatile solid state memory parts.Some
In embodiment, it includes the memory remotely located relative to processor 401 that memory 402 is optional, these remote memories can be with
Pass through network connection to local module.The example of above-mentioned network includes but is not limited to internet, intranet, local area network, shifting
Dynamic communication network and combinations thereof.
Input unit 403 can receive the number or character information of input, and generates and fill with switch port queues traffic
The related key signals input of the user setting and function control set.Output device 404 may include that display screen etc. shows equipment.
Corresponding program instruction/the module of one or more of switch port queues traffic methods is stored in described deposit
In reservoir 402, when being executed by the processor 401, the switch port flow row in above-mentioned any means embodiment is executed
Team's method.
Described any one embodiment for executing the switch port queues traffic device, can achieve corresponding
The identical or similar effect of aforementioned any means embodiment.
Finally, it should be noted that those of ordinary skill in the art will appreciate that realizing the whole in above-described embodiment method
Or part process, related hardware can be instructed to complete by computer program, the program can be stored in computer can
It reads in storage medium, the program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein, described to deposit
Storage media can be magnetic disk, CD, read-only memory (ROM) or random access memory (RAM) etc..
In addition, typically, it can be various electric terminal equipments, example that the embodiment of the present invention, which discloses described device, equipment etc.,
Such as mobile phone, personal digital assistant (PDA), tablet computer (PAD), smart television, are also possible to large-scale terminal device, such as service
Device etc., therefore protection scope disclosed by the embodiments of the present invention should not limit as certain certain types of device, equipment.The present invention is real
Apply example disclose the client can be applied to the combining form of electronic hardware, computer software or both it is above-mentioned any
In a kind of electric terminal equipment.
In addition, disclosed method is also implemented as the computer program executed by CPU according to embodiments of the present invention, it should
Computer program may be stored in a computer readable storage medium.When the computer program is executed by CPU, the present invention is executed
The above-mentioned function of being limited in method disclosed in embodiment.
In addition, above method step and system unit also can use controller and for storing so that controller is real
The computer readable storage medium of the computer program of existing above-mentioned steps or Elementary Function is realized.
In addition, it should be appreciated that computer readable storage medium (for example, memory) as described herein can be it is volatile
Property memory or nonvolatile memory, or may include both volatile memory and nonvolatile memory.As example
And not restrictive, nonvolatile memory may include read-only memory (ROM), programming ROM (PROM), electrically programmable to son
ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory.Volatile memory may include arbitrary access
Memory (RAM), the RAM can serve as external cache.As an example and not restrictive, RAM can be with more
Kind form obtains, such as synchronous random access memory (DRAM), dynamic ram (DRAM), synchronous dram (SDRAM), double data rate SDRAM
(DDR SDRAM), enhancing SDRAM (ESDRAM), synchronization link DRAM (SLDRAM) and directly Rambus RAM (DRRAM).
The storage equipment of disclosed aspect is intended to the memory of including but not limited to these and other suitable type.
Those skilled in the art will also understand is that, various illustrative logical blocks, mould in conjunction with described in disclosure herein
Block, circuit and algorithm steps may be implemented as the combination of electronic hardware, computer software or both.It is hard in order to clearly demonstrate
This interchangeability of part and software, with regard to various exemplary components, square, module, circuit and step function to its into
General description is gone.This function is implemented as software and is also implemented as hardware depending on concrete application and application
To the design constraint of whole system.Those skilled in the art can realize described in various ways for every kind of concrete application
Function, but this realization decision should not be interpreted as causing a departure from range disclosed by the embodiments of the present invention.
Various illustrative logical blocks, module and circuit, which can use, in conjunction with described in disclosure herein is designed to
The following component of function described here is executed to realize or execute: general processor, digital signal processor (DSP), dedicated collection
At circuit (ASIC), field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, divide
Any combination of vertical hardware component or these components.General processor can be microprocessor, but alternatively, processing
Device can be any conventional processors, controller, microcontroller or state machine.Processor also may be implemented as calculating equipment
Combination, for example, the combination of DSP and microprocessor, multi-microprocessor, one or more microprocessors combination DSP and/or any
Other this configurations.
The step of method in conjunction with described in disclosure herein or algorithm, can be directly contained in hardware, be held by processor
In capable software module or in combination of the two.Software module may reside within RAM memory, flash memory, ROM storage
Device, eprom memory, eeprom memory, register, hard disk, removable disk, CD-ROM or known in the art it is any its
In the storage medium of its form.Illustrative storage medium is coupled to processor, enables a processor to from the storage medium
Information is written to the storage medium in middle reading information.In an alternative, the storage medium can be with processor collection
At together.Pocessor and storage media may reside in ASIC.ASIC may reside in user terminal.It is replaced at one
In scheme, it is resident in the user terminal that pocessor and storage media can be used as discrete assembly.
In one or more exemplary designs, the function can be real in hardware, software, firmware or any combination thereof
It is existing.If realized in software, can be stored in using the function as one or more instruction or code computer-readable
It is transmitted on medium or by computer-readable medium.Computer-readable medium includes computer storage media and communication media,
The communication media includes any medium for helping for computer program to be transmitted to another position from a position.Storage medium
It can be any usable medium that can be accessed by a general purpose or special purpose computer.As an example and not restrictive, the computer
Readable medium may include RAM, ROM, EEPROM, CD-ROM or other optical disc memory apparatus, disk storage equipment or other magnetic
Property storage equipment, or can be used for carry or storage form be instruct or data structure required program code and can
Any other medium accessed by general or specialized computer or general or specialized processor.In addition, any connection is ok
It is properly termed as computer-readable medium.For example, if using coaxial cable, optical fiber cable, twisted pair, digital subscriber line
(DSL) or such as wireless technology of infrared ray, radio and microwave to send software from website, server or other remote sources,
Then above-mentioned coaxial cable, optical fiber cable, twisted pair, DSL or such as wireless technology of infrared ray, radio and microwave are included in
The definition of medium.As used herein, disk and CD include compact disk (CD), laser disk, CD, digital versatile disc
(DVD), floppy disk, Blu-ray disc, wherein disk usually magnetically reproduce data, and CD using laser optics reproduce data.On
The combination for stating content should also be as being included in the range of computer-readable medium.
It is exemplary embodiment disclosed by the invention above, it should be noted that in the sheet limited without departing substantially from claim
Under the premise of inventive embodiments scope of disclosure, it may be many modifications and modify.According to open embodiment described herein
The function of claim to a method, step and/or movement be not required to the execution of any particular order.In addition, although the present invention is implemented
Element disclosed in example can be described or be required in the form of individual, but be unless explicitly limited odd number, it is understood that be multiple.
It should be understood that it is used in the present context, unless the context clearly supports exceptions, singular " one
It is a " it is intended to also include plural form.It is to be further understood that "and/or" used herein refers to including one or one
Any and all possible combinations of a above project listed in association.
It is for illustration only that the embodiments of the present invention disclose embodiment sequence number, does not represent the advantages or disadvantages of the embodiments.
Those of ordinary skill in the art will appreciate that realizing that all or part of the steps of above-described embodiment can pass through hardware
It completes, relevant hardware can also be instructed to complete by program, the program can store in a kind of computer-readable
In storage medium, storage medium mentioned above can be read-only memory, disk or CD etc..
Above-mentioned " preferably " embodiment is the possibility example of embodiment, and just to be clearly understood that the principle of the present invention
And it proposes.It should be understood by those ordinary skilled in the art that: the discussion of any of the above embodiment is exemplary only, not purport
These examples are limited in hint range (including claim) disclosed by the embodiments of the present invention；In the thinking of the embodiment of the present invention
Under, it can also be combined between the technical characteristic in above embodiments or different embodiments, and exist as described above originally
Many other variations of the different aspect of inventive embodiments, for simplicity, they are not provided in details.Therefore, all in this hair
Within the spirit and principle of bright embodiment, any omission, modification, equivalent replacement, improvement for being made etc. should be included in the present invention
Within the protection scope of embodiment.
Claims (10)
1. a kind of switch port queues traffic method, which comprises the following steps:
Multiple non-default priority queries and the minimum default priority queue of a priority are safeguarded on switch port, and
And multiple subqueues are safeguarded in the non-default priority query, each corresponding token bucket of the subqueue；
The data packet is sent into corresponding priority team according to the priority for the affiliated data flow of data packet for entering forwarding port
In column, it is divided into subqueue wherein the data packet for entering the non-default priority query is based on packet information；
After entering respective queue or subqueue, the data packet is sent by following rule:
The sequence of the forwarding port from high to low according to priority successively handles the queue；
When handling the non-default priority query, data packet is chosen from each subqueue at random and is sent；
When it is sky that subqueue, which is empty or its corresponding token bucket, then the subqueue stops sending data packet；
When all subqueues in the non-default priority query all stop sending data packet, the forwarding port transfers to locate
Manage the queue of next priority.
2. the method according to claim 1, wherein the rule further include:
During the forwarding port handles Low Priority Queuing, when having data packet that can send in high-priority queue, in
Break the treatment process of the Low Priority Queuing, preferentially sends the data packet in the high-priority queue.
3. the method according to claim 1, wherein the rule further include:
When only all non-default priority queries all stop sending data packet, the forwarding port just handles the default priority
Grade queue.
4. according to the method described in claim 3, it is characterized in that, the rule further include:
During handling the default priority queue, the data packet is sent according to the sequence of first in first out.
5. the method according to claim 1, wherein the subqueue in same non-default priority query it
Between not no priority difference.
6. according to the method described in claim 5, it is characterized in that, according to the affiliated data flow of data packet for entering forwarding port
The data packet is sent into corresponding priority query by priority, wherein entering the data packet of the non-default priority query
It is divided into subqueue based on packet information and includes:
It, will further according to the five-tuple information of the data packet after data packet is sent into corresponding priority query
It is sent into corresponding subqueue.
7. the method according to claim 1, wherein the actual bandwidth B of i-th of non-default priority queryi
Meet:Wherein, there is n in i-th of non-default priority queryiA subqueue, each sub- team
Column are b by the bandwidth that the token bucket limitsij。
8. according to the method described in claim 6, it is characterized in that, the actual bandwidth B of the default priority queue0Meet:Wherein the bandwidth of the forwarding port is C, the forwarding port
On have non-default priority query described in m item.
9. the method according to claim 1, wherein the method also includes: using ECN label replace lose at random
Packet introduces DCTCP mechanism to control the transmission window of the forwarding port.
10. a kind of switch port queues traffic device characterized by comprising
At least one processor；With
Memory, the memory are stored with the program code that processor can be run, and said program code is run by processor
When implement method as claimed in any one of claims 1-9 wherein execute flow forwarding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811293243.3A CN109246031A (en) | 2018-11-01 | 2018-11-01 | A kind of switch port queues traffic method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811293243.3A CN109246031A (en) | 2018-11-01 | 2018-11-01 | A kind of switch port queues traffic method and apparatus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109246031A true CN109246031A (en) | 2019-01-18 |
Family
ID=65080021
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811293243.3A Withdrawn CN109246031A (en) | 2018-11-01 | 2018-11-01 | A kind of switch port queues traffic method and apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109246031A (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111858011A (en) * | 2020-07-31 | 2020-10-30 | 深圳大普微电子科技有限公司 | Multi-data-stream task processing method, device, equipment and storage medium |
| CN112671832A (en) * | 2020-12-03 | 2021-04-16 | 中国科学院计算技术研究所 | Forwarding task scheduling method and system for guaranteeing hierarchical time delay in virtual switch |
| CN112953848A (en) * | 2021-03-12 | 2021-06-11 | 西安电子科技大学 | Strict priority based traffic supervision method, system and equipment |
| CN113543209A (en) * | 2021-06-24 | 2021-10-22 | 北京邮电大学 | Token scheduling-based congestion control method and device |
| CN113630339A (en) * | 2021-08-04 | 2021-11-09 | 安超云软件有限公司 | Flow forwarding method and device, electronic equipment and storage medium |
| CN113726682A (en) * | 2021-08-30 | 2021-11-30 | 北京天空卫士网络安全技术有限公司 | Data transmission method and device based on speed limit strategy |
| CN114531399A (en) * | 2020-11-05 | 2022-05-24 | 中移(苏州)软件技术有限公司 | Memory blocking balance method and device, electronic equipment and storage medium |
| CN114567679A (en) * | 2022-03-25 | 2022-05-31 | 阿里巴巴（中国）有限公司 | Data transmission method and device |
| CN114679421A (en) * | 2022-04-19 | 2022-06-28 | 深圳市吉祥腾达科技有限公司 | Queue scheduling method and system based on user data flow priority |
| CN114900476A (en) * | 2022-05-09 | 2022-08-12 | 中国联合网络通信集团有限公司 | Data transmission method, device, network equipment and storage medium |
| CN114928614A (en) * | 2022-05-16 | 2022-08-19 | 济南大学 | Deterministic network load balancing method and system based on SDN |
| CN115955447A (en) * | 2023-03-13 | 2023-04-11 | 微网优联科技(成都)有限公司 | Data transmission method, switch and switch system |
| CN116319598A (en) * | 2023-05-19 | 2023-06-23 | 工业富联(佛山)产业示范基地有限公司 | Mechanical arm control method, time-sensitive switch and storage medium |
-
2018
- 2018-11-01 CN CN201811293243.3A patent/CN109246031A/en not_active Withdrawn
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111858011A (en) * | 2020-07-31 | 2020-10-30 | 深圳大普微电子科技有限公司 | Multi-data-stream task processing method, device, equipment and storage medium |
| CN114531399B (en) * | 2020-11-05 | 2023-09-19 | 中移(苏州)软件技术有限公司 | Memory blocking balancing method and device, electronic equipment and storage medium |
| CN114531399A (en) * | 2020-11-05 | 2022-05-24 | 中移(苏州)软件技术有限公司 | Memory blocking balance method and device, electronic equipment and storage medium |
| CN112671832A (en) * | 2020-12-03 | 2021-04-16 | 中国科学院计算技术研究所 | Forwarding task scheduling method and system for guaranteeing hierarchical time delay in virtual switch |
| CN112953848A (en) * | 2021-03-12 | 2021-06-11 | 西安电子科技大学 | Strict priority based traffic supervision method, system and equipment |
| CN113543209A (en) * | 2021-06-24 | 2021-10-22 | 北京邮电大学 | Token scheduling-based congestion control method and device |
| CN113543209B (en) * | 2021-06-24 | 2022-05-06 | 北京邮电大学 | Token scheduling-based congestion control method and device |
| CN113630339A (en) * | 2021-08-04 | 2021-11-09 | 安超云软件有限公司 | Flow forwarding method and device, electronic equipment and storage medium |
| CN113726682A (en) * | 2021-08-30 | 2021-11-30 | 北京天空卫士网络安全技术有限公司 | Data transmission method and device based on speed limit strategy |
| CN113726682B (en) * | 2021-08-30 | 2024-05-31 | 北京天空卫士网络安全技术有限公司 | Data transmission method and device based on speed limiting strategy |
| CN114567679A (en) * | 2022-03-25 | 2022-05-31 | 阿里巴巴（中国）有限公司 | Data transmission method and device |
| CN114567679B (en) * | 2022-03-25 | 2024-04-02 | 阿里巴巴（中国）有限公司 | Data transmission method and device |
| CN114679421A (en) * | 2022-04-19 | 2022-06-28 | 深圳市吉祥腾达科技有限公司 | Queue scheduling method and system based on user data flow priority |
| CN114900476A (en) * | 2022-05-09 | 2022-08-12 | 中国联合网络通信集团有限公司 | Data transmission method, device, network equipment and storage medium |
| CN114928614A (en) * | 2022-05-16 | 2022-08-19 | 济南大学 | Deterministic network load balancing method and system based on SDN |
| CN115955447A (en) * | 2023-03-13 | 2023-04-11 | 微网优联科技(成都)有限公司 | Data transmission method, switch and switch system |
| CN116319598A (en) * | 2023-05-19 | 2023-06-23 | 工业富联(佛山)产业示范基地有限公司 | Mechanical arm control method, time-sensitive switch and storage medium |
| CN116319598B (en) * | 2023-05-19 | 2023-11-07 | 工业富联(佛山)产业示范基地有限公司 | Time-sensitive mechanical arm control method, switch and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109246031A (en) | A kind of switch port queues traffic method and apparatus | |
| US20210243247A1 (en) | Service mesh offload to network devices | |
| CN101584164B (en) | Closed-loop clock synchronization | |
| US8462628B2 (en) | Method of improving over protocol-required scheduling tables while maintaining same | |
| CN103632209B (en) | A kind of intelligent adapted electric industry business data transfer bandwidth Forecasting Methodology based on queueing theory | |
| CN106817317A (en) | Traffic management with in-let dimple | |
| TW201347487A (en) | System and method for scheduling packet transmission on a client device | |
| CN103348641A (en) | Method and system for improved multi-cell support on single modem board | |
| CN114301851B (en) | Industrial field-oriented time-sensitive network flow hierarchical scheduling method | |
| CN103731409B (en) | The distributed measurement device of embedded type automobile acquisition equipment for accelerating with TCP | |
| CN102387076B (en) | Shaping-combined hierarchical queue scheduling method | |
| RU2643666C2 (en) | Method and device to control virtual output queue authorization and also computer storage media | |
| CN113783793B (en) | Traffic scheduling method for time-sensitive data frames and related equipment | |
| CN112600684A (en) | Bandwidth management and configuration method of cloud service and related device | |
| CN113904991A (en) | Traffic shaping method, device and system | |
| CN108702336A (en) | Dynamic optimization queue in data routing | |
| JPWO2010032533A1 (en) | Network protocol processing system and network protocol processing method | |
| CN114172975B (en) | Industrial heterogeneous network protocol deterministic conversion method and device | |
| CN113765825B (en) | Planning method and system architecture for chained service flow scheduling | |
| US20190288954A1 (en) | Methods and systems for data transmission | |
| CN100477630C (en) | Queue dispatching method and apparatus in data network | |
| Antequera et al. | ADON: Application-driven overlay network-as-a-service for data-intensive science | |
| CN102611924A (en) | Flow control method and system of video cloud platform | |
| Nie et al. | Hybrid traffic scheduling in time‐sensitive networking for the support of automotive applications | |
| US6996107B2 (en) | Packet shaping on a fixed segment scheduler |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20190118 |
|
| WW01 | Invention patent application withdrawn after publication |