基于P2P视频点播技术的流媒体平台设计与开发

随着流媒体应用在Internet上的流行,传统C/S模式的流媒体服务系统已经不能满足流媒体对服务器性能和高带宽的要求,严重阻碍了流媒体业务质量的提高和容量的扩大。本文介绍一种基于P2P网络的流媒体播放技术,它将P2P网络技术和流媒体技术结合起来,充分利用客户计算机的资源,减轻流媒体服务器和网络负载,突破了传统的流媒体播放系统带宽瓶颈,能够保持播放节目流完整而流畅。本文还采用MVC模式和Java语言以面向对象方法设计和开发P2P流媒体网站,利用P2P流媒体技术,实现校园流媒体的视频点播。     

iGridMedia: The system to provide low delay peer-to-peer live streaming service over internet

Commercial peer-to-peer live streaming services are getting popular nowadays, however, almost all systems target non-interactive applications. Few systems can address how to support interactive applications (such as online auction, person interview, video sharing & commenting, etc.) with peer-to-peer streaming technology. In an interactive channel, all or part of the participants can interact with the presenter or publisher at the source. Unlike existing P2P streaming service, there is different level of delay and synchronization requirements in interactive applications, meanwhile, the participant number in each channel is relatively small but the concurrent channel number is large. With such challenges, how much server bandwidth can be saved in P2P streaming is an interesting problem. We propose a very practical protocol iGridMedia and fully implement it. The basic tradeoff between consumed server bandwidth and the required delay is carefully studied. Simulation and real-world experiments show that our system consumes little server bandwidth under low delay even if the peer churn rate is very high and the peer bandwidth resource index is very limited.     

流媒体对象的缓存管理策略

基于流媒体服务的代理技术是流媒体研究领域中的重要课题.随着流媒体技术在Internet和无线网络环境中的高速发展,对流媒体代理服务器的研究也正在逐步深入.本文主要讨论通过代理技术改善媒体的服务质量,降低媒体的传输延迟以及减轻网络负载.在Internet环境下,对流媒体代理服务器的研究集中于流媒体的访问特性、缓存替换算法,构建和实现一个流媒体代理服务器是对流媒体代理技术研究的基础.     

一种基于Sever和Proxy流媒体流行性的Caching策略

1 概述经过了2000、2001两年的社区宽带网建设的高速发展后,摆在中国ISP们面前的任务是如何在已建成的宽带网上开展增值服务,许多ISP尝试在宽带网上开展流媒体(Streaming Media)服务,如视频点播VOD(Video On-Demand)系统。然而,流媒体对网络带宽和实时性的要求使得流服务器必须能够进行端对端(End-to-End)的拥塞控制和质量调整,由于     

种基于Sever和Proxy流媒体流行性的Caching策略

It is expected that by 2003, continuous media will account for more than 50% of the data available on origin servers. This will provoke a significant change in Internet workload, due to the high bandwidth requirements and the long-lived nature of digital video, streaming server loads and network bandwidths are proving to be major limiting factors. Aiming at the characteristic of broadband network in a residential area, we propose a popularitybased on server-proxy caching strategy for streaming media. According to a streaming media popularity on streaming server and proxy, this strategy caches the content of this streaming media partially or completely, and plays an important role in decreasing server load, reducing the traffic from streaming server to proxy, and improving the startup latency of the client.     

基于P2P的流媒体直播系统研究与设计*

根据当前流媒体播放系统存在的问题,设计了基于对等网络模式的流媒体直播系统,其中每个节点既是服务的消费者同时又是提供者,克服了当前流媒体系统在大规模用户时存在的服务器瓶颈问题,具有对网络带宽和服务器处理能力要求低,容易部署和扩展性高的特点。     

Adaptive topology formation for peer-to-peer video streaming

