Scheduling data transmission by medium access control (MAC) layer in a mobile network

CROSS REFERENCE TO RELATED APPLICATION(S)

This application claims priority from U.S. provisional application No. 60/435,842 filed Dec. 20, 2002, which is incorporated by reference as if fully set forth.

FIELD OF INVENTION

This invention generally relates to the procedures used by the MAC Layer to schedule data transmission. More particularly, the invention relates to method and algorithm for data transmission in a UMTS network.

BACKGROUND

In a third generation partnership project universal mobile telecommunications system (3GPP UMTS), the MAC layer in the user equipment (UE) and in the Radio Network Controller (RNC) is responsible for scheduling of data transmission in the uplink and downlink, respectively. Transport channels form the interface between the MAC layer and the physical layer. In the physical layer, a set of transport channels is combined to form a Coded Composite Transport Channel (CCTrCH).

A Transport Format Combination Set (TFCS) is defined for each CCTrCH. Each Transport Format Combination (TFC) defines a Transport Format (TF) for each transport channel of the CCTrCH. The TF defines the data rate of a transport channel by setting the Transmission Time Interval (TTI) (in ms), the Transport Block (TB) size (in bits) and the Transport Block Set (TBS) size (in number of blocks).

A TB is the basic unit exchanged between the MAC and physical layers. A TBS is defined as a set of TBs, which are exchanged between physical and MAC layers at the same time and using the same transport channel. The TTI is defined as the inter-arrival time of TBSs. A TTI is equal to the periodicity at which a TBS is transferred from the MAC to the physical layer and then by the physical layer onto the radio interface.

The MAC gets data from the radio link control (RLC) layer. The interface between the MAC layer and the RLC layer is formed by logical channels, or radio bearers (RB). Each transport channel can carry more than one RB. The RLC maintains a buffer for each RB; each buffer contains a set of RLC service data units (SDUs). Some RLC configurations (but not all) allow the segmentation of SDUs into protocol data units (PDUs), some allow the concatenation of SDUs to build PDUs and some allow the use of padding PDUs. In the MAC layer, a MAC header may be added to the PDU to form a TB.

The MAC layer selects the PDU sizes for a given TTI and requests these PDUs from the RLC layer. The RLC then segments and/or concatenates the SDUs in order to satisfy the MAC request. The MAC then builds the TBs and sends the TBs to the physical layer to be sent over the air in the next TTI.

At the UE side, in order to perform TFC selection, there are some standard requirements that must be followed by the UE. These requirements are summarized below.

It is desirable to provide a method for TFC selection, obviating the need for the MAC to have to determine the power needed by each TFC in each time slot.

SUMMARY

This invention provides a method and an algorithm for TFC selection wherein the need for the MAC to determine the power needed by each TFC in each time slot is obviated. The following description sets forth the MAC procedure to schedule data transmission wherein the scheduling may involve the selection of a TFC to be used and the selection of RBs to be serviced.

Both UE and Serving-RNC (S-RNC) sides of a universal mobile telecommunication service (UMTS)—time division duplex (TDD) network are discussed. In particular, the strategies for the TFC selection and related algorithms are presented.

Before selecting a TFC, a set of valid TFCs must be established. This set is referred to as the candidate set. All TFCs in the candidate set must generally satisfy the following six (6) rules: 1) belong to the TFCS; 2) not carry more bits than can be transmitted in a TTI; 3) respect the TTI compatibility (i.e., the TF of a TrCH cannot change in the middle of the TTI of the TrCH); 4) not be in the blocked state, as defined below; 5) be compatible with the RLC configuration; and 6) not require RLC to produce padding PDUs. If all TFCs in the TFCS require padding PDUs, this last requirement can be ignored. The present invention provides solutions for the last three (3) requirements.

The blocking criterion is defined as follows:

In the case of a single CCTrCH or multiple CCTrCHs having mutually exclusive timeslot assignments, the UE considers the blocking criterion for a given TFC of a CCTrCH to be fulfilled if, for three (3) successive frames, the estimated UE transmit power is greater than the maximum UE transmitter power for at least one timeslot associated with the CCTrCH in each frame.

In the case of multiple CCTrCHs that do not have mutually exclusive timeslot assignments, if, for a given CCTrCH for three (3) successive frames, the estimated UE transmit power is greater than the maximum UE transmitter power for at least one timeslot associated with the CCTrCH in each frame, the UE considers the blocking criterion for a given TFC to be fulfilled if the use of this TFC will cause the estimated UE transmit power to continue to be greater than the maximum UE transmitter power in at least one timeslot associated with the CCTrCH.

As to the unblocking criterion, the UE must not consider the unblocking criterion for a given TFC (that has been blocked) to be fulfilled until the use of this TFC will not cause the estimated UE transmit power to be greater than the maximum UE transmitter power for all uplink (UL) timeslots associated with the TFC for a minimum of three (3) successive frames. The number of said successive frames may be greater than or lesser than three (3) without departing from the spirit and scope of the invention. For example, the number of successive frames could be as few as two (2) or four (4) or more, with three (3) consecutive frames being preferred. This is also the case for all subsequent criteria for non-mutually exclusive timeslot arrangements for UEs and S-RNCs.

The MAC is divided in MAC-c and MAC-d. MAC-c is responsible for common channels and MAC-d is responsible for dedicated channels. On the UE side, there is a single TFC defined for the common channel, and thus TFC selection does not apply in UE MAC-c. On the RNC side, TFC selection is done in MAC-c and MAC-d.

The RLC configuration plays an important role during TFC selection. Depending on the amount of data available for transmission, some TFCs in the TFCS may not conform to the RLC configuration.

Padding compatibility (i.e., need for padding PDUs) is an RLC configuration issue. To check for padding compatibility one needs to check if a TFC requires padding PDUs from a transport channel that only carries logical channels that cannot provide padding PDUs, (i.e., logical channels in RLC-TM (transparent mode)). If so, then the TFC is incompatible with the RLC configuration and is considered invalid.

Note that there are other requirements related to the RLC configuration. However, in the present invention, these requirements are checked during the TFC selection procedure itself. Because the TFC selection procedure maximizes the throughput of the high priority data, the TFC selection procedure is performed in order of logical channel priority, and not per transport channel. Thus, if the padding compatibility requirement were not satisfied, the whole procedure would need to be repeated (without the selected TFC) in order to obtain a valid TFC. That is why padding compatibility is checked before performing TFC selection, thereby reducing the TFC candidate set.

The check for padding PDU compatibility must preferably be done for every TFC, based on the buffer occupancy of the logical channels mapped to that transport channel and the TF for that transport channel. The check for padding PDU compatibility is performed only in logical channels configured for transparent mode (RLC-TM)

The TF determines the number of TBs and the TB size needed. The first step is to determine how many PDUs can be generated by all logical channels in that transport channel. This determination must consider the TB size and if segmentation is allowed or not in each logical channel, and comprises the following steps:

a. If segmentation is allowed in the logical channel, then calculate n: where n=SDUsize/TBsize,

and check if n is an integral number (which means that the number of PDUs multiplied by the PDU size is equal to the SDU size).

<ul id="ul0001" list-style="none"><li id="ul0001-0001" num="0000"><ul id="ul0002" list-style="none"><li id="ul0002-0001" num="0024">i. if yes, then the number of PDUs for that logical channel is equal to n</li><li id="ul0002-0002" num="0025">ii. if no, then the number of PDUs for that logical channel is equal to zero.</li></ul></li></ul>

b. If segmentation is not allowed, check if the SDU size is equal to the TB size. <ul id="ul0003" list-style="none"><li id="ul0003-0001" num="0000"><ul id="ul0004" list-style="none"><li id="ul0004-0001" num="0027">i. if yes, the number of PDUs for that logical channel is equal to the total number of SDUs in that logical channel available for transmission</li><li id="ul0004-0002" num="0028">ii. if no, the number of PDUs for that logical channel is equal to zero.</li></ul></li></ul>

The number of PDUs for that transport channel is determined by summing the number of PDUs for each logical channel mapped to that transport channel.

The TFC can be supported in terms of padding PDUs if the number of PDUs for that transport channel is greater than or equal to the number of TBs in the TF.

The idea of a minimum TFC set proposed in the standards and used in this invention is explained hereinafter. The minimum TFC set is the set that allows the transmission of one TB of the highest priority transport channel that has data to be sent. The minimum TFC set includes all TFCs that have a “minimum size compatible TF” for one transport channel and empty TFs for all other transport channels, where the “minimum size compatible TF” is defined as:

For acknowledge mode—RLC (AM-RLC) logical channels, the “minimum size compatible TF” is the TF with one TB with “RLC Size” equal to the RLC PDU size.

For non-segmented Transparent Mode (TM-RLC) logical channels, the “minimum size compatible TF” is the TF with one transport block with “RLC Size” equal to the RLC SDU size considered.

For segmented mode TM-RLC, the “minimum size compatible TF” is the TF such that the number of transport blocks multiplied by the “RLC Size” is equal to the RLC SDU size considered.

For Unacknowledge Mode (UM-RLC), the “minimum size compatible TF” is the TF with a single transport block (of any size since there is no restriction on PDU size for UM). If there is more than one TFs with a single transport block defined, the “minimum size compatible TF” is the one with minimum transport block size.

In the present invention, every time the maximum transmit power is reached in a timeslot, the physical layer sends a notification along with the timeslot number to the MAC layer that the maximum power was reached.

Every time the MAC receives a notification from the physical layer that the maximum transmit power is reached in a timeslot, the MAC determines which CCTrCHs have allocated codes in the timeslot that reached maximum power and marks such CCTrCHs as having reached maximum power. When a CCTrCH reaches maximum power, the MAC will check whether or not it should “step down”:

Stepping down: Each time a CCTrCH reaches maximum transmit power for three (3) consecutive frames, the MAC will limit the candidate TFC set to the minimum TFC set in the next common TTI boundary (common TTI to all transport channels in the CCTrCH).

After the MAC “steps down”, it will consider the recovery criteria to “step up”.

For stepping up, after every frame of operation of a CCTrCH at the minimum TFC set, the MAC will predict the power needed by the full TFC set of that CCTrCH in the next frame. If the predicted transmit power in all timeslots of the CCTrCH is less than the maximum allowed UE transmit power for three (3) consecutive frames, then the full TFC set can be included in the candidate TFC set. Otherwise, the minimum TFC set will be used.

That is, the MAC will either allow the full set (in terms of power) or the minimum set. This is a low cost solution that avoids the need for the MAC to determine the power needed by each TFC in each timeslot.

As to power prediction, in order to check if the full set can be supported, it is sufficient to check if the TFC that requires maximum transmit power can be supported. However, due to rate matching and puncturing used in the TDD system, the TFC that requires maximum transmit power may be different for each timeslot (i.e., each timeslot has associated with it a TFC that requires maximum transmit power). One solution for this problem is for the MAC to know the procedure used by the physical layer to “fill up” timeslots and codes. The power needed by each timeslot will depend on the TFC being used, since the transmit power is a function of the beta (β) factors and number of codes used by the TFC in the timeslot, and each TFC may have a different beta factor and different data rate (and thus, different number of codes used).

Proposed herein is a solution where the MAC predicts the transmit power in each timeslot of the CCTrCH by considering the worst case scenario, by assuming that: all the assigned codes are being used in that timeslot (all codes even if they are from different CCTrCHs); and the highest beta factor among all TFCs in the TFCS is being used.

If there are codes from different CCTrCHs in the timeslot, then different beta factors will be used for each code (each code will use the highest beta factor of the associated CCTrCH).

The above technique provides a low cost solution that avoids the need for the MAC to determine which TFC requires the most power in each timeslot.

As to the padding of the PDUs, as stated above, the requirement for padding PDUs needs to be followed only if no TFCs are available among the TFCs that do not require padding PDUs. In other words, if there are TFCs available in the candidate TFC set that do not require padding PDUs, then one of those should be selected, instead of selecting a TFC that requires padding. It should be noted that, for all TFCs that require padding, PDUs from logical channels that cannot produce padding PDUs (i.e., RLC-TM logical channels) are eliminated from the candidate TFC set when the RLC configuration requirements are checked for padding compatibility. The TFCs that require padding PDUs and are in the candidate TFC set, require padding PDUs from logical channels that can produce padding. Whether or not padding PDUs are needed for a given TFC, depends on the RLC buffer occupancy (amount of data that needs to be sent). In order to create a set with only TFCs that do not require padding PDUs, all TFCs must be tested at every TTI. However, this is an expensive solution.

It is proposed herein to determine if there are TFCs that do not require padding PDUs while performing TFC selection algorithm, as set forth below. Thus, all TFCs that satisfy the five requirements stated supra will be part of the candidate TFC set, and the requirement regarding padding PDUs will be fulfilled, whenever possible, at each TFC selection iteration.

A chosen TFC must be selected from the candidate set and must satisfy the following criteria (and in the order in which they are listed):

a) no other TFC allows the transmission of higher priority data than the chosen TFC;

b) no other TFC allows the transmission of more data from the next lower priority channels, and

c) no other TFC has a lower bit rate than the chosen TFC.

BRIEF DESCRIPTION OF THE DRAWING(S)

<figref idref="DRAWINGS">FIGS. 1A through 1D</figref> comprise a flow chart for MAC-c TFC selection algorithm implementation;

<figref idref="DRAWINGS">FIG. 1</figref> shows the manner in which <figref idref="DRAWINGS">FIGS. 1A through 1D</figref> are arranged to form the flow chart;

<figref idref="DRAWINGS">FIGS. 2A through 2D</figref> comprise a flowchart for MAC-d TFC selection algorithm implementation; and

<figref idref="DRAWINGS">FIG. 2</figref> shows the manner in which <figref idref="DRAWINGS">FIGS. 2A through 2D</figref> are arranged to form the flow chart.

<figref idref="DRAWINGS">FIG. 3</figref> is a flowchart for an RNC MAC-d SDU size selection procedure.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S)

In the description of the exemplary embodiments to follow, each logical channel has an associated MLP (MAC Logical Channel Priority). The MLP determines the priority of the logical channel. The rules described in the following paragraph are based on MLPs:

Thus, the first important point is that the algorithm iterates per logical channel priority (tries to serve logical channels of highest priority first), as opposed to per transport channel.

One solution when performing TFC selection is to determine how much data of each priority each TFC can carry (starting with the highest priority), and then select one based on the requirements (maximizing the throughput of higher priority data). However, this requires going over all TFCs in the candidate set.

