CA2285245A1 - High speed packet scheduling method and apparatus - Google Patents

High speed packet scheduling method and apparatus Download PDF

Info

Publication number
CA2285245A1
CA2285245A1 CA002285245A CA2285245A CA2285245A1 CA 2285245 A1 CA2285245 A1 CA 2285245A1 CA 002285245 A CA002285245 A CA 002285245A CA 2285245 A CA2285245 A CA 2285245A CA 2285245 A1 CA2285245 A1 CA 2285245A1
Authority
CA
Canada
Prior art keywords
packet
time
session
virtual
finish time
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.)
Abandoned
Application number
CA002285245A
Other languages
French (fr)
Inventor
Mahesh N. Ganmukhi
Tao Yang
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.)
Ascend Communications Inc
Original Assignee
Individual
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 Individual filed Critical Individual
Publication of CA2285245A1 publication Critical patent/CA2285245A1/en
Abandoned legal-status Critical Current

Links

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/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2408—Traffic characterised by specific attributes, e.g. priority or QoS for supporting different services, e.g. a differentiated services [DiffServ] type of service
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L12/5602—Bandwidth control in ATM Networks, e.g. leaky bucket
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/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/52—Queue scheduling by attributing bandwidth to queues
    • H04L47/522—Dynamic queue service slot or variable bandwidth allocation
    • 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
    • H04L47/564—Attaching a deadline to packets, e.g. earliest due date first
    • 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
    • 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/621—Individual queue per connection or flow, e.g. per VC
    • 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
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/622—Queue service order
    • H04L47/623—Weighted service order
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5649—Cell delay or jitter
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5651—Priority, marking, classes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5679—Arbitration or scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/568—Load balancing, smoothing or shaping
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5681—Buffer or queue management

Abstract

A packet scheduler is disclosed which provides a high degree of fairness in scheduling packets associated with different sessions. The scheduler also minimizes packet delay for packet transmission from a plurality of sessions which may have different requirements and may operate at different transfer rates. When a packet is received by the scheduler, the packet is assigned its own packet virtual start time based on whether the session has any pending packets and the values of the virtual finish time of the previous packet in the session and the packets arrival time. The scheduler then determines a virtual finish time of the packet by determining the transfer time required for the packet based upon its length and rate and by adding the transfer time to the packet virtual start time of the packet. The packet with the smallest virtual finish time is then scheduled for transfer. By selecting packets for transmission in the above described manner, the available bandwidth may be shared in pro-rata proportion to the guaranteed session rate, thereby providing a scheduler with a high degree of fairness while also minimizing the amount of time a packet waits in the scheduler before being served.

Description

TITLE OF THE INVENTION
High Speed Packet Scheduling Method and Apparatus ~ 5 CROSS REFERENCE TO RELATED APPLICATIONS
This application claims priority of patent application serial number 60/042,943 filed April 4, 1997.
STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR

DEVELOPMENT

Not Applicable BACKGROUND OF THE INVENTION

High speed packet networks, such as Asynchronous Transfer Mode (ATM) networks, support connections to multiple sessions which operate at different packet transfer rates.

Packet scheduling must be handled such that packets are transferred from the different sessions with minimal delays, while maximizing the use of available bandwidth. Ideally, a scheduler should fairly arbitrate packets for delivery while being cost effective to implement. Many schedulers are known which are either simple to implement but do not fairly arbitrate between packets of different sessions, or provide fair arbitration but are costly to implement. A class of schedulers known as Packet Fair Queuing (PFQ) schedulers (described below) are cost effective to implement and include Virtual Clock (VC) schedulers, Self Clocked Fair Queuing (SCFQ) schedulers, Start Time Fair Queuing (STFQ) schedulers and Deficit Round Robin Fair Queuing (DRRFQ) schedulers.

VC schedulers provide every session with a guaranteed throughput. Each user requests an allocation for the amount of traffic the user expects. The packets are then time stamped and placed in a queue according to the value of their time stamp. One drawback to this method is there is no way to detect or correct errors. VC schedulers have a tight delay bound that is independent of the number of sessions involved in order to provide for delay minimization, however, VC schedulers do not allocate available bandwidth as fairly as some other schedulers.

Self Clocked Fair Queuing (SCFQ) schedulers as well as Start Time Fair Queuing (STFQ) schedulers have a high degree of fairness for allocating bandwidth. However, they do not have the desired delay minimization since the virtual time is not strictly monotonically increasing, and their delay bounds are proportional to the number of sessions involved.

DRRFQ schedulers have a degree of fairness but are less effective when load balancing or distributed queues are used.

Other types of PFQ schedulers, such as Worst-case Fair Weighted Fair Queuing (WF2Q), Worst Case Fair Weighted Fair Queuing Plus (WFZQ+) and Packetized Generalized Processor Sharing (PGPS) offer better performance but are more costly to implement than the SCFQ, STFQ and DRRFQ schedulers.

The WFzQ and WF2Q+ schedulers have both a high degree of fairness, effectively minimize scheduling delay through the scheduler and have a tight delay bound that is independent of the number of sessions involved. The implementation costs of WFZQ and WFzQ+ schedulers however are high compared to other schedulers since the WFZQ and WF2Q+ schedulers must perform two searches on each session, one search for determining the packet start times of the first packet in each session and another search for determining the packet start times of the backlogged packets in each session. Other schedulers typically perform only a single search of the first packet of each session to determine the packet start times for each such packet.

PGPS schedulers are similar to the WFzQ and WF2Q+

schedulers, especially when utilizing packets having a small ......_.. ...... ~ .~
packet size, however the PGPS schedulers are better at . minimizing worst-case session delay; that is, the amount of time a session has to wait before it can schedule a packet for transfer.
Accordingly, it would be desirable to have a scheduler which is cost effective to implement and which is capable of scheduling the transmission of packets from different sessions such that the individual demands on throughput and delay can be met in a fair and efficient manner.
BRIEF SUMMARY OF THE INVENTION
A packet scheduler is disclosed which provides a high degree of fairness in scheduling packets associated with different sessions. The scheduler also minimizes packet delay for packet transmission from a plurality of sessions which may have different requirements and rnay operate at different transfer rates. When a packet is received by the scheduler, the packet is assigned its own packet virtual start time based on whether the session has any pending packets and the values of the virtual finish time of the previous packet in the session and the packets arrival time.
The scheduler then determines a virtual finish time of the packet by determining the transfer time required for the packet based upon its length and rate and by adding the transfer time to the packet virtual start time of the packet .
The packet with the smallest virtual finish time is then scheduled for transfer. By selecting packets for transmission in the above described manner, the available bandwidth may be shared in pro-rata proportion to the guaranteed session rate, thereby providing a scheduler with a high degree of fairness while also minimizing the amount of time a packet waits in the scheduler before being served.
BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING
The invention will be more fully understood from the following detailed description taken in conjunction with the accompanying drawings in which:
Fig. 1 is a block diagram of a scheduler in accordance with the present invention;
Figs. 2a-2b show a flow chart illustrating the method employed in the presently disclosed scheduler;
Fig. 3 is a set of graphs illustrating results of a first test of the three schedulers;
Fig. 4 is a set of graphs illustrating results of a second test of three schedulers;
Fig. 5 is a set of graphs illustrating results of a third test of three schedulers;
Fig. 6 is a set of graphs illustrating results of a fourth test of three schedulers;
Fig. 7 is a set of graphs illustrating results of a fifth test of three schedulers;
Fig. 8 is a table illustrating the traffic composition for the results of the five tests illustrated in Figs. 3-8;
and Figs. 9a-9b show a flow chart illustrating an additional method which may be employed in the scheduler in accordance with the present invention.
DETAILED DESCRIPTION OF THE INVENTION
A Start Time Clocked Fair Queuing (STCFQ) scheduler 1 in accordance with the present invention is shown in Fig. 1.
The scheduler 1 has inputs for receiving packets for multiple sessions 10, 20, 30. Each of the sessions has a respective transfer rate r, 40, r2 50, and r3 60. The scheduler further includes inputs for receiving a packet belonging to one of ,.

