A Novel Patching Algorithm Based On Stream Merging In Grouping

With the development of internet technology, network transmition is coming tomultimedia phase. On one hand, we hope to watch more clear and vivid media program; Onthe other hand, we have to waste a lot of time on watching video/audio contents transmition.To solve this contradiction, streaming media technology is proposed. Because it isunnecessary download the video/audio contents to local, for its continuous、real-time andtime-ordered characters, streaming media technique is widely applied in our life and work.Wide applications of stream media impel the development of stream media research, andstream media technology has a hot topic，but there are tow sorts of problem now: One issystem resource delivery problem, namely stream media delivery algorithm problem. Forimproving system capacity, a lot of stream media systems required to support a large numberof users simultaneously, how to use and schedule system resources rationally to satisfy usersfaster and better has become a very important question; Another one is stream media systemcapability problem. Streaming media applications not only to consider end-to-end QoS, butalso consider overall system performance. Enhancing the capacity of the system hardwaresimultaneously, we need to design efficient resource management strategies and thescheduling algorithm to improve the performance of the system.This paper aims at the first kind of problem in stream media research, based oncorrelative technologies on stream media, researches existing stream media deliveryalgorithms, analyses their capabilities, summarizes the problem about them, combines thegrouping strategy and merging strategy with patching algorithm, uses multicast technologyand stream-merging in grouping to deal with patching stream, and transplants the concept ofmulticast stream to patching stream, a new stream media delivery algorithm is proposedwhich is called patching algorithm based on stream-merging in grouping, enhances thecapabilities, solves system resource delivery problem in stream media research. Based onabove theories, we set up an algorithm emulator to analyze and compare the new algorithm’scapabilities. The experimental results show that the new algorithm has three levels stream schedulingthought which is made of regular stream、patching group regular stream and patching stream.It has better system throughput、shorter user average waiting time、lower user requestdefection ratio and algorithm’s unfair parameter. It is an effective scheduling algorithm forstreaming media. In addition, this algorithm also has better stability and adaptability.