The solution proposed here is to identify the amount of highest priority data that each TFC can carry, and then eliminate those that provide lower throughput from the candidate set. In the next iteration (for the next highest priority data), only the new set is considered.

However, there is still need to satisfy the “candidate set” requirement listed supra on padding PDUs. When eliminating TFCs from the set before completing the whole procedure, the final TFC selected may require padding PDUs, and the whole procedure would need to be repeated without the given TFC, until a TFC that does not require padding is found (and if no such TFC is found, the first TFC selected would be used).

The solution proposed here is to assure that at least one TFC that does not require padding remains on the candidate set. As discussed before, certain candidate sets may have no such TFC, in which case, the above stated “candidate set” requirement need not be satisfied.

Thus, if after removing the TFCs that do not maximize the throughput from the candidate set, the candidate set does not contain at least one TFC that is “filled up” (i.e., all transport blocks being used), then a TFC that does not require padding PDUs (but does not maximize throughput) is added back to the candidate set (note that the padding requirement is stronger than the throughput requirement). If there are many TFCs that could be added to the candidate set, the one that maximizes the throughput of the highest priority data is chosen. If more than one TFC that does not require padding has the same throughput for the highest priority data, then the TFC that maximizes throughput of the next highest priority data is chosen. This rule should be applied recursively for all priority levels.

The following is an example of an implementation of the MAC-d TFC selection procedure. It should be noted that the invention is broader than this example and the example should not be considered as limiting the invention.

The following is used in the algorithm below:

SDUs from logical channels with the priority p are considered data with priority p.

The candidate TFC set is referred to as TFC_Can.

Only logical channels that have buffer occupancy greater than zero shall be considered for the TFC selection.

The algorithm should run only if the TFC set has valid TFCs (TFCs with data rate greater than zero).

The following algorithm (shown in <figref idref="DRAWINGS">FIG. 2</figref>) is performed for MAC-d TFC selection:

After performing steps S<b>1</b> through S<b>3</b> to obtain candidate sets (step S<b>1</b> being performed only by UEs), the routine proceeds as follows: <ul id="ul0005" list-style="none"><li id="ul0005-0001" num="0000"><ul id="ul0006" list-style="none"><li id="ul0006-0001" num="0072">S<b>4</b>: Initialize p=1.</li><li id="ul0006-0002" num="0073">S<b>5</b>: Check if there is at least one TFC with at least one TB available in the TFC_Can (candidate TFC set). <ul id="ul0007" list-style="none"><li id="ul0007-0001" num="0074">a. If yes, S<b>5</b><i>a</i>, go to step S<b>6</b>.</li><li id="ul0007-0002" num="0075">b. If no, S<b>5</b><i>b</i>, go to step S<b>25</b> (all TFCs filled, select one).</li></ul></li><li id="ul0006-0003" num="0076">S<b>6</b>: Select the first TFC with at least one TB available from TFC_Can (candidate TFC set).</li><li id="ul0006-0004" num="0077">S<b>7</b>: Check if there is a logical channel with priority p such that: the logical channel has available PDUs to be sent; the logical channel is not blocked for this TFC; and the transport channel that is mapped to that logical channel has available TBs. <ul id="ul0008" list-style="none"><li id="ul0008-0001" num="0078">a. If yes, S<b>7</b><i>a</i>, to go S<b>9</b> and select that logical channel. If there is more than one such logical channel, select one randomly. Then go to step S<b>10</b>.</li><li id="ul0008-0002" num="0079">b. If no, S<b>7</b><i>b</i>, go to step S<b>16</b> (no more data with priority p).</li></ul></li><li id="ul0006-0005" num="0080">S<b>10</b>: Check if there is a restriction on PDU sizes for the selected logical channel. <ul id="ul0009" list-style="none"><li id="ul0009-0001" num="0081">a. If yes, S<b>10</b><i>a</i>, go to step S<b>11</b> and check if the TB size of the transport channel is the same size as the PDU size+MAC header.</li></ul></li><li id="ul0006-0006" num="0082">i. If yes, S<b>11</b><i>a: </i><ul id="ul0010" list-style="none"><li id="ul0010-0001" num="0083">1. Go to S<b>13</b> and select PDUs from this logical channel to fill up as many available TBs as possible in the transport channel.</li><li id="ul0010-0002" num="0084">2. Update logical channel information as follows: <ul id="ul0011" list-style="none"><li id="ul0011-0001" num="0085">a. This logical channel is blocked for this TFC selection (logical channel already served).</li></ul></li><li id="ul0010-0003" num="0086">3. Go to S<b>14</b>, update TB information as follows: <ul id="ul0012" list-style="none"><li id="ul0012-0001" num="0087">a. TBs used are not available anymore for this TFC selection.</li></ul></li><li id="ul0010-0004" num="0088">4. Go to step S<b>14</b>.</li></ul></li><li id="ul0006-0007" num="0089">ii. If no, S<b>11</b><i>b, </i><ul id="ul0013" list-style="none"><li id="ul0013-0001" num="0090">1. Go to S<b>8</b> where the logical channel is considered blocked for this TFC (PDUs do not fit the TFC).</li><li id="ul0013-0002" num="0091">2. Then return to step S<b>7</b>.</li><li id="ul0013-0003" num="0092">b. If no, S<b>10</b><i>b, </i></li></ul></li><li id="ul0006-0008" num="0093">i. go to S<b>12</b> and fill up as many TBs as possible in that transport channel with bits from this logical channel.</li><li id="ul0006-0009" num="0094">ii. At S<b>14</b>, update TB information as follows: <ul id="ul0014" list-style="none"><li id="ul0014-0001" num="0095">1. TBs used are no longer available for this TFC selection</li></ul></li><li id="ul0006-0010" num="0096">iii. This logical channel is considered blocked for this TFC selection (logical channel already served).</li><li id="ul0006-0011" num="0097">iv. Go to step S<b>15</b>.</li><li id="ul0006-0012" num="0098">At S<b>15</b>, check if all the TBs in this TFC are filled. <ul id="ul0015" list-style="none"><li id="ul0015-0001" num="0099">a. If yes, S<b>15</b><i>a</i>, go to step S<b>16</b> (no more space in this TFC).</li><li id="ul0015-0002" num="0100">b. If no, S<b>15</b><i>b</i>, return to step S<b>7</b>.</li></ul></li><li id="ul0006-0013" num="0101">At S<b>16</b>, compute the total optimal throughput of priority p data for this TFC, as follows: <ul id="ul0016" list-style="none"><li id="ul0016-0001" num="0102">Let Num_Bits(p,i,j) denote the number of bits of priority p data that can be transmitted on DCH i when using TFC j (i.e., TB size times the number of TBs being sent, including any RLC and/or MAC header that is applicable and/or padding bits).</li></ul></li></ul></li></ul>

The normalized throughput of DCH i is computed as:

