Patent Application
20050149470
The present invention relates to scheduling for data transmission, for example, scheduling for transmission of stream-type data which is sensitive to delay.
In a mobile communication system, plural users in the same area need to be provided with services. Accordingly, it is necessary to assign different radio resource (frequency, time, or diffusion code) to each user to avoid interference. Further, in a mobile communication system which handles variable-rate traffic, in order to effectively use the radio resource, scheduling is carried out so as to dynamically assign the radio resource to users who need to use.
In general, the scheduling is carried out with a radio frame cycle. Two typical algorithms for scheduling will be explained.
By a round-robin type, all users are provided with a chance to be assigned the radio resource in rotation, and if requested, the radio resource is assigned. This method is easy to implement.
By a line quality reflective type, users who have good quality of radio line are provided with a chance to be assigned preferentially, and if requested, the resource is assigned. Since a chance to be assigned is given preferentially to the users having good quality of radio line, it is possible to implement a highly effective use of the radio resource in the system as a whole.
In the future, it is expected that transmission of stream-type data such as real-time animation or speech would be increased. This stream-type data is sensitive to delay, so that it becomes impossible to normally reproduce data at a receiver side if excessive delay than an authorized value is applied to a packet caused by transmission queuing due to the scheduling.
Therefore, the Japanese unexamined patent publication JP8-288952 proposes to output preferentially a packet categorized in a quality class having a short authorized delay time. This prior art is not directed to the mobile communication system; however, the purpose is the same, and thus the art is described here as a related art.
In the figure, 2004 is a packet separating unit, 2005 is a packet storing unit, 2006 is a scheduling unit, and 2007 is a packet multiplexing unit.
In the following, an operation will be explained.
The packet separating unit 2004 checks a quality class of a packet inputted, and separates the packet to the packet storing unit corresponding to the quality class. As the quality class, an authorized delay time is mainly assumed.
The packet storing unit 2005 stores the packet for each quality class.
The scheduling unit 2006 carries out scheduling so as to extract the packet preferentially from the packet storing unit of the quality class of a short authorized delay time.
The packet multiplexing unit 2007 extracts the packet from the packet storing unit 2005 by an instruction of the scheduling unit 2006, multiplexes and outputs the packet.
On the other hand, since the mobile communication employs the radio, the line quality becomes unstable, and thus the receiver side sometimes cannot receive the packet correctly. To solve the problem, for the packet which has not been received correctly, a retransmission control function is often used in which a retransmission request is sent to a transmitter side, and the transmitter side retransmits the corresponding packet.
However, it essentially takes time to successfully receive a packet by the receiver side with multiple times of retransmission. When the time required for this retransmission exceeds the authorized delay time, the packet cannot be used even if the receiver side correctly receives it. As a result, the radio resource becomes waste.
Consequently, the Japanese unexamined patent publication JP 10-56480 offers to terminate the retransmission if the time required for the retransmission exceeds the authorized delay time.
In the figure, 2108 is a retransmission controlling unit, and 2110 is an authorized delay time excess observing unit. Here, numerals 2104 through 2107 show the same as those in
Next, an operation will be explained.
On receiving a retransmission request issued by a reception apparatus, the retransmission controlling unit 2108 generates a retransmission packet corresponding to the request and transfers it to the packet storing unit.
The authorized delay time excess observing unit 2110 observes each packet stored in the packet storing unit, searches a packet which has been stored for longer than the authorized delay time, and if such packet exists, instructs the packet storing unit to discard the corresponding packet.
The operation of the other components is the same as the case of
By doing so, it is possible to avoid transmission of useless packet, so that it is also possible to avoid wasting the radio resource.
However, there are problems in these related arts as described in the following.
The primary problem is there is no equality in discarding the packet.
In the first related art, the class with a short “authorized delay time” is always treated preferentially over the class with a long “authorized delay time.” Accordingly, in case of convergence, the packet is discarded from the class with the long “authorized delay time.” However, an application with the long “authorized delay time” is not always robust to the packet discarding, and thus the method proposed by the first related art lacks the equality.
Among plural classes of different “authorized delay times” requests, the equality must be established in any aspects other than that of “authorized delay time,” and therefore a probability of discarding the packet has to be equal. Or the probability of discarding the packet has to be defined based on another priority.
The secondary problem is that generation of the retransmission is likely to prevent completion of the transmission within the authorized delay time.
In the second related art, the effective use of the radio resource is attempted by discarding a packet which exceeds the “authorized delay time” at the transmitter side without retransmission; however, the art does not provide a process to passively complete the transmission before exceeding the “authorized delay time.” Accordingly, it is still impossible to solve the problem that the reception apparatus cannot receive the packet within the “authorized delay time.”
In this way, the related arts have a problem in handling the stream-type traffic for which the transmission has to be completed within the “authorized delay time.”
The present invention, therefore, aims to solve the problems of the related arts as discussed above.
According to the present invention, a data transmission apparatus for carrying out data transmission and includes:
The data specifying unit specifies the transmission candidate data of which the difference between the transmission completion time and the current time is smallest as the transmission object.
The data transmission apparatus carries out data transmission of data received from another apparatus, and
The data transmission apparatus further includes a retransmission controlling unit for receiving a retransmission request for the data transmitted by the data transmitting unit and instructing the data storing unit which has stored retransmission requested data of which retransmission is requested to generate the retransmission requested data,
The data transmission apparatus further includes a transmission completion time storing unit, when the transmission completion time for the transmission candidate data which is the transmission queuing data is specified by the data specifying unit, for storing the transmission completion time specified by relating with the corresponding transmission candidate data, and
The data transmission apparatus carries out data transmission of data received from another apparatus, and
The data transmission apparatus carries out data transmission received from another apparatus,
The data transmission apparatus further includes a coefficient value determining unit for determining a value of the coefficient based on quality of a communication line used for transmitting the transmission candidate data, for each transmission candidate data.
The data transmission apparatus further includes a coefficient value determining unit for determining a value of the coefficient based on moving speed of a mobile communication apparatus which is a destination of the transmission candidate data, for each transmission candidate data.
The data transmission apparatus further includes a coefficient value determining unit for determining a value of the coefficient based on geographical condition of a location of a mobile communication apparatus which is a destination of the transmission candidate data, for each transmission candidate data.
The data transmission apparatus carries out data transmission of data received from another apparatus,
The specifying unit specifies the transmission completion time for each transmission trial by equally setting intervals of the transmission completion times.
The data specifying unit specifies the transmission completion time for each transmission trial by setting intervals of transmission completion times so that later transmission trials have shorter intervals.
The data transmission apparatus carries out data transmission of data received from another apparatus, and
According to the present invention, a data transmission method for carrying out data transmission includes:
The data specifying step specifies the transmission candidate data of which the difference between the transmission completion time and the current time is smallest as the transmission object.
The data transmission method carries out data transmission of data received from another communication method, and
The data specifying unit specifies the transmission completion time for each transmission candidate data, obtains the difference between the transmission completion time and the current time, specifies the transmission candidate data of which the difference between the transmission completion time and the current time is smaller than a predetermined threshold value as the transmission object, and determines if the transmission candidate data of which the difference between the transmission completion time and the current time is larger than the predetermined threshold value is to be specified as the transmission object or not based on a different criteria other than the difference between the transmission completion time and the current time.
The data transmission apparatus carries out data transmission to a plurality of mobile communication apparatuses;
Each of the plurality of data storing units is related to any one of the plurality of mobile communication apparatuses and
One embodiment of a communication system according to the present invention will be explained.
In
Next, the operation of each unit will be discussed.
The transmission block receiving unit 101 accepts (receives) a transmission block from the outside (another apparatus).
The request issuing time assigning unit 102 assigns a time when the transmission block reaches the transmission apparatus (reception time) to each of the transmission blocks received as a request issuing time.
The transmission block separating unit 104 separates the transmission blocks into respective reception apparatuses or respective connections.
The transmission block storing unit 105 stores the transmission blocks. In each transmission block storing unit, the transmission blocks are stored in an order of receipt for each reception apparatus or each connection. Here, the transmission block storing unit 105 is an example of a data storing unit. Further, the transmission block stored in the transmission block storing unit 105 corresponds to transmission queuing data.
The scheduling unit 106 specifies a transmission block as a transmission object and radio resource (a frequency, a time, a diffused code, etc.) to be assigned to the transmission block based on information from the transmission block storing unit 105, authorized delay time information given to each user, and the current time information. The scheduling unit 106 is an example of a data specifying unit.
The transmission block multiplexing unit 107 extracts the transmission block, which is the transmission object specified by the scheduling unit 106, from the transmission block storing unit 105 and carries out a multiplexing.
The radio transmission unit 109 outputs the transmission block via an antenna after performing processes such as modulation, amplification, etc. Here, a combination of the transmission block multiplexing unit 107 and the radio transmission unit 109 corresponds to an example of a data transmitting unit.
Next, the operation of the scheduling unit in this embodiment will be explained by referring to the flowchart of
For each transmission block storing unit, the request issuing time of the oldest transmission block is obtained out of the transmission blocks to which the radio resource have not been assigned yet and which are waiting for transmission, based on the information attached to the transmission blocks (S204). Here, the oldest transmission block within each transmission block storing unit corresponds to transmission candidate data.
The scheduling unit adds an authorized delay time to the request issuing time of each oldest transmission block in each transmission block storing unit to obtain a transmission completion time limit (transmission completion time) (S205). This transmission completion time limit shows a targeted time limit when the transmission block completes the transmission.
After checking all the transmission block storing units, the transmission block having the transmission completion time limit of which the time difference from the current time is the smallest is specified as a transmission object (S210). That the difference is the smallest means the transmission completion time limit is imminent, and such transmission block needs to have a priority to be transmitted.
The radio resource is assigned to the selected transmission block (S211).
It is checked if the radio resource remains or not (S212).
If no radio resource remains, an assignment result is notified to a transmission block multiplexing unit (S213), and the scheduling process is finished.
If the radio resource remains, the scheduling process is repeated again.
It is assumed that the “authorized delay time (user A)” of the user A is larger than the “authorized delay time (user B)” of the user B.
Two transmission blocks, namely, a transmission block 1 and a transmission block 2 have arrived for the user A and the user B, respectively.
It is assumed that the “request issuing time (transmission block 1)” of the transmission block 1 is earlier than the “request issuing time (transmission block 2)” of the transmission block 2.
As described above, the authorized delay time (user A) is added to the request issuing time (transmission block 1) for the transmission block 1, the authorized delay time (user B) is added to the request issuing time (transmission block 2) for the transmission block 2, and the transmission completion time limit of each transmission block is obtained as shown in
The difference between the current time and the transmission completion time limit shows a grace time until the transmission completion time limit, and the radio resource is assigned to each of the transmission blocks preferentially from the one having the smallest grace time.
Here, since the grace time of the transmission block 2 is shorter, the transmission block 2 is scheduled to be transmitted prior to the transmission block 1.
On the other hand, although the request issuing time of the transmission block 2 and that of the transmission block 3 directed to the user C are different, their grace times are the same, and thus they are equally scheduled.
As discussed above, since the present embodiment sets the priority according to the “grace time” which is a difference between the transmission completion time limit and the current time and scheduling is carried out, it can be avoided that unnecessary radio resource is assigned to the transmission block of which the “grace time” is still long enough. And thus an unassigned part of radio resource generated by this avoidance can be assigned preferentially to the transmission block of which the “grace time” is short.
This enables to treat equally stream-type data which is sensitive to delay.
In the present embodiment, the arrival time of each transmission block at this apparatus is referred to as the “request issuing time,” however; when a packet is separated into transmission blocks in an apparatus which is located in the upstream of the dataflow, the “request issuing time” of each transmission block can be a time when the packet arrives at the apparatus located in the upstream.
In addition, the flowchart for explaining the operation of the scheduling unit merely explains the simplest example of operation, and another implementing unit enables the operation with a higher speed. For instance, it is considered to have a means that aligns previously all of the transmission blocks sequentially according to an order of the transmission completion time limit within the transmission block storing unit.
In
The other elements are the same as those shown in
In the following, the operation of the sequence number assigning unit 403, the transmission block storing unit 405, and the retransmission controlling unit 408 will be explained.
The sequence number assigning unit 403 assigns a sequence number to each of the transmission blocks.
When retransmission request information including the sequence number is received, the retransmission controlling unit 408 instructs the transmission block storing unit which has stored the transmission block of the retransmission object to generate a retransmission block (retransmission requested data) of the corresponding transmission block.
When the above instruction is received, the transmission block storing unit 405 generates the retransmission block.
The other operations are the same as those of the first embodiment.
This transmission completion time limit storing table can be administrated by the scheduling unit 106, or can be administrated by some means other than the scheduling unit 106. Here, the means to administrate this transmission completion time limit storing table corresponds to a transmission completion time storing unit.
Next, the operation of the scheduling unit of the present embodiment will be explained by referring to the flowchart of
For each of the transmission block storing units, it is checked if the retransmission block exists or not (S502).
When there is no retransmission block, then it is checked if a new transmission block exists or not (S503).
When the new transmission block neither exists, such transmission block storing unit is skipped.
When the new transmission blocks exist, the oldest transmission block is selected from the new transmission blocks to which the radio resource has not been assigned, and its request issuing time is obtained from the information attached to the oldest transmission block (S504).
The authorized delay time is added to the request issuing time, the transmission completion time limit is obtained, and it is memorized with the sequence number (S505). This transmission completion time limit shows a targeted time limit when the transmission block finishes the transmission. The memorizing is conducted at the transmission completion time limit storing table shown in
On the other hand, when the retransmission block exists, the oldest retransmission block is selected from the transmission blocks to which the radio resource has not been assigned yet (S507).
From the sequence number of the selected retransmission block, the transmission completion time limit stored in the transmission completion time limit storing table is obtained, which is set as the transmission completion time limit of the retransmission block (S508).
The operations thereafter are the same as those of the first embodiment.
The error occurs in a transmission trial (the first time), and a retransmission request is received from the reception apparatus. The transmission apparatus generates a corresponding retransmission block; it is assumed that the transmission completion time limit of the retransmission block is the same as the transmission completion time limit stored in the transmission completion time limit storing table. A difference between the current time and the transmission completion time limit is set as the “grace time,” and the radio resource is assigned preferentially to the transmission block of which the grace time is short.
As has been explained, even when the embodiment is combined with the retransmission controlling unit, the scheduling is carried out by setting a priority based on the “grace time” which is the difference between the transmission completion time limit and the current time. Accordingly, it can be avoided that unnecessary radio resource is assigned to the transmission block of which the “grace time” is still long enough. And thus the unassigned part of radio resource generated by this avoidance can be assigned preferentially to the transmission block of which the “grace time” is short.
This enables to treat equally stream-type data which is sensitive to delay.
A configuration of a transmission apparatus according to the present embodiment is the same as that of
In the following, the operation will be explained.
In
When the retransmission block does not exist, next it is checked if a new transmission block exists or not (S803).
When the new transmission block neither exists, such transmission block storing unit is skipped.
When the new transmission blocks exist, the oldest transmission block is selected from the new transmission blocks to which the radio resource has not been assigned, and its request issuing time is obtained from the information attached to that transmission block (S804).
The authorized delay time is added to the request issuing time, and a final transmission completion time limit is obtained and stored with the sequence number (S805). This final transmission completion time limit shows a targeted deadline until which the transmission of the transmission block is finished. Here, this final transmission completion time limit corresponds to a first transmission completion time. The memorizing is done at the transmission completion time limit storing table shown in
A product of multiplication of the authorized delay time with a coefficient K (0<K<1) is added to the request issuing time, and the total value is set as the transmission completion time limit (S806). Here, this transmission completion time limit corresponds to a second transmission completion time.
On the other hand, when the retransmission block exists, the oldest retransmission block is selected from the transmission blocks to which the radio resource has not been assigned yet (S807).
From the sequence number of the selected retransmission block, the final transmission completion time limit stored in the transmission completion time limit storing table is obtained. A product of multiplication of a difference between the request issuing time (retransmission request arrival time) and the obtained final transmission completion time limit with the coefficient K (0<K<1) is added to the request issuing time (retransmission request arrival time) and the total value is set as the transmission completion time limit (S808).
The operations thereafter are the same as those of the first embodiment.
A priority indicator for scheduling can be obtained as follows:
Final transmission completion time limit=Transmission block arrival time+Authorized delay time
Request issuing time=New transmission block arrival time or Retransmission request arrival time
Transmission completion time limit=(Final transmission completion time limit−Request issuing time)×Coefficient+Request issuing time
Grace time=Transmission completion time limit−Current time
Priority indicator=Grace time
In order to transmit correctly one transmission block to the receiver side, one or multiple times of trials are necessary. The number of transmission trials depends on quality of the radio line, etc.
As shown in
Since these transmission blocks have the same transmission completion time limits, they are treated equally according to the scheduling of the second embodiment. However, as the numbers of transmission trials are different, the time when the transmission finishes for the user A becomes later. If this time is later than the transmission completion time, the transmission block for the user A becomes unnecessary. In this way, even if the given conditions are the same, the result may be unequal according to different numbers of transmission trials.
Then, as shown in
The coefficient K (0<K<1) has the following features.
When the coefficient K is made small, the interval of the transmission trials becomes shorter, and thus the time until the transmission completion can be shortened. On the contrary, when the coefficient K is made large, the interval of the transmission trials becomes longer, and thus the time until the transmission completion is made delayed.
In general, if the quality of the radio line is improved, the number of retransmissions necessary to transmit one transmission block becomes smaller, and on the contrary, if the quality of the radio line is degraded, the necessary number of retransmissions becomes larger. Accordingly, if the quality of the radio line is improved, the coefficient K is increased, and on the contrary, if the quality of the radio line is degraded, the coefficient K is decreased, and thus an appropriate value of coefficient K can be obtained.
Further, in general, if the moving speed of the mobile station is slow, the radio line becomes stable, and thus the number of retransmissions necessary to transmit one transmission block becomes small. On the contrary, if the moving speed of the mobile station is fast, the radio line becomes unstable, and thus the necessary number of the retransmissions becomes large. Based on this, an appropriate value of the coefficient K can be obtained according to the moving speed of the mobile station.
Further, in general, if geographical complexity is low around the mobile station, the radio line becomes stable, and thus the number of retransmission necessary to transmit one transmission block can be small. On the contrary, if the geographical complexity is high around the mobile station, the radio line becomes unstable, and thus the number of retransmission necessary to transmit one transmission block becomes large. By using this, an appropriate value of the coefficient K can be obtained according to the geographical complexity (geographical condition) around the mobile station.
According to the present embodiment, an interval between the arrival time of the transmission block or the arrival time of the retransmission request and the final transmission completion time limit is divided by a ratio obtained by a predetermined coefficient value. The time given by the division is set as the transmission completion time limit for the request, and the coefficient value can vary for each user.
Therefore, by making the coefficient value small to be given to the user whose number of the transmission trials is large, it is possible to transmit preferentially the transmission packet of the user over the other users. To set appropriately the coefficient value makes a time necessary to complete transmission almost equal, and equality can be obtained among the users to whom the same “authorized delay times” are specified. Moreover, by obtaining the coefficient value from the quality of the radio line, the moving speed of the mobile station, or the geographical complexity around the mobile station, it is possible to maintain the equality among the users whose “authorized delay times” are the same.
Further, since the priority is set and scheduling is done based on the “grace time,” which is the difference between the transmission completion time limit and the current time, it can be avoided that unnecessary radio resource is assigned to the transmission block of which the “grace time” is still long enough. And thus the unassigned part of radio resource generated by this avoidance can be assigned preferentially to the transmission block of which the “grace time” is short.
This enables to treat equally stream-type data which is sensitive to delay.
In the following, a transmission apparatus according to the fourth embodiment will be explained.
A configuration of a transmission apparatus according to the present embodiment is the same as that of
In the following, the operation will be explained.
In
When the retransmission block does not exist, next it is checked if a new transmission block exists or not (S1303).
When the new transmission block neither exists, such transmission block is skipped.
When the new transmission block exists, the oldest transmission block is selected from the new transmission blocks to which the radio resource has not been assigned, and its request issuing time is obtained from the information attached to the oldest transmission block (S1304).
The authorized delay time is added to the request issuing time, a final transmission completion time limit is obtained (S1305). This final transmission completion time limit shows a targeted deadline until which the transmission of the transmission block is finished.
Further, the transmission completion time limit for each transmission trial is determined within the time before the final transmission completion time limit beforehand and is memorized (S1306). The memorizing is done at the transmission completion time limit storing table shown in
On the other hand, when the retransmission block exists, the oldest retransmission block is selected from the transmission blocks to which the radio resource has not been assigned yet (S1307).
A sequence number of the selected retransmission block is obtained, and the number of a next transmission trials conducted of the retransmission block is obtained. From the sequence number and the number of next transmission trials conducted, the corresponding transmission completion time limit is obtained out of the transmission completion time limits stored in the transmission completion time limit storing table, and it is set as the transmission completion time limit of the retransmission block (S1308).
The operations thereafter are the same as those of the third embodiment.
Namely, for the new transmission block, a difference between the first transmission completion time limit out of the transmission completion time limits for each of the transmission trials and the current time is obtained. For the retransmission block, a difference between the transmission completion time limit obtained from the transmission completion time limit storing table and the current time is obtained. The transmission block which has the smallest difference with the current time is specified as the transmission object.
Here, the “expected number of the transmission trials” can be the maximum number of the retransmissions defined by the retransmission controlling unit, or it can be obtained by probability based on the quality of the radio line.
According to the present embodiment, the “transmission completion time limit” is determined beforehand for each of the transmission trials when the new transmission block arrives.
Therefore, it is unnecessary to calculate the transmission completion time limit for each generation of the retransmission block.
Further, since the priority is set and scheduling is done based on the “grace time,” which is the difference between the transmission completion time limit and the current time, it can be avoided that unnecessary radio resource is assigned to the transmission block of which the “grace time” is still long enough. And thus the unassigned part of radio resource generated by this avoidance can be assigned preferentially to the transmission block of which the “grace time” is short.
By doing so, it becomes possible to treat equally stream-type data which is sensitive to delay.
In the following, a transmission apparatus according to the fifth embodiment will be explained.
A configuration of the transmission apparatus in relation to this embodiment is the same as that of
Next, the operation will be explained.
In
When the retransmission block does not exist, next, it is checked if a new transmission block exists or not (S1703).
When the new transmission block neither exists, such transmission block storing unit is skipped.
When the new transmission blocks exist, the oldest transmission block is selected out of the new transmission blocks to which the radio resource has not been assigned, and its request issuing time is obtained from the information attached to the corresponding transmission block (S1704).
From the arrival time of the transmission block and the authorized delay time, the transmission completion time limit is obtained by using a formula (S1705).
On the other hand, when the retransmission block exists, the oldest retransmission block is selected from the transmission blocks to which the radio resource has not been assigned yet (S1707).
From the arrival time of the transmission block, the authorized delay time, and the number of transmission trials conducted, the transmission completion time limit is obtained by using the formula (S1708).
The operations thereafter are the same as those of the fourth embodiment.
As the formula, for instance, the following is used:
y=(−ax+1)×Tau+Tarrival
where
a: coefficient (0<a<1)
Tarrival: arrival time of transmission block
Tau: authorized delay time
x: number of transmission trials conducted
y: transmission completion time limit
By using the above formula, as a result, as shown in
According to the present embodiment, every time when the new transmission block arrives or when the retransmission block is generated, the transmission completion time limit of the transmission block is obtained by using the formula.
Therefore, it is unnecessary to memorize the transmission completion time limit for each transmission trial.
Further, since the priority is set and scheduling is done based on the “grace time,” which is the difference between the transmission completion time limit and the current time, it can be avoided that unnecessary radio resource is assigned to the transmission block of which the “grace time” is still long enough. And thus the unassigned part of radio resource generated by this avoidance can be assigned preferentially to the transmission block of which the “grace time” is short.
By doing so, it becomes possible to treat equally stream-type data which is sensitive to delay.
Hereinafter, a transmission apparatus according to the sixth embodiment will be explained.
In
The other parts are the same as those of
Next, the operation of the radio line quality receiving unit 2201 will be explained.
The radio line quality receiving unit 2201 receives the radio line quality information collected/sent by each of the mobile stations (mobile communication apparatus), computes and stores “instant line quality” and “average line quality” of each mobile station, and supplies such information to the scheduling unit 106 when needed. Here, the line quality means the line quality of the radio line between each mobile station and the transmission apparatus, and shows that the better the line quality is, the better the status of receiving data at the mobile station becomes.
Here, the radio line quality receiving unit 2201 corresponds to an example of a data receipt status information receiving unit.
In
After selecting the transmission block having the smallest difference between the transmission completion time limit and the current time at step S510, the scheduling unit 106 compares the “difference” between the transmission completion time limit and the current time and a predetermined “threshold value” (S2301), and if the “threshold value” is larger, the operation proceeds to the process of assigning the radio resource to the corresponding transmission block (S511).
If the “difference” is larger at step S2301, the operation proceeds to the flowchart shown in
In
The radio resource is assigned to the transmission block of the corresponding transmission block storing unit (S2402).
It is checked if the radio resource remains or not (S2403).
If there remains, the process is repeated for the transmission block storing unit belonging to the mobile station having the second largest “ratio” (S2404).
If no radio resource remains, the transmission block multiplexing unit is notified of the assignment result (S2405).
In this way, according to the present embodiment, the scheduling unit 106 analyzes the data receiving status for each mobile station and assigns the radio resource preferentially to the transmission block stored in the transmission block storing unit corresponding to the mobile station of which the data receiving status is good.
A case is shown in which the “transmission blocks 1 through 4” to be scheduled exist at the “current time.” It is assumed that the transmission blocks 1 through 4 are stored in different transmission block storing units, respectively.
By adding the authorized delay time to each request issuing time, the “transmission completion time limit” is obtained, and a difference between the “current time” and the “transmission completion time limit” corresponds to the “grace time.”
For the “transmission block” of which the “transmission completion time limit” is marked before the “current time+threshold value” (Yes at step S2301 in
On the other hand, for the “transmission block” of which the “transmission completion time limit” is marked after the “current time+threshold value” (No at step S2301 in
For instance, the scheduling is carried out using “normalized line quality,” which is obtained from the “instant line quality” notified by each user (each mobile station) by normalizing with the “average line quality” of each user (each mobile station), as a priority indicator
In
Here, the scheduling algorithm using the “normalized line quality” is only one of examples, and scheduling can be carried out according to another algorithm.
As discussed above, according to the present embodiment, for the user of which the “grace time” which is the difference between the completion time limit and the current time is smaller than the “threshold value,” the scheduling is done by a priority of the “grace time.” Accordingly, unnecessary assignment of the radio resource to the transmission block having an enough large “grace time” can be avoided. In addition, unassigned radio resource generated by this avoidance can be assigned preferentially to the transmission block having a small “grace time.”
Further, for the user of which the “grace time” is larger than the “threshold value,” the scheduling is done, for example, based on the “normalized line quality,” while the radio resource can be assigned preferentially to the user whose line quality status is good, and thus the throughput can be improved.
This enables to equally treat the streaming type data which is sensitive to delay and also to improve the throughput.
In the foregoing first through sixth embodiments, the transmission apparatus in the radio communication system has been discussed as an example; however, the contents that have been shown in the first through sixth embodiments can be applied to a transmission apparatus of a wired communication system.
Further, in the first through sixth embodiments, the transmission apparatus has been discussed as an example of the data transmission apparatus according to the present invention; however, it is also possible to implement a data transmission method according to the present invention using the operational procedure shown in the first through sixth embodiments.
Hereinafter, the features of the transmission apparatus shown in the first through sixth embodiments will be restated.
A transmission apparatus shown in the first embodiment is characterized to include:
The transmission apparatus shown in the first embodiment is characterized to include a function to obtain a transmission completion time limit for each transmission block by adding an authorized delay time to an arrival time of the transmission block.
A transmission apparatus shown in the second embodiment is characterized to include:
The transmission apparatus shown in the second embodiment is characterized to include:
A transmission apparatus shown in the third embodiment is characterized to include:
The transmission apparatus shown in the third embodiment is characterized to include a function to set different coefficients for respective users.
The transmission apparatus shown in the third embodiment is characterized to include a function to determine the coefficient according to radio line quality of each user.
The transmission apparatus shown in the third embodiment is characterized to include a function to determine the coefficient according to a moving speed of the user.
The transmission apparatus shown in the third embodiment is characterized to include a function to determine the coefficient according to location information of the user.
A transmission apparatus shown in the fourth and fifth embodiments is characterized to include a function to obtain transmission completion time limits of the first, the second and thereafter transmission trials using an arrival time and an authorized delay time of the transmission block and the number of transmission trials conducted.
A transmission apparatus shown in a sixth embodiment is characterized to include a function to assign radio resource based on another scheduling standard when an authorized delay time is larger than a predetermined “threshold value.”
According to the present invention, since a transmission object is specified out of transmission candidate data based on a grace time which is a difference between a transmission completion time limit and a current time, it is possible to send preferentially from the transmission candidate data having a small grace time. This enables to maintain equality among the transmission candidate data, and thus appropriate transmission can be data is streaming type data which is sensitive to delay.
Further, according to the present invention, when the retransmission requested data is included, the grace time which is a difference between the transmission completion time and the current time is obtained also for the retransmission requested data and the transmission object is specified based on the grace time. Therefore, even if the retransmission requested data is included, it is possible to transmit preferentially the transmission candidate data of which the grace time is small, accordingly the equality among the transmission candidate data can be established, and thus appropriate transmission can be carried out without generating delay even if the transmission candidate data is streaming type data which is sensitive to delay.
Further, according to the present invention, when the transmission candidate data is the transmission queuing data, an interval between the arrival time of the transmission candidate data and the first transmission completion time is divided, when the transmission candidate data is the retransmission requested data, an interval between the arrival time of the retransmission request and the first transmission completion time is divided, by a ratio which can be obtained by a certain coefficient value. The time obtained by the division is set as the second transmission completion time, and the transmission object is specified among the transmission candidate data based on a difference between the second transmission completion time and the current time. In addition, the coefficient value is made variable. Consequently, by setting an appropriate coefficient value for each transmission candidate data, it is possible to approximate times necessary to complete the transmission among the transmission candidate data, and thus the equality of the transmission candidate data can be established.
Further, according to the present invention, since the coefficient value is determined for each transmission candidate data based on the communication line quality, the moving speed of the mobile communication apparatus, or the geographic condition of the location of the mobile communication apparatus, the equality of the transmission candidate data can be established.
Further, according to the present invention, since the transmission completion time is specified for each transmission trial of the transmission candidate data which is the transmission queuing data and the transmission completion time is memorized for each transmission trial specified, to the retransmission requested data, it is possible to apply the transmission completion time corresponding to the number of transmission trials conducted among the transmission completion time stored. Consequently, there is no need to obtain the transmission completion time for each generation of the retransmission requested data.
Yet further, according to the present invention, for any of the transmission candidate data which is the transmission queuing data and the transmission candidate data which is the retransmission requested data, the transmission completion times are respectively obtained based on the arrival time, the authorized delay time, and the number of transmission trials conducted. Consequently, even if the retransmission requested data is included, the equality among the transmission candidate data can be established without memorizing the transmission completion time.
| Number | Date | Country | Kind |
|---|---|---|---|
| 2002-104999 | Apr 2002 | JP | national |
| Filing Document | Filing Date | Country | Kind |
|---|---|---|---|
| PCT/JP03/02117 | 2/26/2003 | WO |
