Source: http://www.patentgenius.com/patent/5889779.html
Timestamp: 2018-10-18 06:40:31
Document Index: 537874296

Matched Legal Cases: ['art 300', 'art 325', 'art 350', 'art 350', 'art 400', 'art 400', 'art 500', 'art 500', 'art 325', 'art 325', 'art 350', 'art 350', 'art 350', 'art 400', 'art 425', 'art 425', 'art 425', 'art 425', 'art 400', 'art 425', 'art 425', 'art 425', 'art 500', 'art 500', 'art 500', 'art 500', 'art 600', 'art 600', 'art 600']

Scheduler utilizing dynamic schedule table - Patent # 5889779 - PatentGenius
Scheduler utilizing dynamic schedule table
5889779 Scheduler utilizing dynamic schedule table
Inventor: Lincoln
Application: 08/759,057
Inventors: Lincoln; Bradford C. (Boulder, CO)
Assignee: Rockwell Science Center (Newport Beach, CA)
Assistant Examiner: Sam; Phirin
U.S. Class: 370/395.42; 370/398; 370/412
Field Of Search: 370/229; 370/234; 370/395; 370/396; 370/398; 370/412; 370/418; 370/235
U.S Patent Documents: 5412648; 5533020; 5610921; 5633870; 5638371; 5649110; 5684791; 5712851
Abstract: An asynchronous transfer mode scheduler schedules connection utilizing available bit rate (ABR) modes of traffic, unspecified bit rate (UBR) modes of traffic, variable bit rate (VBR) modes of traffic, and constant bit rate (CBR) modes of traffic. The scheduler communicates with a dynamic schedule table which includes a programmable number of slots. Each slot includes a CBR entry, a tunnel entry, and a number of VBR entries. The VBR entries store a slot tail pointer which indicates the end of a linked list. The scheduler utilizes the single bucket algorithm or dual bucket algorithm to dynamically schedule connections on future slots. The scheduler places connections using the VBR mode of traffic in a priority queue and takes the highest priority connection in the priority queue for transmission on the network.
1. A dynamic schedule table for use with a scheduler coupled to a communications system, the scheduler accessing the dynamic schedule table to schedule transmission of dataassociated with a plurality of connections in the communication system, the dynamic schedule table comprising:
a plurality of slot locations, each of the slot locations including a first storage location and a plurality of second storage locations, the first storage location storing an indication of a connection utilizing a constant bit rate mode oftraffic and the second storage locations each storing an indication of a connection utilizing a variable bit rate mode of traffic; and
a third storage location in each of the slot locations, the third storage location storing an indication of a connection for a tunnel constant bit rate mode of traffic.
2. The dynamic schedule table of claim 1 wherein the second storage locations are arranged in a priority order.
3. The dynamic schedule table of claim 1 wherein the communication system is an ATM system.
4. The dynamic schedule table of claim 1 wherein the number of slot locations is programmable.
5. The dynamic schedule table of claim 1 wherein the second locations store a slot tail pointer for a linked list.
6. A traffic manager system coupled to a communication system for scheduling transmission of data associated with a plurality of connections in the communication system, the traffic manager system comprising:
a dynamic schedule table including a plurality of slot locations;
a global priority queue including a tunnel mode priority level, the global priority queue defining a linked list at the tunnel mode priority level;
a scheduler memory; and
a scheduler coupled to the dynamic schedule table, the global priority queue, and the scheduler memory, the scheduler processes the slot locations in the dynamic schedule table to place connections utilizing variable bit rate mode in the globalpriority queue in a priority order, the scheduler selecting the connections from the global priority queue according to the priority order and placing selected connections in the scheduler memory for eventual transmission in the communications system,the scheduler setting the tunnel priority level active in response to processing a tunnel entry in one of the slots, the scheduler selecting connections from the linked list defined by the tunnel mode priority level when the tunnel priority level isactive.
7. The traffic manager system of claim 6 wherein the scheduler processes the slots in the dynamic schedule table to place connections directly in the scheduler memory for eventual transmission in the communication system.
8. A traffic manager system coupled to a communications system for scheduling transmission of data associated with a plurality of connections in the communications system, the traffic manager system comprising:
a global priority queue;
a scheduler coupled to the dynamic schedule table, the priority queue, and the scheduler memory, the scheduler processes the slot locations in the dynamic schedule table to place connections utilizing variable bit rate mode in the global priorityqueue in a priority order according to a dual bucket algorithm, the scheduler selecting the connections from the global priority queue according to the priority order and placing selected connections in the scheduler memory for eventual transmission inthe communications system.
9. The traffic manager system of claim 8 wherein the scheduler reschedules a connection in a future slot of the slots based upon the dual bucket algorithm.
10. The traffic manager system of claim 8 wherein the scheduler selects the connections from the global priority queue in response to a timing parameter indicative of a real time parameter, thereby ensuring priority isolation for CBRconnections.
a controlled memory including a schedule table and a connection state data structure, the schedule table including a plurality of slots, each of the slots storing at least one connection, the connection using a variable bit rate mode of traffic,the connection state data structure including variable bit rate mode parameters for the connection; and
a scheduler coupled to the control memory, the scheduler processing the slots in the schedule table to select a connection for eventual transmission, the scheduler dynamically rescheduling the connection in a new slot of the slots in response toa timing parameter and the variable bit rate mode parameters for the connection, the scheduler dynamically rescheduling in accordance with a single bucket algorithm.
a controlled memory including a schedule table and a connection state data structure, the schedule table including a plurality of slots, each of the slots storing at least one connection, the connection using the variable bit rate mode oftraffic, the connection state data structure including variable bit rate mode parameters for the connection; and
a scheduler coupled to the control memory, the scheduler processing the slots in the schedule table to select a connection for eventual transmission, the scheduler dynamically rescheduling the connection in a new slot of the slots in response toa timing parameter and the variable bit rate mode parameters for the connection, the scheduler dynamically rescheduling in accordance with a dual bucket algorithm.
13. The communication system of claim 12 wherein the variable bit rate mode parameters include delta 1, delta 2, L1, L2, I1, and I2 parameters where a delta 1 parameter is a difference between the desired first bucket next transmission time andthe last transmission time for VBR modes of traffic, a delta 2 parameter is the difference between the desired second bucket next transmission time and the last transmission time for VBR modes of traffic, the I1 and L1 parameters for the first VBR bucketalgorithm, and the I2 and L2 parameters for the second VBR bucket algorithm.
14. The communication system of claim 12 further comprising:
a priority memory for storing the selected connection for eventual transmission in a priority order, and wherein the variable bit rate mode parameters include priority parameters and the connection is rescheduled in the new slot in accordancewith the priority parameters.
15. A method of scheduling connections for transmission on a communications network, the method comprising:
accessing a slot in a schedule table and retrieving connection information associated with a connection;
placing the connection information in a memory unit if the connection uses a CBR mode of traffic, the memory unit storing the connection information for eventual transmission of data associated with the connection;
forwarding the connection information to a priority queue if the connection does not use the CBR mode of traffic, the priority queue storing the connection information at a priority level associated with the connection;
placing the connection information from a highest available priority level of the priority queue in the memory unit; and
rescheduling the connection if the connection does not use the CBR mode of traffic by storing the connection information in a future slot of the schedule table.
16. The method of claim 15 wherein the future slot is chosen in accordance with VBR mode criteria.
17. A traffic manager system coupled to a communication system for scheduling transmission of data associated with a plurality of connections in the communication system, the traffic manager system comprising:
a control memory including a connection state data structure having a plurality of fields for each connection, the plurality of fields including a queue pointer field storing a queue pointer to another connection;
a global queue including a head pointer and a tail pointer; and
a scheduler coupled to the control memory and the global queue, the scheduler setting the head pointer, the tail pointer and the queue pointer to define a linked list, the linked list being linear for a variable bit rate mode of traffic and thelinked list being circular for an unspecified bit rate mode of traffic.
18. A traffic manager system coupled to a communication system for scheduling transmission of data associated with a plurality of connections in the communication system, the traffic manager system comprising:
a control memory including a connection state data structure having a plurality of fields for each connection, the plurality of fields including a queue pointer field storing a queue pointer to another connection and an out-of-rate pointer fieldstoring an out-of-rate pointer;
a global queue including a first head pointer and a first tail pointer at a first priority level and a second head pointer and a second tail pointer at a second priority level; and
a scheduler coupled to the control memory and the global queue, the scheduler setting the first head pointer, the first tail pointer and the first queue pointer to define a first linked list for in-rate scheduling and setting the second headpointer, second tail pointer and out-of-rate pointer to define a second linked list for out-of-rate scheduling.
19. The traffic manager system of claim 18 wherein the connection data structure further includes an out-of-rate priority field for storing an out-of-rate priority parameter, the scheduler scheduling the second linked list in response to theout-of-rate priority parameter.
20. A traffic manager system coupled to a communication system for scheduling transmission of data associated with a plurality of connections in the communications system, the traffic manager system comprising:
a connection state data structure having a plurality of fields for each connection, a plurality of fields storing variable bit rate parameters, including a minimum cell rate priority parameter and a minimum cell rate limit parameters;
a dynamic schedule table including a priority of slots, each of the slots including a variable bit rate entry; and
a scheduler coupled to the connection data structure and the dynamic schedule table, the scheduler processing the slots and loading connection information in a variable bit rate entry of the future slot of the slots in response to the variablebit rate parameter.
21. A traffic manager system coupled to a communication system for scheduling transmission of data associated with a plurality of connections in the communication system, the traffic manager system comprising:
a connection state data structure having a plurality of fields for each connection, the plurality of field storing variable bit rate parameters, including a cell loss priority parameter;
a dynamic schedule table including a plurality of slots, each of the slots including a variable bit rate entry; and
a scheduler coupled to the connection state data structure and the dynamic schedule table, the scheduler processing the slots and loading connection information in a variable bit rate entry of the future slot in response to the variable bit rateparameter, the scheduler loading the connection information in accordance with a single bucket algorithm.
22. A traffic manager system coupled to a communication system for scheduling transmission of data associated with a plurality of connections in the communication system, the traffic manager system comprising:
a scheduler coupled to the connection data structure and the dynamic schedule table, the scheduler processing the slots and loading connection information in a variable bit rate entry of the future slot in response to the variable bit rateparameters, the scheduler loading the connection information in accordance with a dual bucket algorithm.
23. A traffic manager system coupled to a communication system for scheduling transmission of data associated with a plurality of connections in the communication system, the traffic manager system comprising:
a connection state data structure having a plurality of fields for each connection, the plurality of field storing variable bit rate parameters, including a variable bit rate reset parameter;
a scheduler coupled to the connection data structure and the dynamic schedule table, the scheduler processing the slots and loading connection information in a variable bit rate entry of the future slot of the slots in response to the variablebit rate parameters, the scheduler loading the connection information in accordance with a bucket algorithm.
24. The traffic manager system of claim 23 wherein the scheduler loads the connection information in accordance with a bucket algorithm and a next packet size a parameter to accommodate variable packet size transmissions.
25. The traffic manager system of claim 23 further comprising:
an ABR manager coupled to the connection state data structure, the ABR manager changing a rate associated with a connection by modifying the VBR parameters in response to feedback.
26. The traffic manager system of claim 23 wherein the VBR parameters are an I parameter and an L parameter, whereby dynamic rate scheduling with fine granularity is achieved.
27. A traffic manager system coupled to a communication system for scheduling transmission of data associated with a plurality of connections in the communications system, the traffic manager system comprising:
a connection data structure having a plurality of fields for each connection, a plurality of fields storing variable bit rate parameters, including L1 and L2 parameters where L1 parameter for the first VBR bucket algorithm and L2 parameter forthe second VBR bucket algorithm;
28. The traffic manager system of claim 27 wherein the connection associated with the connection information is allowed to burst up to the L1 and L2 parameters to recover from periods where the connection was not allowed to be transmitted.
The present invention relates to a method and to an apparatus for transferring information through a communication medium. More particularly, the present invention relates to a method and to an apparatus for scheduling the transmission of datapackets across connections in a communication system.
Various systems have been adopted to carry digitally-encoded signals for communication applications, such as, telephone, video, and data services. These systems are often connection-oriented packet mode transmission systems, such as,asynchronous transfer mode (ATM) systems, frame relay systems, X.25 systems, or other transmission systems. Connection-oriented systems (e.g., ATM systems) have been employed in private and public communication systems or networks to transfer packetizedsignals (e.g., data cells or protocol data units) across communication lines, such as, telephone lines, cables, optical fibers, air waves, satellite links, or other communication media.
As an example, the ATM system transfers the data cells or units across the ATM system via connections or channels. The data cells can represent voice, sound, video, graphics, data, or combinations thereof for use in computing or communicationapplications. The connections can be part of a single physical link carrying a number of logical connections or be a single isolated path. The connections are often classified as either virtual channel connections (VCC), or virtual path connections(VPC) and either permanent virtual connections (PVC), or switched virtual connections (SVC). Connections are generally defined by a source and a destination for the data cell.
ATM systems or networks are generally utilized to support the integration of high quality voice, video, and high speed data traffic which can have specific conformance and quality of service (QOS) requirements. A scheduler is employed toproperly select connections for transmission in accordance with operational parameters, such as, QOS requirements. The scheduler organizes transmission of data cells associated with the connections to guarantee QOS requirements and protocol conformanceat the network ingress point as well as to maximize bandwidth for the communication system.
ATM systems can utilize at least four types of service categories or modes of traffic for transmission of data cells on connections. These four types include the constant bit rate (CBR) mode, the variable bit rate (VBR) mode, the unspecified bitrate (UBR) mode, and the available bit rate (ABR) mode. Each of these modes have somewhat different transmission protocol requirements. For example, the CBR mode requires that a connection be able to send a specific number of cells or bits per second;the CBR mode must have a set end-to-end bandwidth. The CBR mode is often utilized for data sources, such as, voice or video circuits which are susceptible to cell delay variations (CDV). The VBR mode often utilizes a "single leaky bucket" algorithm(e.g., virtual scheduling algorithm) or "dual leaky bucket" algorithm. Although the VBR mode has somewhat more flexible timing requirements than the CBR mode, the VBR mode must meet timing requirements dictated by the single or dual bucket algorithms. The ABR mode requires the sending of data cells in response to feedback from the network.
To appropriately supply and maximize the effectiveness of the transmission of the CBR, UBR, ABR, and UBR modes of traffic on the network, a scheduler controls a segmentation coprocessor (e.g., segmentation and reassembly unit) to directcommunication of data cells or data protocol units on the connections. Generally, the scheduler attempts to select particular connections for transmission at particular times to guarantee conformance to traffic contracts and to QOS at network ingresspoints. This selection process, or scheduling, selects various connections for transmission based upon operational parameters associated with each connection, with feedback from the network, and with traffic mode timing requirements.
Scheduling a large number of connections with particular timing and communication criteria can lead to complex scheduling problems. For example, various connections can need a particular capacity from the network, and the availability of theparticular capacity can be impinged by congestion across the network. These scheduling problems can be compounded by the specific requirements of CBR mode, VBR mode, UBR mode, and ABR modes of traffic.
Traditional network scheduling algorithms, such as, Token Ring and Ethernet utilize fairly simplified scheduling algorithms. The algorithms are typically based upon transmission schemes wherein each member of the network gets a fair share of thenetwork bandwidth. These systems cannot handle QOS requirements or the four categories (e.g., CBR mode, VBR mode, UBR mode, and ABR mode) of traffic for ATM systems.
Prior schedulers utilized in ATM systems access a fixed size schedule table to assist time scheduling of connections. The fixed schedule table is comprised of slots, each of which is assigned to particular connections. The scheduler processeseach slot one-by-one and transmits the connection assigned to the slot being processed to the network. These prior schedulers are somewhat inflexible and prioritize CBR and VBR modes traffic. Further, the fixed schedule table requires that the CBRmodes of traffic be sent a fixed rate or a harmonic of a fixed rate. Further still, these prior schedulers often must send idle cells to maintain the drain rate for the connection.
Other prior schedulers utilize a first-in, first-out (FIFO) memory and a timer (e.g., hardware units) to appropriately send connections across the network. However, the number of hardware units is limited by circuit size design criteria andcannot be dynamically allocated as bandwidth becomes available. Each FIFO and timer must be dedicated to a particular rate of transmission. Therefore, the rates of transmission are limited. Additionally, these prior schedulers cannot prioritize VBRand CBR modes of traffic.
Thus, there is a need for a scheduler which can dynamically manage and prioritize modes of traffic. Additionally, there is a need for a scheduler for an asynchronous transfer mode (ATM) system which can efficiently handle the CBR mode oftraffic, the VBR mode of traffic, the UBR mode of traffic, and the ABR mode of traffic. Further still, there is a need for a scheduler which can handle both the CBR mode of traffic and the VBR mode of traffic on a dynamic basis.
The present invention relates to a dynamic schedule table for use with a scheduler coupled to a communication system. The scheduler accesses the dynamic schedule table to schedule transmission of data associated with a plurality of connectionsin the communication system. The dynamic schedule table includes slot locations. Each of the slot locations includes a first storage location and second storage locations. The first storage location stores an indication of a connection utilizing aconstant bit rate mode of traffic, and the second storage locations each store an indication of a connection utilizing a variable bit rate mode of traffic.
The present invention further relates to a traffic manager system coupled to a communication system for scheduling transmission of data associated with a plurality of connections in the communication system. The traffic manager system includes adynamic schedule table, a global priority queue, a scheduler memory, and a scheduler. The dynamic schedule table includes a plurality of slot locations. The scheduler is coupled to the dynamic schedule table, the global priority queue, and thescheduler memory. The scheduler processes the slot locations in the dynamic schedule table to place connections utilizing variable bit rate mode in the global priority queue in a priority order. The scheduler selects the connections from the globalpriority queue according to the priority order and places the selected connections in the scheduler memory for eventual transmission in the communication system.
The present invention still further relates to a communication system including a control memory, and a scheduler. The control memory includes a schedule table and a connection state data structure. The schedule table includes slots which storeat least one connection. The connection uses a variable bit rate mode of traffic. The connection state data structure includes variable bit rate mode parameters for the connection. The scheduler is coupled to the control memory. The schedulerprocesses the slots in the schedule table to select a connection for eventual transmission. The scheduler dynamically reschedules the connection in a new slot of the slots and responds to a timing parameter and the variable bit rate mode parameters forthe connection.
The present invention also relates to a method of scheduling connections for transmission on a communication network. The method includes steps of accessing a slot in a schedule table and retrieving connection information associated with aconnection, placing the connection information in a memory unit if the connection uses a CBR mode of traffic, forwarding the connection information to a priority queue if the connection does not use the CBR mode of traffic, and placing the connectioninformation from a highest available priority level of the priority queue in the memory unit. The memory unit stores connection information for eventual transmission of data associated with the connection. The priority queue stores the connectioninformation at a priority level associated with the connection.
The present invention further relates to a traffic manager system coupled to a communication system for scheduling transmission of data associated with a plurality of connections in the communication system. The traffic manager system includes acontrol memory, a global queue, and a scheduler coupled to the control memory and the global queue. The control memory includes a connection state data structure having a plurality of fields for each connection, which include a queue pointer field forstoring a queue pointer to another connection. The global queue includes a head pointer and a tail pointer. The scheduler sets the head pointer, the tail pointer, and the queue pointer to define a linked list. The linked list is linear for a firstmode of traffic and the linked list is circular for a second mode of traffic.
The present invention still further relates to a traffic manager system coupled to a communication system for scheduling transmission of data associated with a plurality of connections in the communication system. The traffic manager systemincludes a control memory, a global queue, and a scheduler coupled to the control memory and the global queue. The control memory includes a connection state data structure having a plurality of fields for each connection which include a queue pointerfield for storing a queue pointer to another connection and an out-of-rate pointer field storing an out-of-rate pointer. The global queue includes a first head pointer and a first tail pointer at a first priority level and a second head pointer and asecond tail pointer at a second priority level. The scheduler sets the first head pointer, the first tail pointer and the first queue pointer to define a first linked list for in-rate scheduling and sets the second head pointer, the second tail pointer,and out-of-rate pointer to define a second linked list for out-of-rate scheduling.
The present invention still further relates to a traffic manager system coupled to a communication system for scheduling transmission of data associated with a plurality of connections in the communication system. The traffic manager systemincludes a schedule table, a connection state data structure, and a scheduler coupled to the schedule table and the connection state data structure. The schedule table includes a plurality of VBR slot locations which have a single tail pointer. Theconnection state data structure has a plurality of fields for each connection. The plurality of fields include a queue pointer field for storing a queue pointer to another connection. The queue pointer and the single tail pointer define a linked list. The scheduler processes the VBR slot locations in the scheduled location to select at least one connection from the linked list for eventual transmission in the communication system. Memory in the schedule table is saved by utilizing the single tailpointer in combination with the queue pointer to define the linked list.
The present invention still further relates to a traffic manager system coupled to a communication system for scheduling transmission of data associated with a plurality of connections in the communication system. The traffic manager systemincludes a connection state data structure, a dynamic schedule table, and a scheduler coupled to the connection state data structure and the dynamic schedule table. The connection state data structure has a plurality of fields for each connection whichstore VBR parameters. The dynamic schedule table includes a plurality of slots, each of which includes a VBR entry. The scheduler processes the slots and loads connection information in a VBR entry of a future slot of the slots in response to the VBRparameters.
According to one exemplary aspect of the present invention, a dynamic scheduler table is programmable to be various sizes. The schedule table includes slots having an entry dedicated to receive a connection which utilizes the constant bit ratemode of traffic, an entry for tunnel mode transmission of traffic, and a number of entries for connections which utilize VBR modes of traffic. The entries which store the connections utilizing the VBR modes of traffic include a single tail pointer whichpoints to an end of a linked list.
In another aspect of the present invention, the scheduler process the slots and places the connections using the constant bit rate mode of traffic directly in a schedule FIFO and places connections utilizing other modes of traffic in a priorityqueue. The scheduler then accesses the priority queue and places the highest priority connections in the priority queue into the scheduler FIFO.
According to yet another exemplary embodiment of the present invention, the scheduler utilizes a single bucket or dual bucket algorithm to dynamically schedule connections utilizing variable bit rate modes of traffic. The scheduler dynamicallyplaces connections in future slots in the schedule table and responds to variable bit rate mode parameters and timing parameters.
In accordance with still further exemplary aspects of the present invention, dynamic rate scheduling with fine granularity for ABR modes of traffic can be achieved by adjusting the rate for a connection in response to feedback. The I and Lparameters associated with a leaky bucket algorithm can be adjusted to change the rate for a connection for ABR modes of traffic. Statistical multiplexing can be achieved for VBR and ABR modes of traffic by bursting connections to the extent allowed byL1 and L2 parameters associated with the dual bucket algorithm to recover from periods during which the connections were not allowed to be transmitted. A VBRC algorithm can also be utilized which relies on a cell loss priority parameter (CLP). Thescheduler can also schedule connections in accordance with a minimum cell rate (MCR) priority parameter and a minimum cell rate (MCR) limit parameter. The scheduler can also be modified to handle packets of data which are not of fixed size.
With reference to FIG. 1, a communication system 20 includes a traffic manager system or unit 25 coupled to an ATM system or network 30 by a communication line 32. Unit 25 includes a scheduler 34, a timer 36, a global priority queue 38, a startFIFO memory 40, a schedule FIFO memory 42, an available bit rate (ABR) manager 44, a segmentation unit 46, and a transmit FIFO memory 50. Scheduler 34 of unit 25 is coupled to a control memory 48 via bus 52.
Control memory 48 is coupled to ABR manager 44 of unit 25 by a bus 54. Scheduler 34 is coupled to timer 36, global priority queue 38, start FIFO memory 40, schedule FIFO memory 42, and ABR manager 44. Scheduler 34 is coupled to ABR manager 44by a control bus 56 and by a control bus 58. Segmentation unit 46 is coupled to start FIFO memory 40, schedule FIFO memory 42, and transmit FIFO memory 50. Transmit FIFO memory 50 is coupled to communication line 32.
Control memory 48 can be any memory unit, such as, a semiconductor memory or other storage facility. Queue 38 is preferably a semiconductor memory (e.g., register or static random access memory) device integrated with scheduler 34 for fasttransfer of information. Unit 25 is preferably integrated on a single semiconductor substrate, including processing units, state machines, registers, and other circuits for implementing the functions and operations of scheduler 34, timer 36, globalpriority queue 38, start FIFO memory 40, schedule FIFO memory 42, ABR manager 44, segmentation unit 46, and transmit FIFO memory 50.
Traffic manager unit 25 preferably provides data packets or data cells as protocol data units (PDU) to ATM network 30. In general, scheduler 34 is a state machine which responds to timing signals from timer 36, control signals from ABR manager44 across control bus 58, connection information and operational parameters for each connection stored in control memory 48, and connection information in start FIFO memory 40 to place connection information in global priority queue 38. Scheduler 34selects the highest priority connection information in queue 38 and places that information in schedule FIFO memory 42 for eventual transmission through network 30.
Segmentation unit 46 receives the connection information stored in schedule FIFO memory 42. Segmentation unit 46 utilizes the connection information to place data cells associated with the connection information in transmit FIFO memory 50. Thedata cells are transmitted from FIFO memory 50 to line 32 and then to network 30. Segmentation unit 46 generally organizes the data cells into protocol data units (PDUs) for transmission on the network 30.
Scheduler 34 can also directly place connection information from control memory 48 into schedule FIFO memory 42. For example, scheduler 34 places connection information for the CBR mode of traffic directly from memory 48 to FIFO memory 42without accessing queue 38. In this way, scheduler 34 ensures that the CBR mode of traffic is sent in accordance with its strict timing requirements.
ABR manager 44 is a state machine which receives feedback from network 30 through control bus 56 from scheduler 34 and requests that scheduler 34 schedule a connection for the ABR mode of traffic in response to the feedback and to the parametersfor the particular connection. Manager 44 implements an ABR flow control algorithm to process the feedback based upon user-programmable parameters and connection parameters. In general, ABR manager 44 indicates that a connection in the ABR mode oftraffic should be scheduled and the types of cells which should be sent as part of the traffic via control bus 58. For example, ATM network 30 preferably handles three types of ABR cells: data cells, forward resource management (RM) cells, and backwardRM cells. ABR manager 44 indicates the type of cell which scheduler 34 should schedule and the mode of traffic (e.g., an out-of-rate transmission or an in-rate transmission).
The in-rate transmission is scheduled by scheduler 34 as a "single bucket" VBR mode of traffic transmission, and the out-of-rate transmission is scheduled utilizing a dedicated priority level of queue 38. Generally, out-of-rate transmission isused for both out-of-rate forward RM cells that are requested at a low rate by ABR manager 44 and for out-of-rate backward RM cells that are requested by ABR manager 44 based on received traffic from network 30. A connection can send out-of-rate cellsat the same time the connection is using VBR scheduling to send in-rate cells.
ABR manager 44 can also adjust the rate for a connection utilizing the ABR mode of traffic in response to feedback. Manager 44 can write new I and L parameter values which are stored in memory 48 to adjust the rate according to a bucketalgorithm. In this way, dynamic rate scheduling for ABR modes of traffic with fine granularity can be achieved.
Start FIFO memory 40 holds connection information related to data cells that have been received from a host or data source (not shown). Start FIFO memory 40 is processed by scheduler 34 to add connections to global priority queue 38 for eventualplacement in schedule FIFO memory 42 and for eventual transmission on network 30. The connection information is the indication of the connection number of the data received by segmentation unit 46.
With reference to FIG. 2, global priority queue 38 is comprised of a head pointer stored in a column 60 and a tail pointer stored in a column 62. Queue 38 stores head pointers and tail pointers at priority levels 64A-H. Alternatively, queue 38can store any number of priority locations. FIG. 2 shows exemplary priority levels associated with particular modes of traffic and an exemplary table-type data structure. For example, the out-of-rate UBR traffic mode is given the first priority (e.g.highest) at priority level 64A, and the tunnel mode of traffic is given the last priority (e.g., lowest) in queue 38. The head pointer and tail pointer stored in columns 60 and 62, respectively, are simply an address or information which indicates aconnection associated with the transmission. The head pointer and the tail pointer generally direct scheduler 34 to memory locations in control memory 48 which are described in more detail below with reference to FIG. 4.
To advantageously save memory space in queue 38 and to allow faster data transfer from scheduler 34 to queue 38, only the head pointer and the tail pointer are stored in global priority queue 38 for each of priority levels 64A-H. As an example,global priority queue 38 is shown including eight priority levels 64A-H that can be utilized. Four of the eight priority levels 64A-H are preferably contiguous and are utilized for VBR modes of traffic. The priority levels for ABR, VBR, and UBR modesof traffic can be set by the user.
The head pointers and tail pointers can define a linked list of a number of connections for each of priority levels 64A-H. Exemplary linked lists are shown in FIG. 3. The linked lists are used to indicate a number of connections at theparticular priority level of levels 64A-H in queue 38 without using a large amount of memory. Thus, queue 38 can indicate a large list of connections, even though only a head pointer and tail pointer are stored in queue 38.
Generally, priority queue 38 includes a register (not shown) which indicates when the head pointer in column 60 includes information. In this way, scheduler 34 can simply check the register for each priority level of levels 64A-H rather thanaddressing priority queue 38 to determine if a head pointer is available in column 60. In this way, scheduler 34 saves time, as only one bit in the register needs to be checked to determine if a head pointer is present.
With reference to FIG. 3, a linked list 64 of connections for VBR that moves out traffic is defined by a head pointer in column 60 of queue 38 and a tail pointer in column 62 of queue 38. The head pointer provides an address or indication of aconnection state 66A in control memory 48 (FIG. 1). Connection state 66A includes a pointer which points to a next connection state 66B stored in control memory 48. Connection state 66B includes a pointer which points to connection state 66C stored incontrol memory 48. The tail pointer stored in column 62 of queue 38 also points to connection state 66C. Therefore, for linked list 64, the head pointer in column 60 stores connection state 66A for the head of list 64 and the tail pointer in column 62stores the connection state 66C for the end of list 64.
Similarly, a circular linked list 68 is shown in FIG. 3 which is defined by the head pointer in column 60 and the tail pointer in column 62. The head pointer in column 60 points to a first connection state 70A in circular linked list 68. Similar to linked list 64, state 70A includes a pointer which points to a connection state 70B, and connection state 70B includes a pointer which points to a connection state 70C. Connection states 70A-C are stored in control memory 48. Additionally,connection state 70C includes a pointer which points back to connection state 70A so that a circular buffer or linked list is defined. The tail pointer in column 62 also points to connection state 70C.
Linked list 64 is typically used for VBR modes of traffic, and linked list 68 is typically used for UBR modes of traffic. Circular linked list 68 facilitates round-robin orientation of connections in queue 38 which are utilized by UBRconnections. In UBR modes of traffic, the connection is typically not removed after transmission. Since the connection utilizing the VBR modes of traffic are typically removed from queue 38 after transmission, there is no advantage in maintaining acircular linked list such as link 68. The use of the head pointer in column 60 and tail pointer 62 allows easy access to both ends of lists 64 and 68. For example, if connections need to be added to linked list 64, the tail pointer provides directionsto connection state 66C which is modified to point to the additional connection state (not shown). The tail pointer is then pointed to the additional connection state. For circular linked list 68, state 70C is modified to point to the additional state,and the additional state includes a pointer to state 70A. The tail pointer is amended to point to the additional state.
With reference to FIG. 4, control memory 48 includes a data structure or connection state 90 which includes storage locations or fields 92A-R. Control memory 48 includes a connection state 90 for each connection associated with traffic classmanager unit 25. Each state 90 represents a connection in network 30. State 90 in FIG. 4 represents the data structure of states 66A-C and 70A-C in FIG. 3.
A data available field 92A indicates whether data for the particular connection is available for transmission on network 30. A last CLP field 92B includes a cell loss priority (CLP) parameter which indicates the value of the cell loss priorityfor the most recently transmitted cell of the connection. A scheduled field 92C indicates that the connection is presently linked to a dynamic schedule table 88 (FIG. 5) within memory 48 or is part of a linked list, such as, lists 64 and 68 (FIG. 3)defined in global priority queue 38. A schedule mode field 92D indicates whether the connection utilizes an UBR, a CBR, a VBR1 (e.g., single bucket VBR), a VBR2 (e.g., dual bucket VBR), a VBRC (dual bucket CLP control), or an ABR mode of traffic.
A priority field 92E includes a priority parameter which indicates the scheduling priority of the connection. The priority parameter corresponds to priority levels 64A-H of queue 38 (FIG. 2) and provides an indication as to which priority levelof levels 64A-H in priority queue 38 the connection should be stored.
A queue pointer field 92F stores a pointer for linking lists defined in dynamic schedule table 88 or in priority queue 38. The queue pointer for the connection is utilized in lists for VBR modes of traffic, such as, list 64 and in lists for theUBR modes of traffic, such as, list 68. A VBR reset field 92G stores a reset parameter for the VBR bucket algorithms (e.g., single bucket, dual bucket, or CLP bucket).
An I1 field 92H includes an I1 parameter for the first VBR bucket algorithm, and an L1 field 92I provides an L1 parameter for the first VBR bucket algorithm. An I2 field 92J provides an I2 parameter for the second VBR bucket algorithm, and an L2field 92K provides an L2 parameter for the second VBR bucket algorithm.
A present field 92L provides a present parameter indicative of the time of the last VBR mode of traffic transmission for the connection. A delta 1 field 92M provides a delta 1 parameter indicative of the difference between the desired firstbucket next transmission time and the last transmission time for VBR modes of traffic. A delta 2 field 92N provides a delta 2 parameter indicative of the difference between the desired second bucket next transmission time and the last transmission timefor VBR modes of traffic.
A minimum cell rate (MCR) priority field 920 provides an MCR priority parameter for temporarily increasing the priority of the connection to provide MCR guarantees for ABR modes of traffic. An MCR limit field 92P provides an MCR limit parameterindicative of a maximum time interval between connection cell transmissions before the MCR priority parameter is set.
Out-of-rate priority field 92Q provides a scheduling priority parameter for out-of-rate cells for ABR modes of traffic. An out-of-rate pointer field 92R provides an out-of-rate pointer to a connection state 90. Similar to the queue pointer infield 92F, the out-of-rate pointer is used to build linked lists, such as, list 68 (FIG. 3).
With reference to FIG. 5, dynamic schedule table 88 is located in memory 48 (FIG. 1). Schedule table 88 is comprised of a number of slots 88A-G (e.g., from slot 1 to M where M is a user-programmable parameter). Slots 88A-G are each comprised ofa CBR entry 94, a tunnel entry 95, and slot tail pointer entries 96A-D. Each of slots 88A-G can be configured to include a number of slot tail pointer entries 96A-D from 1 to N. Each of entries 96A-D is associated with a particular VBR priority level oflevels 64A-H in queue 38 (FIG. 2). The VBR priority levels 1-N for entries 96A-D are mapped to global priority levels 64A-H via a fixed offset (although an arbitrary mapping is also possible).
CBR entry 94 stores connection information if a CBR mode of traffic connection should be transmitted. For example, when scheduler 34 processes slot 88C, scheduler 34 reads CBR entry 94, and if the connection information is present, scheduler 34places the connection information in schedule FIFO memory 42.
Tunnel entry 95 is used to indicate that one of a group of connections should be transmitted in round-robin order in the CBR mode of traffic. In tunnel transmission mode, scheduler 34 reads entry 95 and activates tunnel priority level 64H inqueue 38. Queue 38 includes a header or flag bit which is set when tunnel priority level 64H is active. Columns 60 and 62 for the tunnel priority level 64H define a circular linked list (not shown) similar to link list 68 (FIG. 3).
Scheduler 34 sends the connection at the head of the linked list defined by level 64H of queue 38 to schedule FIFO memory 42 the next time the queue 38 is accessed. Priority level 64H is accessed only when active even if the head pointer incolumn 60 has a connection entry. When active, the priority level 64H is accessed in the normal priority order. When the next slot of slots 88A-G that has an entry 95 is processed, scheduler 34 sets level 64H active, and the next connection in thecircular linked list of the tunnel priority level 64H is selected. In this way, connection for the tunnel mode transmission is processed in a round-robin order.
Slot tail pointer entries 96A-D provide slot tail pointers which indicate a connection state at the tail of a linked list (not shown). For example, when slot 88C is processed, scheduler 34 reads the slot tail pointer in entry 96A and addresses aconnection state 96A (having the structure of connection state 90 in FIG. 4). State 96A includes a queue pointer field 92F (FIG. 4) which points to a state 98B (e.g., the head of linked list 98). Similarly, state 98B points to a state 98C which pointsto state 98A. The head of linked list 98 is reached by following the tail entry 96A to the tail of the list (state 98A) and then following the queue pointer in field 92F of state 98A to the head of list 98 (e.g., state 98B). Entries 96A-D are used forVBR modes of traffic.
When scheduler 34 reads entry 96D, scheduler 34 is directed to a linked list 97. List 97 is comprised of one connection state 97A. The queue pointer in field 92F of state 97A points to itself (connection state 97A). Thus, the tail pointer inentry 96D and the queue pointer in field 92F of state 97A are the same.
Dynamic schedule table 88 can be programmed to be various sizes. The capability allows scheduler 34 to customize table 88 for various CBR modes of traffic. Since the size of table 88 is variable, scheduler 34 is more precisely able to schedulespecific rates for CBR modes of traffic.
With reference to FIGS. 6-12, the notation A.fwdarw.B means the field B (fields 92A-R) in connection state 90 indicated by the pointer A. With reference to FIG. 6, scheduler 34 operates according to a top level flow chart 300. Scheduler 34determines if an out-of-rate ABR connection must be scheduled at a step 302. At step 302, scheduler 34 determines if a signal from ABR manager 44 has been provided on control bus 58 indicating that an out-of-rate ABR mode of traffic connection must bescheduled.
Connections may need to be scheduled for out-of-rate transmissions of RM cells. Out-of-rate scheduling is used for both out-of-rate forward RM cells that are requested at a low rate by manager 44 and for out-of-rate backward RM cells that arerequested by manager 44 based on traffic received from ATM network 30. If scheduler 34 has received a signal from manager 44 that an out-of-rate ABR connection should be scheduled, scheduler 34 performs a flow chart 325 described with reference to FIG.7.
At step 304, scheduler 34 determines if start FIFO memory 40 is empty. If start FIFO memory 40 is empty, scheduler 34 advances to a step 306, as scheduler 34 does not have to process any connection information stored in FIFO memory 40. If startFIFO memory 40 is not empty (e.g., start FIFO memory 40 has received new connection information), scheduler 34 reads the connection information stored in start FIFO memory 40 at a step 308.
At a step 310, scheduler 34 determines if the connection associated with the connection information read from start FIFO memory 40 has been scheduled by reading scheduled field 92C of connection state 90 (FIG. 4) associated with the connection. If the connection has been scheduled, scheduler 34 advances to step 306. If the connection has not been scheduled, scheduler 34 performs a schedule connection flow chart 350 described with reference to FIG. 8. After schedule connection flow chart 350is completed, scheduler 34 advances to step 306.
At step 306, scheduler 34 determines if schedule FIFO memory 42 is not full and if a schedule difference parameter is greater than zero. The schedule difference parameter is derived from timing signals provided by timer 36. The scheduledifference parameter is indicative of whether scheduler 34 has reached the appropriate slot at the appropriate real time. For example, the schedule difference parameter is representative of the actual slot position minus the desired slot position at aparticular time. The schedule difference parameter is incremented whenever the amount of time for the processing of one of slots 88A-G is elapsed and is decremented whenever one of slots 88A-G is processed. Therefore, the schedule difference parameterkeeps track of the time for processing slots 88A-G. If the schedule difference parameter is greater than zero (scheduler 34 is late), scheduler 34 should process a slot to bring the schedule difference parameter to zero (scheduler 34 is not late).
If schedule FIFO memory 42 is not full and the schedule difference parameter is greater than zero, scheduler 34 advances to a process slot flow chart 400 discussed with reference to FIG. 9. After process slot flow chart 400 is completed,scheduler 34 advances to a step 308. If either schedule FIFO memory 42 is full or if schedule difference is equal to zero, scheduler 34 advances to step 308. Scheduler 34 should not process a slot if schedule FIFO memory 42 is full because there is noplace to store any additional connections in FIFO memory 42. Additionally, if the schedule difference parameter is equal to zero, the timing is not appropriate (e.g. it is too early) to process the slot. More particularly, the appropriate sendingparameters for the connections could be violated if slots 88A-G are processed too early (e.g., when the schedule difference parameter is zero).
At a step 308, scheduler 34 determines if the schedule difference parameter is equal to zero and if global priority queue 38 is empty. When schedule difference parameter equals zero, the timing is appropriate for scheduler 34 to schedule aconnection on schedule FIFO memory 42. If the schedule difference parameter is greater than zero, scheduler 34 should not transmit cells until the scheduler 34 catches up (e.g., the schedule difference parameter equals zero). Priority isolation for UBRmodes of connections is ensured by only processing queue 38 when the schedule difference parameter is equal to zero. Additionally, if there are no global priority queue entries in levels 64A-H of global priority queue 38, there are no connectionsavailable. Therefore, if the schedule difference parameter is greater than zero or there are no global priority queue entries, then scheduler 34 returns to step 302.
If the schedule difference parameter is zero and there is a global priority queue entry in global priority queue 38, scheduler 34 performs a send cell flow chart 500. After flow chart 500 is completed as discussed with reference to FIGS. 11A-C,scheduler 34 returns to step 302.
With reference to FIG. 7, link out-of-rate flow chart 325 is utilized by scheduler 34 to link a connection to the out-of-rate priority level of global priority queue 38 (FIG. 3, e.g., priority level 64A). At a step 326, scheduler 34 determinesif the head pointer 60 at the out-of-rate priority level 64A of global priority queue 38 is null. If the head pointer is null, scheduler 34 advances to a step 328 and sets the head pointer in column 60 of queue 38 to the connection provided by ABRmanager 44. After step 328, scheduler 34 advances to a step 330 and sets the out-of-rate pointer in field 92R in connection state 90 for the connection to the connection provided by ABR manager 44. After step 330, scheduler 34 advances to a step 340.
Steps 326, 328, and 330 build a circular linked list consisting of the connection provided by manager 44. If the head pointer is null, there are no out-of-rate connections stored in global priority queue 38, since out-of-rate connections arestored in circular linked lists, such as, list 68 (FIG. 3). The UBR modes of traffic, such as, the out-of-rate mode have connections circularly linked to facilitate round-robin orientation of the connection in queue 38. If no other connections are inthe out-of-rate queue, the new connection should be linked onto itself.
If the head pointer in column 60 of queue 38 for the out-of-rate priority level 64A is not null, then scheduler 34 advances to a step 332. If the head pointer is not null, a linked list, such as, list 68 (FIG. 3) already exists for theout-of-rate connections. The connection provided by ABR manager 44 must then be circularly linked to the existing linked list.
At step 332, scheduler 34 reads the schedule mode field 92D of connection state 90 for the connection indicated by the tail pointer at priority level 64A in column 62 of global priority queue 38. Scheduler 34 determines if field 92D indicatesthat the connection is in the ABR mode. If scheduler 34 determines that the ABR mode has been set in schedule mode field 92D, a circularly linked list must be built utilizing the out-of-rate pointer in field 92R for the connection indicated by the tailpointer in column 62 of queue 38. The out-of-rate pointer in field 92Q is set to the connection provided by manager 44 in a step 334. After step 334, scheduler 34 advances to a step 338.
If in step 332 the schedule mode field 92D is not set to ABR mode, then the connection is an UBR mode of traffic and not an ABR mode of traffic, and scheduler 34 advances to a step 336. Therefore, the queue pointer in field 92F is utilized asopposed to the out-of-rate pointer in field 92R to build the linked list at step 336. In step 336, the queue pointer in field 92F for state 90 indicated by the tail pointer in queue 38 is set to the connection provided by manager 44.
After step 336, a scheduler 34 advances to step 338 where the out-of-rate pointer in field 92R of state 90 for the connection provided by ABR manager 44 is set to the head pointer in column 60 of queue 38. At a step 340, the tail pointer incolumn 62 is set to the connection provided by manager 44, and flow chart 325 is completed. In this way, a circular queue is built for both ABR linked lists which utilize the out-of-rate pointer in field 92R and for UBR linked lists which utilize thequeue pointer in field 92F.
With reference to FIG. 8, scheduler 34 performs schedule connection flow chart 350 to add connections from start FIFO memory 40 to global priority queue 38. Typically, scheduler 34 schedules connections by placing the connections on the globalpriority queue 38 by inserting the connection number or connection information in the head pointer in column 60 and in the tail pointer in column 62.
At a step 352, scheduler 34 determines if connection state 90 of the connection provided by start FIFO memory 40 has a schedule mode field 92D set to a CBR mode of traffic. If so, the connection does not have to be scheduled because it isalready scheduled on dynamic schedule table 88 in an entry 94 and will automatically be transferred to schedule FIFO memory 42 when the appropriate slot of slots 88A-G is processed. The nature of CBR mode of traffic is such that the connection must besent at particular times defined by slots 88A-G to meet strict protocol requirements.
If schedule mode field 92D does not indicate that the connection is a CBR connection, scheduler 34 advances to a step 354 and determines whether connection state 90 of the connection indicated by start FIFO memory 40 has field 92D set to an ABRmode and a field 920 which indicates MCR priority. If connection state 90 indicates ABR mode and the MCR priority, then scheduler 34 advances to a step 356.
At step 356, the priority level, such as, levels 64A-H, for the connection is increased by utilizing the head pointer for a priority level one above the priority level indicated in connection 90 by the priority level parameter in field 92E. Thehigher priority level is utilized for the remaining steps in flow chart 350. After a step 356, scheduler 34 advances to a step 358. In step 354, if state 90 indicates no ABR mode or no MCR priority for the connection, scheduler 34 advances to step 358.
At step 358, scheduler 34 determines if the head pointer in column 60 of queue 38 for the particular priority level of levels 64A-H is null. If the head pointer for the particular priority level is null, then there are no connections currentlyscheduled for the priority level, and the head pointer is set to the connection at a step 360. If the head pointer is not null, the connection must be attached to an existing linked list for the priority level stored in priority queue 38 (beginning at astep 362).
In step 362, if scheduler 34 determines that schedule mode field 92D of connection state 90 of the connection from start FIFO memory 40 indicates a UBR mode, and schedule field 92D of connection state 90 pointed to by the tail pointer in queue 38indicates an ABR mode, then scheduler 34 advances to a step 364. At step 364, scheduler 34 sets the out-of-rate pointer in field 92R for connection state 90 pointed to by the tail pointer in queue 38 to the connection provided by start FIFO memory 40.
If field 92D of the connection indicates no UBR mode or field 92D pointed to by the tail pointer indicates no ABR mode at step 362, scheduler 34 advances to a step 366. At step 366, scheduler 34 sets the queue pointer in field 92F of connectionstate 90 pointed to by the tail pointer to the connection provided by start FIFO memory 40.
After step 366, scheduler 34 advances to a step 368 and determines if the schedule mode field 92D of the connection provided by start FIFO memory 40 indicates an UBR mode. If so, a circular buffer must be built, and scheduler 34 advances to astep 370 where the queue pointer in field 92F of connection state 90 for the connection provided by FIFO memory 40 is set to the head pointer of global priority queue 38. If not, scheduler 34 advances to a step 376. After step 364, scheduler 34advances to step 370.
After step 360, scheduler 34 advances to a step 372 and determines if schedule mode field 92D of connection state 90 for the connection provided by FIFO memory 40 indicates an UBR mode. If so, scheduler 34 advances to a step 374 and sets thequeue pointer in field 92F of connection state 90 to the connection provided by FIFO memory 42 (e.g., to the head pointer). If not, scheduler 34 advances to a step 376. After a step 374, scheduler 34 advances to a step 376 and sets the tail pointer inqueue 38 to the connection provided by start FIFO memory 40. After step 370, scheduler 34 advances to step 376. In step 368, if field 92D does not indicate an UBR mode, scheduler 34 advances to step 376. After step 376, flow chart 350 is completed.
With reference to FIG. 9, process slot flow chart 400 is utilized so scheduler 34 can process a slot of slots 88A-G in dynamic schedule table 88. In this example, slot 88C is processed for illustration only. At a step 402, the scheduledifference parameter is decremented to accurately represent the temporal relationship between the real time and the position of scheduler 34 with respect to slots 88A-G. At a step 404, scheduler 34 increments the schedule table position to the nextposition of slots 88A-G to accurately reflect the position on table 88. In this example, the scheduled table position is incremented to point to slot 88C.
At a step 406, scheduler 34 determines if CBR entry 94 of slot 88C includes connection information. If so, scheduler 34 advances to a step 408. At step 408, scheduler 34 determines if connection state 90 indicated by the connection in entry 94of slot 88C has data available field 92A set to indicate that the data associated with the connection is available.
If the data is available for the connection, scheduler 34 writes the connection in entry 94 to schedule FIFO memory 42 in a step 410. Scheduler 34 writes the CBR connection directly to scheduler 42 as opposed to global priority queue 38 becauseof the conformance requirements for the CBR mode of traffic. In this way, scheduler 34 guarantees that CBR connection will be transmitted appropriately.
In step 408, if data available field 92A indicates that the data for the connection is not available, scheduler 34 advances to a step 414. In step 406, if entry 94 does not include connection information, scheduler 34 advances to step 414.
At step 414, scheduler 34 determines if tunnel entry 95 of slot 88C indicates that a CBR tunnel transmission is scheduled. A tunnel transmission typically consists of several CBR connections distributed in a round-robin order. The circularlylinked list of the CBR connections associated with tunnel entry 95 is provided in global priority queue 38.
At a step 416, scheduler 34 sets the tunnel active by providing an appropriate header for priority level 64H associated with tunnel transmission in priority queue 38. After step 416, scheduler 34 advances to a step 418. In step 414, if tunnelentry 95 does not indicate that there is a tunnel connection for slot 88C, scheduler 34 advances to a step 418.
At step 418, scheduler 34 sets the queue number for slot tail pointer entries 96A-D to one indicating entry 96A. After step 418, scheduler 34 advances to a flow chart 425 described with reference to FIG. 10 and processes the slot tail pointerprovided in entry 96A. At a step 422, scheduler 34 determines if all of tail entries 96A-D have been processed. If not, scheduler 34 advances to a step 424 where the queue number is incremented. After step 424, scheduler 34 returns to flow chart 425. To complete processing slot 88C, scheduler 34 would perform flow chart 425 for each of entries 96A-D by performing the loop comprised of chart 425, step 422, and step 424. If in step 422 all of the entries 96A-D have been processed, scheduler 34 hascompleted flow chart 400.
With reference to FIG. 10, scheduler 34 performs the process slot tail queue flow chart 425 to process the slot tail pointer indicated by entries 94A-D in slot 88C (for example only). The queue number associated with entries 96A-D have arelationship to the priority levels 64A-H in priority queue 38. Preferably, there is a fixed offset between the VBR priority levels of entries 96A-D and priority levels 64A-H of queue 38.
In this example, entry 96A is processed. At step 428, scheduler 34 determines if the tail pointer in entry 96A is null. If so, there are no VBR connections in entry 96A and flow chart 425 is completed. If a slot tail pointer is provided inentry 96A, scheduler 34 advances to a step 430.
At step 430, scheduler 34 determines if the head pointer in column 60 of queue 38 for the priority level indicated by slot tail pointer entry 96A is null. If so, scheduler 34 advances to a step 432. At step 432, scheduler 34 sets the headpointer in priority queue 38 to the queue pointer in field 92F of connection state 90 pointed to by the slot tail pointer in entry 96A. After a step 432, scheduler 34 advances to a step 434.
If the head pointer is not null in step 430, scheduler 34 advances to a step 436 and adds the connection to an already existing linked list defined in queue 38. At step 436, scheduler 34 sets the queue pointer in field 92F of connection state 90indicated by the tail pointer in column 62 of global priority queue 38 to the queue pointer stored in field 92F of connection state 90 indicated by the slot tail pointer in entry 96A. For example, connection slate 98B at the head of list 98 is added tothe linked list defined in queue 38. In this way, list 98 (FIG. 5) is added to the list defined in queue 38. After a step 436, scheduler 34 advances to step 434.
At step 434, the tail pointer in column 62 of priority queue 38 is set to the slot tail pointer in entry 92A. In this example, the slot tail pointer points to state 98A, and all of list 98 is added to the list in queue 38, with only slot tailpointer and a queue pointer being updated. After step 434, scheduler 34 advances to a step 436 and sets the slot tail pointer in entry 96A to null, thereby clearing entry 96A. After step 436, flow chart 425 is completed.
At a step 502, scheduler 34 selects the connection stored in the highest pending global priority level of levels 64A-H of global priority queue 38. After step 502, scheduler 34 sets the connection number equal to the connection associated withthe head pointer stored in column 60 of queue 38 for the highest pending global priority level of levels 64A-H at a step 504.
After step 504, scheduler 34 determines if data available field 92A for connection state 90 for the connection indicates that data is available at a step 506. If not, scheduler 34 advances to a step 508 (FIG. 11B), and begins to remove theconnection from global priority queue 38. The connection must be removed from the global priority queue to ensure that it is not continually selected.
At step 508, scheduler 34 determines if the head pointer is equal to the tail pointer in priority queue 38. If so, scheduler 34 advances to a step 510 and sets the head pointer in priority queue 38 to null. When the head pointer and the tailpointer are equal, scheduler 34 determines that there is only one connection associated with the linked list defined by queue 38. Therefore by setting the head pointer in column 60 to null, the linked list is effectively eliminated from queue 38. Thetail pointer in column 62 does not have to be set to null because the head pointer in column 60 is always checked first. After step 510, flow chart 500 is completed.
At step 508, if the head pointer is not equal to the tail pointer, scheduler 34 advances to a step 512. At step 512, scheduler 34 determines if connection state 90 for the connection indicated by the head pointer of queue 38 has a schedule modefield 92D which indicates an UBR mode. If so, scheduler 34 must eliminate the connection from the circular linked list associated with the priority level in queue 38 and advances to a step 513. If not, scheduler 34 advances to a step 515.
At step 515, scheduler 34 determines if field 92D indicates an ABR mode and if the selected priority is equal to the out-of-rate priority parameter in field 92Q. If so, scheduler 34 sets a next parameter to the out-of-rate pointer in field 92Rat a step 517 (e.g., chooses the out-of-rate connection). If not, scheduler 34 sets a next parameter to the queue pointer in field 92F at a step 519. After step 517, scheduler 34 advances to a step 514. After step 519, scheduler 34 advances to a step516.
At step 514, scheduler 34 determines if field 92D of connection state 90 pointed by the tail pointer in queue 38 indicates an ABR mode. If so, scheduler 34 advances to a step 518 and sets the out-of-rate pointer field 92R in state 90 for theconnection indicated by the tail pointer of queue 38 to the next parameter. After step 518, scheduler 34 advances to step 516.
At step 516, scheduler 34 sets the head pointer in column 60 of queue 38 to the next parameter. Therefore, scheduler 34 effectively sets the linked list to the next connection indicated by the next parameter. After step 516, flow chart 500 iscompleted.
At step 506 (FIG. 11A), if data available field 92A for the connection indicates that data is available, scheduler 34 advances to a step 530. At step 530, scheduler 34 determines if field 92D indicates an ABR mode. If so, scheduler 34 advancesto a step 532. At step 532, scheduler 34 receives the cell type from ABR manager 44 on control bus 58 and writes the connection information (e.g., the connection number and the type of connection) to schedule FIFO memory 42. After step 532, scheduler34 advances to a step 534.
At step 534, scheduler 34 determines if the selected priority level in priority queue 38 is equal to the out-of-rate priority parameter in field 92Q. If so, scheduler 34 advances to a step 560 (FIG. 11C). If not, scheduler 34 advances to a step580 (FIG. 11C).
At step 530, if field 92D indicates that the connection is not an ABR mode, scheduler 34 advances to a step 536 where scheduler 34 writes the connection to schedule FIFO memory 42. At a step 538, scheduler 34 determines whether field 92Dindicates an UBR mode. If so, scheduler 34 advances to step 560. If not, scheduler 34 advances to a step 580. If scheduler 34 reaches step 560, the connection utilizing the UBR mode of traffic has been written to schedule FIFO memory 42. At step 560,scheduler 34 determines if the selected priority level of levels 64A-D is indicative of a tunnel mode (not shown on queue 38). If so, scheduler 34 clears the tunnel active indication at a step 562 and advances to a step 564. If not, scheduler 34advances to step 564.
At step 564, scheduler 34 determines if the head pointer in column 60 of queue 38 for the selected priority level is equal to the tail pointer in column 62. If so, flow chart 500 is completed because the circularly linked list consists of onlythe one connection. If not, scheduler 34 advances to a step 566.
At step 566, scheduler 34 sets the tail pointer in column 62 of queue 38 to the connection (e.g., the head pointer in queue 38) and advances to a step 567. In step 567, scheduler 34 determines if field 92D indicates an ABR mode. If not,scheduler 34 sets the head pointer in queue 38 to the queue pointer in field 92F of connection state 90 for the connection at a step 568. If so, scheduler 34 sets the head pointer in queue 38 to the out-of-rate pointer in field 92Q at a step 570. Steps566, 568, and 570 rotate the circularly linked list associated with ABR and UBR modes so that the next connection is at the head of the list. After steps 568 and 570, flow chart 500 is completed.
When scheduler 34 reaches step 580, scheduler 34 has determined that a VBR connection has been written to schedule FIFO memory 42. At step 580, scheduler 34 determines if the head pointer in queue 38 is equal to the tail pointer. If so,scheduler 34 sets the head pointer in column 60 of queue 38 to null in a step 582. If not, scheduler 34 advances to a step 584 and sets the head pointer to the queue pointer field 92F of connection state 90 for the connection.
Scheduler 34 utilizes schedule rate flow chart 600 to schedule a connection in the future by linking the connection onto a schedule slot of slots 88A-G in dynamic schedule table 88. In this way, scheduler 34 dynamically allocates connectionsusing ABR and VBR modes to maximize the bandwidth of communication system 20. Scheduler 34 utilizes the single bucket and dual bucket scheduling algorithms to appropriately schedule ABR and VBR modes of traffic in slots 88A-G of table 88. Statisticalmultiplexing can be achieved for VBR and ABR modes of traffic by bursting connections to the extent allowed by L1 and L2 parameters to recover from periods during which the connections were not allowed to be transmitted.
With reference to FIGS. 12A-C, scheduler 34 sets a now parameter equal to the current time provided by timer 36 at a step 602. At a step 604, scheduler 34 determines if VBR reset field 92G of connection state 90 indicates that the delta 1 anddelta 2 parameters for the connection should be reset. Resetting the delta 1 and delta 2 parameters sets VBR buckets to their maximum burst state. If so, scheduler 34 advances to a step 606. If not, scheduler 34 advances to a step 612.
At step 606, the elapsed parameter is set to a maximum value. After step 606, scheduler 34 advances to a step 608 and sets the delta 1 parameter in field 92M and the delta 2 parameter in field 92N to zero. After step 608, scheduler 34 advancesto a step 610.
At step 612, scheduler 34 sets the elapsed parameter to the now parameter minus the present parameter in field 92L. The elapsed parameter represents the amount of time since the last VBR transmission for the connection. At step 610, scheduler34 determines if field 92D of connection state 90 indicates a VBRC mode and if CLP field 92B is set. If so, scheduler 34 advances to a step 650 (FIG. 12B) and schedules the connection in accordance with a VBRC bucket algorithm. If not, scheduler 34advances to a step 614.
At step 614, a late parameter is set equal to the elapsed parameter minus a delta 1 parameter stored in delta 1 field 92M of connection state 90 for the connection. After step 614, scheduler 34 advances to step 616 and determines if field 92Dfor the connection is set to an ABR mode. If not, scheduler 34 advances to a step 618. If so, scheduler 34 advances to a step 624.
At step 618, scheduler 34 determines if the late parameter is greater than the L1 parameter in L1 field 92I of connection state 90 for the connection. If so, scheduler 34 advances to a step 620 and sets the late parameter equal to the L1parameter in field 92I. If not, scheduler 34 advances to a step 622. After step 620, scheduler 34 advances to step 622.
At step 624, if the late parameter plus the I1 parameter in field 92H for the connection is greater than the MCR limit parameter in the MCR field 92P, scheduler 34 advances to a step 626. Otherwise, scheduler 34 advances to step 618. At step624, scheduler 34 sets the MCR priority parameter in field 920. Thus, preferred scheduling can be achieved via the MCR priority parameter and the MCR limit parameter.
At step 622, scheduler 34 sets the delta 1 parameter in field 92M equal to the I1 parameter in field 92H minus the late parameter. After step 622, scheduler 34 advances to step 650 (FIG. 12B). At step 650, scheduler 34 determines if schedulemode field 62C indicates a VBR 1 or an ABR mode. If so, scheduler 34 advances to a step 652 and sets a delta parameter equal to the delta 1 parameter in field 92M. If not, scheduler 34 advances to a step 654 where the late parameter is set equal to theelapsed parameter minus the delta 2 parameter in field 92N.
After step 654, scheduler 34 advances to a step 656 where the late parameter is compared to the L2 parameter stored in field 92K for the connection. If the late parameter is greater than the L2 parameter, scheduler 34 advances to a step 658where the late parameter is set equal to the L2 parameter in field 92K. After steps 656 and 658, scheduler 34 advances to a step 660.
At step 660, scheduler 34 sets the delta 2 parameter in delta 2 field 92N equal to the I2 parameter in I2 field 92J minus the late parameter. After step 660, scheduler 34 determines if field 92D indicates a VBRC mode and if the last CLP field92B is set at a step 662. If so, scheduler 34 advances to a step 664 where the delta parameter is set to the delta 2 parameter in field 92N for the connection. If not, scheduler 34 advances to a step 666.
After step 668, scheduler 34 determines if the delta parameter is less than one at a step 669 (FIG. 12C). If the delta parameter is less than one, scheduler 34 advances to a step 670 and sets the delta parameter equal to one. After step 670,scheduler 34 advances to a step 672.
If the delta parameter is not less than one at step 669, scheduler 34 advances to step 672. At step 672, scheduler 34 calculates a new schedule position parameter equal to a current position plus the ceiling (delta parameter). The functionceiling (delta parameter) is the lowest integer which is greater than or equal to the delta parameter. The new schedule position refers to a new slot of slots 88A-G.
After step 672, scheduler 34 determines if the new schedule position parameter is greater than or equal to the schedule table size parameter at a step 674. The schedule table size parameter is a user-set parameter which indicates the number ofslots 88A-G for dynamic schedule table 88. If so, the new schedule position parameter will not fit within one cycle of the dynamic schedule table 88, and scheduler 34 subtracts the schedule table size parameter from the new schedule position parameterat a step 676. After step 676, scheduler 34 advances to a step 678.
If the new schedule position parameter is less than the schedule table size parameter, scheduler 34 advances from step 674 to step 678. At step 678, scheduler 34 selects a slot tail pointer entry of entries 96A-D in dynamic schedule table 88 forone of slot 88A-G. The priority level of the chosen entry of entries 96A-D is equal to the priority parameter in field 92E minus the VBR priority offset minus the MCR priority parameter in field 920. Therefore, the priority can be increased in the newschedule slot so that the connection is more likely to be transmitted after the new schedule position has been processed.
After step 678, scheduler 34 determines if the slot tail pointer entry of entries 96A-D is null at a step 680. If so, scheduler 34 sets the queue pointer in field 92F equal to the connection at a step 682. After step 682, scheduler 34 advancesto a step 684.
If the slot tail pointer in the selected entry is not null, scheduler 34 advances from step 680 to a step 686 and sets the queue pointer in field 92F equal to the queue pointer in field 92F of connection state 90 pointed to by the slot tailpointer in the selected entry of entries 96A-D. After step 686, scheduler 34 sets the queue pointer in field 92F of connection state 90 for the connection pointed to by the slot tail pointer of the selected entry to the connection. After step 688,scheduler 34 advances to a step 684. At step 684, scheduler 34 sets the slot tail pointer for the selected entry to the connection. After step 684, flow chart 600 is completed.
Alternatively, scheduler 34 can be modified to handle packets of data which are not of fixed size. In flow chart 600, the calculation of the delta parameter can be according to the following equation to handle variable size data packets: deltaparameter=(I parameter.multidot.next packet size)-Late. This equation is the same as the equation in steps 622 and 660 where the next packet size parameter is equal to one in the fixed packet size case.
It is understood that, while the detailed drawings, specific examples, and particular memory structures given describe a preferred exemplary embodiment of the present invention, they are for the purpose of illustration only. The apparatus andmethod of the invention is not limited to the precise details and conditions disclosed. For example, although the scheduler is an ATM scheduler, it may be utilized with other communication systems. Also, although particular timing parameters aredescribed, other methods of tracking scheduling times may be utilized. Further still, single lines in the various drawings may represent multiple conductors. Various changes may be made to the details disclosed without departing from the spirit of theinvention which is defined by the following claims:
Optical disk recording apparatus and optical recording method
Anti-hijack system and method in a mode of forestalling the enemy
Liquid crystal display apparatus having multi-layer substrate
Flame retardant polyamides
Apparatus for heat sealing
Multi-function sanitization system
Integrated circuit package separators