In this paper we propose an adaptive P2P video streaming framework to address the challenges due to bandwidth heterogeneity and peer churn on the Internet. This adaptive streaming framework consists of two major components, source rate adaptation and adaptive overlay topology formation, to maximize the video quality and fully utilize the overall peer upload capacity. In the source rate adaptation, the video server adapts the video source rate automatically based on the local measurement of peers’ download rates, so that the P2P network is not overloaded beyond its bandwidth capacity and peers are able to achieve smooth video playback. To combat bandwidth heterogeneity, we propose to construct a desirable link-level homogeneous overlay topology using a Markov chain Monte Carlo method, so that peers achieve an equal per-connection upload/download bandwidth. In this link-level homogeneous network, video flows do not encounter any bottlenecks along the delivery paths, and peers achieve high download rates to ensure smooth video playback. We also design a fully distributed algorithm to implement the dual mechanisms of the adaptive topology formation and the source rate maximization. To evaluate the performance of our streaming framework, we conduct both mathematical analysis and extensive simulations. The simulation results confirm our analysis and show that the proposed distributed algorithm is able to maximize the video playback quality with fast convergence.     

Loopback: exploiting collaborative caches for large-scale streaming

In this paper, we propose a Loopback approach in a two-level streaming architecture to exploit collaborative client/proxy buffers for improving the quality and efficiency of large-scale streaming applications. At the upper level we use a content delivery network (CDN) to deliver video from a central server to proxy servers. At the lower level a proxy server delivers video with the help of collaborative client caches. In particular, a proxy server and its clients in a local domain cache different portions of a video and form delivery loops. In each loop, a single video stream originates at the proxy, passes through a number of clients, and finally is passed back to the proxy. As a result, with limited bandwidth and storage space contributed by collaborative clients, we are able to significantly reduce the required network bandwidth, I/O bandwidth, and cache space of a proxy. Furthermore, we develop a local repair scheme to address the client failure issue for enhancing service quality and eliminating most required repairing load at the central server. For popular videos, our local repair scheme is able to handle most of single-client failures without service disruption and retransmissions from the central server. Our analysis and simulations have shown the effectiveness of the proposed scheme.     

Peer Assisted Video Streaming With Supply-Demand-Based Cache Optimization

In this paper, we consider a hybrid P2P video on-demand architecture that utilizes both the server and the peer resources for efficient transmission of popular videos. In our system architecture, each peer dedicates some cache space to store a particular segment of a video file as well as some of its upload bandwidth to serve the cached segment to other peers. Peers join the system and issue a streaming request to a control server. Control server directs the peers to streaming servers or to other peers who have the desired video segments. Control server also decides which peer should cache which video segment. Our main contribution in this paper is to determine the proper caching strategies at peers such that we minimize the average load on the streaming servers.      

Measurement study on P2P streaming systems

Originally used as the default infrastructure for efficient file sharing, peer-to-peer (P2P) architecture achieved great successes. Now, the P2P model has been adopted for many other distributed applications, such as instant message and phone services, Internet gaming, and large-scale scientific computing. In recent years, P2P streaming systems experienced tremendous growth and became one of the largest bandwidth consumers on the Internet. Compared to standard file sharing systems, the streaming services show unique characteristics with more stringent time constraints and require much higher network bandwidth. It is extremely important to evaluate and analyze existing applications, and investigate the merits and weaknesses in these systems for future development. In this paper, we conduct a comprehensive measurement study on two of the most popular P2P streaming systems, namely, PPLive and PPStream. They are very popular P2P streaming applications, and serving millions of registered users with hundreds of live TV channels and millions of other video clips. In our measurement, we deploy our collectors in China, and both live TV and video-on-demand (VoD) channels are evaluated. We record run-time network traffic on the client side, compare and analyze the characteristics of these channels based on their popularity. For both categories, we perceive that, in general, the two measured P2P streaming systems provide satisfactory experience to the audiences for all channels regardless of popularity. However, the most of data are downloaded from the dedicated servers for unpopular channels. We also observe that live TV channels show better peer coordination than VoD channels. Beside the traffic, we have also collected cache replacement information for VoD channels, and these measurement results can help us understand the caching mechanism of P2P streaming systems. With the support of the cache, VoD channels perform better than their counterparts in the live TV category in terms of data transmission, workload distribution, and signal traffic overhead. Overall, our results reveal that although P2P streaming systems can usually provide excellent viewing experience for popular channels, there are still challenges to fully support unpopular channels. New designs and algorithms are in urgent need, especially for unpopular live TV channels.     

Throughput optimization for video streaming proxy servers based on video staging

