Abstract:
A system and method of scheduling and servicing events in a communications network are described. To provide improved efficiency while maintaining fairness to all traffic a two slot dynamic length Weighted Fair Queuing (WFQ) calendar is implemented. The two slot calendar can be transformed to provide fine granularity utilizing a hierarchical WFQ scheme.

Description:
FIELD OF THE INVENTION 
     This invention relates to the communication of information and more particularly to scheduling and servicing of high speed data traffic. 
     BACKGROUND OF THE INVENTION 
     Information, including data information, is conveniently communicated over communication channels. These channels may include one or more paths between entities allowing communication of information through one or more types of communication media, for example: wire line, fibre optic cables and wireless connections. Typically, a communication channel has a finite bandwidth, i.e., only a finite amount of information may be communicated through the channel in a given amount of time. Information from several sources may be communicated over a common communication channel by sequencing the information over time. 
     Different types of information may be subject to different communication requirements. Examples of such requirements include a minimum amount of bandwidth, a maximum amount of permissible delay, and a maximum permissible portion of the information that is not successfully communicated. For example, a teleconferencing application may require communication of information at high bandwidth and with very little delay but may not be seriously degraded if a portion of the information is lost during transmission. Another application, for example an interactive web browsing application, may tolerate greater delay but with little or no tolerance for lost information. As another example, file transfer application may tolerate substantial delay but require complete reliability of the information communicated. Thus, it is desirable to provide communication in a manner that accommodates the various communication requirements of various types of information. It is also useful to be able to fairly allocate communication resources among types of information having similar communication requirements. 
     Attempts have been made to use calendar structures for the allocation of information to communication channels. However, such calendar structures have generally required storing and processing large amounts of overhead information to control the communication of information through a communication channel. Such requirements have placed limits on the operating speed of the system used to allocate information to the channel. Thus, scheduling and servicing techniques that avoid these disadvantages are desired. 
     A typical prior art scheduler architectures is a traditional n-slot weighted fair queuing (WFQ) calendar which may contain hundreds of calendar slots in order to meet the diversified bandwidth requirements and variable packet sizes. In view of this, a large amount of memory is required for implementation and this large memory requirement leads to latency issues. 
     U.S. patent application Ser. No. 10/334,204 filed Dec. 30, 2002 to Olesinski et al., describes one prior art calendar structure. In the Ser. No. 10/334,204 application entitled “Methods and Apparatus for Scheduling and Servicing Events Using a Calendar Structure” a multi-tier structure is presented which means that it consumes less memory than a typical n-slot WFQ calendar. Although it does not require hundreds of calendar slots as in the n-slot WFQ calendar it still requires tens of calendar slots which as indicated previously raises latency issues. The contents of application Ser. No. 10/334,204 are incorporated herein by reference. 
     One additional problem that exists with both n-slot WFQ calendars and the architecture disclosed in the aforementioned application is that the number of calendar slots in a calendar is fixed. This means that even if some calendar slots are never used the memory used for implementing them is reserved. 
     In a typical WFQ calendar architecture each calendar slot has to store both head and tail pointers. The more slots required, the more memory is used to store these head and tail pointers. This is a particular issue because internal memory is often used in the implementation to minimize latency. This need to use internal memory is significant for WFQ schedulers that may be implemented in the datapath. For example, a traffic management chip designed in Alcatel supports 3.5 k WFQ calendars and consumes around 4 M bits internal memory. It was desired that further 2 k WFQ calendars be implemented on the chip but this is not feasible due to the large amount of internal memory consumption. 
     The present invention addresses the aforementioned problems by using resources in a very efficient way while maintaining good performance. Fairness of scheduling and service is provided by using a two-slot dynamic length WFQ calendar. The calendar can be configured to provide a fine granularity by using a hierarchical WFQ scheme. 
     SUMMARY OF THE INVENTION 
     Therefore, in accordance with a first embodiment of the invention there is provided a method of scheduling events in a communication system, the method comprising configuring a scheduling calendar with multiple slots wherein the length of each slot is varied dynamically based on a virtual theoretical emission time (VTET) of queues scheduled thereon. 
     In accordance with a second aspect of the invention there is provided a system for scheduling events in a communications system, the system comprising a scheduling calendar having multiple slots wherein the length of each slot is dynamically variable, the length being based on a virtual theoretical emission time (VTET) of queues scheduled thereon. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       The invention will now be described in greater detail with reference to the attached drawings wherein: 
         FIG. 1  Illustrates a two-slot dynamic length WFQ calendar; and 
         FIG. 2  Illustrates the forming of a high precision WFQ calendar through a number of two slot dynamic length calendars. 
     
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
     As shown in  FIG. 1 , the 2-slot dynamic length WFQ calendar consists of 2 slots, but the length of each calendar slot can be changed dynamically based on the maximum virtual theoretical emission time (i.e. vtet) of the queues scheduled on the calendar slot. In  FIG. 1 , the length of slot  0  (VT_slot 0 ) is equal to the maximum length of VtetA and VtetB and the length of slot  1  (VT_slot 1 ) is equal to the maximum length of VtetC, VtetD, VtetE and VtetF. 
     The concept of the VTET is expressed by the following pseudo code for illustration purposes:
         Vtet X: virtual theoretical emission time for queue X;   VTP: Virtual Time Pointer and it represents the system virtual time in the WFQ algorithm;   VweightPeriod X: the reciprocal value of weight for queue X.   scheduling packet size: the length of the scheduling packet.       

     If queue X is empty then
 
 V tet  X=VTP+V weightPeriod  X *scheduling packet size;
 
     Else
 
 V tet  X=V tet  X _previous+ V weightPeriod  X *scheduling packet size
 
     End if 
     The scheduling and servicing methods of the two-slot dynamic length WFQ calendar are the same as traditional n-slot WFQ calendar. During the scheduling event, the scheduling queue is located on the calendar slot which represents the range of the Vtet of the scheduling queue. During the servicing event, the Virtual Time Pointer (VTP) will advance to the nearest occupied slot and the head queue in the nearest occupied slot is granted. 
     The following simple example illustrates how this works: 
     Queue X and queue Y are scheduled on the calendar and VweightPeriods for queue X and Y are 1 and 2 respectively. The packets in the queue X and Y are all 100 byte packets and both queues will not be empty. 
     Initially, VT_slot 0 =100 and VT_slot 1 =200 and no queues are scheduled on it. Queue X is first scheduled on the slot  0  because its Vtet=100; then queue Y is scheduled on the slot  1  because its Vtet=200. No adjustments are required for both VT_slot 0  and VT_slot 1 . 
     (1) At the first service event, the queue X is granted, its Vtet=200 after the reschedule and it is put on the slot  1  again and no adjustment is required for VT_slot 1 ; 
     (2) At the second service event, the queue Y is granted, its Vtet=400 after the reschedule and it is put on the slot  0  and the VT_slot 0  is adjusted to 400. 
     The sequence of the service events and corresponding data is listed in Table 1 and it is easy to see that it achieves the expected fairness (i.e., queue X serviced 2 times faster than queue Y). 
     
       
         
               
               
             
               
               
               
               
               
               
               
               
               
               
               
             
               
               
             
               
               
               
               
               
               
               
               
               
               
               
             
           
               
                   
                 TABLE 1 
               
               
                   
                   
               
             
             
               
                   
                 Service sequence 
               
             
          
           
               
                   
                 Initial 
                 1 
                 2 
                 3 
                 4 
                 5 
                 6 
                 7 
                 8 
                 9 
               
               
                   
               
               
                 granting queue 
                   
                 X 
                 Y 
                 X 
                 Y 
                 X 
                 X 
                 Y 
                 X 
                 X 
               
               
                 Vtet X 
                 100 
                 200 
                 200 
                 300 
                 300 
                 400 
                 500 
                 500 
                 600 
                 700 
               
               
                 Vtet Y 
                 200 
                 200 
                 400 
                 400 
                 600 
                 600 
                 600 
                 800 
                 800 
                 800 
               
               
                 VT_slot0 
                 100 
                 100 
                 400 
                 400 
                 400 
                 400 
                 400 
                 800 
                 800 
                 800 
               
               
                 VT_slot1 
                 200 
                 200 
                 200 
                 200 
                 600 
                 600 
                 600 
                 600 
                 600 
                 600 
               
               
                   
               
             
          
           
               
                   
                 Service sequence 
               
             
          
           
               
                   
                 10 
                 11 
                 12 
                 13 
                 14 
                 15 
                 16 
                 17 
                 18 
                 19 
               
               
                   
               
               
                 Granting queue 
                 Y 
                 X 
                 X 
                 Y 
                 X 
                 X 
                 Y 
                 X 
                 X 
                 Y 
               
               
                 Vtet X 
                 700 
                 800 
                 900 
                 900 
                 1000 
                 1100 
                 1100 
                 1200 
                 1300 
                 1300 
               
               
                 Vtet Y 
                 1000 
                 1000 
                 1000 
                 1200 
                 1200 
                 1200 
                 1400 
                 1400 
                 1400 
                 1600 
               
               
                 VT_slot0 
                 800 
                 800 
                 800 
                 1200 
                 1200 
                 1200 
                 1200 
                 1200 
                 1200 
                 1600 
               
               
                 VT_slot1 
                 1000 
                 1000 
                 1000 
                 1000 
                 1000 
                 1000 
                 1400 
                 1400 
                 1400 
                 1400 
               
               
                   
               
             
          
         
       
     
     As shown in  FIG. 2 , it is possible to increase the granularity and precision of the WFQ calendar by using a number of 2-slot dynamic length WFQ calendars based on a hierarchical scheme. In  FIG. 2 , the weight for queues  1 ,  2 , and  3  are w 1 , w 2 , and w 3 , respectively. The weight for the calendar X (wx) is equal to the sum of the weights of all the queues which are scheduled on the calendar X. For a greater understanding of the hierarchical scheme refer to a paper by Rexford et al., entitled “Hardware-Efficient Fair Queuing Architectures for High-Speed Networks, Proc. IEEE INFOCOM, March 1996, pp. 638-646. 
     Memory is saved by the two-slot dynamic length WFQ calendar implementation in comparison to other WFQ calendar implementations while the same fairness is achieved. This also means that a given implementation of a TM device, eg an ASIC, can support more WFQ schedulers or that the WFQ schedulers will require fewer resources to implement. 
     With an implementation such as an ASIC chip which have many such two-slot WFQ calendars, it is easy to make it support thousands of coarse granularity WFQ schedulers, or make it support hundreds of fine granularity WFQ schedulers, or make it support some fine granularity WFQ schedulers and some coarse granularity WFQ schedulers. 
     This is a very useful feature For example, the fine granularity WFQ schedulers can be used for real time traffic, while the coarse WFQ schedulers can be used for best effort traffic. Alternatively, the granularity of a WFQ calendar may be determined dynamically based on the number of queues that are scheduled on it. 
     One of the hardest parts of WFQ calendar implementation is the selection of the servicing calendar slot. With such a two-slot WFQ calendar, the selection of the servicing calendar slot is very simple, so it is much easier to implement, as is the high speed scheduler. 
     While particular embodiments of the invention have been described and illustrated it will be apparent to one skilled in the art that numerous changes can be made without departing from the basic concepts. It is to be understood that such changes will fall within the said scope of the invention as defined in the appended claims.