WO 98145990 PCTIUS98l06298 _5_ the sessions and an output 70. V~Ihile only three sessions 10, _ 20, and 30 are presently illustrated for purposes of explanation, the scheduler 1 can receive inputs corresponding to more sessions.
Packets in multiple sessions 10, 20, 30 having transfer rates rl, r2, rn respectively, must be scheduled so that throughput and delay criteria can be met in a fair and efficient manner. A single channel supports a session having a transfer rate r, measured in bits per second. The scheduler schedules the transmittal of packets generated from n different sessions. The transfer rate of each session has a transfer rate which may differ from the transfer rates of the other sessions. Once the scheduler finishes transferring a packet from a session, the scheduler then begins serving another packet from either the same session or a different session.
In the illustrative example, session 1 needs a throughput of rl, session 2 needs a throughput of rz and session n needs a throughput of rN. Rate rl may be at a similar or different rate than r2. The presently disclosed scheduler assures the respective throughputs rl, r2, . . . rN by sharing the available bandwidth of the output channel 70 in proportion to the respective sessions needed transfer rates.
The condition rl + rz + ... + rN s r must be satisfied to assure the respective throughputs rl, r2, ... rN. The STCFQ
scheduler is work-conserving in that the scheduler always schedules a packet transmission as long as at least one session is not empty. The bandwidth which would have been allocated for an empty session is distributed among active sessions proportional to their respective rates.
As an example, assume that rate rl is 10 megabytes/sec (Mbps) , that rate r2 is 20 Mbps, that r" = r3 and that rate r3 is 30 Mbps. Further assume that the output 70 has 100Mbps bandwidth. The summation of all the input rates is lOMbps + 20Mbps + 30Mbps - 60Mbps. since the output bandwidth is 100Mbps, the available bandwidth is the output rate minus the summation of the input rates; i.e. 100Mbps - 60Mbps = 40Mbps.
This available bandwidth is divided up among the three sessions in proportion to their respective transfer rates.
Thus, the bandwidth allocated to session 1 is:
rl + (available bandwidth * rl / summation) -10 + (40 * 10 / 60} - l7Mbps the bandwidth allocated to session 2 is:
r2 + (available bandwidth * r2 / summation) -20 + (40 * 20 / 60) - 32Mbps and the bandwidth allocated to session 3 is:
rN + (available bandwidth * rN / summation) -30 + (40 * 30 / 60) - 50Mbps Thus, the available bandwidth is divided among the sessions in a weighted manner, such that the sessions with the higher transfer rates receive a concomitant larger proportion of the available bandwidth.
One prior art scheduler divides any additional available bandwidth equally among the sessions. Using the example transfer rates above, the prior art scheduler would allocate bandwidth according to the following formula:
session 1 - rl + (available bandwidth / number of sessions) 10 + (40/3)= 23.3 Mbps _7_ session 2 - r2 + (available bandwidth / number of sessions) 20 + (40/3)= 33.3 Mbps session 3 - r3 + (available bandwidth / number of sessions) 30 + (40/3) = 43 .3 Mbps While in the prior art scheduler the allocation is simple to implement, the available bandwidth is equally divided among the remaining sessions, instead of being divided in proportion to the assigned rates. Thus the prior art scheduler does not achieve the fairness of the presently disclosed STCFQ scheduler.
Further, if session 2 were eliminated, the bandwidth allocated by the STCFQ scheduler would be as follows:
session 1 - rl + (available bandwidth * rl / summation) 10 + (60 * 10/40)= 25 Mbps session 3 - r3 + (available bandwidth * r, / summation) 30 + (60 * 30/40)= 75 Mbps.
The bandwidth allocated by the prior art scheduler would result in:
session 1 - rl + (available bandwidth / number of sessions) 10 + (60/2)= 40 Mbps session N = rN + (available bandwidth / number of sessions) + (60/2)= 60 Mbps Thus, in the STCFQ scheduler the faster session is allocated a larger portion of the additional available bandwidth since 30 the STCFQ scheduler takes in to consideration the transfer rate and the packet length as part of the determination of the packet virtual finish time of the packet then schedules _g_ the packets according to their virtual f finish times . As such, a high degree of utilization of available bandwidth is achieved.
Figs. 2a and 2b illustrate the method employed in the presently disclosed STCFQ scheduler which includes two basic operations : Enqueue ( ) and Dispatch ( ) . The Enqueue ( ) operation 100 updates the virtual finish time of a session i (if necessary) and appends the packet to the end of the session i queue. Operation Dispatch() 200, shown in Fig. 2b, is executed whenever the scheduler is ready to schedule the next packet for transmission. It should be noted that the scheduler is not a channel or a link and therefore is not responsible for packet transmission. For this reason, it is possible that operation Dispatch() is being executed while some other packet. is being transmitted by the link.

Associated with the scheduler is the system virtual time. In addition, each session has its own virtual finish time, which is equal to the virtual finish time of the packet at the head of the session i queue. Initially, the system virtual time and the virtual finish time of each session are set to zero.

Referring now to Fig. 2a, the Enqueue(i) operation 100 is activated when a session i packet arrives, as shown in step 110. When the packet is received the packet arrival time of the received packet is set to the current value of the system virtual time. A determination of the packet virtual finish time is performed next. The transfer time of the packet is determined by dividing the packet length by the packet transfer rate. The packet transfer time is added to the packet virtual start time in order to obtain the packet virtual finish time.

At step 120 a determination is made if the session i _g_ queue is empty. If there are other packets in the session i queue, then the current packet is appended to the end of the session i queue, as shown in step 160 and the Enqueue(i) operation is complete, as shown in step 170. If the session i queue is empty then, as shown in step 130, the system virtual time is compared with the virtual finish time of session i (the virtual finish time of the last packet of session i transmitted prior to the arrival of this new packet). As shown in step 140, if the system virtual time is greater than the virtual finish time of session i, then the virtual finish time of session i is replaced by the system virtual time plus the packet length divided by the rate allocated to session i. Otherwise, as shown in step 150, the virtual finish time of session i is increased by the packet length divided by the rate allocated to session i.

Next the current packet is appended to the end of the session i queue, as shown in step 160 and the Enqueue (i) operation is complete, as shown in step 170.

Referring now to Figure 2b, the Dispatch ( ) operation 200 is shown. When the scheduler is ready to schedule another packet for transmission, the Dispatch() operation 200 is executed, as shown in step 205. As shown in step 210, a determination is made if all the session queues are empty.

If all the session queues are empty then the system virtual time and the virtual finish times of all sessions are set to zero, as shown in step 230 . The Dispatch ( ) operation is then finished, as shown in step 295. If there are one or more sessions whose queue is not empty, then the scheduler determines which session (session i) has the smallest virtual finish time among all the sessions which have a pending packet, as shown in step 220. At step 240, the scheduler determines if the system virtual time is less than the session i virtual finish time minus the session i head packet length divided by the allocated rate. If this is true then, as shown in step 260, the system virtual time is replaced by the session i virtual finish time minus the session i head packet length divided by the allocated rate. Tf the system virtual time is not less than the session i virtual finish time minus the session i head packet length divided by the allocated rate the system virtual time is increased by the session i head packet length divided by the allocated rate as shown in step 250. After completion of steps 250 or 260 the session i head packet is removed from the session i queue, as shown in step 270. The scheduler then, as shown at step 280, determines if the session i queue is empty. If the session i queue is empty then the Dispatch() operation is finished, as shown in step 295. If the session i queue is not empty, step 290 increases the session i virtual finish time by the session inn new head packet length divided by the rate allocated to session i. The Dispatch() operation is then finished, as shown in step 295.

Accordingly, for the STCFQ scheduler the system virtual time, which is used as part of the determination of when the packets are scheduled for transfer, always keeps up with the virtual start time of the packet being served.

Referring now to Figs. 3-7, simulation results for the STCFQ scheduler are presented along with those for SCFQ and WFZQ+ schedulers. In all the simulations runs, three classes of sources are used: a Constant Bit Rate (CBR) source which is deterministic, a real time Variable Bit Rate (rtVBR) source, and Available Bit Rate (ABR) source utilizing Poisson processes. The mean rates of all the ABR sources are intentionally made much larger than their respective guaranteed throughput so that there will always be ABR cells ,.