A video streaming proxy server needs to handle hundreds of simultaneous connections between media servers and clients. Inside, every video arrived at the server and delivered from it follows a specific arrival and delivery schedule. While arrival schedules compete for incoming network bandwidth, delivery schedules compete for outgoing network bandwidth. As a result, a proxy server has to provide sufficient buffer and disk cache for storage, together with memory space, disk space and disk bandwidth. In order to optimize the throughput, a proxy server has to govern the usage of these resources. In this paper, we first analyze the property of a traditional smoothing algorithm and a video staging algorithm. Then we develop, based on the smoothing algorithm, a video staging algorithm for video streaming proxy servers. This algorithm allows us to devise an arrival schedule based on the delivery schedule. Under this arrival and delivery schedule pair, we can achieve a better resource utilization rate gracefully between different parameter sets. It is also interesting to note that the usage of the resources such as network bandwidth, disk bandwidth and memory space becomes interchangeable. It provides the basis for inter-resource scheduling to further improve the throughput of a video streaming proxy server system.

A new fast friendly window-based congestion control for real-time streaming media transmission

1 Introduction In the current Internet, not all applications use TCP and they do not follow the same concept of fairly sharing the available bandwidth. The rapid growing of real-time streaming media applications will bring much UDP traffic without integrating TCP compatible congestion control mechanism into Internet. It threats the quality of service (QoS) of real-time applications and the stability of the current Internet. For this reason, it is desirable to define appropriate rate rule…     

局域网流媒体Caching代理服务器的实现

With the widespread use of streaming media application on the Internet, a significant change in Internet workload will be provoked.Caching is one kind of applied technique relatively for enhancing the scalability of streaming system and reducing the workload of server/network. We have utilized RTP/RTSP protocol, and implemented the prototype of streaming proxy caching based on LAN in visual C-t-t-environment with WINSOCK network interface. This system can play a role in decreasing server load, reducing the traffic from streaming server to proxy, and improving the Start-up latency of the client.     

Cost-based cache replacement and server selection for multimedia proxy across wireless Internet

Multimedia proxy plays an important role in multimedia streaming over wireless Internet. Since wireless network exhibits different characteristics from the Internet, multimedia proxy caching over wireless Internet faces additional challenges. In this paper, we present a study of cache replacement for a single server and server selection for multiple servers across wireless Internet. By considering multiple objectives of multimedia proxy, we design a unified cost metric to measure proxy performance in wireless Internet. Based on the defined unified cost metric, we propose a novel replacement algorithm for single-server and a new server-selection policy for multiple servers to improve the end-to-end performance such as throughput, media quality, and start-up latency. To effectively handle errors occurred on wireless link, channel-adaptive unequal error protection is deployed according to distinct quality of service requirements of layered or scalable media. Simulation results demonstrate that our approaches achieve significantly better performance than the known cache-replacement algorithms and sever selection schemes, respectively.     

基于P2P的3G流媒体代理缓存策略

3G时代已经到来,伴随着3G的快速发展,移动流媒体服务的需求迅速增长。由于移动网络带宽远达不到互联网的带宽,流媒体业务的增长将增加网络延迟,影响流媒体的观看质量,因此提出了一种新的基于P2P的3G流媒体缓存代理结构PSPA,配合PSPA设计了代理缓存置换策略SCOP,该设计能有效降低对移动核心网带宽的占用。最后,仿真实验和实验结果分析表明,PSPA体系与代理缓存置换策略SCOP的结合,能有效提高移动流媒体的服务质量,对3G流媒体的应用具有一定的参考价值。     

流媒体代理缓存和预取方法的研究

代理缓存可以降低用户的启动延迟，减轻网络流量和服务器的负载，且在Web中也已广泛使用。但由于流媒体和非流媒体(文本，图像)有着显著的区别，目前，支持流媒体的代理缓存技术还面临着许多挑战。文中针对流媒体的数据量大和高带宽需求等特性，对支持流媒体的代理缓存和预取方法进行了总结。调研、分类、比较了目前已有的一些缓存算法和预取算法的优缺点，为下一步的研究提供启发和借鉴作用，同时指出将来的研究方向和热点问题。     

一种分层P2 P流媒体系统重叠网的构建策略

基于Peer-to-Peer(P2P)技术的流媒体应用具有部署效率高及可扩展性好等突出优势。而采用分层视频编码技术的P2P流媒体系统把原视频流分解为多个视频层数据进行分发,让节点能够选择与自己带宽资源相匹配的视频质量,使其很好地适应节点的异构性。但是各分层视频数据传输的路径存在较大差异,使重叠网构建策略面临更大的挑战。因此定义了基于分层视频编码技术环境下的P2P流媒体重叠网络构建问题,并证明该问题是一个NP难问题。提出了一种构建重叠网的集中启发式算法,同时还提出了一种基于视频组(Streaming Group)的分布式重叠网络构建策略。通过大规模网络仿真实验验证了基于该分布式重叠网构建策略的分层流媒体系统具备低服务器带宽占用、高数据获取率等优点。     

Cooperative Media Data Streaming with Scalable Video Coding

Live peer-to-peer (P2P) streaming has become a promising approach for broadcasting non-interactive media content from a server to a large number of interested clients. However, it still faces many challenges such as high churn rate of peer clients, uplink bandwidth constraints of participating peers, and heterogeneity of client throuput capacities. This paper presents a new P2P network called LSONet, a collaborative peer-to-peer streaming framework for scalable layer-encoded bit streams. The contributions are the combination of the advantages of both layered conding and mesh-based packet exchange. With layered coding, it overcomes overlay bandwidth limitatioins and heterogeneity of client capacities. With mesh based overlay streaming, it can better handle peer churns, as compared to tree-based solutions. For achieving these targets, this paper employs a gossip-based data-driven scheme for partnership formation, and proposes two algorithms, optimized transmission policy (OTP) and graceful degradation scheme (GDS), for multi-layers allocation. The proposed system is completely self-organizing, and in a fully distributed fashion. Extensive simulations show that LSONet achieves higher quality of service by peer-assisted streaming and layered video coding. Also, through comparison, results show that the system outperforms some previous schemes in resource utilization and is more robust and resilient for nodes departure, which demonstrate that it is well-suited for quality adaptive live streaming applications.     

Providing Controlled Quality Assurance for Streaming Stored-Videos Across the Internet Using VPNs

Video Streaming across wide-area networks is one of the most important applications on the Internet. In this paper we focus on the quality assurance issue on best-effort networks and propose a practical technique, named staggered two-flow video streaming. We deliver a stored video through two separate flows in a staggered fashion via a VPN pipe from a central server to a proxy server. One flow containing the essential portion of the video is delivered using a novel controlled TCP (cTCP), and the other flow containing the enhanced portion of the video is transmitted using a rate-controlled RTP/UDP (rUDP). To provide video-quality assurance in such a system, we design several application-aware flow-control and adaptation approaches to control bandwidth sharing and interactions among flows by exploiting the inherent priority structure in videos, the storage space on proxy servers and the coarse-grain bandwidth assurance of VPN. Our experiments using FreeBSD and simulations on NS2 both have demonstrated the efficacy of the proposed technique in protecting essential data and significantly reducing the numbers of packets retransmitted/lost in transmission and the sizes of video prefixes required on proxy servers. In summary, our application-aware approach provides stable and predictable performance in streaming videos across wide-area best-effort networks. In addition, another salient feature of our approach is that it requires no changes on the client-receiving side and minimal changes on the server-sending side.     

Fast proxy delivery of multiple streaming sessions in shared running buffers

With the falling price of memory, an increasing number of multimedia servers and proxies are now equipped with a large memory space. Caching media objects in the memory of a proxy helps to reduce the network traffic, the disk I/O bandwidth requirement, and the data delivery latency. The running buffer approach and its alternatives are representative techniques to caching streaming data in the memory. There are two limits in the existing techniques. First, although multiple running buffers for the same media object co-exist in a given processing period, data sharing among multiple buffers is not considered. Second, user access patterns are not insightfully considered in the buffer management. In this paper, we propose two techniques based on shared running buffers in the proxy to address these limits. Considering user access patterns and characteristics of the requested media objects, our techniques adaptively allocate memory buffers to fully utilize the currently buffered data of streaming sessions, with the aim to reduce both the server load and the network traffic. Experimentally comparing with several existing techniques, we show that the proposed techniques achieve significant performance improvement by effectively using the shared running buffers.