Jun-Li Kuo

Work place: Computer Science, National Chiao Tung University, HsinChu, Taiwan, China

E-mail: estar.cs95g@nctu.edu.tw

Website:

Research Interests: Data Structures and Algorithms, Multimedia Information System, Computer Architecture and Organization, Autonomic Computing

Biography

Jun-Li Kuo (estar.cs95g@nctu.edu.tw) received his M.S. degree in Computer Science and Information Engineering from National Central University, Taiwan in 2006. He is a Ph.D. student in Computer Science at National Chiao Tung University, Taiwan. His research interests include peer-to-peer network and WiMax multimedia, cloud computing.

Author Articles
A Dynamic Self-Adjusted Buffering Mechanism for Peer-to-Peer Real-Time Streaming

By Jun-Li Kuo Chen-Hua Shih Yaw-Chung Chen

DOI: https://doi.org/10.5815/ijisa.2011.03.01, Pub. Date: 8 May 2011

Multimedia live stream multicasting and on-line real-time applications are popular recently. Real-time multicast system can use peer-to-peer technology to keep stability and scalability without any additional support from the underneath network or a server. Our proposed scheme focuses on the mesh architecture of peer-to-peer live streaming system and experiments with the buffering mechanisms. We design the dynamic buffer to substitute the traditional fixed buffer.

According to the existing measurements and our simulation results, using the traditional static buffer in a dynamic peer-to-peer environment has a limit of improving quality of service. In our proposed method, the buffering mechanism can adjust buffer to avoid the frozen or reboot of streaming based on the input data rate. A self-adjusted buffer control can be suitable for the violently dynamic peer-to-peer environment. Without any support of infrastructure and modification of peer-to-peer protocols, our proposed scheme can be workable in any chunk-based peer-to-peer streaming delivery. Hence, our proposed dynamic buffering mechanism varies the existing peer-to-peer live streaming system less to improve quality of experience more.

[...] Read more.
Other Articles