WO 98/45990 PCT/tJ598/06298 available in the system to use the spare bandwidth from real time connections such as CBR and rtVBR, thereby resulting in a link utilization of 1000.
. The three schedulers are compared under a flat scheduling structure as shown in Fig. 1. In flat scheduling a single scheduler (either SCFQ, WF~Q+, or STCFQ) is used for all connections.
Results of five simulation tests are shown in Figs. 3-7, each representing a particular traffic scenario of interest.
In the first two tests, all connections are homogeneous. In test #3, three different types of sources are used while in both tests #4 and #5 more than 10 different types of sources are used. The composition or traffic and other system parameters of the five tests are shown in the table of Fig. 8. For example, in Test #3, 130 sources (source number 0-99 are VBR1, number 100 to number 119 are VHR4, and number 120 to number 129 are ABR1) share a total of 82.5 Mbps bandwidth.
For each test shown in Figs. 3-7, two graphs, (a) and (b), are plotted. In the (a) graph, the mean cell delay (sum of cell delays divided by the number of cells transmitted during the simulation run) of each connection (source) is given for each of the three schedulers. In the (b) graph, the maximum delay (the largest cell delay recorded during the simulation run) of each connection is given for each of the three schedulers. It should be noted that Fig. 8 can be used to identify the source type of each connection in the Figures. For example, source #45 in Test #1 (Fig. 3) is a CBR1 source while source #106 in Test #3 (Fig. 5) is a VBR4 source.
From Fig. 8, it can be seen that in Test #1 100 CBR1 connections (each with a peak rate of 64 Kbps) share a single WO 9814599a PCT/US98/06298 link of capacity 6.4 Mbps (link utilization - 100%). as illustrated in Figure 4, cell delays (both mean and maximum) are identical under the three scheduling schemes for all connections since all connections have the same scheduling interval and for this reason all three schemes behave the same. Additionally, the maximum delays are very close to the mean delays of most of the connections due to the periodic nature of the CBR traffic.

In test #2 (Fig. 4), 100 VBR1 (voice) connections share a single link of capacity 3.44 Mbps (link utilization = 640).

Here again, the delays (both mean and maximum) are identical under the three schedulers for all connections since they have the same scheduling interval and all three schedulers behave the same in this scenario. However, unlike Test #1, the maximum delays are much larger than the mean delays due to the variable nature of the VBR traffic.

Test #3 (Fig. 5) has 100 VBRl, 20 VBR4 and 10 ABR1 connections sharing a single link of 82.5 Mbps. The average rate of the ABR1 sources are relatively large (10 Mbps each) , resulting in a link utilization of 100%. As shown in Fig. 5, the 120 VBR connections are protected from the overloading by the 10 ABR sources. In this test the advantages of WFzQ+

and STCFQ over SCFQ are apparent, the delay performance (both the mean and the maximum) of WF2Q+ and STCFQ is almost identical and is significantly better than that of the SCFQ.

As the traffic mixture becomes more complicated in Test #4 and Test #5 (Figs. 6 and 7 respectively) the advantages of both WF2Q+ and STCFQ become more visible. In Figs. 6 and 7, it is apparent that the WFZQ+ offers significantly better delay performance for all CBR and VBR connections than SCFQ does. The WFZQ+ is better than the STCFQ only for low throughput (64Kbps) connections (e.g., CBR1, VBR1, VBR2, and ' CA 02285245 1999-10-O1 PCT/US ~f~ ~ 0 6 2 9 g a IPEA/US 4 Nov ~gg~

VBR3) and the two have nearly the same delay performance for other connections.

Therefore, the STCFQ scheduler is clearly better than the SCFQ scheduler with respect to delay performance for real time connections and it is nearly as good as the WFZQ+ except for low throughput connections, while being more cost effective to implement than the WFzQ+ scheduler.

Figs. 9a and 9b illustrate the method employed in the presently disclosed Minimum Start Time Clocked Fair Queuing Plus MSTCFQ+ scheduler. This scheduler includes two basic operations Enqueue(i) and Dispatch(). The Enqueue(i) operation 300 updates the virtual finish time of a session i (if necessary) and appends the packet to the end of the session i queue . Operation Dispatch ( ) 400 , shown in Fig .
9b, is executed whenever the scheduler is ready to schedule the next packet for transmission. It should be noted that the scheduler is not a channel or a link and therefore is not responsible for packet transmission. For this reason, it is possible that operation Dispatch() is being executed while some other packet is being transmitted by the link.

Associated with the scheduler is the system virtual time. In addition, each session has its own virtual finish time, which is equal to the virtual finish time of the packet at the head of the session i queue and further includes a counter G that keeps track of the number of packets whose virtual start time is the same as the system virtual time.

Counter G is used to decide when to increase the system virtual time. Initially, the system virtual time, the virtual finish time of each session and the counter G are set to zero.

Referring now to Fig. 9a, the Enqueue(i) operation 300 is activated when a session i packet arrives, as shown in MENDED SHE

WO 98!45990 PCT/US98106298 step 310. When the packet is received the packet arrival time of the received packet is set to the current value of the system virtual time. A determination of the packet virtual finish time is performed next. The transfer time of the packet is determined by dividing the packet length by the packet transfer rate. The packet transfer time is added to the packet virtual start time in order to obtain the packet virtual finish time.

At step 320 a determination is made if the session i queue is empty. If there are other packets in the session i queue, then the current packet is appended to the end of the session i queue, as shown in step 360 and the Enqueue(i) operation is complete, as shown in step 370. If the session i queue is empty then, as shown in step 330, the system virtual time is compared with the virtual finish time of session i (the virtual finish time of the last packet of session i transmitted prior to the arrival of this new packet). As shown in step 340, if the system virtual time is greater than the virtual finish time of session i, then the virtual finish time of session i is replaced by the system virtual time plus the packet length divided by the rate allocated to session i and the value of G is incremented. Otherwise, as shown in step 350, the virtual finish time of session i is increased by the packet length divided by the rate allocated to session i . Next the current packet is appended to the end of the session i queue, as shown in step 360 and the Enqueue(i) operation is complete, as shown in step 370.

Referring now to Fig. 9b, the Dispatch() operation 400 is shown. When the scheduler is ready to schedule another packet for transmission, the Dispatch() operation 400 is started, as shown in step 410. As shown in step 420, a determination is made if all the session queues are empty.

If all the sessions are empty then the system virtual time, the virtual finish times of all sessions and counter G are set to zero, as shown in step 440. The Dispatch() operation is then finished, as shown in step 520. If there are one or more sessions whose queue is not empty, then the scheduler determines which session (session i) has the smallest virtual finish time among all the sessions which have a pending packet, as shown in step 430. At step 450, the scheduler determines if the system virtual time is less than the session i virtual finish time minus the session i head packet length divided by the allocated rate and if G = 0. If this is true then, as shown in step 470, the system virtual time is replaced by the session i virtual finish time minus the session i head packet length divided by the allocated rate and G is set to 1. At step 460, if the system virtual time is equal to the session i virtual finish time minus the session i head packet length divided by the allocated rate than G is decreased by 1. If the determination in step 460 is not true or after the completion of step 470 or 480 the session i head packet is removed from the session i queue, as shown in step 490. The scheduler then, as shown at step 500, determines if the session i queue is empty. If the session i queue is empty then the Dispatch ( ) operation is finished, as shown in step 520. If the session i queue is not empty, step 510 increases the session i virtual finish time by the session i new head packet length divided by the rate allocated to session i. The Dispatch() operation is then finished, as shown in step 520.

The STCFQ and MSTCFQ+ schedulers provide a high degree of fairness and delay minimization which are necessary for scheduling packets from multiple sessions each of which may have different characteristics and correspondingly different requirements. This high level of fairness and delay minimization are achieved since the available bandwidth of the scheduler is distributed among sessions requiring service according to the virtual start time of the packet, the transfer rate of the session and the length of the packet.
Additionally, the STCFQ and MSTCFQ-~ schedulers are inexpensive to implement.
Having described preferred embodiments of the invention it will now become apparent to those of ordinary skill in the art that other embodiments may be used. Accordingly, it is submitted that the invention should not be limited to the described embodiment but rather should be limited only by the spirit and scope of the appended claims.
_..__.._. _.._ r

Claims (13)

