CN1773962A - Gigabit passive optical network strict priority weighted round robin scheduling mechanism - Google Patents
Gigabit passive optical network strict priority weighted round robin scheduling mechanism Download PDFInfo
- Publication number
- CN1773962A CN1773962A CNA2005101201776A CN200510120177A CN1773962A CN 1773962 A CN1773962 A CN 1773962A CN A2005101201776 A CNA2005101201776 A CN A2005101201776A CN 200510120177 A CN200510120177 A CN 200510120177A CN 1773962 A CN1773962 A CN 1773962A
- Authority
- CN
- China
- Prior art keywords
- packet
- weight
- priority
- reception
- distribution list
- 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
Abstract
A system, method, and computer readable medium for strict priority weighted round robin scheduling includes selecting a set of bandwidth allocation table filled entries having a common destination address, each filled entry associated with a received data packet and determining a scheduling weight for each bandwidth allocation table entry in the selected set, the scheduling weight determined first by a priority and then by an assigned weight.
Description
The cross reference of related application
Present patent application relates to and requires to be called in the name that on November 10th, 2004 proposed the U.S. Provisional Patent Application No.60/626 of " 7342FTTU GPON ONT SWRR SCHEDULER ", 652 priority, and its full content is introduced the application by reference.
Technical field
Relate generally to of the present invention is used for the single-stage scheduling mechanism of signal server, and relates more particularly to gigabit passive optical network strict priority weighted round robin scheduling mechanism.
Background technology
At present, data packet network need be dispatched to satisfy the requirement of service quality.The scheduling mechanism that is used for adapting to priority and weighting at present the needs multi-stage scheduling to consider each level of priority and weight dividually.The scheduling difficult point is the assigned priority of constantly variation and the percentage of weight.The realization of hardware at present need have the multi-stage scheduling mechanism of each grade for strict priority or weighting.
What therefore, need is a kind of scheduler of single-stage flexibly.More particularly, what need is the strict priority weighted round robin scheduling device that a kind of software is realized, it can provide the single-stage scheduling mechanism, dispatches according to the combination of priority, weight or priority and weight.Many outputs or logical division based on the scheduler of same destination (by distributing Id identification) are main flexibilities provided by the present invention.
Summary of the invention
The traffic carrying capacity control of gigabit passive optical network needs to use scheduler to satisfy the requirement of service quality.The grouping of data can have a logic output terminal mouth (distributing Id), relevant priority, weight or priority and weight the two.Determine in hardware that at present a suitable dispatch weight needs multi-stage scheduling that priority and weight are described dividually.The invention provides of the combination of this mechanism with the weight that allows in the single-stage scheduler, will to assess and logic output terminal mouth, priority.
Dispatching packet with route enters a formation and is used for traffic carrying capacity control.Relevant with this packet and traffic carrying capacity is controlled required information stores in a bandwidth distribution list (BAT).Single-stage scheduler of the present invention is used to make the scheduling decision from the information of bandwidth allocation table.The bandwidth distribution list data relevant with packet comprise be used for recognition data grouping index, be called the packet that distributes Id will be routed to destination address, priority, initial weight, increment weight and block count there.
The index of bandwidth distribution list is to be used for the value of identification data grouping.This index can be called port Id to enter identifier relevant.
The destination address of the packet in the bandwidth distribution list is to be used for the value of identification data grouping route.Destination address is called and distributes Id.Same destination address can be used for the packet more than.If be routed to same destination address, then need to dispatch with the control traffic carrying capacity more than one packet.
The priority of the packet in the bandwidth distribution list is the value between limit priority 0 and the lowest priority 7.If have same destination address, then should be to each packet of this destination address route and specify different levels of priority to allow scheduling more than one packet.
If have same address and same priority level, then need the initial weight of the packet in the bandwidth distribution list more than one packet.In this case, should be each packet specified weight to allow scheduling.
After having received the postamble of packet, increase the increment of the packet in the bandwidth distribution list by formation.
When having received the postamble of packet by formation, the block count of the packet in the bandwidth distribution list is accumulated at the byte number that has received in the formation.
The specified weight of the packet of being calculated by the strict priority weighted round robin scheduling device is that the initial weight of packet adds the increment that multiply by after the block count.
The designated order of data packet transmission is called queue sequence.Be the packet specified queue order that will send to the common purpose address at first, then by coming for packet specified weight for sending to the packet specified queue order of common purpose address with same priority based on strict priority.
It is to distribute the approval of ID transmission of data packets to destination address from formation that transmission is authorized.
In one embodiment, the method that is used for strict priority weighted round robin scheduling comprises selects one group of bandwidth distribution list with common purpose address to fill clauses and subclauses, each filling clauses and subclauses is relevant with the packet of a reception, and each allocated bandwidth table clause is determined a dispatch weight in being selected group, and this dispatch weight is at first determined and determined by specified weight then by priority.
In one embodiment, the method that is used for strict priority weighted round robin scheduling comprises that receiving data divides into groups, this packet comprises destination address, priority and initial weight, structure and the relevant allocated bandwidth table clause of packet that receives, this allocated bandwidth table clause comprises destination address, priority and initial weight, after receiving relevant packet, with the increment in the predetermined value increase bandwidth distribution list, byte number in the packet that receives is counted, byte number in the relevant reception packet that block count in the bandwidth distribution list is set to be counted, allocated bandwidth table clause to relevant reception packet adds increment, allocated bandwidth table clause to relevant reception packet adds block count, select one group of bandwidth distribution list to fill clauses and subclauses with common purpose address, each filling clauses and subclauses is relevant with the packet of reception, by increment being multiplied by block count and product being added to the relevant initial weight of reception packet in bandwidth distribution list, calculate the specified weight of the packet of reception, the calculating of specified weight wherein takes place after the postamble of relevant reception packet, for each allocated bandwidth table clause in selected group is determined dispatch weight, this dispatch weight is at first determined and is determined by specified weight then by priority, if overflow will have the specified weight of selected clauses and subclauses of identical destination address and common priority reset to 0, and accept data packet transmission and authorize and transmit packet with minimum dispatch weight.
In another embodiment, a kind of computer-readable medium that comprises the instruction that is used for strict priority weighted round robin scheduling mechanism, be included in to receive after the packet and increase increment in the bandwidth distribution list with predetermined value, byte number in the packet that receives is counted, the byte number of the relevant reception packet that the block count in the bandwidth distribution list is set to be counted, calculate the specified weight of the packet of reception by increment being multiplied by block count and product being added to the relevant initial weight of reception packet in bandwidth distribution list, and each allocated bandwidth table clause is determined dispatch weight in being selected group, this dispatch weight is at first determined and is determined by specified weight then by priority, select one group of bandwidth distribution list to fill clauses and subclauses with common purpose address, each is filled clauses and subclauses and is associated with the packet of reception, wherein, the calculating of specified weight takes place after the postamble that receives relevant reception packet, reset to zero if overflow the specified weight that to be used to have the selected clauses and subclauses of identical destination address and common priority, accept data packet transmission and authorize and send packet with minimum dispatch weight.
In another execution mode, strict priority weighted round robin scheduling mechanism has computer-readable medium, this computer-readable medium comprises such instruction, be used in bandwidth distribution list structure and the relevant clauses and subclauses of packet that receive, these clauses and subclauses have index, destination address, priority, initial weight, increment and block count, be used to specify the index that is used for the allocated bandwidth table clause, be used for determining the priority of allocated bandwidth table clause, be used to distribute the initial weight of allocated bandwidth table clause, be used for after receiving relevant packet increasing the increment of allocated bandwidth table clause with predetermined value, and the byte number of the block count of the allocated bandwidth table clause reception packet that is set to be correlated with.
In another execution mode, a kind of system is suitable for providing strict priority weighted round robin scheduling, this system comprises memory and processor, this memory has the formation that wherein receives packet from the port identifiers that enters, this memory has bandwidth distribution list, this bandwidth distribution list has the index of comprising, destination address, priority, initial weight, the clauses and subclauses of increment and block count, these clauses and subclauses are relevant with the packet of reception, the all computer processors in this way of this processor, can be connected communicatedly with bandwidth distribution list with the formation in the memory, one group of allocated bandwidth table clause of processor selection wherein with common purpose address and priority, wherein in formation, receive the increment of packet preprocessor with predetermined value increase bandwidth distribution list, wherein processor is counted the byte number in the packet that receives, the byte number in the block count of the processor bandwidth distribution list reception packet that is set to be counted wherein, wherein processor calculates the specified weight that receives packet by increment being multiplied by block count and product being added to the initial weight that receives packet, wherein processor is that each allocated bandwidth table clause is determined dispatch weight in selected group, this dispatch weight is at first determined and is determined by specified weight then by priority, take place by of the described calculating of described processor after wherein in formation, receiving the postamble of relevant reception packet described specified weight, reset to zero if wherein overflow the specified weight of the selected clauses and subclauses that just will be used to have identical destination address and common priority, wherein processor is accepted the packet that data packet transmission is authorized and wherein processor has minimum dispatch weight from the formation transmission of memory from the formation of memory.
Description of drawings
Fig. 1 has described first a strict priority weighted round robin scheduling system according to a preferred embodiment of the present invention;
Fig. 2 has described second a strict priority weighted round robin scheduling system according to a preferred embodiment of the present invention;
Fig. 3 has described a bandwidth distribution list according to a preferred embodiment of the present invention;
Fig. 4 has described a software flow piece according to a preferred embodiment of the present invention;
Fig. 5 has described the 3rd a strict priority weighted round robin scheduling system according to a preferred embodiment of the present invention.
Embodiment
Referring now to Fig. 1, a kind of method that is used for strict priority weighted round robin (SPWRR) scheduling realizes that by means of a system 10 of the present invention this system 10 comprises a plurality of pieces that will be described below or module.These pieces or module are the combination of software, hardware, firmware and/or software, hardware and/or firmware.Dispatch packet 22,24 and 26 with route and enter a formation or SPWRR scheduler 12 so that carry out traffic carrying capacity control.Relevant with packet and be that traffic carrying capacity is controlled needed information stores in a bandwidth distribution list (BAT) 14.The packet that enters arrives formation from the entry port identifier that is designated as port id 16,18 and 20.These packets have priority.SPWRR scheduler 12 is connected with BAT by interface so that determine a dispatch weight of this packet.In case calculate dispatch weight, packet just is routed successively to being designated as and distributes ID28,30 and 32 destination address.
Referring now to Fig. 2, Fig. 2 has described a system 40 that is used for strict priority weighted round robin (SPWRR) scheduling in more detail, and this system comprises a plurality of and module.These pieces or module are the combination of software, hardware, firmware and/or software, hardware and/or firmware.When in formation or SPWRR scheduler 42 when receiving the postamble of associated data packet 56,58,60,62 and 64, the present invention will add predetermined value at the increment in the bandwidth distribution list 44.Block count is made of the byte number in packet, and this value is added among the BAT of associated data packet.The packet that enters has an initial weight.Join initial weight by product, come assigning weight of compute dependent data grouping increment and block count.
SPWRR scheduler 42 at first according to priority then according to the weight of distributing, select one group of non-NULL allocated bandwidth clauses and subclauses with common purpose address.Allocated bandwidth clauses and subclauses with a common purpose address assignment ID and common priority are called a WRR (WRR) group 66.If overflow situation, then will distribute to non-NULL allocated bandwidth clauses and subclauses with common purpose address, WRR group, weight be set to 0.
Strict priority weighted round robin mechanism can be determined queue sequence according to the weight of priority and application.At first select queue sequence,, then select queue sequence according to the weight of being distributed then if the clauses and subclauses that surpass more than 1 have same levels of priority according to priority.Receive after transmission authorizes, the table clause with destination address (distributing Id) 72,78 and 80 is distributed in scanning, and according to the weight of priority and distribution queue sequence is selected.The weight of priority and distribution allows dispatch weight is calculated.Minimum dispatch weight value in the same destination address group has the limit priority of dispatching next time.When on entry port identifier (port Id) 46,48,50,52 and 54, receiving packet, byte number calculated and gather be block count.In case the packet that receives in entering identifier sends postamble, just be added in the initial weight by the increment that will multiply by block count, the weight of being distributed is upgraded.If the weight of distributing causes overflowing, the assigning weight of clauses and subclauses that then all is assigned to the same-priority of same destination address resets to 0.If these clauses and subclauses are defined as the strict preference utmost point, then increment is set to 0.Packet is routed to 68,70,74 and 76 to distribute Id to suitable destination address.
Dispatching algorithm of the present invention will be described below.Preferably, this algorithm is included in the computer-readable medium or in the software, realizes but also can be included in the firmware and by hardware.
This algorithm comprises the steps:
1. wait the transmission of Id_x to be allocated to authorize, and enter into step 2;
2. select the bandwidth allocation table entries;
A. it is filled,
B. it distributes Id to equal to distribute Id_x,
C. its have minimum priority (with other clauses and subclauses of a and b condition coupling in),
3. if find clauses and subclauses then upgrade surface weight;
A. upgrade surface weight=initial weight+increment,
B. if overflow, then the weight of selecting all clauses and subclauses in the WRR group is reset (clauses and subclauses with same allocated id_x and equal priority).
C. send packet from formation
4. arrive step 1
Referring now to Fig. 3, piece and module are the combination of software, hardware, firmware and/or software, hardware and/or firmware.Bandwidth distribution list 90 comprises determines queue sequence and the needed information of packet route.Index 92 is values that each packet in the formation is discerned.Each formation can be relevant with the entry port identifier.
Each clauses and subclauses among the BAT distribute Id94 relevant with destination address.Same destination address can be used by more than one clauses and subclauses.Whenever work as more than one clauses and subclauses and be routed to same destination address, should utilize priority 96 or the weight of distributing or both to utilize, so that the bandwidth sharing between the specified data grouping.If do not have relevant destination address to distribute Id94, then in clauses and subclauses, Use Defaults 255.
When more than one packet is routed to same destination address, should specify scheduling mechanism.If used the mechanism based on priority, then each clauses and subclauses should be assigned to different levels of priority.If more than one clauses and subclauses need have identical priority, then should in same priority, specify assigning weight of each clauses and subclauses.The highest levels of priority is appointed as 0, and minimum levels of priority is appointed as 7, and the priority of acquiescence is set to 0.
When more than one packet was routed to the same destination address with same-priority level, the clauses and subclauses of this group were called the WRR group, and used strict priority weighted round robin scheduling mechanism to determine scheduling.The initial weight value 98 of acquiescence is 0 by hardware setting.Preferably, be worth when representing weighted value, this value do not made amendment when hardware uses this.The weight of distributing is relevant with assigning weight of other packet with same destination address and same-priority.
When receiving the postamble of associated data packet in formation, the increment 100 in the bandwidth distribution list increases a predetermined value.Block count 102 is used for the quantity of the piece that received of accumulative total formation.Module unit is represented the concrete quantity of the byte that formation has received.When formation received postamble, block count and increment multiplied each other and its result and initial weight addition, thereby determined the weight of distribution.This calculating has guaranteed that formation can send entire frame, because the weight of distributing is just upgraded up to postamble.This calculating has reduced the quantity of the fragment support that needs on optical line terminal, and has satisfied the bandwidth weighting requirement of formation.Because increment and block count are multiplied each other, so the size of the packet of route should correspondingly be complied with big minispread so that reduce the quantity of overflowing.
Strict priority schedule policy Combined Input of the present invention comprises computer-readable medium, and this computer-readable medium comprises the instruction of the clauses and subclauses that are used for constructing the bandwidth distribution list 90 relevant with the packet that receives.These clauses and subclauses comprise index 92, destination address (distributing Id) 94, priority 96, initial weight 98, increment 100 and block count 102.Strict priority weighted round robin scheduling mechanism comprises instruction, this instruction be used to specify the allocated bandwidth table clause index, determine the allocated bandwidth table clause priority, distribute the initial weight of allocated bandwidth table clause, when receiving associated data packet, increase the byte number of the reception packet that the block count of the increment of allocated bandwidth table clause and allocated bandwidth table clause is set to be correlated with predetermined value.
Referring now to Fig. 4, Fig. 4 has described the method 110 that is used for strict priority weighted round robin scheduling.The strict priority weighted round robin scheduling device receives the packet (112) that comprises destination address, priority and initial weight.Constitute BAT with the clauses and subclauses that comprise destination address, priority and initial weight.(114) are authorized in the transmission of accepting packet, and select one group of BAT (116) from the filling clauses and subclauses with common purpose address.When receiving associated data packet, increase increment (118) among the BAT, and the byte number of the packet that receives is counted (120) with predetermined value.The byte number of the relevant reception packet that the block count among the BAT is set to be counted, and increment is added to the BAT clauses and subclauses of the associated data packet that receives.Block count is added to the allocated bandwidth table clause of relevant reception packet.
Next, by increment being multiplied by block count and this product is added the initial weight of associated data packet in bandwidth distribution list that is received, the weight of the distribution of the packet that receives is calculated (122).After the postamble that receives associated data packet in the formation, the weight of distributing is calculated.Determine the dispatch weight of each allocated bandwidth table clause in selected group.This dispatch weight is at first determined by priority, determines (124) by the weight of distributing then.If overflow, then selected assigning weight of clauses and subclauses with same destination address and priority reset to 0 (126).The transmission that receives packet is authorized (114) and is transmitted the packet (128) with minimum dispatch weight.
Referring now to Fig. 5, SPWRR dispatching patcher 130 of the present invention comprises a plurality of or module, and these pieces or module are the combination of software, hardware, firmware and/or software, hardware and/or firmware.
Processor 132 can be connected to BAT and formation communicatedly.The instruction of this processor processing SPWRR scheduling 152 is so that carry out route and scheduling to the Business Stream of the packet in the network.
Though the illustrated embodiment of system of the present invention is illustrated in the accompanying drawings, and be described in the detailed description in front, but be to be understood that, the present invention is not limited to disclosed embodiment, many rearrange, revises and replace and do not break away from the spirit of the present invention of being listed and being limited by following claims but can have.For example, performance of the present invention can be realized by one or more management processors, presence server or web server module fully and/or partly.Simultaneously, these performances also can realize under current mode or distributed way, perhaps by providing and/or any equipment of receiving scheduling information is realized.In addition, though be described in a kind of concrete mode in this specification, various modules or piece can reappose, and do not depart from the scope of the present invention.For example, the function that is realized by BAT and formation can be the function that they are controlled oneself and are comprised.Furthermore, though be described in a kind of concrete mode in this specification, the present invention can use formation, scheduler, BAT, entry port identifier and the destination address of more or less quantity.In addition, can use still less or the packet of greater number and, so that realize the present invention, to the invention provides additional known features, and/or make the present invention more effective in order to realize that this packet of the present invention can comprise known side information.
Claims (10)
1. method that is used for strict priority weighted round robin scheduling comprises:
Receive packet, this packet comprises destination address, priority and initial weight;
Construct the allocated bandwidth table clause relevant with the packet of described reception, described allocated bandwidth table clause comprises described destination address, described priority and described initial weight;
When receiving described relevant packet, increase increment in the described bandwidth distribution list with predetermined value;
Byte number in the packet of described reception is counted;
Byte number in the described relevant reception packet that block count in the described bandwidth distribution list is set to be counted; And
By described increment being multiplied by described block count and this product being added the above relevant reception packet described initial weight in described bandwidth distribution list, calculate the specified weight of the packet of described reception, the calculating of described specified weight wherein takes place after the postamble that receives described relevant reception packet.
2. method according to claim 1 comprises the dispatch weight that is identified for each allocated bandwidth table clause in selected group, and described dispatch weight is at first determined and determined by specified weight then by described priority.
3. method according to claim 1 comprises if overflow, and the described specified weight that just will be used to have the selected clauses and subclauses of identical destination address and common priority resets to zero.
4. method according to claim 1 comprises that accepting described data packet transmission authorizes.
5. method according to claim 1 comprises that transmission has the described packet of minimum dispatch weight.
6. system that is suitable for providing strict priority weighted round robin scheduling comprises:
Memory, it has the formation that wherein receives packet from the port identifiers of introducing, described memory has bandwidth distribution list, described bandwidth distribution list has the clauses and subclauses that comprise index, destination address, priority, initial weight, increment and block count, and described clauses and subclauses are relevant with the packet of described reception; With
Processor can be connected to described formation and described bandwidth distribution list in the described memory communicatedly, and described processor is suitable for:
Select one group of allocated bandwidth table clause with common purpose address and priority;
Increase the increment of described bandwidth distribution list when in described formation, receiving described packet with predetermined value;
Byte number in the packet of described reception is counted;
Byte number in the described reception packet that the block count of described bandwidth distribution list is set to be counted;
By described increment being multiplied by described block count and taking advantage of product being added the described initial weight that the above receives packet, calculate the specified weight of described reception packet; And
Be identified for the dispatch weight of each allocated bandwidth table clause in selected group, described dispatch weight is at first determined and is determined by described specified weight then by priority.
7. system according to claim 6 takes place by the described calculating of described processor to described specified weight when wherein receiving the postamble of described relevant reception packet in described formation.
8. system according to claim 6, if wherein overflow, the described specified weight that described processor just will be used to have the selected clauses and subclauses of identical destination address and common priority resets to zero.
9. system according to claim 6, wherein said processor is accepted authorizing of described packet transmitted in the formation from described memory.
10. system according to claim 6, the formation transmission of wherein said processor from described memory has the described packet of minimum dispatch weight.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US62665204P | 2004-11-10 | 2004-11-10 | |
| US60/626,652 | 2004-11-10 | ||
| US11/269,934 | 2005-11-09 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1773962A true CN1773962A (en) | 2006-05-17 |
| CN100550831C CN100550831C (en) | 2009-10-14 |
Family
ID=36760725
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005101201776A Expired - Fee Related CN100550831C (en) | 2004-11-10 | 2005-11-10 | The gigabit passive optical network strict priority weighted round robin scheduling method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100550831C (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010145598A1 (en) * | 2009-11-03 | 2010-12-23 | 中兴通讯股份有限公司 | Configuration method, scheduling method for downlink priority scheduling and equipment thereof |
| CN101621460B (en) * | 2008-06-30 | 2011-11-30 | 中兴通讯股份有限公司 | Packet scheduling method and device |
| CN102523539A (en) * | 2011-12-15 | 2012-06-27 | 北京讯风光通信技术开发有限责任公司 | Passive optical network system having dynamic bandwidth allocation function |
| CN107908368A (en) * | 2017-11-16 | 2018-04-13 | 郑州云海信息技术有限公司 | A kind of single input storage organization and method with priority |
-
2005
- 2005-11-10 CN CNB2005101201776A patent/CN100550831C/en not_active Expired - Fee Related
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101621460B (en) * | 2008-06-30 | 2011-11-30 | 中兴通讯股份有限公司 | Packet scheduling method and device |
| WO2010145598A1 (en) * | 2009-11-03 | 2010-12-23 | 中兴通讯股份有限公司 | Configuration method, scheduling method for downlink priority scheduling and equipment thereof |
| CN102523539A (en) * | 2011-12-15 | 2012-06-27 | 北京讯风光通信技术开发有限责任公司 | Passive optical network system having dynamic bandwidth allocation function |
| CN107908368A (en) * | 2017-11-16 | 2018-04-13 | 郑州云海信息技术有限公司 | A kind of single input storage organization and method with priority |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100550831C (en) | 2009-10-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1237761C (en) | Multi-level scheduling method for multiplexing packets in a communications network | |
| US8289972B2 (en) | Gigabit passive optical network strict priority weighted round robin scheduling mechanism | |
| CN100348003C (en) | Programmable scheduling for IP routers | |
| CN1681263A (en) | Method and system for actively managing central queue buffer allocation using a backpressure mechanism | |
| CN1681262A (en) | Method and system for actively managing central queue buffer allocation | |
| US20010043564A1 (en) | Packet communication buffering with dynamic flow control | |
| CN1745549A (en) | System for content based message processing | |
| CN1199971A (en) | ATM cell buffer circuit and priority order allocating method at ATM switching system | |
| CN101057462A (en) | Method for priority based queuing and assembling of packets | |
| CN102238068B (en) | Message transmitting method and system | |
| CN1520663A (en) | Method and appts. for providing communications bandwidth to users having committed data rate based on priority assignment | |
| CN101986619A (en) | Bandwidth reservation-based VSAT satellite communication system bandwidth distribution method | |
| CN1579075A (en) | Method and systems for ordered dynamic distribution of packet flows over network processing means | |
| CN1541002A (en) | Calling acception controller and calling acception control method | |
| CN1362820A (en) | Method for selecting route for grouping in route apparatus | |
| CN1773962A (en) | Gigabit passive optical network strict priority weighted round robin scheduling mechanism | |
| CN1317180A (en) | Method for allocating/sharing resources among several communication network subscribers | |
| CN1359241A (en) | Distribution type dispatcher for group exchanger and passive optical network | |
| CN1968186A (en) | Message sending scheduling apparatus and method | |
| CN1192563C (en) | Band width split method using emulation weighting reasonable queue technology | |
| CN1643874A (en) | Scheduling using quantum and deficit values | |
| CN1728698B (en) | Parallel structured order preserved flow equilibrium system, and method for dispatching message based on sorted stream | |
| CN1694435A (en) | Frame-to-cell traffic scheduling | |
| CN1757206A (en) | System and method for providing differentiated services | |
| CN1315046C (en) | A method for allocating computation nodes in cluster job management 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: 20091014 Termination date: 20181110 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |