WO2003085934A1 - Data transmission apparatus and data transmission method - Google Patents
Data transmission apparatus and data transmission method Download PDFInfo
- Publication number
- WO2003085934A1 WO2003085934A1 PCT/JP2003/002117 JP0302117W WO03085934A1 WO 2003085934 A1 WO2003085934 A1 WO 2003085934A1 JP 0302117 W JP0302117 W JP 0302117W WO 03085934 A1 WO03085934 A1 WO 03085934A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- transmission
- data
- time
- completion time
- candidate data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Ceased
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/1215—Wireless traffic scheduling for collaboration of different radio technologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/28—Flow control; Congestion control in relation to timing considerations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/28—Flow control; Congestion control in relation to timing considerations
- H04L47/286—Time to live
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/54—Loss aware scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/56—Queue scheduling implementing delay-aware scheduling
- H04L47/564—Attaching a deadline to packets, e.g. earliest due date first
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
- H04W8/04—Registration at HLR or HSS [Home Subscriber Server]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/10—Flow control between communication endpoints
- H04W28/14—Flow control between communication endpoints using intermediate storage
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
Definitions
- the present invention relates to scheduling at the time of data transmission, for example, to scheduling at the time of transmitting stream-type data that is sensitive to delay.
- radio resources frequency, time or spreading code
- scheduling is performed to dynamically allocate radio resources to users who need them in order to use radio resources efficiently.
- the scheduling process is performed in a radio frame cycle. Two typical scheduling algorithms are described.
- FIG. 20 is a configuration diagram illustrating a configuration of a transmission device according to a first related art (Japanese Patent Laid-Open No. 8-288952).
- reference numeral 204 denotes a packet separation unit
- reference numeral 205 denotes a packet storage unit
- reference numeral 2000 denotes a schedule unit
- reference numeral 2000 denotes a packet multiplexing unit.
- the bucket separation unit 204 determines the quality class of the input packet and separates the packet into the packet storage unit corresponding to the quality class.As the quality class, the allowable delay time is mainly assumed. .
- the bucket accumulation unit 2000 accumulates buckets for each quality class.
- the schedule unit 206 performs scheduling so as to preferentially take out a bucket from the packet storage unit of the quality class having a short allowable delay time.
- the packet multiplexing section 2000 picks up and multiplexes the packet from the packet storage section 205 in accordance with the instruction from the schedule section 2000, and outputs a bucket.
- Japanese Patent Application Laid-Open No. H10-56480 proposes to stop retransmission of a packet that exceeds the allowable delay time.
- FIG. 21 is a configuration diagram illustrating a configuration of a transmission device according to a second conventional technique (Japanese Patent Laid-Open No. 10-56480).
- 210 is a retransmission control unit, and 210 is an allowable delay time excess monitoring unit. Note that 210 4 to 210 7 are the same as those shown in FIG.
- retransmission control section 210 Upon receiving the retransmission request from the receiving device, retransmission control section 210 generates a corresponding retransmission bucket and transfers it to the bucket storage section.
- the permissible delay time excess monitoring unit 2110 monitors each packet in the bucket storage unit, searches for a packet stored exceeding the permissible delay time, and if present, discards the bucket to the packet storage unit. To instruct.
- the first problem is that there is no fairness in discarding packets.
- the class having a short “allowable delay time” Since packets are always given priority over classes with long “intervals”, when congestion occurs, packets are discarded from classes with long “tolerable delay times”.
- the method described in the first prior art lacks fairness, because an application having a long “allowable delay time” does not mean that the resistance to packet discard is high.
- Classes with different "tolerable delay times" requirements should be fair except for the "tolerable delay times", and thus the packet drop probability should be equal.
- the probability of packet discard should be specified by another priority.
- the second problem is that transmission within the allowable delay time is not likely to be completed due to retransmission.
- an object of the present invention is to solve the above-mentioned problems of the prior art. Disclosure of the invention
- a data transmission device that performs data transmission
- a plurality of data storage units each capable of storing one or more transmission waiting data in a transmission waiting state; For each data storage unit, a specific transmission waiting data is selected as transmission candidate data from the stored transmission waiting data, and a transmission completion time is designated for each transmission candidate data.
- a data specification unit for determining a difference, and specifying a specific transmission candidate data as a transmission target based on a difference between a transmission completion time and a current time for each transmission candidate data;
- the data specifying unit includes:
- transmission observation data having the smallest difference between the transmission completion time and the current time is designated as a transmission target.
- the data transmission device transmits data to data received from another device,
- the data specifying unit includes:
- the reception time and the permissible delay time are obtained for each transmission candidate data, the obtained reception time and the permissible delay time are added, and the value obtained by the addition is set as the transmission completion time of each transmission candidate data.
- the data transmission device further comprises:
- a retransmission control unit that receives a retransmission request for the data transmitted from the data transmission unit, and instructs a data storage unit that has stored the retransmission request data for which the retransmission request has been stored, to generate retransmission request data;
- the data specifying unit includes:
- the data transmission device further comprises:
- a transmission completion time storage unit that stores the specified transmission completion time in association with the target transmission candidate data.
- the data designating section comprises:
- a transmission completion time associated with the selected transmission capture data is obtained from the transmission completion time storage unit, and the obtained transmission completion time is selected by the selected transmission.
- Candidate is a transmission completion time of one night.
- the data transmission device transmits data to data received from another device,
- the data specifying unit includes:
- the reception time and the permissible delay time are obtained for each transmission candidate data, the coefficient determined for each transmission candidate data is multiplied by the permissible delay time, the reception time is added to the value obtained by the multiplication, and the sum is added. Is set as the transmission completion time of each transmission candidate data.
- the data transmission device transmits data to data received from another device,
- the data transmission device further comprises:
- the data specifying unit includes:
- Judgment of the presence / absence of retransmission request data is performed for each data storage unit, and for data storage units that do not store the retransmission request data, a specific transmission waiting data is selected from the stored transmission waiting data as a transmission candidate.
- specific retransmission request data is selected as transmission candidate data from the stored retransmission request data,
- the reception time and the permissible delay time are obtained for each transmission candidate data, and the obtained reception time and permissible delay time are added.
- the value is set as the first transmission completion time of each transmission candidate data, the coefficient determined for each transmission candidate data is multiplied by the allowable delay time, the reception time is added to the value obtained by the multiplication, and the addition is performed.
- the obtained value is the second transmission completion time of each transmission candidate data,
- the reception time of each retransmission request is obtained for each transmission candidate data, and the first transmission completion time associated with each transmission candidate data is stored in the transmission completion time storage unit.
- the reception time of the retransmission request is subtracted from the obtained first transmission completion time, and a coefficient determined for each transmission candidate data is multiplied by a value obtained by the subtraction. Add the retransmission request reception time to the value obtained by the multiplication, and designate the value obtained by the addition as the second transmission completion time;
- the difference between the second transmission completion time and the current time is determined for each transmission candidate data, and the specific transmission candidate data is set as a transmission target based on the difference between the second transmission completion time and the current time for each transmission candidate data. It is characterized by specifying.
- the data transmission device further comprises:
- the data transmission device further comprises:
- a coefficient value determination unit that determines the value of the coefficient according to the moving speed of the mobile communication device that is the destination of the transmission candidate data.
- the data transmission device further comprises:
- the data transmission device transmits data to data received from another device,
- the data transmission device further comprises:
- the specified transmission attempt A transmission completion time storage unit for storing the transmission completion time for each of the transmission candidate times in association with the target transmission candidate data
- the data specifying unit includes:
- Judgment of the presence / absence of retransmission request data is performed for each data storage unit, and for data storage units that do not store the retransmission request data, a specific transmission waiting data is selected from the stored transmission waiting data as a transmission candidate.
- specific retransmission request data is selected as transmission candidate data from the stored retransmission request data,
- the transmission completion time for each transmission attempt is specified based on the number of transmission attempts determined for each transmission candidate data, and The difference between the transmission completion time for the first transmission attempt and the current time is calculated,
- the transmission candidate data which is the retransmission request data
- the next number of transmission trial executions is determined, and the transmission completion time corresponding to the next transmission trial execution number is set to the transmission completion time.
- the difference between the acquired transmission completion time and the current time is obtained from the time storage unit,
- a specific transmission candidate data is designated as a transmission target based on a difference between a transmission completion time and a current time for each transmission candidate data.
- the data specifying unit includes:
- the transmission completion time is set at equal intervals, and the transmission completion time for each transmission attempt is designated.
- the data specifying unit includes:
- Transmission is performed such that the interval between transmission completion times becomes narrower as later transmission attempts are performed. It is characterized in that a transmission completion time is specified for each trial.
- the data transmission device transmits data to data received from another device,
- the data specifying unit includes:
- the reception time and the permissible delay time are obtained for each transmission candidate data, the number of transmission trial executions is determined for each transmission candidate data, and the number of transmission candidate It is characterized by specifying the transmission completion time.
- At least two or more transmission waiting data are selected as transmission candidate data from the plurality of transmission waiting data in the transmission waiting state, a transmission completion time is designated for each transmission candidate data, and a difference between the transmission completion time and the current time is determined.
- the data designating step includes:
- the transmission candidate data having the smallest difference between the transmission completion time and the current time is designated as a transmission target.
- data transmission is performed overnight for data received from another communication method,
- the data designating step includes:
- the reception time and the permissible delay time are obtained for each transmission candidate data, the obtained reception time and the permissible delay time are added, and the value obtained by the addition is set as the transmission completion time of each transmission candidate data.
- the data specifying unit includes:
- the data transmission device transmits data to a plurality of mobile communication devices,
- the data transmission device further comprises:
- a data reception status information receiving unit configured to receive information on a data reception status in each mobile communication device from each mobile communication device;
- the data reception status of each mobile communication device is analyzed based on the information on the data reception status received from each mobile communication device, and based on the analysis result, the difference between the transmission completion time and the current time is greater than a predetermined threshold. It is characterized in that it is determined whether or not large transmission candidate data is to be transmitted.
- the plurality of data storage units each include:
- the data specifying unit is associated with any one of the plurality of mobile communication devices,
- each data storage unit For each data storage unit, analyze the data reception status in the mobile communication device corresponding to each data storage unit, and wait for the transmission to be performed in the data storage unit where the data reception status in the corresponding mobile communication device is good. It is characterized in that data is specified with priority given to transmission.
- FIG. 1 is a configuration diagram of a transmission device of a wireless communication system according to a first embodiment.
- FIG. 2 is a flowchart showing the operation of the schedule unit according to the first embodiment.
- FIG. 3 is an explanatory diagram showing an outline of the operation of the first embodiment.
- FIG. 4 is a configuration diagram of a transmission device of the wireless communication system according to the second embodiment.
- FIG. 5 is a flowchart showing the operation of the schedule unit according to the second embodiment.
- FIG c 7 illustrating the transmission completion time limit storing table used in Embodiment 2 is an explanatory diagram showing an outline of an operation of the second embodiment.
- FIG. 8 is a flowchart showing the operation of the schedule unit according to the third embodiment.
- FIG. 9 is a first explanatory diagram showing an outline of the operation of the third embodiment.
- FIG. 10 is a second explanatory diagram showing an outline of the operation of the third embodiment.
- FIG. 11 is a third explanatory diagram showing an outline of the operation of the third embodiment.
- FIG. 12 is a flowchart for determining a coefficient K according to the third embodiment.
- FIG. 13 is a flowchart showing the operation of the schedule unit according to the fourth embodiment.
- FIG. 14 is a diagram showing a transmission completion time limit storage table used in the fourth embodiment.
- FIG. 15 is a first explanatory diagram showing an outline of the operation of the fourth embodiment.
- FIG. 16 is a second explanatory diagram showing an outline of the operation of the fourth embodiment.
- FIG. 17 is a flowchart showing the operation of the schedule unit according to the fifth embodiment.
- FIG. 18 is a graph showing a formula used in the fifth embodiment.
- FIG. 19 is an explanatory diagram showing an outline of the operation of the fifth embodiment.
- FIG. 2 0 shows the configuration of a transmission device of a wireless communication system according to a first conventional example
- ⁇ 2 1 is a block diagram of a transmitting device of a wireless communication system according to the second conventional example (Fig. 2 2, Embodiment
- FIG. 23 is a flowchart showing the operation of the schedule unit according to the sixth embodiment.
- FIG. 24 is a flowchart showing the operation of the schedule unit according to the sixth embodiment.
- FIG. 25 is an explanatory diagram showing an outline of the operation of the sixth embodiment. BEST MODE FOR CARRYING OUT THE INVENTION
- FIG. 1 is a configuration diagram of a transmission device configuring a wireless communication system according to Embodiment 1 of the present invention.
- 101 is a transmission block receiving unit
- 102 is a request generation time giving unit
- 104 is a transmission block separation unit
- 105 is a transmission block storage unit.
- 106 is a schedule unit
- 107 is a transmission block multiplexing unit
- 109 is a wireless transmission unit.
- the transmission block receiving unit 101 receives (receives) a transmission block from the outside (another device).
- the request occurrence time assignment unit 102 assigns an arrival time (reception time) to the transmission device as a request occurrence time to each of the received transmission blocks.
- the transmission block separating unit 104 separates the transmission block into each receiving device or each connection.
- the transmission block storage unit 105 stores transmission blocks. In each transmission block storage unit, transmission blocks are stored in the order of arrival for each receiving device or connection. Note that the transmission block storage unit 105 is an example of a data storage unit. The transmission blocks stored in the transmission block storage unit 105 correspond to data waiting for transmission.
- the schedule unit 106 uses the information from the transmission block storage unit 105, the permissible delay time information given to each user, and the current time information to determine the transmission block to be transmitted and the radio resources (frequency , Time, spread code, etc.).
- the schedule section 106 is an example of a data specification section.
- the transmission block multiplexing unit 107 takes out the transmission block designated as the transmission target by the schedule unit 106 from the transmission block storage unit 105 and multiplexes it.
- the wireless transmission unit 109 After performing processes such as modulation and amplification, the wireless transmission unit 109 outputs a transmission block from the antenna.
- the transmission block multiplexing unit 107 and wireless transmission The combination of the section 109 and the section 109 corresponds to an example of the data transmission section.
- FIG. 2 is a flowchart illustrating an operation of the schedule unit according to the first embodiment of the present invention. This flowchart assumes that it is started in a cycle such as a radio frame cycle.
- the oldest transmission block request generation time among the transmission waiting transmission blocks to which the radio resources have not been allocated yet is obtained from the information added to the transmission block (S204).
- the oldest transmission block in each transmission block storage unit corresponds to transmission candidate data.
- the scheduler adds the permissible delay time to the request generation time for each of the oldest transmission blocks in each transmission block storage, and obtains the transmission completion time limit (transmission completion time) (S205).
- the transmission completion time limit indicates a target time limit for completing the transmission of the transmission block.
- the transmission block having the transmission completion time limit with the smallest difference from the current time is designated as the transmission target (S210).
- the small difference means that the transmission completion deadline is imminent, and transmission must be given priority.
- Radio resources are allocated to the selected transmission block (S211). It is determined whether or not radio resources remain (S212).
- the allocation result is notified to the transmission block multiplexing unit (S213), and the scheduling process ends. If the radio resources remain, the scheduling process is repeated again.
- FIG. 3 illustrates an outline of the operation of the schedule unit according to the first embodiment.
- transmission blocks arrive at user A, user B, and user C, respectively, and they are scheduled.
- the "allowable delay time (user A)" of user A is as follows. It is assumed to be larger than “allowable delay time (user B)” of user B.
- transmission block 1 and transmission block 2 arrive for users A and B, respectively.
- the "request occurrence time (transmission block 1)" of the transmission block 1 is earlier than the “request occurrence time (transmission block 2)" of the transmission block 2.
- the allowable delay time (user A) is added to the request occurrence time (transmission block 1), and for transmission block 2, the allowable delay time (transmission block 2) is added.
- the delay time (user B) is added, and the transmission completion time limit of each transmission block is obtained as shown in Fig. 3.
- the difference between each transmission completion time limit from the current time is the grace time until the transmission completion time limit, and the wireless resources are preferentially allocated to smaller transmission blocks.
- the scheduling is performed so that the transmission block 2 is transmitted prior to the transmission block 1.
- the transmission block 2 and user C transmission block 3 for, for requesting onset raw time is different delay time is the same, as described fairly Sukeji user rings are the c or more, complete transmission in this embodiment
- Prioritization and scheduling are performed based on the “grace time”, which is the difference between the deadline and the current time. Without allocating a source, it is possible to prioritize the wireless resource margin created by it for transmission blocks with a small “grace time”.
- the arrival time of each transmission block at the device is referred to as the ⁇ request occurrence time ''.
- the time at which the bucket arrives at the device located upstream may be used as the "request generation time" of each transmission block.
- the flowchart describing the operation of the schedule unit describes the simplest operation example, and by using another realization unit, a higher-speed operation is possible.
- the transmission blocks in all the transmission block storage units may be arranged in advance in the order of the transmission completion time limit. 'Embodiment 2.
- FIG. 4 is a configuration diagram of a transmission device configuring a wireless communication system according to Embodiment 2 of the present invention.
- reference numeral 403 denotes a sequence number assigning unit.
- 405 is a transmission block storage unit.
- 408 is a retransmission control unit.
- the sequence number assigning section 403 assigns a sequence number to each transmission block.
- the retransmission control unit 408 Upon receiving the retransmission request information including the sequence number, the retransmission control unit 408 stores the retransmission request information in the transmission block storage unit that has stored the transmission block to be retransmitted. It instructs to generate a retransmission transmission block (retransmission request data) of the corresponding transmission block.
- the transmission block storage unit 405 Upon receiving the instruction, the transmission block storage unit 405 generates a retransmission transmission block.
- FIG. 5 is a flowchart for explaining the operation of the schedule unit according to the second embodiment of the present invention.
- FIG. 6 is a diagram showing a transmission completion time limit storage table used in the schedule unit according to the second embodiment of the present invention.
- This transmission completion time limit storage table may be managed by the schedule unit 106 or may be managed by means other than the schedule unit 106.
- the means for managing the transmission completion time limit storage table corresponds to a transmission completion time storage unit.
- the transmission block storage unit is skipped.
- the transmission block that has not been allocated radio resources is selected, and the request generation time is obtained from the information added to the transmission block. (S504).
- the transmission completion time limit indicates a target time limit for completing the transmission of the transmission block. The storage is performed using the transmission completion time limit storage table shown in FIG.
- the oldest retransmission transmission block is selected from among the transmission blocks to which radio resources have not been allocated yet (S507).
- the transmission completion period stored in the transmission completion period storage table is obtained, and is set as the transmission completion period of the transmission block for retransmission (S508).
- FIG. 7 is an explanatory diagram illustrating the operation of the schedule unit according to the second embodiment.
- Fig. 7 shows a case where a transmission block arrives for one user and is scheduled and transmitted, but is retransmitted due to an error.
- An error occurs during the first transmission attempt, and a retransmission request is received from the receiving device.
- the transmitting device generates the corresponding retransmission transmission block, and the transmission completion period of the retransmission transmission block is the same as the transmission completion period stored in the transmission completion period storage table.
- the difference between the current time and the transmission completion deadline is used as the grace time, and radio resources are allocated with priority to transmission blocks with smaller grace time.
- priority is assigned based on the “grace time” that is the difference between the transmission completion deadline and the current time, and scheduling is performed.
- Wireless resources are not unnecessarily allocated to transmission blocks whose grace time is still large enough. It can be preferentially assigned to small transmission blocks.
- the configuration of the transmitting apparatus according to the present embodiment is the same as FIG. 4 in Embodiment 2.
- FIG. 8 is a flowchart illustrating the operation of the schedule unit according to the third embodiment of the present invention.
- the transmission block storage unit is skipped.
- the permissible delay time is added to the request generation time to obtain the final transmission completion deadline, which is stored together with the sequence number (S805).
- the final transmission completion deadline indicates a target deadline for the transmission block to complete transmission.
- the final transmission completion deadline corresponds to the first transmission completion time.
- the storage is performed using the transmission completion time limit storage table shown in FIG.
- a value obtained by adding a value obtained by multiplying the allowable delay time by a coefficient K (0 ⁇ K ⁇ 1) to the request generation time is set as a transmission completion time limit (S806). Note that this transmission The expiration date corresponds to the second transmission completion time.
- the oldest retransmission transmission block is selected from among the transmission blocks to which radio resources have not been allocated yet (S807).
- the value obtained by adding 1) to the request occurrence time (retransmission request arrival time) is set as the transmission completion time limit (S808).
- Figure 9 shows the relationship between each time and time.
- the priority index for scheduling can be obtained as follows.
- Request generation time New transmission block arrival time or retransmission request arrival time
- Transmission completion time (final transmission completion time minus request generation time) X coefficient + request generation time
- One or more transmission attempts are required to correctly transmit one transmission block to the receiving side.
- the number of transmission attempts depends on the quality of the wireless link.
- the coefficient (0 ⁇ K ⁇ 1) has the following characteristics.
- the coefficient ⁇ ⁇ ⁇ is reduced, the interval between transmission attempts becomes shorter, and the time until transmission is completed can be shortened. Conversely, if the coefficient ⁇ ⁇ ⁇ is increased, the interval between transmission attempts becomes longer, and the time until transmission is completed is delayed.
- FIG. 12 shows a flowchart of the operation for determining the coefficient value ⁇ .
- the wireless link becomes stable, and the number of retransmissions required to transmit one transmission block is reduced. Conversely, if the moving speed of the mobile station is fast, the wireless link becomes unstable. And the number of required retransmissions increases. From this, an appropriate coefficient value ⁇ ⁇ can be obtained according to the moving speed of the mobile station.
- the wireless link is stable, the number of retransmissions required to transmit one transmission block is small, and conversely, the geographical complexity around the mobile station is small. If the number is too large, the wireless line becomes unstable and the number of required retransmissions increases.
- an appropriate coefficient value K can be obtained according to the geographical complexity (geographical conditions) around the mobile station.
- the period from the arrival time of a transmission block or the arrival time of a retransmission request to the final transmission completion deadline is divided by a ratio determined from a predetermined coefficient value, and the time obtained by the division is determined by the request.
- the coefficient value is variable for each user. Therefore, by reducing the coefficient value given to a user who has a large number of transmission attempts, a transmission bucket can be transmitted with priority over other users.
- the coefficient value By appropriately setting the coefficient value, the time required until transmission is completed can be made close to the same, and equality between users with the same “allowable delay time” can be obtained.
- fairness can be maintained for users with the same “tolerable delay time” by obtaining coefficient values from the quality of the wireless link, the moving speed of the mobile station, or the geographical complexity around the mobile station.
- ⁇ grace time '' which is the difference between the transmission completion deadline and the current time, unnecessary allocation of wireless resources to transmission blocks whose ⁇ grace time '' is still large enough
- the configuration of the transmitting apparatus according to the present embodiment is the same as that of FIG. One.
- FIG. 13 is a flowchart illustrating the operation of the scheduler according to the fourth embodiment of the present invention.
- FIG. 14 shows a transmission completion time limit storage table used in the schedule unit according to the fourth embodiment of the present invention.
- the transmission block storage unit is skipped.
- the permissible delay time is added to the request generation time, and the final transmission completion time limit is obtained (S135).
- the final transmission completion deadline indicates a target deadline for the transmission block to complete transmission.
- the transmission completion period of each transmission trial is determined in advance and stored in the time until the final transmission completion period (S1306).
- the data is stored in the transmission completion time limit storage table shown in Fig. 14.
- the oldest retransmission transmission block is selected from among the transmission blocks to which the radio resources have not been allocated yet (S1307).
- the sequence number of the selected retransmission transmission block is determined, and The number of times the next transmission attempt of the transmission block for retransmission is performed is obtained, and from the sequence number and the number of times the next transmission attempt is performed, the corresponding transmission completion time stored in the transmission completion time limit table is obtained, and the retransmission is performed.
- the transmission completion deadline of the transmission protocol is used (S1308).
- the difference between the first transmission completion period and the current time among the transmission completion periods for each transmission attempt was obtained, and for the retransmission transmission block, the difference was obtained from the transmission completion period storage table. Find the difference between the transmission completion deadline and the current time, and specify the transmission protocol with the smallest difference from the current time as the transmission target.
- FIG. 15 is an explanatory diagram illustrating the operation of the schedule unit according to the fourth embodiment.
- the timing obtained by equally dividing the time until the final transmission completion time obtained when the transmission block arrives by the expected number of transmission attempts is set as the transmission completion time in each transmission attempt.
- FIG. 16 is an explanatory diagram illustrating another operation of the schedule unit according to the fourth embodiment.
- the time until the final transmission completion period obtained when the transmission block arrives is divided by the expected number of transmission attempts so that the interval gradually narrows, and the transmission completion time in each transmission attempt is defined as the transmission completion time limit.
- the probability that the transmission of the transmission block is completed in the first transmission attempt is the highest, and decreases as the number of transmission attempts increases. Therefore, by setting the distribution as shown here, the possibility that transmission of transmission blocks of other users will be suppressed is reduced.
- the “expected number of transmission attempts” may be the maximum number of retransmissions specified by the retransmission control unit, or may be stochastically determined from the quality of the wireless channel.
- each transmission is performed when a new transmission block arrives.
- the “transmission completion time limit” of the trial is determined in advance.
- the configuration of the transmitting apparatus according to the present embodiment is the same as FIG. 4 in Embodiment 2.
- FIG. 17 is a flowchart illustrating an operation of the schedule unit according to the fifth embodiment of the present invention.
- the transmission block storage unit is skipped.
- the transmission completion time limit is calculated using an equation (S1705).
- the oldest retransmission transmission block is selected from among the transmission blocks to which radio resources have not been allocated yet (S1707).
- the transmission completion time limit is calculated using an equation (S1708).
- Transmission completion deadline Figure 18 shows a graph of the above formula. As shown in Fig. 18, it can be seen that as the number of transmission trials increases, T a ival ival + T au, that is, the final transmission completion deadline is approached.
- the transmission completion time limit can be sequentially calculated for each transmission attempt.
- the transmission block is I want a transmission completion deadline.
- FIG. 22 is a configuration diagram of a transmission device configuring a wireless communication system according to Embodiment 6 of the present invention.
- reference numeral 2201 denotes a wireless channel quality receiving unit.
- the radio channel quality receiving section 2221 receives radio channel quality information collected and transmitted by each mobile station (mobile communication device), and obtains “instantaneous channel quality” and “average channel quality” of each mobile station. Is calculated and stored, and the information is provided to the schedule unit 106 as necessary.
- the line quality means the line quality of the wireless line between each mobile station and the transmitting device, and the better the line quality, the better the data reception condition in the mobile station.
- the wireless channel quality receiving section 2221 corresponds to an example of a data receiving state information receiving section.
- FIGS. 23 and 24 are flowcharts illustrating the operation of the schedule unit 106 according to the sixth embodiment of the present invention.
- steps S501 to S510 are the same as those in FIG. 5, and description thereof will be omitted.
- the scheduling unit 106 determines the “difference” between the transmission completion deadline and the current time, and a predetermined “threshold”. (S2301), and if the "threshold" is larger, the process proceeds to the process of allocating radio resources to the transmission block (S511).
- step S2301 If the “difference” is larger in step S2301, the process proceeds to the flowchart shown in FIG.
- the schedule section 106 is composed of a radio channel quality reception section 2 2
- Radio resources are allocated to the transmission blocks in the transmission block storage unit (S2402).
- the transmission block multiplexing unit is notified of the allocation result (S2405).
- the schedule section 106 analyzes the data reception state for each mobile station, and stores the data in the transmission block storage section corresponding to the mobile station having a good data reception state. Radio resources are allocated with priority given to the transmission block.
- FIG. 25 is an explanatory diagram illustrating the operation of the schedule unit according to the sixth embodiment.
- Transmission blocks 1 to 4 are stored in different transmission block storage units.
- the “transmission completion period” is obtained by adding the permissible delay time to each request occurrence time, and the difference between the “current time” and the “transmission completion period” is the “grace time”.
- the “transmission completion time limit” is before “current time + threshold value” (Yes in step S2301 in FIG. 23).
- the scheduling is carried out by the method described above. In other words, transmission block 1 and transmission block 2 destined for user A and user B allocate radio resources to transmission block 1 preferentially, and then allocate radio resources to transmission block 2.
- scheduling is based on “normalized line quality”, which is obtained by normalizing “instantaneous line quality” reported by each user (each mobile station) with “average line quality” of each user (each mobile station).
- comparing the "normalized line quality" of user C and user D the "normalized line quality" of user C is higher (user C has better reception status overnight). If there is any remaining radio resource, the radio resource is preferentially allocated to transmission block 3 addressed to user C. Next, radio resources are allocated to transmission block 4 addressed to user D.
- the scheduling algorithm using “normalized channel quality” is only an example, and it is also possible to perform scheduling based on another algorithm.
- the priority is determined by the “grace time”.
- radio resources are not unnecessarily allocated to transmission blocks whose grace time is still large enough, and the resulting radio resource margin is assigned to transmission blocks with a small grace time. Priority.
- radio resources are preferentially allocated to users with good line quality at that time. And throughput can be improved.
- first to sixth embodiments have been described with reference to a transmission device in a wireless communication system as an example, the contents shown in the first to sixth embodiments can also be applied to a transmission device of a wired communication system. is there.
- Embodiments 1 to 6 described above a transmission device that is an example of a data transmission device according to the present invention has been described.
- the data transmission method according to the present invention can be implemented by the operation procedures described in Embodiments 1 to 6. Can be realized.
- the features of the transmitting apparatus shown in Embodiments 1 to 6 will be described again below.
- the transmitting apparatus described in Embodiment 1 completes transmission for each transmission block. A function to request a deadline,
- the transmitting apparatus described in the first embodiment has a function of obtaining a transmission completion time limit of each transmission block by adding an allowable delay time to an arrival time of the transmission block.
- the transmitting apparatus described in Embodiment 2 has a function of issuing a retransmission request to the transmitting side for a transmission block that has not been correctly received on the receiving side,
- It has a function to preferentially transmit from the transmission block where the difference between the transmission completion deadline and the current time is small, and '.
- the transmitting apparatus described in the second embodiment has a function of obtaining the transmission completion period of the first transmission attempt from the arrival time of the transmission block and the allowable delay time, and a transmission completion period of the second and subsequent transmission attempts. , A function to set the same as the transmission completion deadline of the first transmission attempt,
- the transmitting apparatus described in Embodiment 3 sets the final transmission completion deadline for a newly arrived transmission block to the arrival time of the transmission block and the allowable delay time. The function you want from the middle,
- the transmission completion deadline for the second and subsequent transmission attempts is added to the time when the retransmission request was received, multiplied by the same coefficient as the difference between the time at which the retransmission request was received from the receiving side and the final transmission completion deadline.
- the transmitting apparatus described in Embodiment 3 has a function of setting a different coefficient for each user
- the transmitting apparatus shown in Embodiment 3 has a function of determining a coefficient according to the radio channel quality of each user,
- the transmitting apparatus has a function of determining a coefficient according to a moving speed of a user
- the transmitting apparatus has a function of determining a coefficient according to position information of a user
- the transmitting apparatus described in Embodiments 4 and 5 has a function of obtaining the transmission completion time limit of the first and second and subsequent transmission attempts from the arrival time of the transmission block, the allowable delay time, and the number of transmission attempts.
- the transmitting apparatus described in Embodiment 6 has a function of allocating radio resources according to another scheduling criterion when the allowable delay time is larger than a predetermined “threshold”. It is characterized by having. Industrial applicability
- the transmission target is specified from among the transmission candidate data based on the grace time, which is the difference between the transmission completion time and the current time, so that the transmission candidate data with a shorter grace time is preferentially transmitted.
- the grace time which is the difference between the transmission completion time and the current time.
- a grace time that is the difference between the transmission completion time and the current time is also obtained for the retransmission request data, and the transmission target is specified based on the grace period. Therefore, even when retransmission request data is included, transmission can be performed with priority given to transmission candidate data with a shorter grace time, and thereby fairness among transmission candidate data can be achieved. Even if the data is stream-type data that is sensitive to delay, appropriate transmission can be performed without delay.
- the time between the reception time of the transmission candidate data and the first transmission completion time is set.
- the interval between the reception time of the retransmission request and the first transmission completion time is divided by a ratio determined from a certain coefficient value, and the time obtained by the division is set as the second transmission completion time, and the second transmission completion time is set.
- the transmission target is specified from the transmission candidate data based on the difference between the time and the current time.
- the coefficient value is variable for each transmission candidate data. Therefore, by appropriately setting the coefficient value for each transmission candidate data, the time required for completing transmission can be made closer to the transmission candidate data, and fairness between the transmission candidate data can be obtained.
- the coefficient value is determined for each transmission candidate data based on the communication line quality, the moving speed of the mobile communication device, or the geographical condition of the location where the mobile communication device is arranged.
- the transmission completion time for each transmission attempt is specified for the transmission candidate data that is the transmission waiting data, and the transmission completion time for each specified transmission attempt is stored.
- the transmission completion time corresponding to the number of transmission trial executions among the stored transmission completion times can be applied, and the transmission completion time needs to be obtained every time the retransmission request data is generated.
- each of the transmission candidate data that is the transmission waiting data and the transmission candidate data that is the retransmission request data is transmitted based on the reception time, the allowable delay time, and the number of transmission trials. Since the completion time is obtained, even if retransmission request data is included, fairness can be obtained for the transmission candidate data overnight without storing the transmission completion time.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Databases & Information Systems (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Communication Control (AREA)
Description
Claims
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| EP03707088A EP1482710A4 (en) | 2002-04-08 | 2003-02-26 | DATA TRANSMISSION DEVICE AND DATA TRANSMISSION METHOD |
| JP2003582994A JP3989903B2 (ja) | 2002-04-08 | 2003-02-26 | データ送信装置 |
| US10/504,080 US20050149470A1 (en) | 2002-04-08 | 2003-02-26 | Data transmission apparatus, and data transmission method |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP2002104999 | 2002-04-08 | ||
| JP2002-104999 | 2002-04-08 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2003085934A1 true WO2003085934A1 (en) | 2003-10-16 |
Family
ID=28786356
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/JP2003/002117 Ceased WO2003085934A1 (en) | 2002-04-08 | 2003-02-26 | Data transmission apparatus and data transmission method |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US20050149470A1 (ja) |
| EP (1) | EP1482710A4 (ja) |
| JP (1) | JP3989903B2 (ja) |
| CN (1) | CN1640095A (ja) |
| WO (1) | WO2003085934A1 (ja) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007028491A (ja) * | 2005-07-21 | 2007-02-01 | Noritsu Koki Co Ltd | 通信システム |
| JP2007028132A (ja) * | 2005-07-15 | 2007-02-01 | Noritsu Koki Co Ltd | 通信システム |
| JP2007158640A (ja) * | 2005-12-05 | 2007-06-21 | Nec Access Technica Ltd | 帯域制限方法および装置、それを用いたネットワーク通信機器 |
| JP2007243405A (ja) * | 2006-03-07 | 2007-09-20 | Kddi Corp | 無線バッファ装置、無線通信装置及び無線バッファ制御方法 |
| US7424305B2 (en) | 2003-05-16 | 2008-09-09 | Mitsubishi Denki Kabushiki Kaisha | Base station, mobile station, communication system, and communication method |
| JP2014131310A (ja) * | 2004-05-07 | 2014-07-10 | Interdigital Technology Corp | 拡張専用チャンネル送信に対するデータライフスパンタイマーの実装実施 |
| WO2018179067A1 (ja) * | 2017-03-27 | 2018-10-04 | 日本電気株式会社 | 通信装置、基地局、無線リソース割当方法、及びコンピュータ可読媒体 |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4547210B2 (ja) * | 2004-08-27 | 2010-09-22 | 株式会社エヌ・ティ・ティ・ドコモ | クライアント端末、サービス提供装置及びサービス発見方法 |
| GB0500588D0 (en) | 2005-01-12 | 2005-02-16 | Koninkl Philips Electronics Nv | Method of, and apparatus for, scheduling the transmission of data units in a communication system |
| US7818306B2 (en) * | 2006-03-24 | 2010-10-19 | International Business Machines Corporation | Read-copy-update (RCU) operations with reduced memory barrier usage |
| US7353346B2 (en) * | 2006-03-24 | 2008-04-01 | International Business Machines Corporation | Read-copy-update (RCU) operations with reduced memory barrier usage |
| EP2317686B1 (en) * | 2009-10-28 | 2017-08-30 | Alcatel Lucent | Method and apparatus for requesting and allocating network resource |
| WO2016109563A1 (en) | 2014-12-31 | 2016-07-07 | Wal-Mart Stores, Inc. | System and method for monitoring gas emission of perishable products |
| US10466111B2 (en) | 2016-05-05 | 2019-11-05 | Walmart Apollo, Llc | Systems and methods for monitoring temperature or movement of merchandise |
| US20180078992A1 (en) * | 2016-09-19 | 2018-03-22 | Wal-Mart Stores, Inc. | Secure Enclosure System and Associated Methods |
| CA3063105A1 (en) | 2017-05-23 | 2018-11-29 | Walmart Apollo, Llc | Automated inspection system |
| US11448632B2 (en) | 2018-03-19 | 2022-09-20 | Walmart Apollo, Llc | System and method for the determination of produce shelf life |
| US11393082B2 (en) | 2018-07-26 | 2022-07-19 | Walmart Apollo, Llc | System and method for produce detection and classification |
| US11715059B2 (en) | 2018-10-12 | 2023-08-01 | Walmart Apollo, Llc | Systems and methods for condition compliance |
| WO2020106332A1 (en) | 2018-11-20 | 2020-05-28 | Walmart Apollo, Llc | Systems and methods for assessing products |
| US12175476B2 (en) | 2022-01-31 | 2024-12-24 | Walmart Apollo, Llc | Systems and methods for assessing quality of retail products |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH09307566A (ja) * | 1996-05-17 | 1997-11-28 | Hitachi Ltd | トラフィックシェーピング装置 |
| JPH1155276A (ja) * | 1997-08-01 | 1999-02-26 | Oki Electric Ind Co Ltd | シェーピング装置 |
| JP2000332787A (ja) * | 1999-05-21 | 2000-11-30 | Hitachi Ltd | パケット中継装置及びパケット優先度設定方法 |
| JP2000349763A (ja) * | 1999-06-07 | 2000-12-15 | Hitachi Ltd | 通信装置 |
| JP2001007808A (ja) * | 1999-06-18 | 2001-01-12 | Hitachi Ltd | トラヒックシェーピング装置 |
| JP2001160831A (ja) * | 1999-10-01 | 2001-06-12 | Lucent Technol Inc | 通信ノードにおけるデータフロー制御方法及び装置 |
Family Cites Families (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4346440A (en) * | 1978-06-30 | 1982-08-24 | Motorola, Inc. | Advanced data link controller |
| JPH06309296A (ja) * | 1993-04-19 | 1994-11-04 | Fujitsu Ltd | ネットワーク解析方法 |
| US6470391B2 (en) * | 1995-09-08 | 2002-10-22 | Hitachi, Ltd. | Method for transmitting data via a network in a form of divided sub-packets |
| US5768527A (en) * | 1996-04-23 | 1998-06-16 | Motorola, Inc. | Device, system and method of real-time multimedia streaming |
| US6014694A (en) * | 1997-06-26 | 2000-01-11 | Citrix Systems, Inc. | System for adaptive video/audio transport over a network |
| US6134596A (en) * | 1997-09-18 | 2000-10-17 | Microsoft Corporation | Continuous media file server system and method for scheduling network resources to play multiple files having different data transmission rates |
| JPH1198574A (ja) * | 1997-09-24 | 1999-04-09 | Toyota Motor Corp | 移動体用無線通信システムおよびそのシステムに用いられる無線通信移動局 |
| SE512310C3 (sv) * | 1998-04-30 | 2000-03-20 | Ericsson Telefon Ab L M | Foerfarande anordning basstationssystem och radioenhet foer att behandla dataramar i ett paketdataradiosystem |
| US6081507A (en) * | 1998-11-04 | 2000-06-27 | Polytechnic University | Methods and apparatus for handling time stamp aging |
| EP1166502A1 (en) * | 1999-04-02 | 2002-01-02 | QUALCOMM Incorporated | System and method for prioritizing traffic channel messages |
| US6269080B1 (en) * | 1999-04-13 | 2001-07-31 | Glenayre Electronics, Inc. | Method of multicast file distribution and synchronization |
| US6418474B1 (en) * | 1999-04-16 | 2002-07-09 | Peerless Systems Corporation | Data transfer protocol flow controller and method |
| US6856786B2 (en) * | 2000-01-26 | 2005-02-15 | Vyyo Ltd. | Quality of service scheduling scheme for a broadband wireless access system |
| US8321542B1 (en) * | 2000-05-05 | 2012-11-27 | Ipr Licensing, Inc. | Wireless channel allocation in a base station processor |
| US7069325B1 (en) * | 2001-12-21 | 2006-06-27 | Cisco Technology, Inc. | Method and apparatus for handling requests in a network |
-
2003
- 2003-02-26 WO PCT/JP2003/002117 patent/WO2003085934A1/ja not_active Ceased
- 2003-02-26 EP EP03707088A patent/EP1482710A4/en not_active Withdrawn
- 2003-02-26 US US10/504,080 patent/US20050149470A1/en not_active Abandoned
- 2003-02-26 JP JP2003582994A patent/JP3989903B2/ja not_active Expired - Fee Related
- 2003-02-26 CN CNA038051036A patent/CN1640095A/zh active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH09307566A (ja) * | 1996-05-17 | 1997-11-28 | Hitachi Ltd | トラフィックシェーピング装置 |
| JPH1155276A (ja) * | 1997-08-01 | 1999-02-26 | Oki Electric Ind Co Ltd | シェーピング装置 |
| JP2000332787A (ja) * | 1999-05-21 | 2000-11-30 | Hitachi Ltd | パケット中継装置及びパケット優先度設定方法 |
| JP2000349763A (ja) * | 1999-06-07 | 2000-12-15 | Hitachi Ltd | 通信装置 |
| JP2001007808A (ja) * | 1999-06-18 | 2001-01-12 | Hitachi Ltd | トラヒックシェーピング装置 |
| JP2001160831A (ja) * | 1999-10-01 | 2001-06-12 | Lucent Technol Inc | 通信ノードにおけるデータフロー制御方法及び装置 |
Non-Patent Citations (1)
| Title |
|---|
| See also references of EP1482710A4 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7424305B2 (en) | 2003-05-16 | 2008-09-09 | Mitsubishi Denki Kabushiki Kaisha | Base station, mobile station, communication system, and communication method |
| JP2014131310A (ja) * | 2004-05-07 | 2014-07-10 | Interdigital Technology Corp | 拡張専用チャンネル送信に対するデータライフスパンタイマーの実装実施 |
| JP2015062308A (ja) * | 2004-05-07 | 2015-04-02 | インターデイジタル テクノロジー コーポレーション | 拡張専用チャンネル送信に対するデータライフスパンタイマーの実装 |
| JP2016167874A (ja) * | 2004-05-07 | 2016-09-15 | インターデイジタル テクノロジー コーポレーション | 拡張専用チャンネル送信に対するデータライフスパンタイマーの実装 |
| JP2007028132A (ja) * | 2005-07-15 | 2007-02-01 | Noritsu Koki Co Ltd | 通信システム |
| JP2007028491A (ja) * | 2005-07-21 | 2007-02-01 | Noritsu Koki Co Ltd | 通信システム |
| JP2007158640A (ja) * | 2005-12-05 | 2007-06-21 | Nec Access Technica Ltd | 帯域制限方法および装置、それを用いたネットワーク通信機器 |
| JP2007243405A (ja) * | 2006-03-07 | 2007-09-20 | Kddi Corp | 無線バッファ装置、無線通信装置及び無線バッファ制御方法 |
| WO2018179067A1 (ja) * | 2017-03-27 | 2018-10-04 | 日本電気株式会社 | 通信装置、基地局、無線リソース割当方法、及びコンピュータ可読媒体 |
| JPWO2018179067A1 (ja) * | 2017-03-27 | 2020-01-23 | 日本電気株式会社 | 通信装置、基地局、及び無線リソース割当方法 |
| US11368872B2 (en) | 2017-03-27 | 2022-06-21 | Nec Corporation | Communication apparatus, base station, radio resource allocation method, and computer readable medium |
Also Published As
| Publication number | Publication date |
|---|---|
| EP1482710A4 (en) | 2009-12-09 |
| EP1482710A1 (en) | 2004-12-01 |
| US20050149470A1 (en) | 2005-07-07 |
| JPWO2003085934A1 (ja) | 2005-08-18 |
| JP3989903B2 (ja) | 2007-10-10 |
| CN1640095A (zh) | 2005-07-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2003085934A1 (en) | Data transmission apparatus and data transmission method | |
| EP1432183B1 (en) | System and method for downlink packet scheduling in a mobile communication system and recording medium storing a program thereof | |
| US7283483B2 (en) | Transmitting multiple packets in a frame | |
| CN112019392A (zh) | 一种用于tsn网络的多特征流接入方法 | |
| HUP0201961A2 (en) | Scheduling and admission control of pocket data traffic | |
| US6882625B2 (en) | Method for scheduling packetized data traffic | |
| CN117378215A (zh) | 在分组交换网络中实现的用于调度以太网帧的传输的方法、计算机程序和设备 | |
| Safa et al. | New scheduling architecture for IEEE 802.16 wireless metropolitan area network | |
| KR101737516B1 (ko) | 공평한 대역 할당 기반 패킷 스케줄링 방법 및 장치 | |
| JP5576553B2 (ja) | 通信ネットワークにおいてキューを扱う方法及びシステム、並びに対応するコンピュータプログラム製品 | |
| JP3508562B2 (ja) | 通信帯域割当方法 | |
| JP3649661B2 (ja) | パケットスケジューリング方法及びパケットスケジューリング装置 | |
| JP5157995B2 (ja) | 無線基地局装置、基地局用スケジューリング設定方法、及びスケジューリング設定プログラム | |
| JP4447554B2 (ja) | 通信装置およびスケジューリング方法 | |
| KR101473559B1 (ko) | 패킷 전송 스케줄링 장치 및 방법 | |
| JP3888453B2 (ja) | ネットワークシステム | |
| KR100934990B1 (ko) | 와이브로/모바일 와이맥스 환경에서 와이브로 기지국의스케줄링에 적응적인 실시간 와이브로 단말 스케줄링 방법및 장치 | |
| JP2001186170A (ja) | パケットスケジューリング方式及び方法及びこの方法を実行するプログラムを記録した記録媒体。 | |
| CN113455046B (zh) | 用于在无线通信系统中分配资源的方法 | |
| Asvadi et al. | Age of Information in a Fully-Prioritized Network | |
| Karamat et al. | Performance optimization of multimedia services in wireless multimedia sensor networks (WMSN) at the socket level | |
| Salameh | AN EXACT ANALYTICAL MODEL FOR AN IOT NETWORK WITH MMPP ARRIVALS | |
| George et al. | Min-Max Based Dynamic Scheduling for Quality of Service in WSN | |
| Bok et al. | Improving the Distributed Fair Congestion Avoidance Protocol for Home Area Networks with Internet Access Links | |
| Kouskouli et al. | Scheduling for efficient telemedicine traffic transmission over next generation cellular networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| AK | Designated states |
Kind code of ref document: A1 Designated state(s): CN JP US |
|
| AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT SE SI SK TR |
|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
| WWE | Wipo information: entry into national phase |
Ref document number: 2003582994 Country of ref document: JP |
|
| WWE | Wipo information: entry into national phase |
Ref document number: 10504080 Country of ref document: US |
|
| WWE | Wipo information: entry into national phase |
Ref document number: 20038051036 Country of ref document: CN |
|
| WWE | Wipo information: entry into national phase |
Ref document number: 2003707088 Country of ref document: EP |
|
| WWP | Wipo information: published in national office |
Ref document number: 2003707088 Country of ref document: EP |