-17- We claim:
1. A method for scheduling packet transmission in a network communications device comprising the steps of:
determining a system virtual time;
receiving at least one packet associated with a session, each packet having a packet length in bits and a packet rate, each session having a session virtual finish time;
determining for each of said at least one packet a packet arrival time, [a packet virtual start time,] a packet transfer time, and a packet virtual finish time;
setting the packet arrival time for each of said at least one packet to the current value of the system virtual time;
determining the packet virtual start time for each of said at least one packet;
dividing the packet length by the packet rate to obtain the packet transfer time for each of said at least one packet;
summing the packet virtual start time and the packet transfer time to obtain the packet virtual finish time for each of said at least one packet;
determining which one of said received at least one packet has the smallest packet virtual finish time;
moving said packet into a queue associated with said session if said queue is empty;
updating the session virtual finish time if said queue associated with said session is not empty and moving said packet into said queue associated with said session;
setting the system virtual time and all session virtual finish times to zero if all sessions are empty;
determining which session has the smallest virtual finish time among all sessions which have a pending packet;
updating the system virtual time when the system virtual time is less than the session virtual finish time minus the packet transfer time by setting the system virtual time to the session virtual finish time minus the packet transfer time, and when the system virtual time is not less than the session virtual finish time minus the packet transfer time by adding the packet transfer time to the system virtual time;
transmitting the packet having the smallest packet virtual finish time; and updating the session virtual finish time if the session has a pending packet.
2. The method of claim 1 wherein the step of updating the session virtual finish time if said queue associated with said session is not empty comprises the step of setting the session virtual finish time equal to the packet virtual finish time if the system virtual time is greater than the session virtual finish time.
3. The method of claim 1 wherein the step of updating the session virtual finish time if said queue associated with said session is not empty comprises the step of adding the packet virtual finish time to the session virtual finish time if the system virtual time is not greater than the session virtual finish time.
4. CANCELLED
5. CANCELLED
6. The method of claim 1 wherein said step of updating the session virtual finish time if the session has a pending packet further comprises the step of increasing the session virtual finish time by the packet transfer time of the next packet pending in the session.
7. A method for scheduling packet transmission in a network communications device comprising the steps of:

determining a system virtual time;
initializing a counter when the network communications device is initialized;
receiving at least one packet associated with a session, each packet having a packet length in bits and a packet rate, each session having a session virtual finish time;
determining for each of said at least one packet a packet arrival time, [a packet virtual start time,] a packet transfer time, and a packet virtual finish time;
setting the packet arrival time for each of said at least one packet to the current value of the system virtual time;
determining the packet virtual start time for each of said at least one packet;
dividing the packet length by the packet rate to obtain the packet transfer time for each of said at least one packet;
summing the packet virtual start time and the packet transfer time to obtain the packet virtual finish time for each of said at least one packet;
determining which one of said received at least one packet has the smallest packet virtual finish time;
moving said packet into a queue associated with said session if said queue is empty;
updating the session virtual finish time if said queue associated with said session is not empty and moving said packet into said queue associated with said session;
setting the system virtual time and all session virtual finish times to zero if all sessions are empty;
determining which session has the smallest virtual finish time among all sessions which have a pending packet;
updating the system virtual time when the system virtual time is less than the session virtual finish time minus the packet transfer time by setting the system virtual time to the session virtual finish time minus the packet transfer time, and when the system virtual time is not less than the session virtual finish time minus the packet transfer time by adding the packet transfer time to the system virtual time;
transmitting the packet having the smallest packet virtual finish time; and updating the session virtual finish time if the session has a pending packet.
8. The method of claim 7 further comprising the step of setting the counter to zero if all sessions are empty.
9. The method of claim 7 wherein the step of updating the session virtual finish time if said queue associated with said session is not empty comprises the steps of setting the session virtual finish time equal to the packet virtual finish time and incrementing the counter if the system virtual time is greater than the session virtual finish time.
10. The method of claim 7 wherein the step of updating the session virtual finish time if said queue associated with said session is not empty comprises the step of adding the packet virtual finish time to the session virtual finish time if the system virtual time is not greater than the session virtual finish time.
11. CANCELLED
12. CANCELLED
13. The method of claim 7 wherein said step of updating the session virtual finish time if the session has a pending packet further comprises the step of increasing the session virtual finish time by the packet transfer time of the next packet pending in the session.
CA002285245A 1997-04-04 1998-03-27 High speed packet scheduling method and apparatus Abandoned CA2285245A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US4294397P 1997-04-04 1997-04-04
US60/042,943 1997-04-04
PCT/US1998/006298 WO1998045990A1 (en) 1997-04-04 1998-03-27 High speed packet scheduling method and apparatus

Publications (1)

Publication Number Publication Date
CA2285245A1 true CA2285245A1 (en) 1998-10-15

Family

ID=21924585

Family Applications (2)

Application Number Title Priority Date Filing Date
CA002285245A Abandoned CA2285245A1 (en) 1997-04-04 1998-03-27 High speed packet scheduling method and apparatus
CA002285243A Abandoned CA2285243A1 (en) 1997-04-04 1998-03-27 Hierarchical packet scheduling method and apparatus

Family Applications After (1)

Application Number Title Priority Date Filing Date
CA002285243A Abandoned CA2285243A1 (en) 1997-04-04 1998-03-27 Hierarchical packet scheduling method and apparatus

Country Status (6)

Country Link
US (2) US5850399A (en)
EP (2) EP0972378A4 (en)
JP (2) JP2001519121A (en)
AU (2) AU6788598A (en)
CA (2) CA2285245A1 (en)
WO (2) WO1998045990A1 (en)

Families Citing this family (235)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE19548985A1 (en) * 1995-12-28 1997-07-03 Siemens Ag Method for prioritizing cell streams in systems that transmit information according to an asynchronous transfer mode (ATM)
US6064650A (en) * 1996-06-27 2000-05-16 Xerox Corporation Rate shaping in per-flow output queued routing mechanisms having output links servicing multiple physical layers
US5881050A (en) * 1996-07-23 1999-03-09 International Business Machines Corporation Method and system for non-disruptively assigning link bandwidth to a user in a high speed digital network
EP0833480B1 (en) * 1996-09-25 2005-11-16 Nippon Telegraph And Telephone Corporation Contention control circuit
US6229812B1 (en) * 1996-10-28 2001-05-08 Paxonet Communications, Inc. Scheduling techniques for data cells in a data switch
US6041059A (en) * 1997-04-25 2000-03-21 Mmc Networks, Inc. Time-wheel ATM cell scheduling
US6104700A (en) 1997-08-29 2000-08-15 Extreme Networks Policy based quality of service
US6643293B1 (en) * 1997-09-05 2003-11-04 Alcatel Canada Inc. Virtual connection shaping with hierarchial arbitration
FR2770070B1 (en) 1997-10-20 2000-02-04 Thomson Csf FLOW CONTROL METHOD WITHIN AN ATM SWITCH WITH DISTRIBUTED ARCHITECTURE
US6389031B1 (en) 1997-11-05 2002-05-14 Polytechnic University Methods and apparatus for fairly scheduling queued packets using a ram-based search engine
US6370144B1 (en) * 1997-11-05 2002-04-09 Polytechnic University Methods and apparatus for shaping queued packets using a two-dimensional RAM-based search engine
US6219704B1 (en) * 1997-11-20 2001-04-17 International Business Machines Corporation Method and apparatus for delivering multimedia content based on network connections
US6526060B1 (en) * 1997-12-05 2003-02-25 Cisco Technology, Inc. Dynamic rate-based, weighted fair scheduler with explicit rate feedback option
US6504845B1 (en) * 1997-12-19 2003-01-07 Telefonaktiebolaget Lm Ericsson (Publ) Centralized queuing for ATM node
US6188698B1 (en) * 1997-12-31 2001-02-13 Cisco Technology, Inc. Multiple-criteria queueing and transmission scheduling system for multimedia networks
US6256308B1 (en) 1998-01-20 2001-07-03 Telefonaktiebolaget Lm Ericsson Multi-service circuit for telecommunications
US6859438B2 (en) 1998-02-03 2005-02-22 Extreme Networks, Inc. Policy based quality of service
US6154769A (en) * 1998-03-27 2000-11-28 Hewlett-Packard Company Scheduling server requests to decrease response time and increase server throughput
US6198723B1 (en) * 1998-04-14 2001-03-06 Paxonet Communications, Inc. Asynchronous transfer mode traffic shapers
GB2337406B (en) * 1998-05-11 2003-05-14 Fujitsu Ltd Scheduling circuitry and methods
JP3369108B2 (en) * 1998-06-10 2003-01-20 富士通株式会社 Packet data transmission device
US6359883B1 (en) * 1998-06-23 2002-03-19 The Kohl Group, Inc. Reducing the variability of the data rates of high-rate data streams in order to communicate such streams over a low-rate channel of fixed capacity
US6122673A (en) * 1998-07-22 2000-09-19 Fore Systems, Inc. Port scheduler and method for scheduling service providing guarantees, hierarchical rate limiting with/without overbooking capability
US7154896B1 (en) * 1998-07-24 2006-12-26 Ericsson, Ab ATM traffic having unknown characteristics including traffic with weighted priorities and traffic without weighted priorities
JP3634635B2 (en) * 1998-07-31 2005-03-30 富士通株式会社 Cell switching device for controlling fixed rate connections
US6690671B1 (en) * 1998-08-17 2004-02-10 Marconi Communications, Inc. Load balanced UBR routing in ATM networks
CA2245367A1 (en) * 1998-08-19 2000-02-19 Newbridge Networks Corporation Two-component bandwidth scheduler having application in multi-class digital communication systems
US6081507A (en) * 1998-11-04 2000-06-27 Polytechnic University Methods and apparatus for handling time stamp aging
US6714517B1 (en) 1998-11-10 2004-03-30 Extreme Networks Method and apparatus for interconnection of packet switches with guaranteed bandwidth
US6970424B2 (en) 1998-11-10 2005-11-29 Extreme Networks Method and apparatus to minimize congestion in a packet switched network
US6654374B1 (en) 1998-11-10 2003-11-25 Extreme Networks Method and apparatus to reduce Jitter in packet switched networks
US6917617B2 (en) * 1998-12-16 2005-07-12 Cisco Technology, Inc. Use of precedence bits for quality of service
US7046631B1 (en) * 1999-01-22 2006-05-16 Alcatel Canada Inc. Method and apparatus for provisioning traffic dedicated cores in a connection oriented network
US6490611B1 (en) * 1999-01-28 2002-12-03 Mitsubishi Electric Research Laboratories, Inc. User level scheduling of inter-communicating real-time tasks
US6567408B1 (en) 1999-02-01 2003-05-20 Redback Networks Inc. Methods and apparatus for packet classification with multi-level data structure
US6449650B1 (en) 1999-02-01 2002-09-10 Redback Networks Inc. Methods and apparatus for deploying quality of service policies on a data communication network
US6529508B1 (en) 1999-02-01 2003-03-04 Redback Networks Inc. Methods and apparatus for packet classification with multiple answer sets
US6560230B1 (en) * 1999-02-01 2003-05-06 Redback Networks Inc. Packet scheduling methods and apparatus
US6879563B1 (en) * 1999-02-18 2005-04-12 Nippon Soken, Inc. Data repeater and multiplex communication system using the same
US6760336B1 (en) * 1999-02-18 2004-07-06 Nortel Networks Limited Flow detection scheme to support QoS flows between source and destination nodes
JP3123537B2 (en) * 1999-02-24 2001-01-15 日本電気株式会社 ATM buffer control method and apparatus, and recording medium on which the method is programmed and recorded
US6738346B1 (en) * 1999-03-16 2004-05-18 Northrop Grumman Corporation Hierarchical downlink scheduler for a processed satellite payload
US6628668B1 (en) * 1999-03-16 2003-09-30 Fujitsu Network Communications, Inc. Crosspoint switch bandwidth allocation management
WO2000076152A1 (en) * 1999-06-03 2000-12-14 Fujitsu Network Communications, Inc. Method and system for transmitting traffic in a virtual tunnel of a transmission line
FI107422B (en) * 1999-06-24 2001-07-31 Nokia Corp Session management
US6983350B1 (en) 1999-08-31 2006-01-03 Intel Corporation SDRAM controller for parallel processor architecture
US6891834B1 (en) * 1999-09-09 2005-05-10 Avici Systems Apparatus and method for packet scheduling
US6680933B1 (en) 1999-09-23 2004-01-20 Nortel Networks Limited Telecommunications switches and methods for their operation
US6870809B1 (en) * 1999-10-08 2005-03-22 Microsoft Corporation Fair scheduling in broadcast environments
US6646986B1 (en) * 1999-10-14 2003-11-11 Nortel Networks Limited Scheduling of variable sized packet data under transfer rate control
TW456122B (en) * 1999-11-29 2001-09-21 Jang Jeng Shang Bandwidth division switching device and method
US6976258B1 (en) 1999-11-30 2005-12-13 Ensim Corporation Providing quality of service guarantees to virtual hosts
DE10085287T1 (en) * 1999-12-08 2003-03-27 Univ British Columbia Scheduler for a weighted fair queue operation
US6532509B1 (en) 1999-12-22 2003-03-11 Intel Corporation Arbitrating command requests in a parallel multi-threaded processing system
US6430152B1 (en) * 1999-12-22 2002-08-06 Alcatel Usa Sourcing, L.P. Scheduler system for scheduling the distribution of ATM cells
US6694380B1 (en) 1999-12-27 2004-02-17 Intel Corporation Mapping requests from a processing unit that uses memory-mapped input-output space
US6661794B1 (en) 1999-12-29 2003-12-09 Intel Corporation Method and apparatus for gigabit packet assignment for multithreaded packet processing
US6882623B1 (en) 2000-02-08 2005-04-19 Native Networks Technologies Ltd. Multi-level scheduling method for multiplexing packets in a communications network
US6754716B1 (en) 2000-02-11 2004-06-22 Ensim Corporation Restricting communication between network devices on a common network
US7304945B1 (en) * 2000-02-14 2007-12-04 Ericsson Ab Method and apparatus for dynamic bitmap generator scheduler
US7343421B1 (en) 2000-02-14 2008-03-11 Digital Asset Enterprises Llc Restricting communication of selected processes to a set of specific network addresses
US6948003B1 (en) 2000-03-15 2005-09-20 Ensim Corporation Enabling a service provider to provide intranet services
US6683884B1 (en) * 2000-03-31 2004-01-27 Intel Corporation Shared credit round robin queuing
US7315901B1 (en) 2000-04-13 2008-01-01 International Business Machines Corporation Method and system for network processor scheduling outputs using disconnect/reconnect flow queues
US6804249B1 (en) 2000-04-13 2004-10-12 International Business Machines Corporation Method and system for network processor scheduling based on calculation
US6952424B1 (en) 2000-04-13 2005-10-04 International Business Machines Corporation Method and system for network processor scheduling outputs using queueing
US6795870B1 (en) 2000-04-13 2004-09-21 International Business Machines Corporation Method and system for network processor scheduler
US6862292B1 (en) 2000-04-13 2005-03-01 International Business Machines Corporation Method and system for network processor scheduling outputs based on multiple calendars
US6937611B1 (en) 2000-04-21 2005-08-30 Sun Microsystems, Inc. Mechanism for efficient scheduling of communication flows
US7103672B1 (en) * 2000-05-01 2006-09-05 Hewlett-Packard Development Company, L.P. Method and apparatus for improving system performance through remote credit management
US7058730B2 (en) * 2000-05-05 2006-06-06 Fujitsu Limited Unique address space and method for a transport network
US6775229B1 (en) 2000-05-05 2004-08-10 Fujitsu Network Communications, Inc. Method and system for providing a protection path for connection-oriented signals in a telecommunications network
US20010046208A1 (en) * 2000-05-05 2001-11-29 Eng Kai Y. Unbreakable optical IP flows and premium IP services
US7047176B2 (en) * 2000-05-05 2006-05-16 Fujitsu Limited Method and system for hardware simulation
US7385917B1 (en) 2000-05-05 2008-06-10 Fujitsu Limited Method and system for providing a protection path for connectionless signals in a telecommunications network
US7075927B2 (en) * 2000-05-05 2006-07-11 Fujitsu Limited Method and system for quality of service (QoS) support in a packet-switched network
US6693909B1 (en) 2000-05-05 2004-02-17 Fujitsu Network Communications, Inc. Method and system for transporting traffic in a packet-switched network
US6515966B1 (en) 2000-05-05 2003-02-04 Fujitsu Network Communications, Inc. System and method for application object transport
US7151773B1 (en) 2000-05-05 2006-12-19 Fujitsu Limited System and method for connectionless/connection oriented signal transport
US7133403B1 (en) 2000-05-05 2006-11-07 Fujitsu Limited Transport network and method
US7173912B2 (en) * 2000-05-05 2007-02-06 Fujitsu Limited Method and system for modeling and advertising asymmetric topology of a node in a transport network
US6985937B1 (en) 2000-05-11 2006-01-10 Ensim Corporation Dynamically modifying the resources of a virtual server
US6907421B1 (en) 2000-05-16 2005-06-14 Ensim Corporation Regulating file access rates according to file type
US7222147B1 (en) 2000-05-20 2007-05-22 Ciena Corporation Processing network management data in accordance with metadata files
US7111053B1 (en) 2000-05-20 2006-09-19 Ciena Corporation Template-driven management of telecommunications network via utilization of operations support services clients
US7266595B1 (en) 2000-05-20 2007-09-04 Ciena Corporation Accessing network device data through user profiles
US7240364B1 (en) 2000-05-20 2007-07-03 Ciena Corporation Network device identity authentication
US7225244B2 (en) * 2000-05-20 2007-05-29 Ciena Corporation Common command interface
US6880086B2 (en) 2000-05-20 2005-04-12 Ciena Corporation Signatures for facilitating hot upgrades of modular software components
US20020116485A1 (en) * 2001-02-21 2002-08-22 Equipe Communications Corporation Out-of-band network management channels
US20020001307A1 (en) * 2000-05-20 2002-01-03 Equipe Communications Corporation VPI/VCI availability index
US7143153B1 (en) 2000-11-09 2006-11-28 Ciena Corporation Internal network device dynamic health monitoring
US7225240B1 (en) 2000-05-20 2007-05-29 Ciena Corporation Decoupling processes from hardware with logical identifiers
US7280529B1 (en) 2000-05-20 2007-10-09 Ciena Corporation Providing network management access through user profiles
US7020696B1 (en) 2000-05-20 2006-03-28 Ciena Corp. Distributed user management information in telecommunications networks
US6715097B1 (en) 2000-05-20 2004-03-30 Equipe Communications Corporation Hierarchical fault management in computer systems
US6760339B1 (en) 2000-05-20 2004-07-06 Equipe Communications Corporation Multi-layer network device in one telecommunications rack
US6742134B1 (en) 2000-05-20 2004-05-25 Equipe Communications Corporation Maintaining a local backup for data plane processes
US6332198B1 (en) 2000-05-20 2001-12-18 Equipe Communications Corporation Network device for supporting multiple redundancy schemes
US6671699B1 (en) 2000-05-20 2003-12-30 Equipe Communications Corporation Shared database usage in network devices
US7349960B1 (en) 2000-05-20 2008-03-25 Ciena Corporation Throttling distributed statistical data retrieval in a network device
US7039046B1 (en) 2000-05-20 2006-05-02 Ciena Corporation Network device including central and distributed switch fabric subsystems
US6601186B1 (en) 2000-05-20 2003-07-29 Equipe Communications Corporation Independent restoration of control plane and data plane functions
US6876652B1 (en) 2000-05-20 2005-04-05 Ciena Corporation Network device with a distributed switch fabric timing system
US7062642B1 (en) 2000-05-20 2006-06-13 Ciena Corporation Policy based provisioning of network device resources
US6654903B1 (en) 2000-05-20 2003-11-25 Equipe Communications Corporation Vertical fault isolation in a computer system
US6639910B1 (en) 2000-05-20 2003-10-28 Equipe Communications Corporation Functional separation of internal and external controls in network devices
US6658580B1 (en) 2000-05-20 2003-12-02 Equipe Communications Corporation Redundant, synchronous central timing systems with constant master voltage controls and variable slave voltage controls
US6708291B1 (en) 2000-05-20 2004-03-16 Equipe Communications Corporation Hierarchical fault descriptors in computer systems
US7051097B1 (en) 2000-05-20 2006-05-23 Ciena Corporation Embedded database for computer system management
US7054272B1 (en) 2000-07-11 2006-05-30 Ciena Corporation Upper layer network device including a physical layer test port
US6658579B1 (en) 2000-05-20 2003-12-02 Equipe Communications Corporation Network device with local timing systems for automatic selection between redundant, synchronous central timing systems
US6934749B1 (en) 2000-05-20 2005-08-23 Ciena Corporation Tracking distributed data retrieval in a network device
US6868092B1 (en) 2000-05-20 2005-03-15 Ciena Corporation Network device with embedded timing synchronization
US6904045B1 (en) * 2000-06-02 2005-06-07 Agere Systems Inc. Method and apparatus for guaranteeing data transfer rates and delays in asynchronous transfer mode networks using pivot sessions
US7023845B1 (en) 2000-06-13 2006-04-04 Ciena Corporation Network device including multiple mid-planes
US7143024B1 (en) 2000-07-07 2006-11-28 Ensim Corporation Associating identifiers with virtual processes
US6909691B1 (en) * 2000-08-07 2005-06-21 Ensim Corporation Fairly partitioning resources while limiting the maximum fair share
WO2002015520A1 (en) * 2000-08-17 2002-02-21 Redback Networks Inc. Packet scheduling methods and apparatus
US6996107B2 (en) 2000-10-06 2006-02-07 Pmc-Sierra Ltd. Packet shaping on a fixed segment scheduler
DE10051147B4 (en) * 2000-10-16 2005-04-14 Siemens Ag Method for accessing and working in an IP network
US7113900B1 (en) 2000-10-24 2006-09-26 Microsoft Corporation System and method for logical modeling of distributed computer systems
US7606898B1 (en) 2000-10-24 2009-10-20 Microsoft Corporation System and method for distributed management of shared computers
US7277446B1 (en) 2000-11-02 2007-10-02 Airvana, Inc. Communication of digital data over a wireless transmission medium
US6914881B1 (en) * 2000-11-28 2005-07-05 Nortel Networks Ltd Prioritized continuous-deficit round robin scheduling
US7219354B1 (en) 2000-12-22 2007-05-15 Ensim Corporation Virtualizing super-user privileges for multiple virtual processes
JP3575688B2 (en) * 2001-02-16 2004-10-13 日本電気株式会社 Packet switch
TW540205B (en) * 2001-02-27 2003-07-01 Ind Tech Res Inst Real-time scheduling mechanism capable of controlling quality of service
US8069254B2 (en) * 2001-02-28 2011-11-29 Sharp Laboratories Of America, Inc. Communication period management in a communication system
US6996062B1 (en) 2001-02-28 2006-02-07 3Com Corporation Policy-based weighted random early detection method for avoiding congestion in internet traffic
WO2002069575A1 (en) * 2001-02-28 2002-09-06 Gotham Networks, Inc. Methods and apparatus for network routing device
WO2002073884A2 (en) * 2001-03-08 2002-09-19 Adisak Mekkittikul A method and system for bandwidth allocation tracking
US6947998B2 (en) * 2001-03-08 2005-09-20 Broadband Royalty Corporation Method and system for bandwidth allocation tracking in a packet data network
US6963536B1 (en) 2001-03-23 2005-11-08 Advanced Micro Devices, Inc. Admission control in a network device
US6954427B1 (en) * 2001-03-28 2005-10-11 Advanced Micro Devices, Inc. Method and apparatus for performing priority-based admission control
WO2002084957A2 (en) * 2001-04-13 2002-10-24 Motorola, Inc., A Corporation Of The State Of Delaware Manipulating data streams in data stream processors
US7263597B2 (en) * 2001-04-19 2007-08-28 Ciena Corporation Network device including dedicated resources control plane
JP2002325093A (en) * 2001-04-26 2002-11-08 Fujitsu Ltd Band control method and device, and band control system
WO2002088879A2 (en) * 2001-04-27 2002-11-07 Wanwall, Inc. Weighted fair queuing-based methods and apparatus for protecting against overload conditions on nodes of a distributed network
US6904057B2 (en) 2001-05-04 2005-06-07 Slt Logic Llc Method and apparatus for providing multi-protocol, multi-stage, real-time frame classification
US6901052B2 (en) 2001-05-04 2005-05-31 Slt Logic Llc System and method for policing multiple data flows and multi-protocol data flows
US7006513B1 (en) * 2001-05-11 2006-02-28 Turin Networks Method and system for pipelining packet selection
JP3693932B2 (en) * 2001-05-16 2005-09-14 三菱電機株式会社 Optical communication system
US6987774B1 (en) * 2001-06-20 2006-01-17 Redback Networks Inc. Method and apparatus for traffic scheduling
KR100436365B1 (en) * 2001-06-23 2004-06-18 삼성전자주식회사 ATM-based delay adaptive scheduling apparatus according to traffic types and method thereof
US7266606B2 (en) * 2001-06-29 2007-09-04 Tropic Networks Inc. Cascaded policing systems and methods
US7120113B1 (en) 2001-07-16 2006-10-10 Juniper Networks, Inc. Systems and methods for limiting low priority traffic from blocking high priority traffic
US20030072326A1 (en) * 2001-08-14 2003-04-17 Mehdi Alasti Method and apparatus for parallel, weighted arbitration scheduling for a switch fabric
US6757246B2 (en) 2001-08-14 2004-06-29 Pts Corporation Method and apparatus for weighted arbitration scheduling separately at the input ports and the output ports of a switch fabric
US6907525B2 (en) 2001-08-14 2005-06-14 Riverhead Networks Inc. Protecting against spoofed DNS messages
US7027443B2 (en) * 2001-08-23 2006-04-11 Pmc-Sierra Ltd. Reassembly engines for multilink applications
US7313815B2 (en) * 2001-08-30 2007-12-25 Cisco Technology, Inc. Protecting against spoofed DNS messages
US7046676B2 (en) * 2001-11-01 2006-05-16 International Business Machines Corporation QoS scheduler and method for implementing quality of service with cached status array
US7103051B2 (en) * 2001-11-01 2006-09-05 International Business Machines Corporation QoS scheduler and method for implementing quality of service with aging time stamps
US7317683B2 (en) * 2001-11-01 2008-01-08 International Business Machines Corporation Weighted fair queue serving plural output ports
US7280474B2 (en) * 2001-11-01 2007-10-09 International Business Machines Corporation Weighted fair queue having adjustable scaling factor
US7310345B2 (en) * 2001-11-01 2007-12-18 International Business Machines Corporation Empty indicators for weighted fair queues
US6973036B2 (en) 2001-11-01 2005-12-06 International Business Machines Corporation QoS scheduler and method for implementing peak service distance using next peak service time violated indication
US6982986B2 (en) * 2001-11-01 2006-01-03 International Business Machines Corporation QoS scheduler and method for implementing quality of service anticipating the end of a chain of flows
US7187684B2 (en) * 2001-11-01 2007-03-06 International Business Machines Corporation Weighted fair queue having extended effective range
US7382792B2 (en) * 2001-11-23 2008-06-03 International Business Machines Corporation Queue scheduling mechanism in a data packet transmission system
US7136385B2 (en) * 2001-12-07 2006-11-14 International Business Machines Corporation Method and system for performing asymmetric address translation
US7385993B2 (en) * 2001-12-21 2008-06-10 International Business Machines Corporation Queue scheduling mechanism in a data packet transmission system
US7639693B1 (en) 2002-01-30 2009-12-29 Pmc - Sierra Ltd. Method and/or apparatus distributing variable-sized data units to variable destinations
US7680043B2 (en) * 2002-03-20 2010-03-16 International Business Machines Corporation Network processor having fast flow queue disable process
US7257124B2 (en) * 2002-03-20 2007-08-14 International Business Machines Corporation Method and apparatus for improving the fairness of new attaches to a weighted fair queue in a quality of service (QoS) scheduler
US20030200317A1 (en) * 2002-04-19 2003-10-23 Native Networks Technologies Ltd Method and system for dynamically allocating bandwidth to a plurality of network elements
US8090869B2 (en) * 2002-06-04 2012-01-03 Alcatel Lucent Priority-biased exit queue arbitration with fairness
US7525917B2 (en) * 2002-06-04 2009-04-28 Acatel-Lucent Usa Inc. Flow control in a distributed scalable, shared memory switching fabric system
US7292580B2 (en) * 2002-06-10 2007-11-06 Lsi Corporation Method and system for guaranteeing quality of service in a multi-plane cell switch
US7359384B2 (en) * 2002-06-10 2008-04-15 Lucent Technologies Inc. Scheduling of guaranteed-bandwidth low-jitter traffic in input-buffered switches
US6888807B2 (en) * 2002-06-10 2005-05-03 Ipr Licensing, Inc. Applying session services based on packet flows
US7471688B2 (en) * 2002-06-18 2008-12-30 Intel Corporation Scheduling system for transmission of cells to ATM virtual circuits and DSL ports
US7418492B1 (en) 2002-06-20 2008-08-26 P-Cube Ltd. System and a method for testing network communication devices
US7023843B2 (en) * 2002-06-26 2006-04-04 Nokia Corporation Programmable scheduling for IP routers
US7177275B2 (en) * 2002-07-26 2007-02-13 Kenneth Stanwood Scheduling method and system for communication systems that offer multiple classes of service
US6795441B1 (en) 2002-08-30 2004-09-21 Redback Networks, Inc. Hierarchy tree-based quality of service classification for packet processing
US7283472B2 (en) * 2002-08-30 2007-10-16 Redback Networks Inc. Priority-based efficient fair queuing for quality of service classification for packet processing
US7339953B2 (en) * 2002-08-30 2008-03-04 Redback Networks, Inc. Surplus redistribution for quality of service classification for packet processing
US7260063B2 (en) * 2002-10-02 2007-08-21 Ericsson Ab Frame relay frame shaping per DLCI
US7336662B2 (en) 2002-10-25 2008-02-26 Alcatel Lucent System and method for implementing GFR service in an access node's ATM switch fabric
US7236495B2 (en) * 2002-10-25 2007-06-26 Alcatel Lucent Calendar heap system and method for efficient sorting
US8045539B2 (en) * 2002-10-25 2011-10-25 Alcatel Lucent Virtual group connection scheme for ATM architecture in an access node
US7283532B2 (en) * 2002-10-25 2007-10-16 Alcatel Lucent Hierarchical scheduler architecture for use with an access node
US7280542B2 (en) * 2002-10-25 2007-10-09 Alcatel Lucent Multicasting system and method for use in an access node's ATM switch fabric
KR20040052012A (en) * 2002-12-13 2004-06-19 한국전자통신연구원 Packet scheduling system and method for high-speed packet networks
US20040158582A1 (en) * 2003-02-11 2004-08-12 Shuichi Takagi Method and apparatus for synchronously transferring data from a local storage medium to a remote storage medium, and method and system for managing transfer of data from a source storage medium to a repository storage medium
US7979694B2 (en) * 2003-03-03 2011-07-12 Cisco Technology, Inc. Using TCP to authenticate IP source addresses
US7072807B2 (en) 2003-03-06 2006-07-04 Microsoft Corporation Architecture for distributed computing system and automated design, deployment, and management of distributed applications
EP1618716A1 (en) * 2003-04-23 2006-01-25 Telecom Italia S.p.A. A client-server system and method thereof for providing multimedia and interactive services to mobile terminals
US7317727B2 (en) * 2003-05-21 2008-01-08 International Business Machines Corporation Method and systems for controlling ATM traffic using bandwidth allocation technology
US7606929B2 (en) 2003-06-30 2009-10-20 Microsoft Corporation Network load balancing with connection manipulation
US7590736B2 (en) 2003-06-30 2009-09-15 Microsoft Corporation Flexible network load balancing
US7567504B2 (en) * 2003-06-30 2009-07-28 Microsoft Corporation Network load balancing with traffic routing
US7613822B2 (en) 2003-06-30 2009-11-03 Microsoft Corporation Network load balancing with session information
US7636917B2 (en) 2003-06-30 2009-12-22 Microsoft Corporation Network load balancing with host status information
US20050047415A1 (en) * 2003-08-28 2005-03-03 Radhakrishna Channegowda Data traffic manager and method therefor
US20050071503A1 (en) * 2003-09-30 2005-03-31 International Business Machines Corporation Hierarchical scheduling
US8218551B2 (en) * 2003-09-30 2012-07-10 International Business Machines Corporation Hierarchical scheduling
US7099975B2 (en) * 2003-12-09 2006-08-29 International Business Machines Corporation Method of resource arbitration
JP2005198204A (en) * 2004-01-09 2005-07-21 Pioneer Electronic Corp Information distribution display system and information distribution display method
US7522609B2 (en) * 2004-01-14 2009-04-21 Cisco Technology, Inc Propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule
US7876763B2 (en) * 2004-08-05 2011-01-25 Cisco Technology, Inc. Pipeline scheduler including a hierarchy of schedulers and multiple scheduling lanes
US20050195742A1 (en) * 2004-03-04 2005-09-08 Adc Telecommunications Israel Ltd. Packet scheduler for access networks
CN100411474C (en) * 2004-06-17 2008-08-13 大唐移动通信设备有限公司 Downstream grouped data scheduling method suitable to mobile communication system
US9031079B1 (en) 2004-08-06 2015-05-12 Juniper Networks, Inc. Hierarchical shaping of network traffic
JP3879754B2 (en) * 2004-08-31 2007-02-14 ヤマハ株式会社 Bandwidth control device and program
JP4483535B2 (en) * 2004-11-05 2010-06-16 株式会社日立製作所 Network equipment
US7647357B2 (en) * 2004-11-12 2010-01-12 International Business Machines Corporation Data transfer management in consistency group formation
US7568224B1 (en) 2004-12-06 2009-07-28 Cisco Technology, Inc. Authentication of SIP and RTP traffic
US7525962B2 (en) * 2004-12-27 2009-04-28 Intel Corporation Reducing memory access bandwidth consumption in a hierarchical packet scheduler
US7620733B1 (en) 2005-03-30 2009-11-17 Cisco Technology, Inc. DNS anti-spoofing using UDP
US7525978B1 (en) 2005-04-15 2009-04-28 Altera Corporation Method and apparatus for scheduling in a packet buffering network
US20070070895A1 (en) * 2005-09-26 2007-03-29 Paolo Narvaez Scaleable channel scheduler system and method
WO2007047864A2 (en) * 2005-10-18 2007-04-26 Ample Communicatins Inc. Traffic shaping and metering scheme for oversubscribed and/or cascaded communication devices
US7941309B2 (en) 2005-11-02 2011-05-10 Microsoft Corporation Modeling IT operations/policies
US7953002B2 (en) * 2005-11-10 2011-05-31 Broadcom Corporation Buffer management and flow control mechanism including packet-based dynamic thresholding
US7953008B2 (en) * 2005-11-10 2011-05-31 Broadcom Corporation Cell copy count hazard detection
KR100745679B1 (en) * 2005-12-08 2007-08-02 한국전자통신연구원 Method and apparatus for packet scheduling using adaptation round robin
JP4659657B2 (en) * 2006-03-28 2011-03-30 富士通株式会社 Frame multiplexer
US8194690B1 (en) 2006-05-24 2012-06-05 Tilera Corporation Packet processing in a parallel processing environment
US8156557B2 (en) * 2007-01-04 2012-04-10 Cisco Technology, Inc. Protection against reflection distributed denial of service attacks
EP1953959A1 (en) * 2007-02-01 2008-08-06 British Telecommunications Public Limited Company Data communication
US7697435B1 (en) * 2007-02-02 2010-04-13 Sprint Communications Company L.P. Dynamic backhaul delay determination
US7870313B2 (en) * 2007-02-27 2011-01-11 Integrated Device Technology, Inc. Method and structure to support system resource access of a serial device implementating a lite-weight protocol
US8094677B2 (en) * 2007-02-27 2012-01-10 Integrated Device Technology, Inc. Multi-bus structure for optimizing system performance of a serial buffer
US7801045B2 (en) * 2007-06-19 2010-09-21 Alcatel Lucent Hierarchical rate limiting with proportional limiting
US8081567B2 (en) * 2008-01-30 2011-12-20 Alcatel Lucent Method and apparatus for detecting wireless data subscribers using natted devices
US8295305B2 (en) * 2009-12-30 2012-10-23 International Business Machines Corporation Dual scheduling of work from multiple sources to multiple sinks using source and sink attributes to achieve fairness and processing efficiency
US8391305B2 (en) * 2009-12-30 2013-03-05 International Business Machines Corporation Assignment constraint matrix for assigning work from multiple sources to multiple sinks
US8532129B2 (en) * 2009-12-30 2013-09-10 International Business Machines Corporation Assigning work from multiple sources to multiple sinks given assignment constraints
US8462802B2 (en) * 2010-09-13 2013-06-11 Juniper Networks, Inc. Hybrid weighted round robin (WRR) traffic scheduling
US8693489B2 (en) 2011-04-28 2014-04-08 Alcatel Lucent Hierarchical profiled scheduling and shaping
US20130044755A1 (en) * 2011-08-16 2013-02-21 Futurewei Technologies, Inc. Scalable Packet Scheduling Policy for Vast Number of Sessions
CN104348750B (en) * 2013-07-31 2019-07-26 中兴通讯股份有限公司 The implementation method and device of QoS in OpenFlow network

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5231633A (en) * 1990-07-11 1993-07-27 Codex Corporation Method for prioritizing, selectively discarding, and multiplexing differing traffic type fast packets
CA2104753C (en) * 1992-10-29 1999-02-16 Kotikalapudi Sriram Bandwidth allocation, transmission scheduling, and congestion avoidance in broadband atm networks
KR960003783B1 (en) * 1993-11-06 1996-03-22 한국전기통신공사 Subscriber atm mux for interface to isdn
US5455825A (en) * 1994-04-28 1995-10-03 Mitsubishi Electric Research Laboratories Tag-based scheduling system for digital communication switch
US5533020A (en) * 1994-10-31 1996-07-02 International Business Machines Corporation ATM cell scheduler
US5629933A (en) * 1995-06-07 1997-05-13 International Business Machines Corporation Method and system for enhanced communication in a multisession packet based communication system
EP0748086A1 (en) * 1995-06-09 1996-12-11 Siemens Aktiengesellschaft Method for scheduling message cells leaving an ATM node
US5689508A (en) * 1995-12-21 1997-11-18 Xerox Corporation Reservation ring mechanism for providing fair queued access in a fast packet switch networks

Also Published As

Publication number Publication date
WO1998045976A2 (en) 1998-10-15
EP0972379A4 (en) 2000-07-05
JP2001519120A (en) 2001-10-16
EP0972378A2 (en) 2000-01-19
US5905730A (en) 1999-05-18
JP2001519121A (en) 2001-10-16
AU6873198A (en) 1998-10-30
WO1998045990A1 (en) 1998-10-15
EP0972378A4 (en) 2001-10-04
AU6788598A (en) 1998-10-30
EP0972379A1 (en) 2000-01-19
US5850399A (en) 1998-12-15
WO1998045990A9 (en) 1999-11-25
CA2285243A1 (en) 1998-10-15
WO1998045976A3 (en) 1999-01-07

Similar Documents

Publication Publication Date Title
US5905730A (en) High speed packet scheduling method and apparatus
US6452933B1 (en) Fair queuing system with adaptive bandwidth redistribution
Rexford et al. Hardware-efficient fair queueing architectures for high-speed networks
EP0810809B1 (en) A scheduling method and apparatus for supporting ATM connections having a guaranteed minimum bandwidth
EP0944208B1 (en) Time based scheduler architecture and method for ATM networks
US5831971A (en) Method for leaky bucket traffic shaping using fair queueing collision arbitration
US6438134B1 (en) Two-component bandwidth scheduler having application in multi-class digital communications systems
CN101414958B (en) Method and apparatus for scheduling business
US20060029080A1 (en) Using burst tolerance values in time-based schedules
US7894347B1 (en) Method and apparatus for packet scheduling
US6990115B2 (en) Queue control method and system
EP1638273B1 (en) Scheduling using quantum and deficit values
US6208652B1 (en) Increment scheduler
Rexford et al. A scalable architecture for fair leaky-bucket shaping
US7599381B2 (en) Scheduling eligible entries using an approximated finish delay identified for an entry based on an associated speed group
EP1521411A2 (en) Method and apparatus for request/grant priority scheduling
Katevenis et al. Multi-queue management and scheduling for improved QoS in communication networks
CA2575814C (en) Propagation of minimum guaranteed scheduling rates
Al-Khasib et al. Mini round robin: an enhanced frame-based scheduling algorithm for multimedia networks
Lin Constant-time dynamic ATM bandwidth scheduling for guaranteed and best effort services with overbooking
JP3177188B2 (en) Packet transmitting / receiving method and apparatus
Al-Khasib et al. Fair and efficient frame-based scheduling algorithm for multimedia networks
KR100757194B1 (en) A Fair Packet Scheduling Method with a High Resource Utilization and Low Implementation Complexity

Legal Events

Date Code Title Description
EEER Examination request
FZDE Discontinued