A media flow random access treatment method

Abstract

The invention discloses a random access processing method of a media flow, which is applicable to stream server, comprising that: A. whether every coded media packet is a random access point or not is judged, and every media packet is added with an extension header used for indicating whether the media packet is the random access point, then the media packet carrying the extension header is storied; B. the media packet requested by the random access is searched after the random access instruction is received, and the packet delivering is controlled according to the instruction of the extension header. Using the invention can avoid judging whether the media packet is the random access point or not by adopting complicated seeking algorithm at each time of random access, thus reducing the consumption to the system resource, improving the efficiency of random access, and reducing cost.

Description

technical field [0001] The invention relates to the technical field of multimedia communication, in particular to a random access processing method suitable for media streams of a streaming media server. Background technique [0002] At present, more and more netizens begin to watch media videos released on the Internet by using streaming media live streaming and on-demand technology. Due to the large bandwidth occupied by media data, in order to reduce the bandwidth occupied by media data, video compression coding technology is generally used to compress and encode the media data frames at the sending end, and decode them according to the corresponding decoding technology at the receiving end to restore the media data. Commonly used video encoding methods such as MPEG encoding, H264 encoding, etc. all use motion compensation inter-frame encoding. This encoding method is divided into intra-frame coding frame (Intra frame) and inter-frame coding frame (Inter frame). The int...

AI Technical Summary

Problems solved by technology

[0006] 1. For each random access request in on-demand, the streaming media server needs to use the I frame search algorithm to find whether each RTP packet contains I frame data when reading the RTP packet. For some encoding algorithms, it needs to search for the I frame The algorithm consumes a lot of system resources. For popular programs, there are often multiple on-demand sessions, which will waste a lot of system resources, resulting in high cost of the streaming server.

At the same time, consuming so many system resources in real-time on-demand will also affect the real-time performance of media data transmission

[0007] 2. For the I-frame search algorithm of various encoding formats, professional codec knowledge is required, and the general streaming servers on the edge nodes usually do not include this part of the function, which requires the transformation of these general streaming servers, thus improving the overall CDN the cost of

[0008] 3. The current standard media file formats such as MP4, 3GP and other formats search for I-frame algorithms are relatively simple, so some existing technologies transfer RTP packets into standard media file formats for live broadcast or on-demand broadcasting, but the transfer process needs to consume System resources, in addition, even if it is transferred to a standard media file format, file parsing and searching are required for each on-demand channel, which also increases the consumption of system resources

Images