Source: http://www.google.com/patents/US20020021700?ie=ISO-8859-1
Timestamp: 2016-02-11 01:07:44
Document Index: 726472088

Matched Legal Cases: ['art 51', 'art 61', 'art 61', 'art 72', 'art 82', 'art 76', 'art 76', 'art 72', 'art 11', 'art 12', 'arts 13', 'art 17', 'art 21', 'art 22', 'art 11', 'art 12', 'art 13', 'arts 13', 'art 21', 'art 22', 'art 21', 'art 22', 'art 17', 'art 17', 'arts 13', 'art 12', 'art 12', 'art 12', 'arts 13', 'art 11', 'art 17', 'art 11', 'art 12', 'arts 13', 'arts 13', 'art 13', 'art 13', 'art 13', 'arts 13', 'arts 13', 'art 21', 'art 22', 'art 22', 'art 22', 'art 17', 'arts 13', 'art 17', 'art 11', 'art 12', 'art 12', 'arts 13', 'art 11', 'art 17', 'art 12', 'art 13', 'art 13', 'art 13', 'art 12', 'art 13', 'art 13', 'art 13', 'arts 13', 'arts 33']

Patent US20020021700 - Data transmission apparatus and method - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsA data transmitter 10 transmits packets each with a sequence number and a priority added. A data receiver 20 detects any packet loss by referring to the sequence numbers added to the packets, and if detecting any packet of high priority as having been lost, requests for packet retransmission. Based on...http://www.google.com/patents/US20020021700?utm_source=gb-gplus-sharePatent US20020021700 - Data transmission apparatus and methodAdvanced Patent SearchPublication numberUS20020021700 A1Publication typeApplicationApplication numberUS 09/929,487Publication dateFeb 21, 2002Filing dateAug 15, 2001Priority dateAug 17, 2000Also published asCA2355035A1, CA2355035C, CN1339878A, CN100414846C, DE60125473D1, DE60125473T2, EP1180870A2, EP1180870A3, EP1180870B1, US6987730Publication number09929487, 929487, US 2002/0021700 A1, US 2002/021700 A1, US 20020021700 A1, US 20020021700A1, US 2002021700 A1, US 2002021700A1, US-A1-20020021700, US-A1-2002021700, US2002/0021700A1, US2002/021700A1, US20020021700 A1, US20020021700A1, US2002021700 A1, US2002021700A1InventorsKoichi Hata, Akihiro Miyazaki, Koji Imura, Daiji IdoOriginal AssigneeKoichi Hata, Akihiro Miyazaki, Koji Imura, Daiji IdoExport CitationBiBTeX, EndNote, RefManPatent Citations (20), Referenced by (50), Classifications (17), Legal Events (4) External Links: USPTO, USPTO Assignment, EspacenetData transmission apparatus and method
US 20020021700 A1Abstract
A data transmitter 10 transmits packets each with a sequence number and a priority added. A data receiver 20 detects any packet loss by referring to the sequence numbers added to the packets, and if detecting any packet of high priority as having been lost, requests for packet retransmission. Based on information about thus detected packet loss, the data receiver 20 generates and transmits an RR packet 110 indicating the packet reception state. The data transmitter 10 extracts from the RR packet 110 a packet loss ratio 200, and therewith, changes manners of priority assignment. The manners are so changed that the packet of high priority is found with a lower ratio when the packet loss ratio 200 is high, and when the packet loss ratio 200 is low, found with a higher ratio. Images(10) Claims(10)
BACKGROUND OF THE INVENTION [0001] 1. Field of the Invention [0002] The present invention relates to apparatuses and methods for data transmission on a packet basis and, more specifically, to a data transmission apparatus and method wherein every packet is assigned with a priority, and only any packet high in priority is to be retransmitted. [0003] 2. Description of the Background Art [0004] Data such as video and audio is generally transmitted in real-time under a Realtime Transport Protocol (RTP). The details of the RTP are found in “RTP: A Transport Protocol for Real-Time Applications”, H. Schulzrinne, S. Casner, R. Frederik, and V. Jacobson, RFC1889, 1996. [0005] [0005]FIG. 9 is a block diagram showing the configuration of a data transmission apparatus having the RTP applied. In FIG. 9, a data transmitter 50 and a data receiver 60 work together to transmit data from a transmission-side application 1 to a reception-side application 2. Herein, the transmission-side application 1 is exemplified by a video encoder and audio encoder, while the reception-side application 2 by a corresponding video decoder and audio decoder. [0006] A header adding part 51 provides a packet outputted from the transmission-side application 1 with a header including a sequence number and a timestamp, for example. A packet transmitter 52 transmits a data packet 101 with such header added. A packet receiver 62 receives and outputs the data packet 101 to a packet output part 61, wherein the data packet is stored. The packet output part 61 outputs the stored data packet to the reception-side application 2 based on the timestamp. [0007] During data transmission over a general transmission path, packet loss is likely to occur due to transmission error and congestion. Under the RTP, the packet receiver 62 refers to the sequence numbers assigned to each of the received data packets 101 to detect if any packet loss has been occurred. How the packet receiver 62 is receiving the data packets (hereinafter, packet reception state) is informed to a reception state transmitter 63. The reception state transmitter 63 then generates a receiver report packet (RR packet) 110, indicating the largest sequence number found among those so far received, and the total number of packets lost so far. Thus generated RR packet 110 is transmitted to a reception state receiver 53, and the reception state found in the RR packet 110 is then notified to both the transmission-side application 1 and the packet transmitter 52. [0008] [0008]FIG. 10 is a sequence diagram for data transmission under the RTP. The data transmitter 50 assigns a sequence number (SN) to every packet (denoted by an arrow), and transmits the packets sequentially. The data receiver 60 informs the data transmitter 50 of the packet reception state by transmitting an RR packet with a predetermined timing. [0009] Also known is data transmission under an enhanced RTP (priority-assigned RTP) wherein every packet is assigned with a priority, and only any packet high in priority is to be retransmitted. FIG. 11 is a block diagram showing the configuration of a data transmission apparatus having such priority-assigned RTP applied. A priority assigning part 72 sequentially assigns each header-added packet with a priority of high or low, and a second sequence number. Here, the second sequence number is incremented by 1 whenever the subsequent packet is of high priority, but remains the same if the packet low in priority follows. A packet transmitter 73 transmits a data packet 100 with such priority assigned. [0010] A priority judging part 82 refers to the second sequence numbers to detect whether any packet of high priority has been lost. The detection result is informed to a transmission request transmitter 85. In response, the retransmission request transmitter 85 transmits to a transmission request receiver 75 a negative acknowledge packet (NACK packet) 120 designating which packet needs to be retransmitted. The retransmission request receiver 75 then passes the information to a retransmitting packet supply part 76, wherein the packets of high priority are stored for retransmission. Based on the information, the retransmitting packet supply part 76 responsively outputs any designated packet to the priority assigning part 72. As such, under the priority-assigned RTP, only any packet of high priority is to be processed for retransmission. [0011] [0011]FIG. 12 is a sequence diagram for data transmission under the priority-assigned RTP. In FIG. 12, reference characters SN and SSN denote, respectively, the sequence number and the second sequence number. Moreover, “P=1” denotes a packet of high priority, while “P=0” a packet low in priority. In FIG. 12, for example, when packets of SN=3 and SN=4 are both lost, the latter packet is to be retransmitted as is high in priority, but not the former packet of low priority. [0012] Here, in the above, priority assignment is performed with no consideration of the packet reception state, and a ratio between high and low priorities to be assigned is constant. Therefore, no matter if the transmission path is bad in condition and packet loss often occurs, packet retransmission continues, resulting in increase of data for transmission. On the other hand, even if the transmission capacity is ample with the transmission path being good in condition and thus rare packet loss, the packets of high priority are generated yet based on the constant ratio, and packet retransmission is performed only when any packet of high priority is lost. As such, due to the neglect of the packet reception state at the time of priority assignment, data transmission cannot be efficiently carried out with whatever available transmission capacity. SUMMARY OF THE INVENTION [0013] Therefore, an object of the present invention is to provide a data transmission apparatus and method achieving efficient data transmission with the appropriate manner change of priority assignment in consideration of the packet reception state. [0014] The present invention has the following features to attain the object above. [0015] A first aspect of the present invention is directed to a data transmission apparatus for transmitting data on a packet basis from a transmitter to a receiver. The transmitter comprises: a priority assigning part for assigning priorities on a packet basis; a packet transmission part for transmitting a priority-assigned packet; a reception state receiving part for receiving a packet reception state in the receiver; and a packet retransmitting part for performing packet retransmission in response to a retransmission request from the receiver. The receiver comprises: a packet reception part for receiving the packet provided by the packet transmission part; a reception state transmitting part for transmitting the reception state based on packet loss information detected by the packet reception part; and a retransmission request transmitting part for transmitting the retransmission request if detected any packet of high priority as having been lost. Herein, the priority assignment part changes manners of priority assignment so that the packet of higher priority is decreased in number when the reception state is bad, and increased in number when good. [0016] As described above, in the first aspect, any packet of high priority is generated less when the packet reception state in the receiver is bad, and generated more when the packet reception state is good. As such, by controlling the amount of data to be retransmitted based on the reception state, data transmission can be efficiently carried out with whatever available transmission capacity. [0017] More preferably, the reception state transmission part may transmit the reception state including a packet loss ratio in the packet reception part, and the priority assignment part may change the manners of priority assignment so that the packet of high priority is found with a lower ratio when the packet loss ratio is larger than a predetermined value, and when smaller, the packet of high priority is found with a higher ratio. [0018] According to a second aspect, in the first aspect, the priority assigning part classifies any packet including coded data derived from moving pictures into an intra-coded packet carrying intra-frame coded data, or an inter-coded packet carrying inter-frame coded data, and based on the reception state, changes the manners of priority assignment determined according to packet type. [0019] As described above, in the second aspect, to transmit coded data derived from moving pictures, the packets are classified into two types in consideration of any influence to be exerted upon the resulting reproduced image. Based on the classification and the packet reception state in the receiver, packets are assigned with priorities. As such, by controlling the amount of data to be retransmitted based on the reception state, data transmission can be efficiently carried out with whatever available transmission capacity, preventing quality deterioration to any resulting reproduced image. [0020] In such case, the priority assigning part may change between, based on the reception state, a first priority assigning manner wherein the intra-coded packet is assigned with a high priority, and the inter-coded packet with a low priority, and a second priority assigning manner wherein every packet is assigned with a high priority. Or alternatively, based on the reception state, changed among may be a first priority assigning manner wherein the intra-coded packet is assigned with either a high or low priority at a predetermined ratio and the inter-coded packet with a low priority, a second priority assigning manner wherein the intra-coded packet is assigned with a high priority and the inter-coded packet with a low priority, and a third priority assigning manner wherein every packet is assigned with a high priority. [0021] When coded data derived from moving pictures is transmitted, the packets are classified into two types in consideration of any effect to be exerted upon the resulting reproduced image. In this manner, by changing two or three manners of priority assignment, it becomes possible to prevent quality deterioration to any resulting reproduced image. [0022] A third aspect of the present invention is directed to a data transmission method for transmitting data on a packet basis from a transmitter to a receiver. The transmitter comprises the steps of: assigning priorities on a packet basis; transmitting a priority-assigned packet; receiving a packet reception state in the receiver; and performing packet retransmission in response to a retransmission request from the receiver. The receiver comprises the steps of: receiving the packet provided by the packet transmission part; transmitting the reception state based on packet loss information detected in the packet receiving step; and transmitting the retransmission request if detected any packet of high priority as having been lost. Herein, in the priority assigning step, manners of priority assignment is so changed that the packet of higher priority is decreased in number when the reception state is bad, and increased in number when good. [0023] As described above, in the third aspect, any packet of high priority is generated less when the packet reception state in the receiver is bad, and generated more when the packet reception state is good. As such, by controlling the amount of data to be retransmitted based on the reception state, data transmission can be efficiently carried out with whatever available transmission capacity. [0024] More preferably, in the reception state transmitting step, the reception state including a packet loss ratio in the packet receiving step may be transmitted, and in the priority assigning step, the manners of priority assignment may be so changed that the packet of high priority is found with a lower ratio when the packet loss ratio is larger than a predetermined value, and when smaller, the packet of high priority is found with a higher ratio. [0025] According to a fourth aspect, in the third aspect, in the priority assigning step, any packet including coded data derived from moving pictures is classified into an intra-coded packet carrying intra-frame coded data or an inter-coded packet carrying inter-frame coded data, and based on the reception state, the manners of priority assignment determined according to packet type are changed. [0026] As described above, in the fourth aspect, to transmit coded data derived from moving pictures, the packets are classified into two types in consideration of any influence to be exerted upon the resulting reproduced image. Based on the classification and the packet reception state in the receiver, packets are assigned with priorities. As such, by controlling the amount of data to be retransmitted based on the reception state, data transmission can be efficiently carried out with whatever available transmission capacity, preventing quality deterioration to any resulting reproduced image. [0027] In this case, in the priority assigning step, based on the reception state, changed between may be a first priority assigning manner wherein the intra-coded packet is assigned with a high priority and the inter-coded packet with a low priority, and a second priority assigning manner wherein every packet is assigned with a high priority. Or alternatively, based on the reception state, changed among may be a first priority assigning manner wherein the intra-coded packet is assigned with either a high or low priority at a predetermined ratio and the inter-coded packet with a low priority, a second priority assigning manner wherein the intra-coded packet is assigned with a high priority and the inter-coded packet with a low priority, and a third priority assigning manner wherein every packet is assigned with a high priority. [0028] When coded data derived from moving pictures is transmitted, the packets are classified into two types in consideration of any effect to be exerted upon the resulting reproduced image. In this manner, by changing two or three manners of priority assignment, it becomes possible to prevent quality deterioration to any resulting reproduced image. [0029] These and other objects, features, aspects and advantages of the present invention will become more apparent from the following detailed description of the present invention when taken in conjunction with the accompanying drawings.
BRIEF DESCRIPTION OF THE DRAWINGS [0030] [0030]FIG. 1 is a block diagram showing the configuration of a data transmission apparatus according to an embodiment of the present invention; [0031] [0031]FIG. 2 is a diagram showing the format of a data packet under a priority-assigned RTP; [0032] [0032]FIG. 3 is a table showing manners of priority assignment differed among priority-assigning parts in the data transmission apparatus of the embodiment; [0033] [0033]FIG. 4 is a diagram showing the format of a NACK packet under the priority-assigned RTP; [0034] [0034]FIG. 5 is a diagram showing the format of an RR packet under the priority-assigned RTP; [0035] [0035]FIG. 6 is a diagram showing the manner change of priority assignment in the data transmission apparatus of the embodiment; [0036] [0036]FIG. 7 is a block diagram exemplarily showing the modified configuration of the data transmission apparatus according to the embodiment of the present invention; [0037] [0037]FIG. 8 is a table showing manners of priority assignment differed between priority-assigning parts in the data transmission apparatus of the embodiment; [0038] [0038]FIG. 9 is a block diagram showing the configuration of a conventional data transmission apparatus having an RTP applied; [0039] [0039]FIG. 10 is a sequence diagram for data transmission under the RTP; [0040] [0040]FIG. 11 is a block diagram showing the configuration of the conventional data transmission apparatus under the priority-assigned RTP; and [0041] [0041]FIG. 12 is a sequence diagram for data transmission under the priority-assigned RTP.
DESCRIPTION OF THE PREFERRED EMBODIMENT [0042] [0042]FIG. 1 is a block diagram showing the configuration of a data transmission apparatus according to an embodiment of the present invention. This data transmission apparatus is configured by a data transmitter 10 and a data receiver 20, and data is transmitted from the transmission-side application 1 to the reception-side application 2 under the priority-assigned RTP. The data transmitter 10 includes a header adding part 11, a priority assignment control part 12, first to third priority assigning parts 13 a to 13 c, a packet transmitter 14, a reception state receiver 15, a retransmission request receiver 16, and a retransmitting packet supply part 17. As to the data receiver 20, included are a packet output part 21, a priority judging part 22, a packet receiver 23, a packet reception state transmitter 24, and a retransmission request transmitter 25. Herein, any component appeared in the apparatus of FIG. 9 is under the same reference numeral. [0043] Described next is data transmission from the transmission-side application 1 to the reception-side application 2. First, the header adding part 11 provides a packet outputted from the transmission-side application 1 with a header including a sequence number and a timestamp, for example. The priority assignment control part 12 outputs the header-added packet to any of the first to third priority assigning part 13 a to 13 c. As will be later described, the first to third priority assigning parts 13 a to 13 c provide every incoming packet with a priority of high or low in each different manner. The packet transmitter 14 transmits the priority-assigned data packet 100 to the packet receiver 23. [0044] The data packet 100 thus received by the packet receiver 23 is then forwarded to the packet output part 21 via the priority judging part 22. The packet output part 21 stores the data packet 100, and waits for the time designated by its timestamp for output to the reception-side application 2. The priority judging part 22 detects whether any packet of high priority has been lost, and the detection result is notified to the retransmission request transmitter 25. The retransmission request transmitter 25 transmits the NACK packet 120 designating which packet is to be retransmitted. [0045] Based on the received NACK packet 120, the retransmission request receiver 16 informs the retransmitting packet supply part 17 which packet needs to be retransmitted. Here, the retransmitting packet supply part 17 previously stores any packet assigned with a high priority by the first to third priority assigning parts 13 a to 13 c, and responsively outputs the designated packet to the priority assignment control part 12. [0046] The packet receiver 23 also outputs the data packet 100 to the reception state transmitter 24 after detecting any packet loss. Based on the information about packet loss, the reception state transmitter 24 generates the RR packet 110, and transmits it to the reception state receiver 15. From the RR packet 110, the reception state receiver 15 extracts a packet loss ratio 200, and outputs it to the priority assignment control part 12. Based on the packet loss ratio 200, the priority assignment control part 12 determines to which of the first to third priority assigning parts 13 a to 13 c the packets each provided by the header adding part 11 and the retransmitting packet supplying part 17 are to be outputted. [0047] Next, the data transmission apparatus of the present embodiment is described in detail. [0048] Here, the transmission-side application 1 is presumably an application for encoding moving pictures such as MPEG 4 and H. 263, for example. The transmission-side application 1 first performs intra-coding or inter-coding with respect to moving pictures, and the resultingly derived coded data is divided into packets. The packets are classified into “intra-coded packets” carrying intra-frame coded data, and “inter-coded packets” carrying inter-frame coded data. In comparison, the intra-coded packets exert more significant influence upon the quality of the resulting reproduced image than the inter-coded packets, and thus considered more consequential. Such packet characteristic is outputted from the transmission-side application 1 together with the packets. [0049] In the present embodiment, presumably, the intra-coded packet corresponds to any intra-coded frame, and the inter-coded packet to any inter-coded frame. Alternatively, any packet carrying the predetermined number or more of intra-coded blocks may be handled as the intra-coded packet, or any packet carrying the intra-coded blocks with a predetermined ratio or more may be handled as such. In this case, any other packet may be handled as the inter-coded packet. [0050] [0050]FIG. 2 is a diagram showing the format of the priority-assigned data packet 100. In FIG. 2, a payload PL is packet data outputted from the transmission-side application 1. A payload type PLT denotes the priority-assigned RTP as being applied for data transmission. A sequence number SN is a number sequentially incremented by 1 in order of data packets. A timestamp TS denotes a time when the packet is to be used in the reception-side application 2. A transmission-side identifier SSRC identifies the data transmitter 10. A priority P denotes the packet priority, and a value 1 means the packet as being high in priority, and a value 0 as being low in priority. A second payload type PLT2 denotes the type of data to be transmitted under the priority-assigned RTP. A second sequence number SSN is a number incremented by 1 whenever the subsequent packet is of high priority, but remains the same for the packet low in priority. [0051] The header adding part 11 provides the packet outputted from the transmission-side application 1 with a header, and sets a value to fields from the head of the header to the transmission-side identifier. The header-added packet is outputted by the priority assignment control part 12 to any of the first to third priority assigning parts 13 a to 13 c. [0052] As shown in FIG. 3, the first to third priority assigning parts 13 a to 13 c perform priority assignment in each different manner. In detail, in the first priority assigning part 13 a, the priority assigned to the intra-coded packets is either high or low with a ratio of 1:1, and the priority to the inter-coded packets is low. In the second priority assigning part 13 b, the priority assigned to the intra-coded packets is high, but to the inter-coded packets is low. The third priority-assigning part 13 c assigns every incoming packet with a low priority. Based on the priorities assigned as such, the first to third priority assigning parts 13 a to 13 c assign each packet with the second sequence number. [0053] The packet transmitter 14 transmits the priority-assigned data packets 100 provided by the first to third priority assigning parts 13 a to 13 c. The data packets 100 are transmitted over the Internet using the User Datagram Protocol (UDP) module (not shown), for example. [0054] In response to the data packets 100, the packet output part 21 and the packet receiver 23 operate as described above. The priority judging part 22 refers to the priorities and the second sequence numbers to detect whether any packet of high priority has been lost, and notifies the detection result to the retransmission request transmitter 25. Specifically, if detecting any packet of high priority having the second sequence number larger by 2 or more than that of the preceding packet, or if detecting any packet of low priority having the second sequence number different from that of the preceding packet, the priority judging part 22 determines that any packet of high priority has been lost. [0055] The retransmission request transmitter 25 generates, based on the notification from the priority judging part 22, the NACK packet 120 designating which packet needs to be retransmitted. FIG. 4 is a diagram showing the format of the NACK packet. In FIG. 4, a packet type (PT) denotes the type of packet. A packet length (L) denotes the length of the packet. A reception-side identifier (SSRC_R) is an identifier for identifying the data receiver 20. The transmission-side identifier SSRC identifies from where the data packet 100 came, that is, the data transmitter 10. The second sequence number (SSN) is the second sequence number of the packet to be retransmitted. Here, the NACK packet shown in FIG. 4 is designating only one packet for retransmission. The number of the packets to be designated is not restrictive, and several packets may be simultaneously designated by including any appropriate field for other data. [0056] The retransmission request transmitter 25 transmits thus generated NACK packet 120 over the Internet using the UDP module (not shown), for example, as is the data packet 100. [0057] In response to the NACK packet 120, the retransmission request receiver 16 and the retransmitting packet supply part 17 operate as described above. The first to third priority assigning parts 13 a to 13 c, and the packet transmitter 14 execute the processing to the packet provided by the retransmitting packet supply part 17 in the same manner as to the packet coming from the header adding part 11. Accordingly, any packet of high priority designated by the NACK packet 120 is retransmitted. [0058] The packet receiver 23 detects any packet loss by referring to the sequence numbers of the received data packets 100. If detecting any packet of high priority having the sequence number larger by 2 or more than that of the preceding packet, the packet receiver 23 determines as packet loss having been occurred. The packet receiver 23 notifies information about packet reception state and packet loss to the reception state transmitter 24. [0059] Based on the notified information, the reception state transmitter 24 calculates the total number of packets lost so far and the packet loss ratio, and generates the RR packet 110 including thus calculated values. FIG. 5 is a diagram showing the format of the RR packet 110. Therein, the packet type (PT), the packet length (L), the reception-side identifier (SSRC_R), and the transmission-side identifier (SSRC) are the same as those in the format of the NACK packet 120. Here, a cumulative number of packets lost (CNPL) and a fraction lost (FL: equal to packet loss ratio) indicate the values calculated by the reception state transmitter 24. An extended highest sequence number received (EHSNR) denotes the sequence number of the packet last received. An interarrival jitter (IJ) denotes a jitter observed for the delay over the transmission path, and a last SR (LSR) and a delay since last SR (DLSR) are used to measure the round-trip delay over the transmission path. Here, the details of each field are also found in the above document (RFC1889). [0060] The reception state transmitter 24 transmits thus generated RR packet 110 over the Internet by using the UDP module (not shown), for example, as is the data packet 100. The reception state receiver 15 extracts the packet loss ratio 200 from the RR packet 110, and outputs it to the priority assignment control part 12. [0061] Based on the packet loss ratio 200, the priority assignment control part 12 changes to which of the first to third priority assigning parts 13 a to 13 c the packets provided by the header adding part 11 and the retransmitting packet supply part 17 are to be outputted. Here, assuming that the packet loss ratio 200 is X (%), and threshold values for the change are T1 and T2. When X is T1 or larger, the priority assignment control part 12 outputs the received packet to the first priority assigning part 13 a. When X is T2 or lager and smaller than T1, the received packet goes to the second priority assigning part 13 b, and when X is smaller than T2, to the third priority assigning part 13 c. As an example, when T1 is 70% and T2 is 30%, the priority assignment control part 12 outputs the received packet to the first priority assigning part 13 a with X being 70% or more, to the second priority assigning part 13 b with X being 30% or larger and smaller than 70%, and to the third priority assigning part 13 c with X being smaller than 30%. As such, the manners of priority assignment are changed based on the packet loss ratio. [0062] [0062]FIG. 6 is a diagram showing the manner change of priority assignment done by the data transmitter 10 after receiving the RR packet 110. For the sake of simplification, FIG. 6 shows only the RR packet 110. The data receiver 20 transmits, with a predetermined timing, the RR packet 110 carrying the packet loss ratio. In response to the packet loss ratio, the data transmitter 10 changes the manners of priority assignment. Specifically, the manners are so changed that the number of packets high in priority becomes less with the high packet loss ratio, and with the low packet loss ratio, the number of packets high in priority are increased. Accordingly, packet retransmission is suppressed with the high packet loss ratio, whereby the data to be transmitted is reduced. On the other hand, packet retransmission is encouraged with the low packet loss ratio, whereby the data to be transmitted is increased. As such, by changing the manners of priority assignment and controlling data amount for retransmission, coded data derived from moving pictures can be efficiently transmitted with whatever available data capacity, preventing quality deterioration to any resulting reproduced image. [0063] As such, in the data transmission apparatus of the present embodiment, the manners of priority assignment are changed on the transmission side in consideration of the packet reception state, and thus the packets of high quality are increased in number when the packet reception state is bad, and decreased in number with good packet reception state. In this manner, the data to be retransmitted can be controlled in amount, and thus data transmission can be efficiently performed with whatever available data capacity. [0064] Here, the first to third priority assigning parts 13 a to 13 c are provided in the data transmission apparatus, and priority assignment is changed in three different manners. This is not restrictive, and as shown in FIG. 7, for example, the data transmission apparatus may include first and second priority assigning parts 33 a and 33 b, and these may operate according to a table shown in FIG. 8. [0065] Further, the packet characteristic is outputted from the transmission-side application in the above. However, the data transmitter may calculate that. For example, to transmit image coded data under the RTP, the packet characteristic may be easily derived by referring to a specific bit in the packet. [0066] Still further, data to be transmitted is arbitrary, and so is the manner of packet classification. For example, to transmit data derived by hierarchically coding the image in the frequency direction, the same manner as above can be applied by classifying any packet including a low frequency component into the intra-coded packet, or any packet including a high frequency component into the inter-coded packet. Also for transmission of audio data, any packet carrying real sound may be classified into the intra-coded packet, or any packet carrying silent sound for most of the part into the inter-coded packet. As another possibility, priority assignment may be done without referring to the packet characteristic. [0067] In the present embodiment, the communications protocol is the RTP. This is not restrictive, and any other communications protocol will also do, leading to the data transmission apparatus with the same features as above. [0068] While the invention has been described in detail, the foregoing description is in all aspects illustrative and not restrictive. It is understood that numerous other modifications and variations can be devised without departing from the scope of the invention. Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5367523 *Aug 26, 1993Nov 22, 1994International Business Machines CorporationAdaptive rate-based congestion and flow control in packet communications networksUS5703870 *Nov 14, 1995Dec 30, 1997Nec CorporationCongestion control methodUS5768533 *Sep 1, 1995Jun 16, 1998National Semiconductor CorporationVideo coding using segmented frames and retransmission to overcome channel errorsUS6081843 *Mar 20, 1997Jun 27, 2000Nokia TelecommunicationsSystem using simulation cell and simulation buffer for regulating cell transfer rate according to occupancy level of the simulation bufferUS6163808 *Mar 20, 1997Dec 19, 2000Nokia Telecommunications, OyNetwork adjusts cell transfer capacity in response to a change in the actual bit rate relative to the nominal bit rateUS6167030 *Mar 20, 1997Dec 26, 2000Nokia Telecommunications, OyBuffer-based traffic measurement system and method for nominal bit rate (NBR) serviceUS6188670 *Oct 31, 1997Feb 13, 2001International Business Machines CorporationMethod and system in a data processing system for dynamically controlling transmission of data over a network for end-to-end device flow controlUS6222841 *May 14, 1997Apr 24, 2001Digital Vision Laboratories CorporationData transmission system and methodUS6335933 *May 21, 1999Jan 1, 2002Broadcom Homenetworking, Inc.Limited automatic repeat request protocol for frame-based communication channelsUS6438135 *Oct 21, 1999Aug 20, 2002Advanced Micro Devices, Inc.Dynamic weighted round robin queuingUS6442166 *Jul 17, 1997Aug 27, 2002Alcatel Canada Inc.Variation fluctuation smoothing (VFS) for ATM circuit emulationUS6445679 *Dec 23, 1998Sep 3, 2002Digital Vision Laboratories CorporationStream communication system and stream transfer control methodUS6449255 *Apr 26, 1999Sep 10, 2002Cisco Technology, Inc.Method and apparatus for managing packets using a real-time feedback signalUS6587985 *Nov 30, 1999Jul 1, 2003Matsushita Electric Industrial Co., Ltd.Data transmission method, data transmission apparatus, data receiving apparatus, and packet data structureUS6628610 *Jun 28, 1999Sep 30, 2003Cisco Technology, Inc.Methods and apparatus for managing a flow of packets using change and reply signalsUS6628614 *Jun 21, 1999Sep 30, 2003Fujitsu LimitedTraffic control apparatus and method thereofUS6643256 *Dec 15, 1999Nov 4, 2003Kabushiki Kaisha ToshibaPacket switch and packet switching method using priority control based on congestion status within packet switchUS6646988 *Mar 28, 2000Nov 11, 2003Nortel Networks LimitedSystem, device, and method for allocating excess bandwidth in a differentiated services communication networkUS6684354 *Aug 26, 2002Jan 27, 2004Matsushita Electric Industrial Co., Ltd.Data transmission method, data transmission apparatus, data receiving apparatus, and packet data structureUS6748435 *Apr 28, 2000Jun 8, 2004Matsushita Electric Industrial Co., Ltd.Random early demotion and promotion marker* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS7656861 *Nov 3, 2004Feb 2, 2010Cisco Technology, Inc.Method and apparatus for interleaving text and media in a real-time transport sessionUS7773523 *Aug 25, 2005Aug 10, 2010Nec CorporationNetwork-quality determining method and apparatus for use therewithUS7792143Mar 25, 2005Sep 7, 2010Cisco Technology, Inc.Method and apparatus for interworking dissimilar text phone protocols over a packet switched networkUS7924890 *Feb 13, 2006Apr 12, 2011Cisco Technology, Inc.Apparatus and method for increasing reliability of data sensitive to packet lossUS8090867Aug 15, 2008Jan 3, 2012Voxer Ip LlcTelecommunication and multimedia management method and apparatusUS8111713Aug 15, 2008Feb 7, 2012Voxer Ip LlcTelecommunication and multimedia management method and apparatusUS8121128 *Feb 25, 2009Feb 21, 2012Qualcomm IncorporatedMethod and apparatus for link control in a wireless communication systemUS8121271Jun 26, 2008Feb 21, 2012Voxer Ip LlcTelecommunication and multimedia management method and apparatusUS8145780Aug 15, 2008Mar 27, 2012Voxer Ip LlcTelecommunication and multimedia management method and apparatusUS8321581Aug 15, 2008Nov 27, 2012Voxer Ip LlcTelecommunication and multimedia management method and apparatusUS8380874 *Aug 22, 2008Feb 19, 2013Voxer Ip LlcTelecommunication and multimedia management method and apparatusUS8391312Aug 22, 2008Mar 5, 2013Voxer Ip LlcTelecommunication and multimedia management method and apparatusUS8411755 *Aug 27, 2009Apr 2, 2013Canon Kabushiki KaishaVideo transmission apparatus and control method for video transmission apparatusUS8422614Oct 14, 2009Apr 16, 2013Qualcomm IncorporatedMethods and apparatus for determining timing in a wireless communication systemUS8463241 *Aug 17, 2007Jun 11, 2013Samsung Electronics Co., LtdMethod and apparatus for reporting reception ratio of streaming service by terminal in a mobile broadcasting system, and system thereofUS8675631 *Mar 6, 2006Mar 18, 2014Qualcomm IncorporatedMethod and system for achieving faster device operation by logical separation of control informationUS8682336Aug 25, 2008Mar 25, 2014Voxer Ip LlcTelecommunication and multimedia management method and apparatusUS8699678Apr 2, 2008Apr 15, 2014Voxer Ip LlcTelecommunication and multimedia management method and apparatusUS8706907 *Aug 25, 2008Apr 22, 2014Voxer Ip LlcTelecommunication and multimedia management method and apparatusUS8750312 *Aug 22, 2011Jun 10, 2014Interdigital Technology CorporationMethod and apparatus for multicasting with feedback informationUS8948329Dec 15, 2005Feb 3, 2015Qualcomm IncorporatedApparatus and methods for timing recovery in a wireless transceiverUS9065744 *Jun 20, 2011Jun 23, 2015Netscout Systems, Inc.Performance optimized and configurable state based heuristic for the classification of real-time transport protocol trafficUS9131110 *Feb 8, 2013Sep 8, 2015Polycom, Inc.System and method for handling critical packets loss in multi-hop RTP streamingUS20030095536 *Nov 16, 2001May 22, 2003Hu Teck H.Multi-priority re-sequencing method and apparatusUS20030200324 *Mar 7, 2003Oct 23, 2003Samsung Electronics Co., Ltd.Apparatus and method for protocol processing, and apparatus and method for traffic processingUS20050207406 *Apr 3, 2003Sep 22, 2005Koninklijke Philips Electronics N.V.Transmission system with congestion control at the receiver end for deciding possible retransmission requestsUS20050254447 *Jul 29, 2003Nov 17, 2005Koninklijke Philips Electronics N.V.Domestic multimedia transmission method and systemUS20060007916 *Nov 3, 2004Jan 12, 2006Jones Paul EMethod and apparatus for interleaving text and media in a real-time transport sessionUS20060045017 *Aug 25, 2005Mar 2, 2006Nec CorporationNetwork-quality determining method and apparatus for use therewithUS20060218596 *Mar 6, 2006Sep 28, 2006Chandhok Ravinder PMethod and system for achieving faster device operation by logical separation of control informationUS20070140322 *Dec 15, 2005Jun 21, 2007Wang Michael MApparatus and methods for timing recovery in a wireless transceiverUS20070189327 *Feb 13, 2006Aug 16, 2007Praveen KondaApparatus and method for increasing reliability of data sensitive to packet lossUS20080045185 *Aug 17, 2007Feb 21, 2008Samsung Electronics Co., Ltd.Method and apparatus for reporting reception ratio of streaming service by terminal in a mobile broadcasting system, and system thereofUS20080084825 *Oct 9, 2007Apr 10, 2008Nec CorporationMethod for determining data transmission state in data communication systemUS20080165805 *Jan 4, 2008Jul 10, 2008Interdigital Technology CorporationNode b based segmentation/concatenationUS20090103433 *Aug 15, 2008Apr 23, 2009Rebelvox, LlcTelecommunication and multimedia management method and apparatusUS20090103475 *Jun 26, 2008Apr 23, 2009Rebelvox, LlcTelecommunication and multimedia management method and apparatusUS20090103521 *Aug 15, 2008Apr 23, 2009Rebelvox, LlcTelecommunication and multimedia management method and apparatusUS20090103522 *Aug 22, 2008Apr 23, 2009Rebelvox, LlcTelecommunication and multimedia management method and apparatusUS20090103523 *Aug 25, 2008Apr 23, 2009Rebelvox, LlcTelecommunication and multimedia management method and apparatusUS20090103527 *Aug 22, 2008Apr 23, 2009Rebelvox, LlcTelecommunication and multimedia management method and apparatusUS20090103549 *Apr 2, 2008Apr 23, 2009Rebelvox, LlcTelecommunication and multimedia management method and apparatusUS20090104915 *Aug 25, 2008Apr 23, 2009Rebelvox, LlcTelecommunication and multimedia management method and apparatusUS20090106617 *Aug 15, 2008Apr 23, 2009Rebelvox, LlcTelecommunication and multimedia management method and apparatusUS20090213729 *Feb 25, 2009Aug 27, 2009Qualcomm IncorporatedMethod and apparatus for link control in a wireless communication systemUS20100054343 *Mar 4, 2010Canon Kabushiki KaishaVideo transmission apparatus and control method for video transmission apparatusUS20100157833 *Dec 22, 2009Jun 24, 2010Qualcomm IncorporatedMethods and systems for improved timing acquisition for varying channel conditionsUS20110299450 *Dec 8, 2011Interdigital Technology CorporationMethod and apparatus for multicasting with feedback informationUS20120320767 *Dec 20, 2012David Ronald HarrisonPerformance optimized and configurable state based heuristic for the classification of real-time transport protocol trafficUS20130208079 *Feb 8, 2013Aug 15, 2013Polycom, Inc.System and Method for Handling Critical Packets Loss in Multi-Hop RTP Streaming* Cited by examinerClassifications U.S. Classification370/395.42, 370/389International ClassificationH04L12/911, H04L12/833, H04L12/70, H04L12/801, H04L29/14, H04L1/18, H04L1/16Cooperative ClassificationH04L1/1628, H04L1/1887, H04L1/1854, H04L1/1809European ClassificationH04L1/18T7, H04L1/18C, H04L1/16F5, H04L1/18R7Legal EventsDateCodeEventDescriptionAug 15, 2001ASAssignmentOwner name: MATSUSHITA ELECTRIC INDUSTRIAL CO., LTD., JAPANFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HATA, KOICHI;MIYAZAKI, AKIHIRO;IMURA, KOJI;AND OTHERS;REEL/FRAME:012101/0610Effective date: 20010808Sep 5, 2006CCCertificate of correctionJun 17, 2009FPAYFee paymentYear of fee payment: 4Mar 11, 2013FPAYFee paymentYear of fee payment: 8RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services