CN102355422A - Multicore, parallel and lock-free quality of service (QOS) flow control method - Google Patents
Multicore, parallel and lock-free quality of service (QOS) flow control method Download PDFInfo
- Publication number
- CN102355422A CN102355422A CN2011103154582A CN201110315458A CN102355422A CN 102355422 A CN102355422 A CN 102355422A CN 2011103154582 A CN2011103154582 A CN 2011103154582A CN 201110315458 A CN201110315458 A CN 201110315458A CN 102355422 A CN102355422 A CN 102355422A
- Authority
- CN
- China
- Prior art keywords
- packet
- shared
- dynamic channel
- passage
- pipe
- 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.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a multicore, parallel and lock-free quality of service (QOS) flow control method. The method comprises the following steps of: S1, receiving a data packet; S2, identifying the data packet; and S3, processing the data packet by a dispatcher of a QOS flow control system. Compared with the prior art, the method has the advantage that: the flexible, efficient and reliable bandwidth control capacity based on division of a business application priority and a multistage and multilevel bandwidth channel can be realized.
Description
Technical field
The present invention relates to a kind of multi-core parallel concurrent does not have the QOS flow control methods of lock, relates in particular to a kind of QOS flow control new method and system that on the multi-CPU system platform, realizes each CPU parallel computation operation efficiently, do not have lock.
Background technology
Along with going deep into and Internet fast development of informationization technology, All Around The World promptly combines together, and computer network has become the economic base and the lifeblood of country.Numerous enterprises, tissue and government department be all at the network of setting up and develop oneself, and be connected on the Internet, with information and the resource of fully sharing, utilize network.Be accompanied by broad application of Internet, networking has become weighs a unit informationization, modern important symbol.In recent years, the networking development was advanced by leaps and bounds, and constituent parts all drops into substantial contribution and built up in-house network and the Internet.Because lack effective network traffics analysis and management control device, networks development is faced with problems and challenge, has caused a series of safety, efficient and legal issue thus.Performance bottleneck unpredictable, burst can influence the operational paradigm of key application.At present in most tissues; Number of users is huge, network application environment is complicated; Various P2P and Online Video are used and have been taken a large amount of network bandwidths (like FLV, BitTorrent; Kazza; Emule etc.), the thing followed is, and is also serious day by day by the application performance decline problem of the congested initiation of network link; Greatly influenced and organized carrying out and service quality that user's proper network is used of regular traffic, network bandwidth resources is pernicious, and to take phenomenon serious.In addition, network key operation professional and that use can not get ensureing.So-called key application is meant with user's production and operation, information security, the closely bound up disparate networks of key user and uses, comprises ERP, database, middleware, ecommerce, video conference etc.
All lack effective network management strategy in the most tissues at present; Core business being used the application such as application (VOIP, video conference), instant messaging, P2P, Online Video, online game of (like ERP, database, OA, mail etc.), delay sensitive makes no exception; The use of network is not to arrange according to the priority of service application and significance level, finally cause network bandwidth resources by seized comparison severe use the use of having no to control such as online game, P2P, Online Video.
Because the use of softwares such as P2P, online game, Online Video has taken the bandwidth resources of network at least 50%; And still having no to quicken temperately engulfing valuable bandwidth resources; Not only reduced the productivity ratio of enterprise; Bring network congestion etc. to have a strong impact on the thorny problem that network uses; With having a strong impact on the normal operation and the use of key application in the tissue, finally can cause direct economic loss.
In the China Internet develop rapidly, P2P and Online Video are used also to popularize rapidly and are come, and have also caused many troubles simultaneously.According to authoritative department statistics, current P2P and Online Video flow have accounted for the about 70% of whole internet traffic, and with the speed increment in every year 350%.In network, P2P and Online Video traffic consumes the huge network bandwidth, improved the network operation cost, network infrastructure can't bear the heavy load.
Exploding of P2P and Online Video flow can effectively be controlled through the fluidic device that is deployed on the network.But therefore the network experience of normal network users but can not get ensureing, causes user experience sharply to descend.
Summary of the invention
In order to address the above problem, the invention provides the QOS flow control methods that a kind of multi-core parallel concurrent does not have lock.
Correspondingly, a kind of multi-core parallel concurrent of the present invention QOS flow control methods of not having a lock may further comprise the steps:
A kind of multi-core parallel concurrent does not have the method for the QOS flow control of lock, may further comprise the steps:
S1, reception packet;
S2, discern said packet;
S3, the said packet of scheduler handle through the QoS flow control system.
As further improvement of the present invention, said S2 step comprises: through DPI&DFI said packet is discerned, and stamp corresponding VC with its from user's ID label.
As further improvement of the present invention, said scheduler handle comprises queuing process and goes out group process, and wherein, said queuing process is with join the team buffer memory or abandon of the packet of receiving; Saidly go out group process and be responsible for finding out the packet that can send of buffer memory in the system and give Rmon&Rmon2 resume module, till all cached data packet are all sent or can not find the packet that meets the speed limit condition.
As further improvement of the present invention, said queuing process specifically may further comprise the steps:
S10, according to User ID that is identified on the said packet and VC ID, seek down the dynamic channel under the respective user to corresponding VC passage;
If S20 can not find, then create this passage, and check whether this VC passage exists Shared VC;
If S30 exists, confirm then whether father's dynamic channel of sub-dynamic channel corresponding under the Shared VC exists;
Do not exist if S40 crosses, then need create corresponding father's dynamic channel under the Shared VC;
If S50 exists, then increase the reference count of his father's dynamic channel; Confirm and create each father's dynamic channel of correspondence under Pipe and the Shared Pipe simultaneously; Thereby form a tunnel speed limit chain to each user; Corresponding with the static speed limit chain of the VC/Shared VC/Pipe/Shared Pipe that has existed; Collaborative work, and static and dynamic passage is linked to be a unidirectional chained list from bottom to top through the pointer that subchannel points to parent channel;
S60, the sub-dynamic channel under the VC of the bottom begin, and check its token step by step;
If S70 is a negative, then carry out the filling of token according to single speed/2-rate 3-color token bucket algorithm, still be assignment if fill the token value of having only, this packet that then will receive is done discard processing, and queuing process finishes;
If the inspection of the token of the dynamic channel on all dynamic speed limit chain of S80 is all passed through; Then said packet is put into buffer queue and lines up, wait to be sent, and according to this length of data package; Deduct the corresponding token value of each dynamic channel step by step, queuing process finishes.
As further improvement of the present invention, saidly go out group process and comprise:
Is the quantity of S100, the current whole QoS flow control system cached data packet of inspection 1?
S101 is if get into fast path: from the queuing process of QoS scheduler, go out group packet under the VC passage;
If S102 can successfully go out packet of team, then group process that goes out of QoS scheduler finishes at this point;
If S103 cannot successfully go out packet of team, then get into slow-path,
Wherein, In said slow-path; What adopt is the mechanism that top-down poll is searched; The order that goes out team's traversal is to begin from the most top Shared Pipe passage; Travel through each subordinate's subchannel successively; The all passages that in system, exist all travel through one time or can success below certain VC go out team's to a packet, then finish this time to go out group process.
With respect to prior art, advantage of the present invention is: can realize flexible, efficient, reliable bandwidth control ability based on the division of service application priority, multistage multi-level bandwidth channel.
[description of drawings]
Fig. 1 is the flow chart that an embodiment of the present invention multi-core parallel concurrent does not have the QOS flow control methods of lock;
Fig. 2 is the flow chart of an embodiment of the present invention scheduler queuing process;
Fig. 3 goes out the flow chart of group process for the scheduler of an embodiment of the present invention.
[embodiment]
In order to make the object of the invention, technical scheme and advantage clearer, describe the present invention below in conjunction with accompanying drawing and specific embodiment.
Multi-core parallel concurrent does not have the QOS flow control system of lock in an embodiment of the present invention; Through DPI is the deep packet inspection technical of core and the deep stream behavior detection technique that DFI is core; Can be accurate to detection and control to the packet of each session; Combine the PFQ technology simultaneously; The double-colored token bucket algorithm of three speed; Self-defined Pipe passage is provided; Self-defined VC (Virtual Channel) passage; The assurance bandwidth is provided with; Maximum bandwidth limit; Bandwidth is leased; The control of Per-IP bandwidth; The control of Per-User bandwidth; Shared bandwidth control; Weight is provided with and uses a series of optimizing application and Bandwidth Management controlled function such as priority, supports Inbound and two-way Bandwidth Management and the control of Outbound.
Wherein, According to the size of self outlet bandwidth and the operating position of flow; The user is the bandwidth channel of defining virtual voluntarily; Can be like the user based on the situation of own service application; Define different Pipe and VC bandwidth channel; And the agreement or the service application of different priorities joined in the different VC passages, reach multi-level bandwidth channel management; Through based on application priority management function priority, multichannel, thereby guarantee in the environment that the various bandwidth of tissue are used, can both realize the effective utilization and the control of bandwidth.
Article one, virtual link can have independently VC configuration.VC is closely related with the application type of network packet, and one or several similar network application types can be divided into a VC, and VC is the node type of the bottom in the system.
Pipe is the set that is defined in some VC on the VC, is the notion of introducing in order to embody three-dimensional flow control, hopes demand that certain several type of service is controlled and retrained simultaneously to satisfy the user.A VC can only belong to a definite Pipe.
Shared VC be defined under the Pipe, the set of some VC on the VC.Be the notion of introducing for the flow control that embodies intersection, to satisfy the demand that competition that the user hopes to carry out between certain several type of service bandwidth resources is used.A Shared VC also can only belong to a definite Pipe.
Shared Pipe is the set that is defined in the Pipe of the some on the Pipe.It is notion in order to embody higher level solid, cross-current control characteristic and to introduce.Shared Pipe is the most top Control Node.
Wherein, Vc, Pipe, Shared Vc, Shared Pipe are referred to as " node ", and the nodal community of node comprises:
NONE: be also referred to as the Normal attribute, the bandwidth control that has the node of this attribute is overall, is regardless of the user or the IP address is controlled separately; Total be exactly and the bandwidth of this node setting flow through this node all flows bandwidth, that is: all users under this node share this total bandwidth.
PER-HOST/PER-USER: the bandwidth control that has the node of this attribute is not overall, but divides IP, divides the user, promptly each IP or user is controlled separately.And this node need be provided with the maximum bandwidth of node, and each IP of this node of flowing through bandwidth that perhaps each user enjoyed.Like this node bandwidth maximum bandwidth is 100Mbps, and PER-HOST is configured to 1Mbps, so, is under the prerequisite of 100Mbps in this node total bandwidth, and each main frame can have the bandwidth of 1Mbps.
Weight: have only to join that the node type as child node just has this attribute below the Shared type node.Therefore in 4 kinds of node types, have only two kinds of nodes of Pipe and Vc to have this attribute, and the node of only likeing father, like son is when being the node of Shared type, this attribute just works.Its essential implication is the bandwidth (guaranteeing bandwidth and maximum bandwidth) that this node of expression can be got on its father node.When VC or Pipe join Shared VC or Shared Pipe, the bandwidth that VC and Pipe can get by weight than deciding.
Default channel: i.e. after system's operation, in order to carry out the forwarding of packet, the automatic passage of creating.Comprise Default Pipe and Default VC.Under each direction (In-bound/Out-bound) of every link, a Default Pipe is arranged all, a Default VC is all arranged below each Default Pipe.In addition, a Default VC is also all arranged below each Pipe.
Default Pipe and Default VC and common Pipe/VC are similar, and configuration parameters such as its bandwidth can be revised, but can not be deleted.
As shown in Figure 1; The system that multi-core parallel concurrent in an embodiment of the present invention does not have the QOS flow control of lock adopts the mechanism of bag driving to move; The QoS flow control system is as the important component part of whole system; Its core is exactly that each packet that flows into native system is all handled accordingly, comprises the abandoning and the selection and the transmission of buffer memory, bag of calculating, bag of user's and passage under the packet identification, CAR (Committed Access Rate) token.Wherein, this multi-core parallel concurrent method of not having a QOS flow control of lock comprises:
S1, reception packet;
S2, discern said packet; Preferably, each is discerned through DPI&DFI from the packet that network interface card receives, stamp corresponding VC with its from user's ID label;
S3, the said packet of scheduler handle through the QoS flow control system.Preferably; The QoS scheduler handle comprises queuing (Enqueue) process and goes out the process two large divisions of team (Dequeue); Queuing process is responsible for join the team buffer memory or abandon of the packet of receiving; Be responsible for finding out the packet that can send of buffer memory in the system and give Rmon&Rmon2 module and go out group process; The statistics of being correlated with has only it is forwarded; As long as and can find qualified packet; To be sustained, till all cached data packet are all sent or can not find the packet that meets the speed limit condition.
As shown in Figure 2, an embodiment of the present invention scheduler queuing process, carrying out traffic management and control with every user is example, may further comprise the steps:
S10, according to User ID that is identified on this packet and VC ID, seek down the dynamic channel under the respective user to corresponding VC passage;
If S20 can not find, then create this passage, and check whether this VC passage exists Shared VC;
If S30 exists, confirm then whether father's dynamic channel of sub-dynamic channel corresponding under the Shared VC exists;
Do not exist if S40 crosses, then need create corresponding father's dynamic channel under the Shared VC;
If S50 exists, then increase the reference count of his father's dynamic channel; In like manner; Confirm and create each father's dynamic channel of correspondence under Pipe and the Shared Pipe; Thereby form a tunnel speed limit chain to each user; Corresponding with the static speed limit chain of the VC/Shared VC/Pipe/Shared Pipe that has existed, (static speed limit chain is done whole Control for Speed Limitation to all users in collaborative work; Dynamically the speed limit chain is done specific Control for Speed Limitation to each user), and these static and dynamic passages are linked to be a unidirectional chained list from bottom to top through the pointer that subchannel points to parent channel;
S60, the sub-dynamic channel under the VC of the bottom begin, and check its token step by step;
If S70 is a negative; Then at first carry out the filling of token according to single speed/2-rate 3-color token bucket algorithm; Still be assignment if fill the token value of having only; Then present this user's of explanation flow has surpassed its speed limit; Therefore; This packet of receiving is done discard processing, and queuing process finishes at this point.
If the inspection of the token of the dynamic channel on all dynamic speed limit chain of S80 is all passed through; The flow that current this user then is described does not surpass its speed limit; Therefore; This packet of receiving can be accepted the buffer queue of the system that puts into and line up; Etc. to be sent, and, according to this length of data package; Deduct the corresponding token value of each dynamic channel step by step, queuing process finishes.
As shown in Figure 3, an embodiment of the present invention scheduler goes out group process, may further comprise the steps:
Is the quantity of S100, the current whole QoS flow control system cached data packet of inspection 1?
S101 is if so just get into fast path: directly from before just gone into the queuing process of QoS scheduler to attempt team below that VC passage of bag and go out a bag;
If S102 can successfully go out team and go out a packet, then group process that goes out of QoS scheduler finishes at this point;
If S103 cannot successfully go out team and go out a packet, then get into slow-path.
In going out the slow-path of team; What adopt is the mechanism that top-down poll is searched; The order that goes out team's traversal is to begin from the most top Shared Pipe passage; Travel through each subordinate's subchannel successively; The all passages that in system, exist all travel through one time or can success below certain VC go out team's to a packet, then finish this time to go out group process.
Each time it finds a channel, you need to determine whether the token is positive? If not positive, then according to single speed / double speed three-color token bucket algorithm fills its token, if the token is still negative after filling, it indicates that the channel has exceeded the current limit value, to abandon the channel, looking for the next a sibling of the channel; token if its conditions are met, then further examination of its DRR (Deficit? round? robin) is positive (DRR is to ensure that all channels are able to get a fair chance to send the mechanism introduced: Any one channel, which can be continuously transmitted byte packet sum is limited, this limit is reached, the system will automatically switch to another channel at the same level, to prevent the emergence of a channel system has been in a bag while the other channel is "hungry" state unfair)? If it is not positive, then fill their DRR value, and switch to the next sibling of the channel, continue to look for qualified channel.
When finding the VC passage, then attempt to go out packet of team from this VC, if can success go out team's to a packet, finish this time to go out group process.
If traveled through all passages in the system, still can not the successful team that goes out go out a packet, then finish this time to go out group process.
In sum, with respect to prior art, advantage of the present invention is: can realize flexible, efficient, reliable bandwidth control ability based on the division of service application priority, multistage multi-level bandwidth channel.
Wherein, the bandwidth control ability is comprised:
Utilize the bandwidth grading function of system; For certain application-specific or some key customer in the tissue specify minimum reserved bandwidth, to guarantee that the user can both obtain same Bandwidth Management service and network use experience in different time sections, various network environment for use;
For application-specific or some client specify maximum utilized bandwidth, thus the bandwidth resources of the consume valuable that the restriction non-critical application has no to control, thus guarantee the service quality of key application;
Based on the control that guarantees bandwidth and maximum bandwidth, in conjunction with the control of using priority, the high priority agreement can be leased the bandwidth of free time or low priority protocol channel, thereby guarantees that bandwidth obtains reasonably, uses efficiently and manages;
Can control each the IP address/user's who gets into this passage assurance bandwidth and maximum bandwidth through the dynamic subchannel parameter that certain traffic channel is set;
The webmaster personnel can put into a sharing channel with several Pipe (perhaps VC), and different weights is set, to reach diversified flow control purpose according to demand.
Can realize the function that multistage bandwidth is nested through the relevant subordinate relation of Pipe, VC and the setting of Share Rate Pool passage and weight.
For the convenience of describing, be divided into various unit with function when describing above the device and describe respectively.Certainly, when implementing the application, can in same or a plurality of softwares and/or hardware, realize the function of each unit.
Description through above execution mode can know, those skilled in the art can be well understood to the application and can realize by the mode that software adds essential general hardware platform.Based on such understanding; The part that the application's technical scheme contributes to prior art in essence in other words can be come out with the embodied of software product; This computer software product can be stored in the storage medium; Like ROM/RAM, magnetic disc, CD etc.; Comprise that some instructions are with so that a computer equipment (can be a personal computer; Server, the perhaps network equipment etc.) carry out the described method of some part of each execution mode of the application or execution mode.
Device embodiments described above only is schematic; Wherein said unit as the separating component explanation can or can not be physically to separate also; The parts that show as the unit can be or can not be physical locations also; Promptly can be positioned at a place, perhaps also can be distributed on a plurality of network element.Can realize the purpose of this execution mode scheme according to the needs selection some or all of unit wherein of reality.Those of ordinary skills promptly can understand and implement under the situation of not paying creative work.
The application can be used in numerous general or special purpose computingasystem environment or the configuration.For example: personal computer, server computer, handheld device or portable set, plate equipment, multicomputer system, the system based on microprocessor, set top box, programmable consumer-elcetronics devices, network PC, minicom, mainframe computer, comprise distributed computing environment (DCE) of above any system or equipment or the like.
The application can describe in the general context of the computer executable instructions of being carried out by computer, for example program unit.Usually, program unit comprises the routine carrying out particular task or realize particular abstract, program, object, assembly, data structure or the like.Also can in distributed computing environment (DCE), put into practice the application, in these distributed computing environment (DCE), by through communication network connected teleprocessing equipment execute the task.In distributed computing environment (DCE), program unit can be arranged in this locality and the remote computer storage medium that comprises memory device.
Be to be understood that; Though this specification is described according to execution mode; But be not that each execution mode only comprises an independently technical scheme; This narrating mode of specification only is for clarity sake; Those skilled in the art should make specification as a whole; Technical scheme in each execution mode also can form other execution modes that it will be appreciated by those skilled in the art that through appropriate combination.
Above listed a series of detailed description only is specifying to feasibility execution mode of the present invention; They are not in order to restriction protection scope of the present invention, allly do not break away from equivalent execution mode or the change that skill of the present invention spirit done and all should be included within protection scope of the present invention.
Claims (5)
1. a multi-core parallel concurrent does not have the method for the QOS flow control of lock, it is characterized in that, said method comprising the steps of:
S1, reception packet;
S2, discern said packet;
S3, the said packet of scheduler handle through the QoS flow control system.
2. method according to claim 1 is characterized in that, said S2 step comprises: through DPI&DFI said packet is discerned, and stamp corresponding VC with its from user's ID label.
3. method according to claim 1 is characterized in that, said scheduler handle comprises queuing process and go out group process, and wherein, said queuing process is with join the team buffer memory or abandon of the packet of receiving; Saidly go out group process and be responsible for finding out the packet that can send of buffer memory in the system and give Rmon&Rmon2 resume module, till all cached data packet are all sent or can not find the packet that meets the speed limit condition.
4. method according to claim 3 is characterized in that, said queuing process specifically may further comprise the steps:
S10, according to User ID that is identified on the said packet and VC ID, seek down the dynamic channel under the respective user to corresponding VC passage;
If S20 can not find, then create this passage, and check whether this VC passage exists Shared VC;
If S30 exists, confirm then whether father's dynamic channel of sub-dynamic channel corresponding under the Shared VC exists;
Do not exist if S40 crosses, then need create corresponding father's dynamic channel under the Shared VC;
If S50 exists, then increase the reference count of his father's dynamic channel; Confirm and create each father's dynamic channel of correspondence under Pipe and the Shared Pipe simultaneously; Thereby form a tunnel speed limit chain to each user; Corresponding with the static speed limit chain of the VC/Shared VC/Pipe/Shared Pipe that has existed; Collaborative work, and static and dynamic passage is linked to be a unidirectional chained list from bottom to top through the pointer that subchannel points to parent channel;
S60, the sub-dynamic channel under the VC of the bottom begin, and check its token step by step;
If S70 is a negative, then carry out the filling of token according to single speed/2-rate 3-color token bucket algorithm, still be assignment if fill the token value of having only, this packet that then will receive is done discard processing, and queuing process finishes;
If the inspection of the token of the dynamic channel on all dynamic speed limit chain of S80 is all passed through; Then said packet is put into buffer queue and lines up, wait to be sent, and according to this length of data package; Deduct the corresponding token value of each dynamic channel step by step, queuing process finishes.
5. according to claim 3 or 4 described methods, it is characterized in that, saidly go out group process and comprise:
Is the quantity of S100, the current whole QoS flow control system cached data packet of inspection 1?
S101 is if get into fast path: from the queuing process of QoS scheduler, go out group packet under the VC passage;
If S102 can successfully go out packet of team, then group process that goes out of QoS scheduler finishes at this point;
If S103 cannot successfully go out packet of team, then get into slow-path,
Wherein, In said slow-path; What adopt is the mechanism that top-down poll is searched; The order that goes out team's traversal is to begin from the most top Shared Pipe passage; Travel through each subordinate's subchannel successively; The all passages that in system, exist all travel through one time or can success below certain VC go out team's to a packet, then finish this time to go out group process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110315458.2A CN102355422B (en) | 2011-10-17 | 2011-10-17 | Multicore, parallel and lock-free quality of service (QOS) flow control method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110315458.2A CN102355422B (en) | 2011-10-17 | 2011-10-17 | Multicore, parallel and lock-free quality of service (QOS) flow control method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102355422A true CN102355422A (en) | 2012-02-15 |
| CN102355422B CN102355422B (en) | 2014-07-23 |
Family
ID=45578919
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110315458.2A Active CN102355422B (en) | 2011-10-17 | 2011-10-17 | Multicore, parallel and lock-free quality of service (QOS) flow control method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102355422B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103634227A (en) * | 2012-08-20 | 2014-03-12 | 百度在线网络技术（北京）有限公司 | A service traffic precision scheduling method based on a user quantity and an apparatus thereof |
| CN104363115A (en) * | 2014-10-30 | 2015-02-18 | 任子行网络技术股份有限公司 | DPI lockless stream state management method and system |
| CN106230612A (en) * | 2016-07-12 | 2016-12-14 | 杭州迪普科技有限公司 | Process the method and device of message |
| WO2018137581A1 (en) * | 2017-01-25 | 2018-08-02 | Huawei Technologies Co., Ltd. | A multi-core lock-free rate limiting apparatus and method |
| WO2020143308A1 (en) * | 2019-01-08 | 2020-07-16 | 盛科网络（苏州）有限公司 | Multi-level scheduling method and device, network chip, and storage medium |
| CN112817530A (en) * | 2021-01-22 | 2021-05-18 | 万得信息技术股份有限公司 | Method for safely and efficiently reading and writing ordered data in multithreading manner |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020114279A1 (en) * | 2001-01-11 | 2002-08-22 | Ann-Christine Eriksson | Telecommunications systems |
| CN101060489A (en) * | 2007-05-16 | 2007-10-24 | 杭州华三通信技术有限公司 | Message forwarding method and device |
| CN101083563A (en) * | 2007-07-20 | 2007-12-05 | 杭州华三通信技术有限公司 | Method and apparatus for preventing distributed refuse service attack |
| CN101964754A (en) * | 2010-11-01 | 2011-02-02 | 南京邮电大学 | Point to point (P2P) service identification-based quality of service (QoS) routing method |
| CN102025623A (en) * | 2010-12-07 | 2011-04-20 | 苏州迈科网络安全技术股份有限公司 | Intelligent network flow control method |
-
2011
- 2011-10-17 CN CN201110315458.2A patent/CN102355422B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020114279A1 (en) * | 2001-01-11 | 2002-08-22 | Ann-Christine Eriksson | Telecommunications systems |
| CN101060489A (en) * | 2007-05-16 | 2007-10-24 | 杭州华三通信技术有限公司 | Message forwarding method and device |
| CN101083563A (en) * | 2007-07-20 | 2007-12-05 | 杭州华三通信技术有限公司 | Method and apparatus for preventing distributed refuse service attack |
| CN101964754A (en) * | 2010-11-01 | 2011-02-02 | 南京邮电大学 | Point to point (P2P) service identification-based quality of service (QoS) routing method |
| CN102025623A (en) * | 2010-12-07 | 2011-04-20 | 苏州迈科网络安全技术股份有限公司 | Intelligent network flow control method |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103634227A (en) * | 2012-08-20 | 2014-03-12 | 百度在线网络技术（北京）有限公司 | A service traffic precision scheduling method based on a user quantity and an apparatus thereof |
| CN103634227B (en) * | 2012-08-20 | 2018-05-01 | 百度在线网络技术（北京）有限公司 | A kind of accurate dispatching method of service traffics based on number of users and device |
| CN104363115A (en) * | 2014-10-30 | 2015-02-18 | 任子行网络技术股份有限公司 | DPI lockless stream state management method and system |
| CN104363115B (en) * | 2014-10-30 | 2017-11-03 | 任子行网络技术股份有限公司 | A kind of DPI is without lock stream mode management method and system |
| CN106230612A (en) * | 2016-07-12 | 2016-12-14 | 杭州迪普科技有限公司 | Process the method and device of message |
| CN106230612B (en) * | 2016-07-12 | 2019-09-06 | 杭州迪普科技股份有限公司 | Handle the method and device of message |
| WO2018137581A1 (en) * | 2017-01-25 | 2018-08-02 | Huawei Technologies Co., Ltd. | A multi-core lock-free rate limiting apparatus and method |
| US10659372B2 (en) | 2017-01-25 | 2020-05-19 | Futurewei Technologies, Inc. | Multi-core lock-free rate limiting apparatus and method |
| WO2020143308A1 (en) * | 2019-01-08 | 2020-07-16 | 盛科网络（苏州）有限公司 | Multi-level scheduling method and device, network chip, and storage medium |
| CN112817530A (en) * | 2021-01-22 | 2021-05-18 | 万得信息技术股份有限公司 | Method for safely and efficiently reading and writing ordered data in multithreading manner |
| CN112817530B (en) * | 2021-01-22 | 2024-06-07 | 万得信息技术股份有限公司 | Method for reading and writing ordered data in full high efficiency through multiple lines Cheng An |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102355422B (en) | 2014-07-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Noormohammadpour et al. | Datacenter traffic control: Understanding techniques and tradeoffs | |
| CN109768939B (en) | Priority-supporting labeling network stack method and system | |
| EP2865147B1 (en) | Guarantee of predictable and quantifiable network performance | |
| CN102355422B (en) | Multicore, parallel and lock-free quality of service (QOS) flow control method | |
| US7290028B2 (en) | Methods, systems and computer program products for providing transactional quality of service | |
| Sulistio et al. | Constructing A Grid Simulation with Differentiated Network Service Using GridSim. | |
| CN108476208A (en) | Multi-path transmission designs | |
| WO2018121295A1 (en) | Heterogeneous multi-protocol stack method, device and system | |
| CN106209506A (en) | A kind of virtualization deep-packet detection flow analysis method and system | |
| Wang et al. | Implementation of multipath network virtualization with SDN and NFV | |
| CN1989738A (en) | Propagation of minimum guaranteed scheduling rates | |
| CN102368741A (en) | Method supporting hierarchical queue scheduling and flow shaping and apparatus thereof | |
| CN108471629A (en) | The control method of business service quality, equipment and system in transmission network | |
| RU2643666C2 (en) | Method and device to control virtual output queue authorization and also computer storage media | |
| Hua et al. | Scheduling heterogeneous flows with delay-aware deduplication for avionics applications | |
| CN106453576A (en) | Interactive method, interactive system and dispatching centre based on hybrid cloud platform | |
| CN109005126A (en) | The processing method and equipment of data flow | |
| Pasyeka et al. | Development algorithmic model for optimization of distributed fault-tolerant web-systems | |
| Liang et al. | Low-latency service function chain migration in edge-core networks based on open Jackson networks | |
| CN113938930B (en) | Construction method of virtual network function forwarding graph adapting to 5G network multi-service scene | |
| CN101557346B (en) | Polling-based packet queue output scheduling method and packet switching node | |
| CN111970149B (en) | Shared bandwidth implementation method based on hardware firewall QOS | |
| Wang et al. | A game theoretical bandwidth allocation mechanism for cloud robotics | |
| CN102611924A (en) | Flow control method and system of video cloud platform | |
| CN107426109A (en) | A kind of traffic scheduling method, VNF modules and flow scheduling server |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP02 | Change in the address of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: Room 301-302, 3rd Floor, Tiancheng Information Building, No. 88 South Tiancheng Road, High Speed Rail New City, Xiangcheng District, Suzhou City, Jiangsu Province, 215133 Patentee after: SUZHOU MAXNET NETWORK SAFETY TECHNOLOGY Co.,Ltd. Address before: 215021 International Science and Technology Park Phase III 8B, No. 1355 Jinjihu Avenue, Industrial Park, Suzhou City, Jiangsu Province Patentee before: SUZHOU MAXNET NETWORK SAFETY TECHNOLOGY Co.,Ltd. |