CN1298139C - Multi-stage dispatch method for supporting multi-port multi-business - Google Patents
Multi-stage dispatch method for supporting multi-port multi-business Download PDFInfo
- Publication number
- CN1298139C CN1298139C CNB031402038A CN03140203A CN1298139C CN 1298139 C CN1298139 C CN 1298139C CN B031402038 A CNB031402038 A CN B031402038A CN 03140203 A CN03140203 A CN 03140203A CN 1298139 C CN1298139 C CN 1298139C
- Authority
- CN
- China
- Prior art keywords
- service
- scheduling
- grade
- port
- level
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 230000015572 biosynthetic process Effects 0.000 claims description 49
- 238000005755 formation reaction Methods 0.000 claims description 49
- 238000007493 shaping process Methods 0.000 claims description 8
- 235000003642 hunger Nutrition 0.000 abstract description 3
- 230000037351 starvation Effects 0.000 abstract 1
- 238000005516 engineering process Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 238000012958 reprocessing Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6215—Individual queue per QOS, rate or priority
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/42—Loop networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/56—Queue scheduling implementing delay-aware scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/60—Queue scheduling implementing hierarchical scheduling
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Small-Scale Networks (AREA)
Abstract
The present invention relates to a multi-stage scheduling method supporting multiple ports and much service. The method comprises the steps that (A) different second-stage queues of A, B and C three service grades are respectively configured on all user side ports of a packet ring station for placing data received by the ports in classification; (B) a two-stage scheduling mechanism of service grade scheduling and port weighting scheduling is carried out for the operation of the second-grade queues of the ports; (C) various data obtained by two stages of scheduling enter the first-grade queue of the A, B and C service grades; (D) upper ring scheduling of flexible packet rings is carried out for the first-stage queue. The method of the present invention achieve the purposes that the service of multiple user ports needs to enter a loop circuit of flexible packet rings and all the user ports simultaneously have A, B and C service scheduling, and therefore, the priority scheduling sequence of all the ports of A service scheduling, B service scheduling and C service scheduling is fulfilled, so that the requirements of the A service and the B service for time delay and time delay jitter are guaranteed, and the starvation of all the ports in the same service grade can not occur.
Description
Technical field
The present invention relates to the multiple services multi-stage scheduling method of a kind of support multiport, relate in particular to and support a plurality of user ports in RPR (Resilient Packet Ring, the Resilient Packet Ring) equipment, and each user port is supported the dispatching method of multiple business.
Background technology
Resilient packet ring technology is an emerging technology; purpose set up exactly have that bandwidth is reusable, each node has fair algorithm and guarantees bandwidth usage, has ring protection and QOS (service quality; Quality of Service) Resilient Packet Ring of ability, its application are to insert looped network at key looped network in metropolitan area and metropolitan area.In December, 2000, IEEE set up the IEEE802.17 standard group specially, to formulate the IEEE802.17 MAC layer standard that can set up Resilient Packet Ring based on resilient packet ring technology.
The topmost feature of resilient packet ring technology is classified to business exactly, business is divided into A, B, C three class business, wherein category-A is a real time business, category-B is divided into two parts, B-CIR (committed information rate) is a committed rate grade business, B-EIR (excessinformation rate) is for surpassing the business of committed rate grade, and the C class is a Best-Effort service.The class of service position of definition Service Class in frame structure.And resilient packet ring technology enters the business of Resilient Packet Ring loop and carries out shaping and scheduling respectively according to A, B, C three classes to single Resilient Packet Ring website, enter afterwards in certain Resilient Packet Ring loop.As depicted in figs. 1 and 2, Resilient Packet Ring equipment generally comprises 2 Resilient Packet Ring loop side ports, the frame that enters and export from this port is the Resilient Packet Ring mac frame, have A, B, the professional class indication of C, and one group of user-side port, the user-side port majority is an ethernet port, and the frame that enters and export from this port is an ethernet frame, and frame structure is not with A, B, the professional class indication of C.A plurality of Resilient Packet Ring equipment are formed a Resilient Packet Ring ring by Resilient Packet Ring loop side ports.User-side port does not have formation in the existing Resilient Packet Ring equipment, carry out the A/B/C formation that just enters certain Resilient Packet Ring loop after certain forwarding operation when data enter certain user-side port, the integer scheduling operation that carries out standard then enters in certain Resilient Packet Ring loop.There are some problems in this way: user-side port often has a plurality of, and possible certain port traffic amount is big, and certain port traffic amount is little, is service earlier first according to existing way, and hunger phenomenon appears in the port that the possibility of result traffic carrying capacity is little.The business that enters such as certain user-side port may be that A service also may be category-B and c service again, what might be introduced into is a large amount of c services, after what enter is a spot of A service, according to existing way, it is service earlier first, the c service of the low priority that the result is a large amount of is by priority treatment, and the A service of high priority in c service with reprocessing, the time delay of A service and delay variation problem can't solve as a result.
Summary of the invention
Technical problem to be solved by this invention is: have a plurality of user-side port at Resilient Packet Ring equipment, the irrational defective of service dispatching between existing port provides a kind of and can better satisfy the business scheduling method that Resilient Packet Ring requires.
The present invention solves the problems of the technologies described above the technical scheme that is adopted to be:
The multiple services multi-stage scheduling method of a kind of support multiport may further comprise the steps:
Step 1: the configuration of each user-side port A, B of single grouping ring station point, the secondary formation that three grades of service of C are different are used for classifying and place the data that described port receives;
Step 2: formation moves the two-level scheduler mechanism that first grade of service scheduling rear port adds right scheduling to described port secondary;
Step 3: through described two-level scheduler to Various types of data enter in the one-level formation of A, B, the C grade of service;
Step 4: the business in the described one-level formation is carried out ring scheduling on the Resilient Packet Ring.
Above-mentioned each user-side port allows to enter minimum A, the B of Resilient Packet Ring loop, the bandwidth of c service can be disposed by the user.
The scheduling of the described grade of service of step 2 is to have precedence over category-B according to category-A, and category-B has precedence over that the priority orders of C class carries out; It is that weights according to each port carry out that the described port of step 2 adds right scheduling.
Above-mentioned weights are to obtain in the ratio that A, B, the c service bandwidth of user-side port configuration accounts for this website same line of business bandwidth according to the user.
And the port weights of the inhomogeneity grade of service can be designed to different value.
Each Resilient Packet Ring website has N user-side port, and described step 2 comprises following concrete steps:
21), judge whether all A grade of service formations of 1-N port are empty, if empty the continuation circulated;
22), if not empty, all N A service class queues of 1-N port are weighted scheduling, the A service that is scheduled for is delivered in the one-level formation of A service;
23), if the formation of all A grades of service all is scheduled sky, perhaps the one-level queue full of the A grade of service then carries out the scheduling of the B level grade of service;
24), judge whether all B grade of service formations of 1-N are empty, if empty the continuation circulated;
25), if not empty, all N b service class queues of 1-N port are weighted scheduling, the b service that is scheduled for is delivered in the one-level formation of b service;
26), if the formation of all B grades of service all is scheduled sky, perhaps the one-level queue full of the B grade of service then carries out the scheduling of the C level grade of service;
27), judge whether all C grade of service formations of 1-N are empty, if empty the continuation circulated;
28), if not empty, all N c service class queues of 1-N port are weighted scheduling, the c service that is scheduled for is delivered in the one-level formation of c service;
29), if the formation of all C grades of service all is scheduled sky, perhaps the one-level queue full of the C grade of service is got back to the scheduling of the A level grade of service; The circular flow above-mentioned steps.
The scheduling of the described upward ring of step 4 comprises carries out shaping and scheduling respectively to A, B, C three class business in the one-level formation.
And, having precedence over category-B according to category-A, category-B has precedence over the order of C class and carries out described shaping and scheduling.
In the time of above-mentioned scheduling class business, consume the credit value of respective class business, after described credit value was consumed to the greatest extent, such is professional just to suspend scheduling, then the another kind of business of scheduling.
The credit value of above-mentioned all kinds of business is to be determined by the A that allows to enter the Resilient Packet Ring loop, the B of place Resilient Packet Ring site configuration, c service total bandwidth.
Above-mentioned single Resilient Packet Ring website allows to enter A, the B of Resilient Packet Ring loop, the total bandwidth of c service can be disposed by the user.
Beneficial effect of the present invention is: because this method has disposed A, B, secondary formation that three grades of service of C are different in each user-side port, and designed a two-level scheduler mechanism that secondary formation elder generation grade of service scheduling rear port is added right scheduling, therefore can satisfy that the A service that each port enters is dispatched at first, category-B takes second place, the priority scheduling order that the C class is last, thereby guaranteed the requirement of category-A and b service, also made each port under the service conditions of same grade, hunger phenomenon can not occur simultaneously time delay and delay variation.Method of the present invention has solved the service needed that has a plurality of user ports effectively and has entered the Resilient Packet Ring loop, and there is the scheduling strategy under A, B, the C three class service conditions simultaneously in each user port.
Description of drawings
Fig. 1 is a Resilient Packet Ring equipment schematic diagram.
Fig. 2 is the scheduling framework schematic diagram of existing equipment.
Fig. 3 multi-stage scheduling framework of the present invention schematic diagram.
Fig. 4 is the Data Receiving flow chart.
Fig. 5 is the second-level dispatching flow chart.
Fig. 6 goes up ring scheduling flow figure.
Embodiment
With embodiment the present invention is described in further detail with reference to the accompanying drawings below:
As shown in Figure 3, be the multi-stage scheduling schematic diagram, each user-side port has disposed three formations, i.e. secondary formation, and each formation is corresponding A, B, the C three class grades of service respectively.Between secondary formation and one-level formation, also increased a second-level dispatching device, be used for moving the two-level scheduler mechanism that first grade of service scheduling rear port adds right scheduling, through two-level scheduler to data enter into the one-level formation of A, B, the C grade of service again.The user disposes total A service bandwidth, b service bandwidth, the c service bandwidth that this website allows to enter the Resilient Packet Ring ring, and disposes minimum A service bandwidth, b service bandwidth, c service bandwidth that each port allows to enter the Resilient Packet Ring ring.Wherein the minimum A service bandwidth that allows of each port of configuration and equate this corresponding relation is also arranged with the total A service bandwidth of this website of configuration for category-B and c service.
Collaborative the finishing of a plurality of flow processs of these method needs, its idiographic flow is as follows:
The Data Receiving flow process as shown in Figure 4, this flow process is responsible for receiving data, and the data that receive are carried out the classification of A, B, the C grade of service, simultaneously data are put into respectively under this port to grade of service formation that should data traffic class, i.e. in the secondary formation.
The second-level dispatching flow process as shown in Figure 5, this flow process is responsible for the two-level scheduler to the secondary formation.Setting the Resilient Packet Ring website has N user-side port, at first carries out the scheduling of the grade of service first order, promptly according to A-〉B-〉order of C carries out successively, judges earlier whether all A grade of service formations of port one-N are empty, if the sky continuation circulates to port 1-N; If non-NULL then carries out the second level scheduling of A service, i.e. all N A grade of service formations to port 1-N are weighted scheduling, and these weights get according to the ratio that the A service bandwidth of user configured this port accounts for the A service bandwidth of whole website.The A service data that are scheduled for are sent in the one-level formation of A service.The sky if the formation of all A grades of service all is scheduled, perhaps the one-level queue full of the A grade of service then carries out the scheduling of the B grade of service.The method of B grade of service scheduling is consistent with the method for above-mentioned A grade of service scheduling.The one-level queue full of the sky or the B grade of service if the formation of the B grade of service of all of the port all is scheduled then carries out the scheduling of the C grade of service, and the method for C grade of service scheduling is consistent with the method for above-mentioned A grade of service scheduling, and above-mentioned steps circulates again and again.Need to prove that the port weighted value of A, B, C different business grade can be designed to inequality.
Last ring scheduling flow carries out on the normal Resilient Packet Ring ring scheduling to the business in the one-level formation as shown in Figure 6, comprises according to A-〉B-〉the various shaping operations and the scheduling process of C priority order.When the scheduling A service, according to A0 and A1 credit value the A service of one-level formation to be carried out shaping, and consume the credit value of corresponding A0 or A1, the data after the shaping send to formation to be sent, enter Resilient Packet Ring.After the credit value of A0 and A1 was consumed to the greatest extent, then A service was just suspended scheduling, then the scheduling b service, and dispatch c service successively, the flow process and the A service of scheduling category-B c service are similar.The credit value of inhomogeneity business is the total bandwidth decision that is allowed to enter A, B, the c service of Resilient Packet Ring loop by the single Resilient Packet Ring website in place.
Though class of service sorting technique of the present invention is illustrated and describes, clearly the present invention is unrestricted.Under the condition that does not depart from by the determined the spirit and scope of the present invention of appended claims book, those skilled in the art will can take into account many corrections, replacing, variation, substitute and equivalent content.
Claims (11)
1, the multiple services multi-stage scheduling method of a kind of support multiport is characterized in that: may further comprise the steps:
Step 1, the configuration of each user-side port A, B at single Resilient Packet Ring website, the secondary formation that three grades of service of C are different are used for classifying and place the data that described port receives;
Step 2, formation moves the two-level scheduler mechanism that first grade of service scheduling rear port adds right scheduling to described port secondary;
Step 3, the Various types of data behind described two-level scheduler enter in the one-level formation of A, B, the C grade of service;
Step 4, the business in the described one-level formation is carried out on the Resilient Packet Ring ring scheduling.
2, method according to claim 1 is characterized in that: described each user-side port allows to enter minimum A, the B of Resilient Packet Ring loop, the bandwidth of c service can be disposed by the user.
3, method according to claim 2 is characterized in that: the scheduling of the described grade of service of described step 2 is to have precedence over category-B according to category-A, and category-B has precedence over that the priority orders of C class carries out; It is that weights according to each port carry out that the described port of described step 2 adds right scheduling.
4, method according to claim 3 is characterized in that: described weights are that the ratio that A, B, the c service bandwidth according to user-side port configuration accounts for this website same line of business bandwidth obtains.
5, method according to claim 4 is characterized in that: the port weights of the inhomogeneity grade of service can be designed to different value.
6, method according to claim 5 is characterized in that: each Resilient Packet Ring website has N user-side port, and described step 2 comprises following concrete steps:
21), judge whether all A grade of service formations of 1-N port are empty, if empty continuation circulation carries out 21;
22), if not empty, all N A service class queues of 1-N port are weighted scheduling, the A service that is scheduled for is delivered in the one-level formation of A service;
23), if the formation of all A grades of service all is scheduled sky, perhaps the one-level queue full of the A grade of service then carries out the scheduling of the B level grade of service;
24), judge whether all B grade of service formations of 1-N port are empty, if empty continuation circulation carries out 24;
25), if not empty, all N b service class queues of 1-N port are weighted scheduling, the b service that is scheduled for is delivered in the one-level formation of b service;
26), if the formation of all B grades of service all is scheduled sky, perhaps the one-level queue full of the B grade of service then carries out the scheduling of the C level grade of service;
27), judge whether all C grade of service formations of 1-N port are empty, if empty continuation circulation carries out 27;
28), if not empty, all N c service class queues of 1-N port are weighted scheduling, the c service that is scheduled for is delivered in the one-level formation of c service;
29), if the formation of all C grades of service all is scheduled sky, perhaps the one-level queue full of the C grade of service is got back to the scheduling of the A level grade of service.
7, method according to claim 2 is characterized in that: the scheduling of the described upward ring of step 4 comprises carries out shaping and scheduling respectively to A, B, C three class business in the one-level formation.
8, method according to claim 7 is characterized in that: have precedence over category-B according to category-A, category-B has precedence over the order of C class and carries out described shaping and scheduling.
9, method according to claim 8 is characterized in that: when dispatching certain class business, consume the credit value of respective class business, and after described credit value is consumed to the greatest extent, such professional just time-out scheduling, then the another kind of business of scheduling.
10, method according to claim 9 is characterized in that: the credit value of described all kinds of business is to be determined by the A that allows to enter the Resilient Packet Ring loop, the B of place Resilient Packet Ring site configuration, c service total bandwidth.
11, method according to claim 10 is characterized in that: described single Resilient Packet Ring website allows to enter A, the B of Resilient Packet Ring loop, the total bandwidth of c service can be disposed by the user.
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031402038A CN1298139C (en) | 2003-08-15 | 2003-08-15 | Multi-stage dispatch method for supporting multi-port multi-business |
| PCT/CN2004/000466 WO2005018154A1 (en) | 2003-08-15 | 2004-05-10 | A method supporting the multilevel schedule of multi-port and multi-traffic |
| RU2006107985/09A RU2350027C2 (en) | 2003-08-15 | 2004-05-10 | Method of multilevel planning supporting plural ports and set of services |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031402038A CN1298139C (en) | 2003-08-15 | 2003-08-15 | Multi-stage dispatch method for supporting multi-port multi-business |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1581790A CN1581790A (en) | 2005-02-16 |
| CN1298139C true CN1298139C (en) | 2007-01-31 |
Family
ID=34155247
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031402038A Expired - Fee Related CN1298139C (en) | 2003-08-15 | 2003-08-15 | Multi-stage dispatch method for supporting multi-port multi-business |
Country Status (3)
| Country | Link |
|---|---|
| CN (1) | CN1298139C (en) |
| RU (1) | RU2350027C2 (en) |
| WO (1) | WO2005018154A1 (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100384182C (en) * | 2005-02-24 | 2008-04-23 | 杭州华三通信技术有限公司 | The Method of Sending Messages on the Packet Ring |
| KR101084142B1 (en) | 2005-08-25 | 2011-11-17 | 엘지전자 주식회사 | Data transmission / reception method of downlink shared channel |
| CN100474845C (en) * | 2005-10-28 | 2009-04-01 | 上海交通大学 | Method for admitting controlling integral service model |
| CN100493019C (en) * | 2005-10-29 | 2009-05-27 | 华为技术有限公司 | Method and device for implementing ring configuration in ring network |
| US8824287B2 (en) * | 2008-04-24 | 2014-09-02 | Marvell International Ltd. | Method and apparatus for managing traffic in a network |
| CN101499973B (en) * | 2009-03-11 | 2012-05-23 | 中兴通讯股份有限公司 | Method for realizing full-line speed dispatching service flow by switch |
| CN101594307B (en) * | 2009-06-30 | 2012-12-05 | 中兴通讯股份有限公司 | Multi-queue based scheduling method and system |
| CN101784082A (en) | 2009-12-22 | 2010-07-21 | 中兴通讯股份有限公司 | Method and device for enhancing service quality in wireless local area network |
| CN102025639A (en) * | 2010-12-23 | 2011-04-20 | 北京星网锐捷网络技术有限公司 | Queue scheduling method and system |
| CN102594662A (en) * | 2012-01-20 | 2012-07-18 | 中兴通讯股份有限公司 | Realization method and device of quality of service |
| CN103379038B (en) * | 2012-04-12 | 2018-08-03 | 南京中兴新软件有限责任公司 | A kind of device and method of flow scheduling |
| CN102801626B (en) * | 2012-08-17 | 2015-02-11 | 北京空间飞行器总体设计部 | Satellite-borne data management method and device based on AOS standard |
| CN104410584A (en) * | 2014-12-16 | 2015-03-11 | 上海斐讯数据通信技术有限公司 | QoS queue level scheduling method |
| CN115242647A (en) * | 2021-04-06 | 2022-10-25 | 中国电信股份有限公司 | Method and apparatus for dynamic traffic shaping |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6205118B1 (en) * | 1995-12-28 | 2001-03-20 | Lucent Technologies Inc. | Adaptive time slot scheduling apparatus and method for end-points in an ATM network |
| CN1357188A (en) * | 1998-12-22 | 2002-07-03 | 鲍尔·埃克斯有限公司 | Data switching method and appts. |
| CN1384673A (en) * | 2001-05-08 | 2002-12-11 | 华为技术有限公司 | Dispatching method for comprehensive router service |
| CN1422475A (en) * | 2000-02-08 | 2003-06-04 | 天然网络技术有限公司 | Multi-level scheduling method for multiplexing packets in a communications network |
| CN1434643A (en) * | 2002-01-21 | 2003-08-06 | 华为技术有限公司 | Down data scheduling method for wireless grouping data transmission system |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2255418C (en) * | 1998-12-07 | 2003-01-21 | Pmc-Sierra Ltd. | Ring interface and ring network bus flow control system |
| US6914882B2 (en) * | 2001-03-30 | 2005-07-05 | Nokia, Inc. | Method and apparatus for improved queuing |
-
2003
- 2003-08-15 CN CNB031402038A patent/CN1298139C/en not_active Expired - Fee Related
-
2004
- 2004-05-10 WO PCT/CN2004/000466 patent/WO2005018154A1/en active Application Filing
- 2004-05-10 RU RU2006107985/09A patent/RU2350027C2/en active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6205118B1 (en) * | 1995-12-28 | 2001-03-20 | Lucent Technologies Inc. | Adaptive time slot scheduling apparatus and method for end-points in an ATM network |
| CN1357188A (en) * | 1998-12-22 | 2002-07-03 | 鲍尔·埃克斯有限公司 | Data switching method and appts. |
| CN1422475A (en) * | 2000-02-08 | 2003-06-04 | 天然网络技术有限公司 | Multi-level scheduling method for multiplexing packets in a communications network |
| CN1384673A (en) * | 2001-05-08 | 2002-12-11 | 华为技术有限公司 | Dispatching method for comprehensive router service |
| CN1434643A (en) * | 2002-01-21 | 2003-08-06 | 华为技术有限公司 | Down data scheduling method for wireless grouping data transmission system |
Also Published As
| Publication number | Publication date |
|---|---|
| RU2350027C2 (en) | 2009-03-20 |
| WO2005018154A1 (en) | 2005-02-24 |
| RU2006107985A (en) | 2006-08-10 |
| CN1581790A (en) | 2005-02-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1298139C (en) | Multi-stage dispatch method for supporting multi-port multi-business | |
| CN1310485C (en) | Method and system for open-loop congestion control in a system fabric | |
| US6721796B1 (en) | Hierarchical dynamic buffer management system and method | |
| US11159452B2 (en) | System and method for supporting efficient load-balancing in a high performance computing (HPC) environment | |
| US6934250B1 (en) | Method and apparatus for an output packet organizer | |
| CN1279728C (en) | Method and appts. for scheduling available link bandwidth between packet-switched data flows | |
| US20070002882A1 (en) | Buffer management policy for shared memory switches | |
| CN1738297A (en) | Improve the method for the service quality in the wireless network | |
| US20080063004A1 (en) | Buffer allocation method for multi-class traffic with dynamic spare buffering | |
| EP0989770A1 (en) | Packet transfer control apparatus and scheduling method therefor | |
| CN101594307B (en) | Multi-queue based scheduling method and system | |
| Chen et al. | SCOQ: A fast packet switch with shared concentration and output queueing | |
| CN115686826A (en) | A dynamic scheduling method and system based on space-based distributed satellite cluster | |
| US20080159138A1 (en) | Methods and devices for providing ingress routing in selective randomized load balancing | |
| CN1798090A (en) | Method for scheduling data packets in packet service | |
| CN1647471A (en) | Multiplexing of managed and unmanaged traffic flows over a multi-star network | |
| US7212524B1 (en) | Multicast connection scheduling in time:space:time switching fabrics | |
| CN1665315A (en) | Intelligent network overload control method based on service control point in multi-service environment | |
| US6647011B1 (en) | Method and system for switching using an arbitrator | |
| Shenker et al. | A symptotic analysis of large heterogeneous queueing systems | |
| Sheu et al. | A generalized channel preemption model for multiclass traffic in mobile wireless networks | |
| CN1221109C (en) | Load balancing switching device and method with multi-level buffer | |
| CN113938913B (en) | Resource allocation optimization method and device | |
| Chang et al. | Hierarchical QoS routing in ATM networks based on MDP cost function | |
| Atiquzzaman | Buffer dimensioning in ATM networks using no-priority and pushout space priorities |
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: 20070131 Termination date: 20170815 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |