CN101945427B - Efficient streaming media transmission method - Google Patents
Efficient streaming media transmission method Download PDFInfo
- Publication number
- CN101945427B CN101945427B CN200910108577.3A CN200910108577A CN101945427B CN 101945427 B CN101945427 B CN 101945427B CN 200910108577 A CN200910108577 A CN 200910108577A CN 101945427 B CN101945427 B CN 101945427B
- Authority
- CN
- China
- Prior art keywords
- packet
- frame
- data
- timestamp
- less
- 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.)
- Expired - Fee Related
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/80—Responding to QoS
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/60—Network streaming of media packets
- H04L65/61—Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio
- H04L65/612—Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio for unicast
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/60—Network streaming of media packets
- H04L65/65—Network streaming protocols, e.g. real-time transport protocol [RTP] or real-time control protocol [RTCP]
Abstract
The invention relates to a streaming media transmission method on the basis of a UDP data transfer protocol. The method comprises the following steps: establishing a video file at a server side, wherein the video file comprises a plurality of data frames, and each data frame corresponds to a frame serial number and a frame timestamp; segmenting each data frame into a plurality of data packets or combining a plurality of the data frames into one data packet, wherein each data packet corresponds to a packet serial number and a packet timestamp; sending the data packets to a client side and recording the packet serial number and the packet timestamp of each data packet into a queue in an internal storage via the server side; detecting whether the data packets are lost via the client side, if yes, feeding back the serial numbers of the lost packets to the server side, and then finding out the corresponding packet timestamps via the server side according to the packet serial numbers in the queue; and according to the relation between the packet timestamps and the frame timestamps, finding out the corresponding data frames of the lost data packets, segmenting one data frame into a plurality of the data packets or combining a plurality of the data frames into one data packet and then sending the lost data packets to the client side.
Description
Technical field
The present invention relates to the wireless flow media field, relate in particular to a kind of flow-medium transmission method efficiently.
Background technology
Along with developing rapidly of mobile communication technology and video-frequency compression method, utilize Wireless IP network transmission live video stream technology to receive people's attention.Packet loss, transmission error such as overtime can take place during data in transmission in the Internet of Wireless IP network and best effort (best-effort).The numerical value of packet loss is generally smaller; But the influence to the user is very big; Be the killer who influences video quality; Especially at present the compression ratio that uses is all than higher, and losing or damaging the decompression that can have influence on other associated frame equally of a frame of video directly damages the fluency and the clarity of receiving terminal video playback.Therefore, the error control that need in video transmission, transmit is handled.
Though the Transmission Control Protocol based on connecting can provide reliable data transmission capabilities, its flow control mechanism is based on low error rate and the low time delay of cable network.Along with the increase of network bandwidth time delay product (BDP), the poor efficiency that common Transmission Control Protocol begins to become.This is because its AIMD (additive increase multiplicative decrease) algorithm has thoroughly reduced the TCP congestion window, but can not recover available bandwidth fast.In addition, the inequitable RTT in the congested control of TCP (two-way time that Round-Trip Time divides into groups) has caused the concurrent TCP that has different RTT to flow share of bandwidth partially.Although in little BDP network, use common TCP to realize the shared bandwidth of relative equality, in having the wireless network of a large amount of BDP, the concurrent TCP stream of common different RTT just must bear serious inequitable problem.In Transmission Control Protocol; Transmitting terminal is through sending the information of the packet that window and timer management sent; Correct data bag loopback ACK acknowledge character (ACKnowledge Character) response of receiving terminal to receiving, ACK itself also will expend considerable network and processor resource.In addition in Transmission Control Protocol; For packet retransmits; Sent but go back unacknowledged data and all be kept in the tcp protocol stack, concerning the wireless flow media server of high concurrency, each user buffer memory waste host resource greatly all; Big at network delay, more serious in the high wireless network of bandwidth jitter rate.
And based on udp protocol, UDP i.e. (User Datagram Protocol) UDP, transfer of data, do not have said congestion window among the TCP, congested control, and metadata cache.But the error control function that udp protocol does not provide TCP to provide.And what have now is the reliable transfer of data that realize on the basis with UDP, also is that the data that first buffer memory sent are waited for ACK again.This causes the waste of resource concerning the big streaming server of data volume and customer volume, and can reduce the concurrency of server.For example, server sends 500 packets, and the server concurrency is 8000, and the size of each packet is 1K, and the buffer memory of server just needs the internal memory of the about 4G of 500x8000x1K so.This performance to server has great influence.
Given this, be necessary to propose a kind of improved method to overcome the defective of prior art in fact.
Summary of the invention
In view of this; The object of the invention is to provide a kind of a kind of flow-medium transmission method efficiently based on udp protocol, according to the characteristics of wireless network, proposes the professional program request scheme of a kind of streaming media video efficiently; Can well improve user's experience effect, and reduce the server its other resources.
In order to address the above problem the present invention a kind of method of flow-medium transmission method efficiently is provided, these method concrete steps are following:
Step S1: set up a video file in service end, this video file comprises the plurality of data frame, and the corresponding number of frames of each Frame and a frame time stab;
Step S2: the length according to Frame is divided into the plurality of data bag with each Frame, perhaps several Frames is combined into a packet, all corresponding packet number of each packet and a bag timestamp;
Step S3: service end is sent packet to client, and the packet number of this packet and bag timestamp are write down the formation the inside of internal memory;
Step S4: client detects according to packet number and has or not the packet of losing, and detects when packet loss is arranged, and the lost package sequence number is fed back to service end, and service end finds corresponding bag timestamp according to packet number in the formation in the internal memory,
Step S5: according to the mapping relations of bag timestamp and frame time stamp; In video file, find the corresponding one or more Frames of lost data packets; A Frame is divided into several packets, perhaps several Frames is formed a packet, send the packet of losing to client again.
Beneficial effect of the present invention is, uses the inventive method can avoid the data that server buffer passed and retransmits the data of having sent, the resource that can save server greatly.
Description of drawings
Fig. 1 is the FB(flow block) of highly efficient stream media transmission method of the present invention;
Fig. 2 is the diagrammatic sketch that sequence of data frames number, Frame length and the corresponding frame time of service end local video file stabs;
Fig. 3 is the diagrammatic sketch of the bag timestamp of packet number, data packet length and correspondence after video file shown in Figure 2 is packed by the inventive method;
Fig. 4 is stored in the packet sequence and bag timestamp corresponding queues presentation graphs in the internal memory for service end after packet shown in Figure 3 is sent;
Fig. 5 sends the sketch map of packet for service end of the present invention;
Fig. 6 is a kind of prior art service end EMS memory occupation amount and the graph of a relation of customer volume when sending Streaming Media;
EMS memory occupation amount when Fig. 7 sends Streaming Media for the inventive method service end and the graph of a relation of customer volume.
Embodiment
The present invention designs a kind of scheme of streaming media on demand efficiently based on udp protocol, and this scheme is these characteristics of program request file according to what play, this strategy of data of taking buffer memory not to send, the resource of greatly practicing thrift server.
Below in conjunction with accompanying drawing practical implementation of the present invention is described.
Fig. 1 is the schematic flow sheet of the inventive method, and these method concrete steps are following:
Step S1: set up a video file in service end, this video file comprises the plurality of data frame, and the corresponding number of frames of each Frame and a frame time stab; Wherein Frame can be frame of video or audio frame.
In conjunction with shown in Figure 2; The diagrammatic sketch that stabs for the sequence of data frames of service end local video file number, Frame length and corresponding frame time; 1,2,3 first row among the figure wherein: ... 18 is sequence of data frames number, secondary series len=2853, len=167, len=68 ... Len=16 is the corresponding data frame length; The 3rd row time=0.00000, time=0.12000, time=0.24000 ... Time=2.16000 is that corresponding frame time stabs.Frame time stabs here is that what to equate was a frame at a distance from 0.12000 second promptly at interval.
Step S2: the length according to Frame is divided into the plurality of data bag with each Frame, perhaps several Frames is combined into a packet, all corresponding packet number of each packet and a bag timestamp;
Here as follows with the packing of Frame detailed process:
S21: confirm the data packet length L under the wireless transmission environment earlier; The size of each Frame is n, as n during greater than L, this frame is cut into n/L+1 packet; Preceding n/L each length of packet is L; Last data packet length is n%L, and wherein n/L removes the back bracket function for doing, and % gets cofunction after removing; As n during, by this frame or form the packet that a data length is less than or equal to L with follow-up Frame addition less than L less than L;
S22: set up the mapping relations that bag timestamp and frame time stab, as n during greater than L, wherein n/L+1 packet record has identical bag timestamp, i.e. the frame time of this Frame stamp; As n during less than L, the bag timestamp of this packet record be that first length is less than the corresponding frame time stamp of the Frame of L.
Shown in Figure 3 is the diagrammatic sketch of the bag timestamp of packet number, data packet length and correspondence after video file shown in Figure 2 is packed by the inventive method: set a data packet length L earlier and equal 1200; The Frame length n of frame sequence 1 is 2853 among Fig. 2; Therefore n cuts into n/L+1 packet with frame sequence 1 Frame, i.e. 2853/1200+1=3 data greater than L; Preceding 2 data packet lengths are 1200; The 3rd data packet length is n%L, i.e. 2853/1200 remainder 453 is thus among Fig. 3; First classifies packet number 1,2,3 corresponding data packet lengths as is respectively len=1200, len=1200, len=453; And get for Frame 1 is cut, so packet number 1,2,3 time corresponding are identical with the timestamp of number of frames 1, all are time=0.00000, time=0.00000, time=0.00000;
In Fig. 2; The length of number of frames 2 be 167 less than L (1200), with subsequent frame sequence number 3 length be 68 also less than L; And 167 add 68 equals 235 and satisfies less than 1200; Therefore number of frames 2,3 is formed a packet (packet numbers 4 among Fig. 3, data packet length are 235, corresponding bag timestamp stabs less than the corresponding frame time of the Frame of L for first, and promptly number of frames 2 corresponding frame times stab time=0.12000).
When if n equals L, then with this frame directly as a packet.
The packing process of follow-up data is analogized by above-mentioned, repeats no more at this.
Step S3: service end is sent packet to client, and the packet number of this packet and bag timestamp are write down the formation the inside of internal memory;
S31:, only write down the packet number and the corresponding bag timestamp of first packet of n/L+1 packet in the formation as n during greater than L;
S32: as n during less than L, the several Frame additions less than n of record are formed packet number and first length of packet that data length are less than or equal to L less than the corresponding bag timestamp of the Frame of L in the formation.
Please refer to Fig. 3 and Fig. 5, service end accordings to packet number 1,2,3 according to the good packet of packing ... 18 to client transmission packet,
As shown in Figure 4, be information recorded in the service end memory queue, first row 1,4,5 ... 18 is packet number, and wherein 1 is that 3 bag timestamps are first packet numbers in 0.00000,4 for the bag time be 0.12000 packet numbers.
Step S4: client detects according to packet number and has or not the packet of losing, and detects when packet loss is arranged, and the lost package sequence number is fed back to service end, and service end finds corresponding bag timestamp according to packet number in the formation in the internal memory, and concrete steps are following:
S41: if in formation, can find the lost package sequence number of client feedback; Then the packet lost of explanation is the packet that the several Frames of first packet or the n of n during greater than L during less than L are formed, and server finds the corresponding bag of packet number timestamp;
In this step, for example client is 1,4 to the packet number of losing of feedback, therefore in the internal memory of service end, can find packet number 1,4 (as shown in Figure 4) can find corresponding bag timestamp respectively.
S42: if in formation, can not find the lost package sequence number of client feedback; Then explain this be one greater than a packet in the Frame of L; Then in the sequence number time queue, find and this packet number nearest previous packet number of being separated by, find the corresponding bag of this previous packet number timestamp;
For example routine client is 2 or 3 to the packet number of losing of feedback; Therefore in the internal memory of service end, can not find packet number 2 or 3 (as shown in Figure 4) and corresponding bag timestamp; Therefore in the sequence number time queue, find and this sequence number nearest previous packet number 1 of being separated by, have only packet number 1 with the packet number 2 or 3 nearest previous packet number of being separated by here.
Step S5: according to the mapping relations of bag timestamp and frame time stamp; In video file, find the corresponding one or more Frames of lost data packets; A Frame is divided into several packets, perhaps several Frames is formed a packet, send the packet of losing to client again.
S51: if in formation, can find the lost package sequence number; N then directly obtains corresponding frame time by the bag timestamp and stabs during greater than L, is stabbed by frame time and reads the Frame in the video file; And Frame is divided into n/L+1 packet, resend first packet to client; N then finds first frame length to stab less than the frame time of L by the bag timestamp during less than L, and this frame and the follow-up Frame addition less than n are formed the packet that a data length is less than or equal to L and resend to client;
For example the lost package sequence number 1; Corresponding bag timestamp is 0.00000; Find corresponding frame time to stab 0.00000 by bag timestamp 0.00000; Frame time stabs 0.00000 Frame 1 that reads in the video file, and Frame is divided into 2853/1200+1=3 packet, resends first packet to client; The bag timestamp is 0.12000 during lost package sequence number 4; Because this bag timestamp is exactly first number of frames less than 1200 to be 2 (shown in Figure 2) frame time stabs 0.12000, so to form a length by number of frames 2,3 be 253 to resend to client less than 1200 packet.
S52: if in formation, can not find the lost package sequence number; The Frame that stabs according to the corresponding frame time of the corresponding bag of this previous packet number timestamp reads out; Be cut into several packets to this Frame; Lost package sequence number and this previous packet number subtracted each other draw difference D, wherein the packet promptly lost of (D+1) packet in (n/L+1) individual packet resends (D+1) packet to client.
For example routine client is 2 or 3 to the packet number of losing of feedback; Has only packet number 1 with the packet number 2 or 3 nearest previous packet number of being separated by here; Bag timestamp 0.00000 finds corresponding frame time to stab 0.00000; Frame time stabs 0.00000 Frame 1 that reads in the video file, and Frame is divided into 2853/1200+1=3 packet, with lost package sequence number 2 or 3 and this previous packet number 1 subtract each other and draw difference D and equal 1 or 2; 1+1=2 or 2+1=3 packet that packet is promptly lost of (D+1) i.e. in 3 packets wherein; The 2nd (packet number is 2, and length is 1200) or the 3rd packet (packet number is 3, and length is 453) are resend to client.
Use this method as herein described can avoid the data that server buffer corrected one's mistakes and retransmit the data of having sent, the resource that can save server greatly.Figure six is normal stream server user amounts and the relation of internal memory, figure seven for adopt streaming server customer volume and the relationship memories after the methods described herein, therefrom can see adopt present technique after, the internal memory use amount obviously reduces, concurrency obviously improves.In postponing big wireless network, improve more obvious to server performance.
The above is merely preferred embodiment of the present invention, not in order to restriction the present invention, all any modifications of within spirit of the present invention and principle, being done, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.
Claims (8)
1. flow-medium transmission method efficiently, this method is characterized in that based on the Data Transport Protocol of UDP these method concrete steps are following:
Step S1: set up a video file in service end, this video file comprises the plurality of data frame, and the corresponding number of frames of each Frame and a frame time stab;
Step S2: the length according to Frame is divided into the plurality of data bag with each Frame, perhaps several Frames is combined into a packet, all corresponding packet number of each packet and a bag timestamp;
Step S3: service end is sent packet to client, and the packet number of this packet and bag timestamp are write down the formation the inside of internal memory;
Step S4: client detects according to packet number and has or not the packet of losing, and detects when packet loss is arranged, and the lost package sequence number is fed back to service end, and service end finds corresponding bag timestamp according to packet number in the formation in the internal memory;
Step S5: according to the mapping relations of bag timestamp and frame time stamp; In video file, find the corresponding one or more Frames of lost data packets; A Frame is divided into several packets, perhaps several Frames is formed a packet, send the packet of losing to client again.
2. flow-medium transmission method efficiently as claimed in claim 1 is characterized in that: frame time stabs to five equilibrium among the said step S1.
3. flow-medium transmission method efficiently as claimed in claim 2 is characterized in that: said step S2 is specific as follows:
S21: confirm the data packet length L under the wireless transmission environment earlier; The size of each Frame is n, as n during greater than L, this frame is cut into n/L+1 packet; Preceding n/L each length of packet is L; Last data packet length is n%L, and wherein: n/L removes the back bracket function for doing, and % gets cofunction after removing; As n during, by this frame or form the packet that a data length is less than or equal to L with follow-up Frame addition less than n less than L;
S22: set up the mapping relations that bag timestamp and frame time stab, as n during greater than L, wherein n/L+1 packet record has identical bag timestamp, i.e. the frame time of this Frame stamp; As n during less than L, the bag timestamp of this packet record be that first length is less than the corresponding frame time stamp of the Frame of L.
4. flow-medium transmission method efficiently as claimed in claim 3 is characterized in that: said step S3 is specific as follows:
S31:, only write down the packet number and the corresponding bag timestamp of first packet of n/L+1 packet in the formation as n during greater than L;
S32: as n during less than L, the several Frame additions less than n of record are formed packet number and first length of packet that data length are less than or equal to L less than the corresponding bag timestamp of the Frame of L in the formation.
5. flow-medium transmission method efficiently as claimed in claim 4 is characterized in that: said step S4 is specific as follows:
S41: if in formation, can find the lost package sequence number of client feedback; Then the packet lost of explanation is the packet that the several Frames of first packet or the n of n during greater than L during less than L are formed, and server finds the corresponding bag of packet number timestamp;
S42: if in formation, can not find the lost package sequence number of client feedback; Then explain this be one greater than a packet in the Frame of L; Then in the sequence number time queue, find and this packet number nearest previous packet number of being separated by, find the corresponding bag of this previous packet number timestamp;
6. flow-medium transmission method efficiently as claimed in claim 5 is characterized in that: said step S5 is specific as follows:
S51: if in formation, can find the lost package sequence number; N then directly obtains corresponding frame time by the bag timestamp and stabs during greater than L, is stabbed by frame time and reads the Frame in the video file; And Frame is divided into n/L+1 packet, resend first packet to client; N then finds first frame length to stab less than the frame time of L by the bag timestamp during less than L, and this frame and the follow-up Frame addition less than n are formed the packet that a data length is less than or equal to L and resend to client;
S52: if in formation, can not find the lost package sequence number; The Frame that stabs according to the corresponding frame time of the corresponding bag of this previous packet number timestamp reads out; Being cut into several packets to this Frame subtracts each other lost package sequence number and this previous packet number and draws difference D; Wherein the packet promptly lost of (D+1) packet in (n/L+1) individual packet resends (D+1) packet to client.
7. flow-medium transmission method efficiently as claimed in claim 1 is characterized in that: said Frame can be frame of video or audio frame.
8. flow-medium transmission method efficiently as claimed in claim 3 is characterized in that: when n equals L, then with this frame directly as a packet.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910108577.3A CN101945427B (en) | 2009-07-03 | 2009-07-03 | Efficient streaming media transmission method |
| PCT/CN2009/076284 WO2011000200A1 (en) | 2009-07-03 | 2009-12-30 | Effective streaming media transmission method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910108577.3A CN101945427B (en) | 2009-07-03 | 2009-07-03 | Efficient streaming media transmission method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101945427A CN101945427A (en) | 2011-01-12 |
| CN101945427B true CN101945427B (en) | 2012-11-14 |
Family
ID=43410474
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910108577.3A Expired - Fee Related CN101945427B (en) | 2009-07-03 | 2009-07-03 | Efficient streaming media transmission method |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN101945427B (en) |
| WO (1) | WO2011000200A1 (en) |
Families Citing this family (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102130954A (en) * | 2011-03-17 | 2011-07-20 | 华为技术有限公司 | Method and device for transmitting data resources |
| CN102685143B (en) * | 2012-05-23 | 2015-02-04 | 北京新媒传信科技有限公司 | Audio data transmission method, client side and server |
| CN103096183B (en) * | 2013-02-05 | 2015-12-09 | 清华大学 | A kind of highly efficient stream media transmission method |
| CN103441826B (en) * | 2013-07-12 | 2016-12-28 | 中国人民解放军国防科学技术大学 | A kind of method and apparatus reducing radio communication packet loss |
| CN103533387B (en) * | 2013-10-21 | 2016-08-17 | 腾讯科技（深圳）有限公司 | A kind of live video control, equipment and system |
| CN105531951A (en) * | 2014-07-29 | 2016-04-27 | 华为技术有限公司 | Data encryption and transmission method and device |
| CN104506455B (en) * | 2014-12-26 | 2017-11-14 | 深圳市兰丁科技有限公司 | Data packet sequencing jitter removing method and device |
| CN104735473B (en) * | 2015-03-05 | 2018-03-09 | 天脉聚源（北京）科技有限公司 | A kind of detection method and device of video render |
| CN105187440A (en) * | 2015-09-26 | 2015-12-23 | 北京暴风科技股份有限公司 | Method and system for transmitting video data by using UDP protocol |
| CN105306065A (en) * | 2015-11-10 | 2016-02-03 | 珠海多玩信息技术有限公司 | Processing method and device for timestamps, extracting method and device for compressed character strings |
| CN106411894A (en) * | 2016-09-29 | 2017-02-15 | 天脉聚源(北京)传媒科技有限公司 | Video transmission method and system |
| CN106713317A (en) * | 2016-12-22 | 2017-05-24 | 上海帝联信息科技股份有限公司 | Method and device for transmitting streaming media file |
| CN108696771B (en) * | 2017-04-11 | 2021-03-09 | 苏州谦问万答吧教育科技有限公司 | Video playing method and device |
| CN107612841A (en) * | 2017-08-21 | 2018-01-19 | 武汉斗鱼网络科技有限公司 | A kind of method, apparatus and computer equipment for transmitting data |
| CN107566808A (en) * | 2017-09-30 | 2018-01-09 | 深圳市智慧海洋科技有限公司 | A kind of underwater image transmission method and system based on wireless water sound communication technique |
| CN107864132B (en) * | 2017-11-03 | 2020-03-10 | 中广热点云科技有限公司 | Method for solving screen splash phenomenon generated by video streaming transmission system |
| CN107968698B (en) * | 2017-11-27 | 2021-06-15 | 中国铁道科学研究院集团有限公司通信信号研究所 | General safety communication method based on MVB bus |
| CN110913421B (en) * | 2018-09-18 | 2021-10-29 | 大唐移动通信设备有限公司 | Method and device for determining voice packet number |
| CN113365098B (en) * | 2021-06-01 | 2022-07-22 | 平安国际智慧城市科技股份有限公司 | Video frame assembling method and device, electronic equipment and storage medium |
| CN114079654B (en) * | 2022-01-05 | 2022-06-21 | 荣耀终端有限公司 | Data retransmission method, system and related device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6996624B1 (en) * | 2001-09-27 | 2006-02-07 | Apple Computer, Inc. | Reliable real-time transport protocol |
| CN101272500A (en) * | 2008-05-14 | 2008-09-24 | 中兴通讯股份有限公司 | Transmission method and system for video/audio data flow |
| CN101277270A (en) * | 2008-05-23 | 2008-10-01 | 北京中讯宏达科技有限公司 | Transmission method and system for flow medium data |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101155311B (en) * | 2006-09-27 | 2012-09-05 | 中兴通讯股份有限公司 | Video code stream error detecting and processing method in video communication |
-
2009
- 2009-07-03 CN CN200910108577.3A patent/CN101945427B/en not_active Expired - Fee Related
- 2009-12-30 WO PCT/CN2009/076284 patent/WO2011000200A1/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6996624B1 (en) * | 2001-09-27 | 2006-02-07 | Apple Computer, Inc. | Reliable real-time transport protocol |
| CN101272500A (en) * | 2008-05-14 | 2008-09-24 | 中兴通讯股份有限公司 | Transmission method and system for video/audio data flow |
| CN101277270A (en) * | 2008-05-23 | 2008-10-01 | 北京中讯宏达科技有限公司 | Transmission method and system for flow medium data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101945427A (en) | 2011-01-12 |
| WO2011000200A1 (en) | 2011-01-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101945427B (en) | Efficient streaming media transmission method | |
| US20220014312A1 (en) | Data transmission method and apparatus | |
| JP5588019B2 (en) | Method and apparatus for analyzing a network abstraction layer for reliable data communication | |
| US9306708B2 (en) | Method and apparatus for retransmission decision making | |
| KR101400658B1 (en) | Media access control protocol data unit aggregation in a time division multiple access media access control layer | |
| CN106341738B (en) | Bandwidth calculation method, server side and system for streaming media network transmission | |
| US11012367B2 (en) | Technologies for managing TCP/IP packet delivery | |
| CN102143078B (en) | Forwarding equipment as well as method and system for processing message | |
| US9565482B1 (en) | Adaptive profile switching system and method for media streaming over IP networks | |
| US20110044338A1 (en) | Throughput in a lan by managing tcp acks | |
| US9084177B2 (en) | Adaptive time allocation in a TDMA MAC layer | |
| US8693333B2 (en) | Method, network node and system for suppressing lost packet retransmission | |
| US9781488B2 (en) | Controlled adaptive rate switching system and method for media streaming over IP networks | |
| WO2022247550A1 (en) | Data retransmission processing method and apparatus, computer device, and storage medium | |
| CN104768081B (en) | A kind of packet loss repeating method for realizing flow control | |
| CN110474721B (en) | Video data transmission method, device and computer readable storage medium | |
| CN104270684A (en) | Video and audio data network transmission system and method oriented to real-time application | |
| JP2019505126A (en) | Requesting retransmission of data in a multicast network | |
| EP3742746A1 (en) | Method and device for realizing video service, and communication system and computer-readable storage medium | |
| EP1914933A1 (en) | Method and apparatus for retransmission request reduction in a network | |
| CN103428531A (en) | Method and system for ARQ controlling of multi-media data | |
| US11502986B2 (en) | Reducing transmission delay of transmitting data in Wi-Fi | |
| CN103841380B (en) | A kind of method and its system of media circulation distribution | |
| CN110086772B (en) | Method and system for acquiring monitoring video | |
| TW201023564A (en) | Frame merging apparatus and method thereof |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C56 | Change in the name or address of the patentee |
Owner name: SHENZHEN RONGCHANG TIANXIA TECHNOLOGY CO., LTD. Free format text: FORMER NAME: SHENZHEN TEMOBI SCIENCE + TECHNOLOGY CO., LTD. |
|
| CP01 | Change in the name or title of a patent holder |
Address after: 19, building 18, Changhong technology building, 518057 South twelve Road, South tech Zone, Nanshan District hi tech Zone, Guangdong, Shenzhen Patentee after: SHENZHEN TEMOBI TECHNOLOGY CO., LTD. Address before: 19, building 18, Changhong technology building, 518057 South twelve Road, South tech Zone, Nanshan District hi tech Zone, Guangdong, Shenzhen Patentee before: Shenzhen Temobi Science & Tech Development Co.,Ltd. |
|
| ASS | Succession or assignment of patent right |
Owner name: RONGCHUANG TIANXIA (SHANGHAI) TECHNOLOGY DEVELOPME Free format text: FORMER OWNER: SHENZHEN RONGCHANG TIANXIA TECHNOLOGY CO., LTD. Effective date: 20150610 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20150610 Address after: 200433 Shanghai City, Yangpu District Wei Road No. 6 room 502-8 Patentee after: World (Shanghai) Technology Development Co., Ltd. Address before: 19, building 18, Changhong technology building, 518057 South twelve Road, South tech Zone, Nanshan District hi tech Zone, Guangdong, Shenzhen Patentee before: SHENZHEN TEMOBI TECHNOLOGY CO., LTD. |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20121114 Termination date: 20160703 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |