CN100461758C - Multi-interface flow-balance controlling method - Google Patents

Multi-interface flow-balance controlling method Download PDF

Info

Publication number
CN100461758C
CN100461758C CNB2005101023904A CN200510102390A CN100461758C CN 100461758 C CN100461758 C CN 100461758C CN B2005101023904 A CNB2005101023904 A CN B2005101023904A CN 200510102390 A CN200510102390 A CN 200510102390A CN 100461758 C CN100461758 C CN 100461758C
Authority
CN
China
Prior art keywords
interface
flow
value
threshold values
resource
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.)
Expired - Fee Related
Application number
CNB2005101023904A
Other languages
Chinese (zh)
Other versions
CN1852233A (en
Inventor
王�华
聂保华
武敏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CNB2005101023904A priority Critical patent/CN100461758C/en
Publication of CN1852233A publication Critical patent/CN1852233A/en
Application granted granted Critical
Publication of CN100461758C publication Critical patent/CN100461758C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The method includes steps: (1) based on value of actual flow at previous cycle at each interface in server end to obtain predicted value of flow at next cycle; (2) at least based on predicted value of flow at each interface, assigning system resources for each interface, and determining threshold of flow control at each interface; (3) determining whether flow of data packet received in next cycle at each interface exceed threshold of flow control; if yes, starting to discard received data packet till to next cycle. The invention makes system resources possible to distribute to each interface smoothly so as to take full advantage of system resources. Predicting flow at each interface simplifies process for each data packet so as to reduce occupancy rate of CPU.

Description

Multi-interface flow-balance controlling method
Technical field
The present invention relates to the method for Control Network flow, specifically, relate to a kind of multi-interface flow-balance controlling method.
Background technology
The application program (Service) that runs on server end generally all can be connected with a plurality of client-side program (Client) simultaneously, as shown in Figure 1, is the schematic diagram of a kind of typical service end and client framework.And along with the continuous increase of the network traffics of client, its load constantly increases the weight of thereupon, can take more system resource (as, the CUP occupancy), so that can influence server itself and other and operate in the efficient of all application programs on this server, in the time of seriously even can cause the server machine (down) of delaying.For avoiding this situation to take place, application program self need take certain flow control strategy to control its utilization to system resource.In addition, how rationally, effectively utilize Limited resources to depend on the flow control strategy that these application programs are taked to a great extent.So both improved its other resources utilance, also guaranteed of the utilization of other application programs system resource.
For the flow control strategy that relates to a plurality of interfaces generally be by: at first set the flow control threshold values in a second of each interface, handle its received packet according to this flow control threshold values then, if the packet that this interface was received in a second surpasses the flow control threshold values of predefined this interface, then abandon partial data bag (in this case, generally can not abandon the heartbeat data packets that each interface sends over) above this flow control threshold values.
This flow control methods has following weak point:
Because each interface is not provided with shared mechanism, resource utilization is low.For example, shown in Fig. 1 when the mass flow discrepancy of four interfaces is even, surpass the flow control threshold values such as the flow that has only an interface, though and the packet that other interface receives seldom, but still taking the resource of system, do not have to share to the bigger interface of flow-rate ratio.The resource of system can seen it is to be divided into independently several parts in equal size, can more effectively not utilize resource according to the traffic conditions of the network of reality.
Continuous increase along with each interface network flow, for a large amount of packets that surpass its disposal ability (promptly having surpassed the flow control threshold values) that send over, application program is not in order to abandon heartbeat packet, need carry out filtration treatment to these packets, because packet is a lot, then the shared resource of application program can get more and more, and this will directly influence the demand of other application software on server.
Also occurred another flow control methods now, it mainly is a flow control threshold values of adjusting next second by last second flow control threshold values M, comes each interface is carried out flow control by this threshold values.Per second calculates the flow of the request access of once current interface, and it is kept among register C1~Cn, preserves n numerical value altogether.Notification processor has transshipped when system overload, calculated flow rate control this moment threshold values M, and computing formula is: M=(C1 * 1+C2 * 2+ ... Cn * n)/(1+2+ ... + n).Specify a trouble free service interval to M, for example the processor overload level is divided into four ranks, be between the one-level overload region, between the secondary overload region, between three grades of overload region and between the level Four overload region, the overload degree difference of representing between every grade of overload region, for example, when processor is between the one-level overload region or between the secondary overload region time, also there is certain free time in expression system resource (or disposal ability); When processor is between three grades of overload region or between the level Four overload region time, expression system resource exhausts substantially, system processing power reaches capacity, needs to keep or reduce the overload conditions that the M value is alleviated processor.
When carrying out flow control, for each request access of each interface, because its priority difference, so need judge whether to receive this request according to its priority.Rule generally is not refuse the high access request of priority, and is First come first served.Simultaneously, also need accumulation process to be carried out in the request of each reception, judge again whether it surpasses the flow control threshold values M of this second according to weight.
This flow control methods also has weak point:
Under the prerequisite that has flow restriction, the reception processing mode of this First come first served, access request for same level is unreasonable, for example, because request time difference, and the resource that causes major part (or owning) request that inserts in the back all shared by the access request of a request formerly and its same level can only take resource (perhaps taking less than resource) seldom.
And when each access request is handled, all need accumulation process to be carried out in each request according to weight, compare with the flow control threshold values again, judge whether it surpasses the flow control threshold values, can reduce the performance of system and the occupancy of raising CPU so to a certain extent.
Summary of the invention
Technical problem to be solved by this invention is, overcomes the deficiency that can not make full use of system resource and demand that can not each interface of balance in the existing flow control technique, and a kind of multi-interface flow-balance controlling method is provided.
The technical solution adopted for the present invention to solve the technical problems is: a kind of multi-interface flow-balance controlling method is provided, comprises: (a) obtain the volume forecasting value of each interface in following one-period according to the actual flow value in the last cycle of each interface of server end; (b) be each interface assignment system resource according to the volume forecasting value of each interface at least, and determine the flow control threshold values of each interface; (c) judge that whether the flow of each interface received packet in this following one-period surpasses the flow control threshold values of this interface, when surpassing the flow control threshold values of this interface, begins received data packet discarding was begun up to following one-period.
In multi-interface flow-balance controlling method of the present invention, obtain the volume forecasting value of each interface in following one-period according to the actual flow value in the last cycle of each interface of server end in the described step (a) and be specially the volume forecasting value of calculating each interface by formula, described formula is:
Err=M-A
A←A+g?Err
D←D+h(|Err|-D)
N=A+4D
M is the actual flow value in this last cycle of interface; A is the value in the smoothed Estimation of Mean device, and its initial value is 0; D is smoothed mean bias; Err is the poor of the actual flow value M in this last cycle of interface and current estimator intermediate value; G one is used for average increment, and h is the gain of deviation D, and N is the predicted value of next cycle flow of this interface.
In multi-interface flow-balance controlling method of the present invention, described g value is 0.12, and the h value is 0.25.
In multi-interface flow-balance controlling method of the present invention, described step (b) is specially: determine that (b1) each interface takies the maximum stream flow threshold values of the priority of resource, each interface, minimum discharge threshold values; (b2) be each interface assignment system resource according to described volume forecasting value, maximum stream flow threshold values, minimum discharge threshold values, and determine the flow control threshold values of each interface.
In multi-interface flow-balance controlling method of the present invention, described step (b2) is specially: (b20) press its minimum discharge threshold values Resources allocation for each interface; (b21) divide into groups by the priority of each interface, the interface of same level is assigned to same group, the priority pointer is represented with I, points to the group of limit priority; (b22) calculate surplus resources, and judge that the volume forecasting whether this surplus resources satisfies each interface in the described priority pointer I group pointed is worth pairing demand; (b23) if in step (b22), described surplus resources can not satisfy the demand of each interface in this group, then all surplus resources is distributed to each interface of this group, and goes to step (b27); (b24) if in step (b22), described surplus resources can satisfy the demand of each interface in this group, according to the volume forecasting value of each interface of this group, distributes its required resource, and gives priority pointer I with I-1 assignment, points to the group of next priority; (b25) judge whether all groups have all been assigned, if unallocated the finishing of group arranged, then flow process turns to step (b22), otherwise goes to step (b26); (b26) all assigned when all groups, and available resources also have residue, then according to the priority orders of interface, the maximum stream flow threshold values with each interface distributes remaining available resources successively, finishes until all resource allocations; (b27), obtain the flow control threshold values of each interface according to the resource that each interface distributed.
In multi-interface flow-balance controlling method of the present invention, the packet that is dropped in step (c) comprises heartbeat packet.
Implement multi-interface flow-balance controlling method of the present invention, has following beneficial effect: can make system resource can smooth to each interface, when the data packet flow of an interface does not reach by flow control, can be assigned to the interface that surpasses flow this moment to remaining disposal ability, utilize system resource fully.
Redundant data bag for surpassing the flow control threshold values with taking the strategy of direct packet loss, comprises abandoning of heartbeat packet equally, has controlled taking system resource.Take the mechanism of dividing into groups, guarantee the interface of same level fair and reasonable be assigned to resource.All by calculate obtaining a volume forecasting value,, allocated resource in advance at each interface according to the priority of each interface because last one predict constantly in advance.Can be simpler on to the processing of each packet, reduced the occupancy of CPU.
Description of drawings
Fig. 1 is the schematic diagram of typical service end of the prior art and client framework;
Fig. 2 is the main flow chart of multi-interface flow-balance controlling method of the present invention;
Fig. 3 is the flow chart that distributes surplus resources among Fig. 2.
Embodiment
The invention provides a kind of multi-interface flow-balance controlling method, as shown in Figure 2, is main flow chart of the present invention.The present invention takes at first according to current network condition the flow of each interface to be predicted, then according to the volume forecasting value of prediction and the priority assignment resource of pressing each interface, and be that each interface obtains a flow control threshold values, the well back flow control threshold values with each interface of Resources allocation carries out flow control to each interface.
At first, in step S20, obtain the volume forecasting value of each interface.Obtaining the volume forecasting value of each interface in following one-period is that each interface is carried out the necessary prerequisite of flow control.For convenience of explanation, following was that one-period describes with one second, the invention is not restricted to this, can take integer second as one-period.
In the present invention, in order to predict the flow value of next second more accurately, adopted the predicted value of calculating each interface flow based on the jacobson formula of average and variance:
Err=M-A
A←A+g?Err
D←D+h(|Err|-D)
N=A+4D
By top formula, can predict back one second flow according to last second actual flow.Wherein, M refers to last second actual flow value; A refers to the value in the smoothed Estimation of Mean device, and its initial value is 0; D is smoothed mean bias; Err is the poor of last second actual flow value M and current estimator intermediate value; Increment g plays mean effort, is taken as 1/8 (0.125) in the present embodiment; The gain of deviation D is h, and value is 0.25 in the present embodiment.A and D all are used to calculate the flow value of next second.N is exactly the predicted value of next second flow amount.In the present embodiment, the value of g and h is the one group of more satisfactory value that relatively draws according to measured result repeatedly and notional result, and this group makes predicted value follow actual value more approaching.
In following step S21, need the reasonable distribution resource.Determine that comprising needs each interface takies the distribution method of the maximum stream flow threshold values of the priority of resource, each interface, minimum discharge threshold values and definite surplus resources etc.
In actual applications, usually the processing priority of each interface is inconsistent, so under the situation of resource-constrained, can the different weights that takies resource be set for each interface, for example, can set the priority that each interface takies resource according to the priority that each interface is handled, this interface takies the priority of resource can be corresponding with the priority that interface is handled, for example, the interface that processing priority is higher, the priority that takies resource of its correspondence is higher; The interface that processing priority is lower, the priority that takies resource of its correspondence is lower.Certainly, the present invention also can determine the height of the priority of the shared resource of each interface according to other principle.
Because the available resource of interface is limited, so each interface setting allowed the maximum stream flow threshold values that passes through.In addition, for the interface assignment that prevents to be seized lower priority by the higher interface of priority because of system resource less than resource, thereby cause no any message bag on the network, produce the situation that interface disconnects.For each interface all is provided with the minimum discharge threshold values that a permission is passed through.When total interface allowed with minimum discharge threshold values reception packet, the last resource of system at this time can not be 0.Be better implement the present invention, in an embodiment of the present invention, select the value of the maximum stream flow threshold values and the minimum discharge threshold values of each interface with certain condition: for example, the minimum discharge threshold values of setting total interface and the ratio sum of maximum stream flow threshold values are less than 1.With four interfaces is example, the maximum stream flow threshold values is represented with Max1, Max2, Max3 and Max4 respectively, the minimum discharge threshold values is represented with Min1, Min2, Min3 and Min4 respectively, can be expressed as: Min1/Max1+Min2/Max2+Min3/Max3+Min4/Max4<1.Certainly in other embodiment, be not limited thereto, but all will satisfy when total interface allows with minimum discharge threshold values reception packet, the last resource of system need be greater than 0.
Defined after the maximum stream flow threshold values and minimum discharge threshold values of each interface, just can the surplus resources of system have been distributed.The flow process of among the present invention surplus resources being distributed is described below in conjunction with Fig. 3.At first, allocate in advance by the pairing resource of its minimum discharge threshold values for each interface.
In step S30, calculate residual resource.The alleged residual resource of the present invention is meant the available resources that system is last, as dividing timing for the first time, is meant the resource of system after given each interface satisfies that the minimum discharge threshold values is required to take resource.Before distributing surplus resources, divide into groups by the priority of each interface earlier, the interface of same level is assigned to a group.
Distribution for residual resource should be considered the group that priority is the highest earlier, calculate the required resource of each group according to the volume forecasting value of each interface in each group then, in step S31, judge whether this surplus resources satisfies the needs of each interface in the group of this priority, judge that promptly whether this surplus resources deducts the required resource that takies of summation of the minimum discharge threshold values of each interface greater than each interface flow predicted value of the highest group of priority.For example, the pointer of limit priority is represented with I at this moment.
If in step S31, described surplus resources can not satisfy the demand of each interface flow of the highest group of this priority, then in step S32, then all surplus resources are distributed to the interface of this group, the gained resource just is mapped as the actual prediction value of this group, and the lower group of other priority is just again distributed less than extra resource, and they still are seized of original that part of resource (corresponding to the resource of each interface minimum discharge threshold values).Wherein, when if surplus resources does not satisfy this total interface demand, can adopt in the ratio of each interface resource demand and distribute described resource, for example, in one embodiment, give each interface assignment in the group of this limit priority to resource be: in will organize the required resource of each interface and surplus resources the resource after average compares by group inner joint sum, get that less value.Resource that each interface can be assigned in this step that Here it is.Like this, can be more liberally for each interface divide resource, and can distribute according to need.Then flow process goes to step S36.
If in step S31, described surplus resources can satisfy the demand of each interface flow of (being equal to or greater than) group that priority is the highest, then in step S33, according to each interface predicted value of this group, distributes the required resource of each interface.And in the priority pointer, give I, promptly point to the group of next priority I-1 assignment.
And in step S34, judge whether all groups have all been assigned.If organize unallocated finishing in addition, then flow process turns to step S30, recomputates residual resource, is this residual resource of set of dispense of next priority.Distribution method is identical with last group distribution method, till available resources do not have residue or all groups all to assign.
If all groups have all assigned, and available resources also have residue, then in step S35, then distribute described surplus resources by the maximum stream flow threshold values of this interface successively according to the priority orders of interface.For example, earlier this surplus resources is distributed to limit priority one group, satisfy the pairing resource quantity of maximum stream flow threshold values of each interface to make the shared resource of interface in this group as far as possible.If this moment, resource still had residue, then residual resource is distributed to each interface of the group of next priority, and the like, finish until all resource allocations.
Like this, in step S36, just finished the distribution of surplus resources.Obtain the flow control threshold values, this flow control threshold values is meant the last assigned pairing flow threshold values of resource of each interface, and wherein last assigned resource is meant that resource and follow-up each step of being distributed by this interface minimum discharge threshold values in advance are the summation of the resource that this interface distributed.
In the present invention, because each distribution all is to distribute according to priority, and each interface all can take certain resource (corresponding minimum discharge threshold values), so even the initial lower group of priority is also taking resource always, if the higher group of priority needs more resources, the resource of system according to priority height order is smoothly distributed to each group gradually.
Get back to Fig. 2, in step S22, after the surplus resources of the system of distributing, just can carry out the step of flow control.Behind the flow control threshold values that has obtained each interface of next second, just can carry out flow control to each interface, when packet that each interface received in one second surpasses this flow control threshold values, just begin received data packet discarding, up to the arrival of next second.Wherein, the described packet that abandons also can comprise heartbeat packet.So can not take more cpu resource because of heartbeat packet is handled.
Implement multi-interface flow-balance controlling method of the present invention, can make system resource can smooth to each interface, when the data packet flow of an interface does not reach by flow control, can be assigned to the interface that surpasses flow this moment to remaining disposal ability, utilized system resource fully.
Redundant data bag for surpassing the flow control threshold values with taking the strategy of direct packet loss, comprises abandoning of heartbeat packet equally, has controlled taking system resource.
Take the mechanism of dividing into groups, guarantee the interface of same level fair and reasonable be assigned to resource.
Introduce the thought that the predicted value of each interface is carried out flow control,, allocated resource in advance according to the priority of each interface because last one predict constantly in advance.Can be simpler on to the processing of each packet, reduced the occupancy of CPU.

Claims (6)

1. a multi-interface flow-balance controlling method is characterized in that, comprising:
(a) obtain the volume forecasting value of each interface in following one-period according to the actual flow value in the last cycle of each interface of server end;
(b) be each interface assignment system resource according to the volume forecasting value of each interface at least, and determine the flow control threshold values of each interface;
(c) judge whether the flow of each interface received packet in this following one-period surpasses the flow control threshold values of this interface, and when surpassing the flow control threshold values of this interface, the data packet discarding with received began up to following one-period.
2. multi-interface flow-balance controlling method according to claim 1, it is characterized in that, obtain the volume forecasting value of each interface in following one-period according to the actual flow value in the last cycle of each interface of server end in the described step (a) and be specially the volume forecasting value of calculating each interface by formula, described formula is:
Err=M-A
A←A+g?Err
D←D+h(|Err|-D)
N=A+4D
M is the actual flow value in this last cycle of interface; A is the value in the smoothed Estimation of Mean device, and its initial value is 0; D is smoothed mean bias; Err is the poor of the actual flow value M in this last cycle of interface and current estimator intermediate value; G one is used for average increment, and h is the gain of deviation D, and N is the predicted value of next cycle flow of this interface.
3. multi-interface flow-balance controlling method according to claim 2 is characterized in that, described g value is 0.12, and the h value is 0.25.
4. according to each described multi-interface flow-balance controlling method of claim 1 to 3, it is characterized in that described step (b) is specially:
(b1) determine that each interface takies the maximum stream flow threshold values of the priority of resource, each interface, minimum discharge threshold values;
(b2) be each interface assignment system resource according to described volume forecasting value, maximum stream flow threshold values, minimum discharge threshold values, and determine the flow control threshold values of each interface.
5. multi-interface flow-balance controlling method according to claim 4 is characterized in that, described step (b2) is specially:
(b20) press its minimum discharge threshold values Resources allocation for each interface;
(b21) divide into groups by the priority of each interface, the interface of same level is assigned to same group, the priority pointer is represented with I, points to the group of limit priority;
(b22) calculate surplus resources, and judge that the volume forecasting whether this surplus resources satisfies each interface in the described priority pointer I group pointed is worth pairing demand;
(b23) if in step (b22), described surplus resources can not satisfy the demand of each interface in this group, then all surplus resources is distributed to each interface of this group, and goes to step (b27);
(b24) if in step (b22), described surplus resources can satisfy the demand of each interface in this group, according to the volume forecasting value of each interface of this group, distributes its required resource, and gives described priority pointer I with I-1 assignment, points to the group of next priority;
(b25) judge whether all groups have all been assigned, if unallocated the finishing of group arranged, then flow process turns to step (b22), otherwise goes to step (b26);
(b26) all assigned when all groups, and available resources also have residue, then according to the priority orders of interface, the maximum stream flow threshold values with each interface distributes remaining available resources successively, finishes until all resource allocations;
(b27), obtain the flow control threshold values of each interface according to the resource that each interface distributed.
6. multi-interface flow-balance controlling method according to claim 5 is characterized in that, the packet that is dropped in step (c) comprises heartbeat packet.
CNB2005101023904A 2005-12-08 2005-12-08 Multi-interface flow-balance controlling method Expired - Fee Related CN100461758C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2005101023904A CN100461758C (en) 2005-12-08 2005-12-08 Multi-interface flow-balance controlling method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2005101023904A CN100461758C (en) 2005-12-08 2005-12-08 Multi-interface flow-balance controlling method

Publications (2)

Publication Number Publication Date
CN1852233A CN1852233A (en) 2006-10-25
CN100461758C true CN100461758C (en) 2009-02-11

Family

ID=37133702

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2005101023904A Expired - Fee Related CN100461758C (en) 2005-12-08 2005-12-08 Multi-interface flow-balance controlling method

Country Status (1)

Country Link
CN (1) CN100461758C (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101442807B (en) * 2008-12-30 2012-09-05 北京邮电大学 Method and system for distribution of communication system resource
CN107613528B (en) 2016-07-11 2021-01-29 华为技术有限公司 Method and system for controlling service flow
CN109639585A (en) * 2017-10-09 2019-04-16 中兴通讯股份有限公司 Flow control methods, device, the network equipment and computer readable storage medium
CN112398748A (en) * 2021-01-21 2021-02-23 全时云商务服务股份有限公司 MQ-based intelligent current limiting method, device and computer readable medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1403934A (en) * 2001-09-06 2003-03-19 华为技术有限公司 Load balancing method and equipment for convective medium server
US20040122938A1 (en) * 2002-12-19 2004-06-24 Messick Randall E. Method and apparatus for dynamically allocating storage array bandwidth
CN1579071A (en) * 2001-08-31 2005-02-09 波音公司 User bandwidth monitor and control management system and method
CN1618065A (en) * 1999-10-20 2005-05-18 北方电讯网络有限公司 Methods and systems for providing load dependent content

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1618065A (en) * 1999-10-20 2005-05-18 北方电讯网络有限公司 Methods and systems for providing load dependent content
CN1579071A (en) * 2001-08-31 2005-02-09 波音公司 User bandwidth monitor and control management system and method
CN1403934A (en) * 2001-09-06 2003-03-19 华为技术有限公司 Load balancing method and equipment for convective medium server
US20040122938A1 (en) * 2002-12-19 2004-06-24 Messick Randall E. Method and apparatus for dynamically allocating storage array bandwidth

Also Published As

Publication number Publication date
CN1852233A (en) 2006-10-25

Similar Documents

Publication Publication Date Title
CN107066332A (en) Distributed system and its dispatching method and dispatching device
CN106411392B (en) The satellite communication system dynamically distributed based on traffic prediction and radio resource
CN101702669B (en) Bandwidth allocation method and system
JP2002278945A (en) Method and system for distributing transaction load between computers with multi-processor configuration and program
CN104168332A (en) Load balance and node state monitoring method in high performance computing
JP2001109638A (en) Method and system for distributing transaction load based on estimated extension rate and computer readable recording medium
MX2015006471A (en) Method and apparatus for controlling utilization in a horizontally scaled software application.
CN110431809A (en) For in the mobile communication network on multilink allocation packets method and apparatus
CN100461758C (en) Multi-interface flow-balance controlling method
CN102098301A (en) Multilink self-adaptation data transmission method and system
CN102664814A (en) Grey-prediction-based adaptive dynamic resource allocation method for virtual network
US10205671B2 (en) Method and apparatus for adding token in traffic shaping
CN101540716B (en) Service quality-based method and service quality-based device for scheduling non-guaranteed bit rate service
CN101427533A (en) Broadband access network capacity management
CN103179570A (en) Resource allocation method and system applied in distributed time division multiplexing system
CN102436399A (en) Load-balanced acquisition method
CN103455375A (en) Load-monitoring-based hybrid scheduling method under Hadoop cloud platform
CN100466593C (en) Method of implementing integrated queue scheduling for supporting multi service
CN1964320A (en) A method for packet dispatching of variable parameter for real-time mixed service environment
CN1316787C (en) Method for distributing accuratelly bandwidth for different queue at IP network equipment port
CN104301241B (en) A kind of SOA dynamic load distributing methods and system
CN101009657A (en) Measurement of the output speed of the buffer queue, allocation method and device of Iub bandwidth
CN107995312B (en) Boundary network service flow distribution system and dynamic distribution method
CA2252792A1 (en) Apparatus and method for preventing network server overload
CN102833786B (en) Independent Carrier Wave dispatching method in a kind of multicarrier system

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20090211

CF01 Termination of patent right due to non-payment of annual fee