<maths id="MATH-US-00001" num="00001"><math overflow="scroll"><mtable><mtr><mtd><mrow><mrow><mi>Throughput</mi><mo>⁢</mo><mstyle><mspace width="0.6em" height="0.6ex" /></mstyle><mo>⁢</mo><mrow><mo>(</mo><mrow><mi>p</mi><mo>,</mo><mi>i</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow></mrow><mo>=</mo><mrow><mi>Num_Bits</mi><mo>⁢</mo><mrow><mrow><mo>(</mo><mrow><mi>p</mi><mo>,</mo><mi>i</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow><mo>·</mo><mfrac><mrow><mn>10</mn><mo>⁢</mo><mstyle><mspace width="0.8em" height="0.8ex" /></mstyle><mo>⁢</mo><mi>ms</mi></mrow><mrow><mi>TTI</mi><mo>⁢</mo><mstyle><mspace width="0.8em" height="0.8ex" /></mstyle><mo>⁢</mo><mi>Length</mi><mo>⁢</mo><mstyle><mspace width="0.6em" height="0.6ex" /></mstyle><mo>⁢</mo><mrow><mo>(</mo><mrow><mi>i</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow></mrow></mfrac></mrow></mrow></mrow></mtd><mtd><mrow><mi>Equation</mi><mo>⁢</mo><mstyle><mspace width="0.8em" height="0.8ex" /></mstyle><mo>⁢</mo><mn>1</mn></mrow></mtd></mtr></mtable></math></maths><br /> where <smallcaps>TTI L</smallcaps>ength(i,j) is the TTI length of TF for TrCH i given TFC j.

The total optimal throughput of priority p data for the CCTrCH is the sum of every DCH's normalized throughput of this priority data.

<maths id="MATH-US-00002" num="00002"><math overflow="scroll"><mrow><mrow><mi>Total_Throughput</mi><mo>⁢</mo><mrow><mo>(</mo><mrow><mi>p</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow></mrow><mo>=</mo><mrow><munderover><mo>∑</mo><mi>i</mi><mstyle><mspace width="0.3em" height="0.3ex" /></mstyle></munderover><mo>⁢</mo><mstyle><mspace width="0.3em" height="0.3ex" /></mstyle><mo>⁢</mo><mrow><mi>Throughput</mi><mo>⁢</mo><mstyle><mspace width="0.6em" height="0.6ex" /></mstyle><mo>⁢</mo><mrow><mo>(</mo><mrow><mi>p</mi><mo>,</mo><mi>i</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow></mrow></mrow></mrow></math></maths><ul id="ul0017" list-style="none"><li id="ul0017-0001" num="0000"><ul id="ul0018" list-style="none"><li id="ul0018-0001" num="0107">At S<b>17</b>, check if there are more TFCs in TFC_Can <ul id="ul0019" list-style="none"><li id="ul0019-0001" num="0108">a. If yes, S<b>17</b><i>a</i>, select the next TFC and go back to step S<b>7</b>.</li><li id="ul0019-0002" num="0109">b. If no, S<b>17</b><i>b</i>, (all TFCs were checked), go to step S<b>18</b>.</li></ul></li><li id="ul0018-0002" num="0110">At S<b>18</b>, among all TFCs in TFC_Can, there is at least one TFC, say TFC k, that provides the highest “total optimal throughput” for priority p, such as:</li></ul></li></ul>

<maths id="MATH-US-00003" num="00003"><math overflow="scroll"><mtable><mtr><mtd><mrow><mi>k</mi><mo>=</mo><mrow><munder><mrow><mi>arg</mi><mo>⁢</mo><mstyle><mspace width="0.3em" height="0.3ex" /></mstyle><mo>⁢</mo><mi>max</mi></mrow><mi>j</mi></munder><mo>⁢</mo><mrow><mo>{</mo><mrow><mi>Total_Throughput</mi><mo>⁢</mo><mrow><mo>(</mo><mrow><mi>p</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow></mrow><mo>}</mo></mrow></mrow></mrow></mtd><mtd><mrow><mi>Equation</mi><mo>⁢</mo><mstyle><mspace width="0.8em" height="0.8ex" /></mstyle><mo>⁢</mo><mn>2</mn></mrow></mtd></mtr></mtable></math></maths><ul id="ul0020" list-style="none"><li id="ul0020-0001" num="0000"><ul id="ul0021" list-style="none"><li id="ul0021-0001" num="0000"><ul id="ul0022" list-style="none"><li id="ul0022-0001" num="0112">Delete (i.e. “discard”) all TFCs that provide throughput less than the one of TFC k from TFC_Can. Then go to step S<b>19</b>.</li></ul></li><li id="ul0021-0002" num="0113">At S<b>19</b>, check if there is at least one TFC in TFC_Can that has all the TBs filled. <ul id="ul0023" list-style="none"><li id="ul0023-0001" num="0114">a. If not, S<b>19</b><i>a</i>, go to S<b>20</b> and check if there is at least one TFC that does not belong to TFC_Can and that has all TBs filled. <ul id="ul0024" list-style="none"><li id="ul0024-0001" num="0115">i. If yes, S<b>20</b><i>a: </i><ul id="ul0025" list-style="none"><li id="ul0025-0001" num="0116">1. Go to S<b>21</b> and create a set with all those TFCs, called TFC_NoPad (TFCs that do not require padding).</li><li id="ul0025-0002" num="0117">2. Among all the TFCs in TFC_NoPad, select the TFC that provides highest “total optimal throughput” for priority p data.</li><li id="ul0025-0003" num="0118">3. Add that TFC to TFC_Can (candidate set).</li></ul></li><li id="ul0024-0002" num="0119">ii. If not, S<b>20</b><i>b</i>, continue to step S<b>22</b>.</li></ul></li><li id="ul0023-0002" num="0120">b. If yes, S<b>19</b><i>b</i>, continue to step S<b>22</b> (there is already one TFC in TFC_Can that does not require padding).</li></ul></li><li id="ul0021-0003" num="0121">At S<b>22</b>, check if all TFCs in TFC_Can have all the TBs filled. <ul id="ul0026" list-style="none"><li id="ul0026-0001" num="0122">a. If yes, S<b>22</b><i>a</i>, go to step S<b>25</b> (TFC selection is done).</li><li id="ul0026-0002" num="0123">b. If no, S<b>22</b><i>b</i>, go to step S<b>23</b>.</li></ul></li><li id="ul0021-0004" num="0124">At S<b>23</b>, update p=p+1.</li><li id="ul0021-0005" num="0125">At S<b>24</b> Check if p≦8 <ul id="ul0027" list-style="none"><li id="ul0027-0001" num="0126">a. If yes, S<b>24</b><i>a</i>, return to step S<b>5</b></li><li id="ul0027-0002" num="0127">b. If no, S<b>24</b><i>b</i>, go to step S<b>25</b> (all priorities checked, will select one TFC).</li></ul></li><li id="ul0021-0006" num="0128">At S<b>25</b>, check if there is at least one TFC in TFC_Can that does not require padding PDUs. <ul id="ul0028" list-style="none"><li id="ul0028-0001" num="0129">a. If yes, S<b>25</b><i>a</i>, go to step S<b>26</b>.</li><li id="ul0028-0002" num="0130">b. If no, S<b>25</b><i>b </i>go to step S<b>27</b>.</li></ul></li><li id="ul0021-0007" num="0131">At S<b>26</b>, select the TFC from TFC_Can that does not require padding. If there is more than one TFC available that does not require padding, among those, select the TFC that provides the minimum data rate.</li><li id="ul0021-0008" num="0132">At S<b>27</b>, Select the TFC from TFC_Can that provides the minimum data rate. If there is more than one TFC available with the same data rate, select one randomly. Fill in the unfilled PDUs in the TFC with padding PDUs from RLC.</li></ul></li></ul>

On the RNC side, the TFC Selection in the MAC layer is done in both MAC-c and MAC-d entities. MAC-c is located in the Controlling-RNC (C-RNC) and there is one MAC-c per cell; MAC-d is located in the S-RNC and there is one MAC-d for each UE.

In order to transfer data between S-RNC and C-RNC, forward access channel (FACH) flow control is used. Flow control allows the MAC-c (C-RNC) to control the number of SDUs (credits) that each MAC-d (S-RNC) can send for an associated priority (FACH Priority Indicator). The MAC-d selects an SDU size for each priority, and send the data to the MAC-c. The MAC-c buffers this data, before it is transmitted.

If credits=0 (e.g. due to congestion in the C-RNC), the S-RNC immediately stops transmission of MAC-c SDUs. If credits=“unlimited”, it indicates that the SRNC may transmit an unlimited number of MAC-c SDUs.

The following sections describe the TFC selection algorithm for RNC MAC-c (<figref idref="DRAWINGS">FIG. 1</figref>) and the SDU size selection algorithm for common transport channels in the RNC MAC-d.

The RNC MAC-d TFC selection algorithm is similar to that for the UE MAC-d, with the exception that on the RNC side there is no restriction on the transmit power, and hence will not be presented here. The procedure discussed in the previous section applies to MAC-d in both UE and RNC sides.

The MAC specification does not specify any requirements for TFC selection on RNC. However for the UE to decode the data properly, there are some requirements that must be followed. These requirements are summarized below.

Before selecting a TFC for the case of MAC-c, the set of valid TFCs must be established. This set is referred to as the “candidate set”. All TFCs in the candidate set must:

1. belong to the TFCS;

2. respect the TTI compatibility—the transport format (TF) of a TrCH cannot change in the middle of the TTI of the TrCH; and

3. be compatible with the RLC configuration.

The chosen TFC must be selected from the candidate set and must satisfy the following criteria in the order in which they are listed below: <ul id="ul0029" list-style="none"><li id="ul0029-0001" num="0000"><ul id="ul0030" list-style="none"><li id="ul0030-0001" num="0144">1. No other TFC allows the transmission of more highest priority data than the chosen TFC.</li><li id="ul0030-0002" num="0145">2. No other TFC allows the transmission of more data from the next lower priority logical channels. This criterion is applied recursively for the remaining priority levels.</li><li id="ul0030-0003" num="0146">3. No other TFC has a lower bit rate than the chosen TFC.</li><li id="ul0030-0004" num="0147">4. Must respect “first in first out” within each priority for data received from MAC-d.</li></ul></li></ul>

For the MAC-c procedure, the data that is received from MAC-d is buffered in MAC-c. This can be done by either having one queue per UE, or one queue for all the UEs, or one queue for each priority. It is proposed to have one queue per priority, as doing so would make it easier to maintain first in first out order. The first approach would require the buffer to be time stamped in order to maintain the order, while the second approach would require coordination of the priorities.

For blocking purposes, MAC-c can schedule data on any of the FACHs mapped on the coded composite channel. If data from a logical channel is sent on a transport channel with TTI of length ‘t’, data from the same logical channel should not be sent on other transport channels, for the duration of ‘t’ as this can lead to an out-of-order problem in the receiving side RLC (i.e., the UE side).

For a CCCH (Common Control Channel) this problem can be solved by blocking the channel for transmission for a duration equal to the TTI of the last transmitted transport channel (i.e., data from that logical channel will not be sent during that TTI).

For buffered data (data received from MAC-d), this problem can be solved by blocking the data of a given priority. However, this approach would lead to under utilization of system resources as a greater amount of data is blocked even if it is not necessary, and leads to a delay in the transmission of data from other UEs of the same priority. To avoid this, data of a priority from a UE is blocked for a period ‘t’, if data from this UE of that priority is sent on a transport channel with TTI period ‘t’. This increases the amount of data that can be sent out from all UEs and also solves the out of order problem.

As for padding, MAC-c can request padding PDUs only from CCCH RLC entity. If CCCH is blocked and if padding PDUs are required, MAC-c requests only padding PDUs from RLC.

The following is an example of an implementation of the RNC MAC-c TFC Selection procedure. The invention is much broader and the invention should not be limited in scope based on the example given but on the scope of the claims.

In this MAC-c algorithm, algorithm:

A buffer with transferred PDUs is referred to as a “logical channel”.

The candidate TFC set is referred to as TFC_Can

Only logical channels that have buffer occupancy greater than zero shall be considered for the TFC selection

The algorithm should run only if the TFC set has valid TFCs (TFCs with data rate greater than zero)

Making reference to <figref idref="DRAWINGS">FIGS. 1A to 1D</figref>, the following steps are performed for the MAC-c TFC selection algorithm: <ul id="ul0031" list-style="none"><li id="ul0031-0001" num="0000"><ul id="ul0032" list-style="none"><li id="ul0032-0001" num="0160">S<b>1</b>. Initialize p=1.</li><li id="ul0032-0002" num="0161">S<b>2</b>. Check if there is at least one TFC with at least one TB available in the TFC_Can (candidate TFC set). <ul id="ul0033" list-style="none"><li id="ul0033-0001" num="0162">a. If yes, S<b>2</b><i>a</i>, go to step S<b>3</b>.</li><li id="ul0033-0002" num="0163">b. If no, S<b>2</b><i>b</i>, go to step S<b>26</b> (all TFCs filled, will select one).</li></ul></li><li id="ul0032-0003" num="0164">S<b>3</b>: Select the first TFC with at least one TB available from TFC_Can (candidate TFC set)</li><li id="ul0032-0004" num="0165">S<b>4</b>: Check if there is a logical channel with priority p such that: the logical channel has available PDUs to be sent; if the selected logical channel is a CCCH, the logical channel is not blocked for the selected TFC; if the selected logical channel is of transferred PDUs then check if; there is a least one PDU that is not blocked for the selected TFC; and the selected logical channel is not blocked for this TFC. <ul id="ul0034" list-style="none"><li id="ul0034-0001" num="0166">a. If yes, S<b>4</b><i>a</i>, go to S<b>5</b> and select that logical channel. If there is more than one such logical channel, select one randomly. Go to step S<b>6</b>.</li><li id="ul0034-0002" num="0167">b. If no, S<b>4</b><i>b</i>, go to S<b>17</b> (no more data with priority p).</li></ul></li><li id="ul0032-0005" num="0168">S<b>6</b>: Check if there is a restriction on PDU sizes for the selected logical channel. <ul id="ul0035" list-style="none"><li id="ul0035-0001" num="0169">a. If yes, S<b>6</b><i>a</i>, go to S<b>7</b> and check if there is a TB available with the same size as the PDU size+MAC header. <ul id="ul0036" list-style="none"><li id="ul0036-0001" num="0170">i. If yes, S<b>7</b><i>a</i>, go to S<b>8</b> and:</li><li id="ul0036-0002" num="0171">1. select the transport channel with that TB size. If more than one are available, select a transport channel that gives the maximum available data rate, as follows:</li><li id="ul0036-0003" num="0172">MAX {(number of available TBs)/TTIsize}; and</li><li id="ul0036-0004" num="0173">2. select PDUs that are not blocked from this logical channel to fill up as many available TBs as possible in the transport channel. PDU selection must respect FIFO; blocked PDUs must be skipped.</li><li id="ul0036-0005" num="0174">3. Update buffer information as follows: <ul id="ul0037" list-style="none"><li id="ul0037-0001" num="0175">a. PDUs selected are not available for this TFC selection, then go to S<b>11</b> and:</li><li id="ul0037-0002" num="0176">Update TB information as follows:</li><li id="ul0037-0003" num="0177">a. TBs used are not available anymore for this TFC selection.</li></ul></li><li id="ul0036-0006" num="0178">Then go to step S<b>14</b>.</li><li id="ul0036-0007" num="0179">ii. If no, S<b>7</b><i>b</i>, go to S<b>9</b> to perform:</li><li id="ul0036-0008" num="0180">1. This logical channel is considered blocked for this TFC (since PDUs do not fit the TFC).</li><li id="ul0036-0009" num="0181">2. Then return to step S<b>4</b>.</li></ul></li><li id="ul0035-0002" num="0182">b. If no, S<b>6</b><i>b</i>, go to S<b>10</b> and: <ul id="ul0038" list-style="none"><li id="ul0038-0001" num="0183">i. select a transport channel that gives the maximum available data rate, as follows:</li><li id="ul0038-0002" num="0184">MAX {(number of available TBs*TBsize)/TTIsize}.</li><li id="ul0038-0003" num="0185">ii. Fill up as many TBs as possible in that transport channel with bits from this logical channel.</li><li id="ul0038-0004" num="0186">iii. Update buffer information as follows:</li><li id="ul0038-0005" num="0187">1. bits used are not available anymore for this TFC selection and should not be counted in the buffer occupancy.</li><li id="ul0038-0006" num="0188">iv. Then go to step S<b>11</b> to update TB information as follows:</li><li id="ul0038-0007" num="0189">1. TBs used are not available anymore for this TFC selection.</li><li id="ul0038-0008" num="0190">v. Then go to step S<b>12</b>.</li><li id="ul0038-0009" num="0191"><b>2</b>. If the selected logical channel is a CCCH, S<b>12</b><i>a</i>, go to S<b>14</b> and: <ul id="ul0039" list-style="none"><li id="ul0039-0001" num="0192">Consider the CCCH to be blocked for this TFC during this TFC selection (for the next steps of the TFC selection for this TTI).</li></ul></li><li id="ul0038-0010" num="0193">3. If the selected logical channel is not a CCCH, S<b>12</b><i>b</i>, go to S<b>13</b> to determine: <ul id="ul0040" list-style="none"><li id="ul0040-0001" num="0194">If the selected logical channel is of transferred PDUs, S<b>13</b><i>a</i>, then go to S<b>15</b>, to assure:</li><li id="ul0040-0002" num="0195"> all the other PDUs that:</li><li id="ul0040-0003" num="0196"> are in the same buffer (i.e., same priority); and</li><li id="ul0040-0004" num="0197"> have the same UE ID as the UE ID of PDU(s) selected are considered blocked for this TFC during this TFC selection (for the next steps of the TFC selection for this TTI).</li></ul></li><li id="ul0038-0011" num="0198">5. If the selected logical channel is not of transferred PDUs, S<b>13</b>b, go directly to S<b>16</b>.</li></ul></li></ul></li><li id="ul0032-0006" num="0199">At S<b>16</b>, check if all the TBs in this TFC are filled. <ul id="ul0041" list-style="none"><li id="ul0041-0001" num="0200">a. If yes, S<b>16</b><i>a</i>, go to step S<b>17</b> (no more space in this TFC).</li><li id="ul0041-0002" num="0201">b. If no, S<b>16</b><i>b</i>, return to step S<b>4</b>.</li></ul></li><li id="ul0032-0007" num="0202">At S<b>17</b>, compute the total optimal throughput of priority p data for this TFC, as follows: <ul id="ul0042" list-style="none"><li id="ul0042-0001" num="0203">Let Num_Bits(p,i,j) denote the number of bits of priority p data that can be transmitted on FACH i when using TFC j (i.e., TB size times the number of TBs being sent, including any RLC and/or MAC header that is applicable and/or padding bits).</li><li id="ul0042-0002" num="0204">The normalized throughput of FACH i is computed as</li></ul></li></ul></li></ul>

<maths id="MATH-US-00004" num="00004"><math overflow="scroll"><mtable><mtr><mtd><mrow><mrow><mi>Throughput</mi><mo>⁢</mo><mstyle><mspace width="0.6em" height="0.6ex" /></mstyle><mo>⁢</mo><mrow><mo>(</mo><mrow><mi>p</mi><mo>,</mo><mi>i</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow></mrow><mo>=</mo><mrow><mi>Num_Bits</mi><mo>⁢</mo><mrow><mrow><mo>(</mo><mrow><mi>p</mi><mo>,</mo><mi>i</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow><mo>·</mo><mfrac><mrow><mn>10</mn><mo>⁢</mo><mstyle><mspace width="0.8em" height="0.8ex" /></mstyle><mo>⁢</mo><mi>ms</mi></mrow><mrow><mi>TTI</mi><mo>⁢</mo><mstyle><mspace width="0.8em" height="0.8ex" /></mstyle><mo>⁢</mo><mi>Length</mi><mo>⁢</mo><mstyle><mspace width="0.6em" height="0.6ex" /></mstyle><mo>⁢</mo><mrow><mo>(</mo><mrow><mi>i</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow></mrow></mfrac></mrow></mrow></mrow></mtd><mtd><mrow><mi>Equation</mi><mo>⁢</mo><mstyle><mspace width="0.8em" height="0.8ex" /></mstyle><mo>⁢</mo><mn>3</mn></mrow></mtd></mtr></mtable></math></maths><ul id="ul0043" list-style="none"><li id="ul0043-0001" num="0000"><ul id="ul0044" list-style="none"><li id="ul0044-0001" num="0000"><ul id="ul0045" list-style="none"><li id="ul0045-0001" num="0206"> where <smallcaps>TTI L</smallcaps>ength(i,j) is the TTI length of TF for TrCH i given TFC j. The total optimal throughput of priority p data for the CCTrCH (S-CCPCH) is the sum of every FACH's normalized throughput of this priority data.</li></ul></li></ul></li></ul>

<maths id="MATH-US-00005" num="00005"><math overflow="scroll"><mrow><mrow><mi>Total_Throughput</mi><mo>⁢</mo><mrow><mo>(</mo><mrow><mi>p</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow></mrow><mo>=</mo><mrow><munderover><mo>∑</mo><mi>i</mi><mstyle><mspace width="0.3em" height="0.3ex" /></mstyle></munderover><mo>⁢</mo><mstyle><mspace width="0.3em" height="0.3ex" /></mstyle><mo>⁢</mo><mrow><mi>Throughput</mi><mo>⁢</mo><mstyle><mspace width="0.6em" height="0.6ex" /></mstyle><mo>⁢</mo><mrow><mo>(</mo><mrow><mi>p</mi><mo>,</mo><mi>i</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow></mrow></mrow></mrow></math></maths><ul id="ul0046" list-style="none"><li id="ul0046-0001" num="0000"><ul id="ul0047" list-style="none"><li id="ul0047-0001" num="0208">At S<b>18</b>, check if there are more TFCs in TFC_Can. <ul id="ul0048" list-style="none"><li id="ul0048-0001" num="0209">a. If yes, S<b>18</b><i>a</i>, select the next TFC and return to step S<b>4</b>.</li><li id="ul0048-0002" num="0210">b. If no, S<b>18</b><i>b</i>, (all TFCs were checked), go to step S<b>19</b>.</li></ul></li><li id="ul0047-0002" num="0211">At S<b>19</b>, among all TFCs in TFC_Can, there is at least one TFC, say TFC k, that provides the highest “total optimal throughput” for priority p, such as:</li></ul></li></ul>

<maths id="MATH-US-00006" num="00006"><math overflow="scroll"><mtable><mtr><mtd><mrow><mi>k</mi><mo>=</mo><mrow><munder><mrow><mi>arg</mi><mo>⁢</mo><mstyle><mspace width="0.3em" height="0.3ex" /></mstyle><mo>⁢</mo><mi>max</mi></mrow><mi>j</mi></munder><mo>⁢</mo><mrow><mo>{</mo><mrow><mi>Total_Throughput</mi><mo>⁢</mo><mrow><mo>(</mo><mrow><mi>p</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow></mrow><mo>}</mo></mrow></mrow></mrow></mtd><mtd><mrow><mi>Equation</mi><mo>⁢</mo><mstyle><mspace width="0.8em" height="0.8ex" /></mstyle><mo>⁢</mo><mn>4</mn></mrow></mtd></mtr></mtable></math></maths><ul id="ul0049" list-style="none"><li id="ul0049-0001" num="0000"><ul id="ul0050" list-style="none"><li id="ul0050-0001" num="0213"> Delete all TFCs that provide throughput less than the selected TFC k from TFC_Can.</li><li id="ul0050-0002" num="0214">At S<b>20</b>, check if there is at least one TFC in TFC_Can that has all the TBs filled (does not require padding). <ul id="ul0051" list-style="none"><li id="ul0051-0001" num="0215">a. If not, S<b>20</b><i>a</i>, go to S<b>21</b> and check if there is at least one TFC that does not belong to TFC_Can and that has all TBs filled. <ul id="ul0052" list-style="none"><li id="ul0052-0001" num="0216">i. If yes, S<b>21</b><i>a</i>, go to S<b>22</b> to: <ul id="ul0053" list-style="none"><li id="ul0053-0001" num="0217">1. Create a set with all those TFCs, called TFC_NoPad (TFCs that do not require padding);</li><li id="ul0053-0002" num="0218">2. among all the TFCs in TFC_NoPad, select the TFC providing the highest “total optimal throughput” for priority p data; and</li><li id="ul0053-0003" num="0219">3. add that TFC to TFC_Can.</li></ul></li><li id="ul0052-0002" num="0220">ii. If not, S<b>21</b><i>b</i>, continue to step S<b>23</b>.</li></ul></li><li id="ul0051-0002" num="0221">b. If yes, S<b>20</b><i>b</i>, continue to step S<b>23</b> (there is already one TFC in TFC_Can that does not require padding).</li></ul></li><li id="ul0050-0003" num="0222">At S<b>23</b>, check if all TFCs in TFC_Can have all the TBs filled. <ul id="ul0054" list-style="none"><li id="ul0054-0001" num="0223">a. If yes, S<b>23</b><i>a</i>, go to step S<b>26</b> (TFC selection is done).</li><li id="ul0054-0002" num="0224">b. If no, S<b>23</b><i>b</i>, go to step S<b>24</b>.</li></ul></li><li id="ul0050-0004" num="0225">At S<b>24</b>, update p=p+1, then go to S<b>25</b> to check if p&lt;=8. <ul id="ul0055" list-style="none"><li id="ul0055-0001" num="0226">a. If yes, S<b>25</b><i>a</i>, return to step S<b>2</b>.</li><li id="ul0055-0002" num="0227">b. If no, S<b>25</b><i>b</i>, go to step S<b>26</b> (all priorities checked, select one TFC).</li></ul></li><li id="ul0050-0005" num="0228">At S<b>26</b>, check if there is at least one TFC in TFC_Can that does not require padding PDUs. <ul id="ul0056" list-style="none"><li id="ul0056-0001" num="0229">a. If yes, S<b>26</b><i>a</i>, go to step S<b>27</b>.</li><li id="ul0056-0002" num="0230">b. If no, S<b>26</b><i>b</i>, go to step S<b>28</b>.</li></ul></li><li id="ul0050-0006" num="0231">At S<b>27</b>, select the TFC from TFC_Can that does not require padding. If there is more than one TFC available that does not require padding, among those, select the TFC that provides the minimum data rate.</li><li id="ul0050-0007" num="0232">At S<b>28</b>, select the TFC from TFC_Can that provides the minimum data rate. <ul id="ul0057" list-style="none"><li id="ul0057-0001" num="0233">If there is more than one TFC available with the same number of bits, select one randomly. Fill in the unfilled PDUs in the TFC with padding PDUs from RLC (CCCH).</li><li id="ul0057-0002" num="0234">After either S<b>27</b> or S<b>28</b>, go to S<b>29</b>.</li></ul></li><li id="ul0050-0008" num="0235">At S<b>29</b>, if the CCCH is used in this TFC, consider the CCCH to be blocked for all TFCs for a period of time equal to the TTI of the transport channel selected.</li><li id="ul0050-0009" num="0236">At S<b>30</b>, for each logical channel with transferred PDUs (i.e., for each buffer with a specific priority) used in the selected TFC, each PDU that is in that buffer and has the UE ID equal to the UE ID of a PDU selected for this TFC is considered to be blocked for all TFCs for a period of time equal to the TTI of the transport channel selected for that logical channel.</li></ul></li></ul>

<figref idref="DRAWINGS">FIG. 1</figref>, which shows the flowchart for the MAC-c TFC selection algorithm implementation, includes more steps than the algorithm of <figref idref="DRAWINGS">FIG. 2</figref>.

The MAC-d can be configured with a set of allowed SDU sizes (the allowed sizes depend on the TFCS of the S-CCPCH (Secondary Common Control Channel)) for each common transport channel priority indicator (FACH priority). A FACH flow control frame is used by the C-RNC to control the user data flow. It may be generated in response to a FACH Capacity Request or at any other time. The FACH Flow control frame shall contain the number of credits the S-RNC MAC-d entity is allowed to transmit.

For each logical channel, there is an associated FACH priority. The MAC-d selects a SDU size (from within the configured set) for each logical channel, depending on the logical channel buffer occupancy (BO) and the number of available credits for that FACH priority. MAC-c SDUs of same size and same FACH priority may be transmitted in the same FACH data frame.

The SDU size selection for a logical channel depends on the corresponding RLC configuration, the logical channel BO, and the number of available credits for that FACH priority.

For a given BO, there may be a variable number of credits needed for each SDU size. If the number of credits required multiplied by the SDU size does not exactly match the BO, then it will require some overhead (RLC padding). An SDU size that minimizes this overhead is selected, to maximize throughput. However, that may require selecting a size that requires an increased number of credits. It should be noted that the more the number of credits is requested, the more times the MAC header is added, resulting in more overhead.

Since there is no closed form equation to determine which option is better (minimizing the RLC padding overhead or minimizing the number of credits for a given BO), the latter (minimizing the number of credits being used for a given BO) is selected because, by selecting a size that requires a lesser number of credits, more credits are available for future use, which proves to be extremely useful in a fully loaded system. Also, if the BO is very large compared with the SDU sizes, then the solution minimizes both the overhead and the number of credits.

The following is an example of an implementation of the RNC MAC-d SDU size selection procedure. The invention is not limited to the following example, and the invention is intended to be limited only by the appending claims.

In order to send SDUs to the MAC-c, MAC-d follows the following procedure (See <figref idref="DRAWINGS">FIG. 3</figref>): <ul id="ul0058" list-style="none"><li id="ul0058-0001" num="0000"><ul id="ul0059" list-style="none"><li id="ul0059-0001" num="0245">S<b>1</b>: Select the highest priority (i.e., highest MLP).</li><li id="ul0059-0002" num="0246">S<b>2</b>: Select a logical channel with that priority. If there is more than one logical channel with that priority, select one randomly.</li><li id="ul0059-0003" num="0247">S<b>3</b>: Based on the buffer occupancy of the logical channel, select the SDU size to be used for that logical channel, as follows: <ul id="ul0060" list-style="none"><li id="ul0060-0001" num="0248">Based on the number of “credits” available in MAC-d, determine the amount of information bits that can be transmitted by using each PDU size (not including padding bits). For each PDU size, the amount of information bits is given by:</li><li id="ul0060-0002" num="0249">MIN (BO, credits×PDU size).</li><li id="ul0060-0003" num="0250">Select the PDU size that gives the maximum amount of information bits. If more than one PDU size gives the same maximum amount of information bits, select the PDU size that gives the minimum number of credits required to send the given maximum amount of information bits. If more than one PDU size gives the same minimum number of credits, select the smallest PDU size.</li></ul></li><li id="ul0059-0004" num="0251">S<b>4</b>: Select the SDUs to be sent from that logical channel. Many SDUs can be sent but only a single SDU size is allowed for that logical channel. The credits allowed must be respected when selecting the number of SDUs to be sent.</li><li id="ul0059-0005" num="0252">S<b>5</b>: Check if there are more logical channels with the same priority and if there are still credits available for that priority <ul id="ul0061" list-style="none"><li id="ul0061-0001" num="0253">If yes, S<b>5</b><i>a</i>, return to S<b>2</b>.</li><li id="ul0061-0002" num="0254">If no, S<b>5</b><i>b</i>, go to S<b>6</b>.</li></ul></li><li id="ul0059-0006" num="0255">At S<b>6</b>, build one “Iur” FACH data frame for each SDU size (for a given priority). Note that the SDU size is the same for a given logical channel, but may be different for different logical channels of the same priority. Thus, if there are n logical channels with that priority, there will be at least one (1) and at most n FACH data frames (one for each size). It should also be noted that the order of the SDUs for each logical channel must be maintained inside the data frame.</li><li id="ul0059-0007" num="0256">At S<b>7</b>, check if there are more logical channels available. <ul id="ul0062" list-style="none"><li id="ul0062-0001" num="0257">If yes, S<b>7</b><i>a</i>, go to S<b>8</b> to select the next highest priority available and go back to S<b>2</b>.</li><li id="ul0062-0002" num="0258">If no, S<b>7</b><i>b</i>, the procedure is over.</li></ul></li></ul></li></ul>

In the previous sections, the information needed in order to perform TFC selection was described. For the interaction between MAC and RLC, both logical channel mode-based configuration information (static) and buffered data information (dynamic) are needed.

As per the MAC Protocol Specification (3GPP TS 25.321) and the RLC Protocol Specification (3GPP TS 25.322), the RLC provides the MAC with the buffer occupancy (BO), which is the total amount of data buffered in the RLC. However, since the MAC needs more information from the RLC in order to perform TFC selection, the RLC protocol specification (3GPP TS 25.322) also states that the RLC needs to provide “RLC Entity Info” to the MAC. The RLC protocol specification (3GPP TS 25.322) does not specify what the “RLC Entity Info” must contain.

In this section, the contents of the “RLC Entity Info” will be described. Since this information is used to “restrict” the selection of the TFC, this information is referred to as the TFC Restriction Variables.

The TFC restriction variables provide information about the PDUs and/or SDUs buffered in the RLC that are available for transmission in the next TTI.

For unacknowledged and transparent modes, the MAC specifies the PDU size on a per TTI basis. Therefore, the RLC cannot create PDUs ahead of the TTI, and only information based on the buffered SDUs can be provided by the RLC in advance of transmission. For an acknowledged mode, the PDU size is fixed, and therefore information based on the buffered PDUs can be provided by the RLC.

Note that the TFC restriction variables can contain the RLC mode itself. However, since providing the RLC mode requires the MAC to make assumptions about the RLC buffered data characteristics based on the RLC mode, then the data characteristics themselves are provided instead.

Since TFC selection depends upon the amount of data that is available for transmission in a given TTI, the TFC restriction variables include the SDU/PDU size and the number of SDUs/PDUs buffered in the RLC.

Depending on the RLC mode, and also in order to avoid data transmission conflicts, only some of the data buffered in the RLC may be available for transmission.

For all RLC modes, the sizes and UE Id Types of all of the PDUs transmitted to the MAC in one TTI must be the same. The information reported to the MAC must guarantee that the TFC is selected so that these two restrictions are not violated. Therefore, only information for SDUs and PDUs that are the same size and UE Id Type is provided. Since the data must be transmitted in the order it was received, the RLC reports only the number of consecutive SDUs/PDUs in the RLC transmission buffer (starting from the oldest SDU/PDU) that are the same size and the same UE Id Type.

For transparent mode with segmentation configured, only one SDU can be transmitted per TTI, and therefore the RLC will report that only one SDU is available for transmission.

For acknowledged mode, depending upon the RLC configuration, a logical channel can carry RLC SDU data (received from the upper layer) and/or RLC peer-to-peer control data. The amount of available PDU data for an acknowledged mode logical channel is therefore restricted by the type of RLC data that it can support. For acknowledged mode logical channels that support transmission of RLC SDUs (received from the upper layer), the amount of available PDU data is also restricted by the size of the logical channel's RLC transmit window. Note that the RLC transmit window size is statically configured in the RLC.

For TFC selection, the MAC needs to know how much of the TB is taken up by the MAC header. Since the TB header size depends on the UE Id Type, then the TFC restriction variables also contain the UE Id Type. Note that the MAC protocol specification (3GPP TS 25.321) states that the UE Id Type is provided by the RLC to the MAC for each data transmission.

Since the TFC contains information about the number of PDUs that the MAC must request from the RLC then the MAC needs to know whether or not the SDUs buffered in the RLC can be segmented. Therefore the TFC restriction variables include a segmentation indicator. Note that this indicator is statically configured in the RLC.

As mentioned in the previous sections, padding information needs to be known by the MAC in order to be able to perform TFC selection. Since padding is only supported in certain RLC modes (UM and AM modes only), a padding PDU indicator is also included in the TFC restriction variables.

The foregoing is a description of a method and exemplary algorithms for procedures used by the MAC layer for TFC selection to schedule data transmission. The 3GPP UMTS stated above as the context for the invention is only by way of example, and, the invention can be modified to serve other related standards and modes of data transmission. All such modifications are envisaged to be within the scope of the present invention.

The blocking and unblocking techniques described above are extremely advantageous for use in a wireless network employing time division duplex (TDD) for communications. However, the above techniques can be employed in a frequency division duplex (FDD) type network.

All other aspects of the invention are applicable to all operating modes of UMTS.