More and more modern group oriented collaborativeapplications use the peer-to-peer(P2P)paradigm tobe independent of expensive infrastructures as theyare,for instance,provided for audio and video conferencesby H.323 sy...More and more modern group oriented collaborativeapplications use the peer-to-peer(P2P)paradigm tobe independent of expensive infrastructures as theyare,for instance,provided for audio and video conferencesby H.323 systems.Decentralized collaborativeP2P solutions require appropriate mechanismsto protect group privacy and data integrity.A centralizedclient/server based video conference system canbe well shielded in a standard manner,whilst thereare no off-the-shelf approaches to secure a P2P videoconference up to now.The paper addresses this issueand presents a flexible security architecture.Usingthe BRAVIS system[4]as an example it shows howthe architecture can be embedded into a P2P videoconferencing system.展开更多
Conventionally, P2P video is regarded as CBR traffic. However, our measurements have shown that the rate reset cannot be neglected in a practical IPTV system because each rate reset often leads to performance degradat...Conventionally, P2P video is regarded as CBR traffic. However, our measurements have shown that the rate reset cannot be neglected in a practical IPTV system because each rate reset often leads to performance degradation. Thus, addressing the problem of inferring playback rate and rate reset in a P2P video system is significant. In this article, an algorithm termed piecewise linear envelope approximation （PLEA） is proposed, in which a follow-up time is introduced to smooth rate fluctuations in a small time scale and to adapt rate jumps in a large time scale automatically. With the PLEA algorithm, discontinuity introduced by blind segmentations adopted by current methods is avoided. Furthermore, unlike existing algorithms in which both segmentation and combinations are performed in multiple runs, only a single computation path is involved in the PLEA algorithm. This makes PLEA algorithm amenable to implementation of low complexity by either software or hardware. Both theoretical analysis and experiment based on measured data show that the PLEA outperforms existing algorithms based on segmentation.展开更多
We are interested in providing Video-on-Demand (VoD) streaming service to a large population of clients using peer-to-peer (P2P) approach. Given the asynchronous demands from multiple clients, continuously changing of...We are interested in providing Video-on-Demand (VoD) streaming service to a large population of clients using peer-to-peer (P2P) approach. Given the asynchronous demands from multiple clients, continuously changing of the buffered contents, and the continuous video display requirement, how to collaborate with potential partners to get expected data for future content delivery are very important and challenging. In this paper, we develop a novel scheduling algorithm based on deadline- aware network coding (DNC) to fully exploit the network resource for efficient VoD service. DNC generalizes the existing net- work coding (NC) paradigm, an elegant solution for ubiquitous data distribution. Yet, with deadline awareness, DNC improves the network throughput and meanwhile avoid missing the play deadline in high probability, which is a major deficiency of the con- ventional NC. Extensive simulation results demonstrated that DNC achieves high streaming continuity even in tight network conditions.展开更多
A P2P approaches to extend the ability of Video on Demand systems to serve more users. In the proposed system users share with each other the media data obtained and the media server is no longer the only source to ge...A P2P approaches to extend the ability of Video on Demand systems to serve more users. In the proposed system users share with each other the media data obtained and the media server is no longer the only source to get data from, thereby, the load on the media server could be greatly alleviated and the overall system capacity increases and more users could be served. The P2P streaming system introduces efficient searching;data transfer dynamically monitoring and initial buffering to maintain a high quality of playback. Its provider selection policy helps to reduce the load of the underlying network by avoiding remote data transfer.展开更多
在深入研究RTMFP协议的工作原理及其实现过程的基础上,分析了该协议的新特性及其在实时通信领域中的优势,并将其应用于P2P视频通信中。结合ActionScript和Flash Media Server等技术和产品,实现了一个P2P视频通信应用原型,并对其具体的...在深入研究RTMFP协议的工作原理及其实现过程的基础上,分析了该协议的新特性及其在实时通信领域中的优势,并将其应用于P2P视频通信中。结合ActionScript和Flash Media Server等技术和产品,实现了一个P2P视频通信应用原型,并对其具体的应用方法和实现方式进行了探索和阐述。研究表明,该协议提供了一种新的低成本且高质量的P2P视频通信方案,具有一定的实用性和创新性。展开更多
文摘More and more modern group oriented collaborativeapplications use the peer-to-peer(P2P)paradigm tobe independent of expensive infrastructures as theyare,for instance,provided for audio and video conferencesby H.323 systems.Decentralized collaborativeP2P solutions require appropriate mechanismsto protect group privacy and data integrity.A centralizedclient/server based video conference system canbe well shielded in a standard manner,whilst thereare no off-the-shelf approaches to secure a P2P videoconference up to now.The paper addresses this issueand presents a flexible security architecture.Usingthe BRAVIS system[4]as an example it shows howthe architecture can be embedded into a P2P videoconferencing system.
基金supported by the National Natural Science Foundation of China(60672069,60772043)the National Basic Research Program of China(2007CB307101)
文摘Conventionally, P2P video is regarded as CBR traffic. However, our measurements have shown that the rate reset cannot be neglected in a practical IPTV system because each rate reset often leads to performance degradation. Thus, addressing the problem of inferring playback rate and rate reset in a P2P video system is significant. In this article, an algorithm termed piecewise linear envelope approximation （PLEA） is proposed, in which a follow-up time is introduced to smooth rate fluctuations in a small time scale and to adapt rate jumps in a large time scale automatically. With the PLEA algorithm, discontinuity introduced by blind segmentations adopted by current methods is avoided. Furthermore, unlike existing algorithms in which both segmentation and combinations are performed in multiple runs, only a single computation path is involved in the PLEA algorithm. This makes PLEA algorithm amenable to implementation of low complexity by either software or hardware. Both theoretical analysis and experiment based on measured data show that the PLEA outperforms existing algorithms based on segmentation.
基金Project (No. DAG05/06.EG05) supported by the Research GrantCouncil (RGC) of Hong Kong, China
文摘We are interested in providing Video-on-Demand (VoD) streaming service to a large population of clients using peer-to-peer (P2P) approach. Given the asynchronous demands from multiple clients, continuously changing of the buffered contents, and the continuous video display requirement, how to collaborate with potential partners to get expected data for future content delivery are very important and challenging. In this paper, we develop a novel scheduling algorithm based on deadline- aware network coding (DNC) to fully exploit the network resource for efficient VoD service. DNC generalizes the existing net- work coding (NC) paradigm, an elegant solution for ubiquitous data distribution. Yet, with deadline awareness, DNC improves the network throughput and meanwhile avoid missing the play deadline in high probability, which is a major deficiency of the con- ventional NC. Extensive simulation results demonstrated that DNC achieves high streaming continuity even in tight network conditions.
文摘A P2P approaches to extend the ability of Video on Demand systems to serve more users. In the proposed system users share with each other the media data obtained and the media server is no longer the only source to get data from, thereby, the load on the media server could be greatly alleviated and the overall system capacity increases and more users could be served. The P2P streaming system introduces efficient searching;data transfer dynamically monitoring and initial buffering to maintain a high quality of playback. Its provider selection policy helps to reduce the load of the underlying network by avoiding remote data transfer.
文摘在深入研究RTMFP协议的工作原理及其实现过程的基础上,分析了该协议的新特性及其在实时通信领域中的优势,并将其应用于P2P视频通信中。结合ActionScript和Flash Media Server等技术和产品,实现了一个P2P视频通信应用原型,并对其具体的应用方法和实现方式进行了探索和阐述。研究表明,该协议提供了一种新的低成本且高质量的P2P视频通信方案,具有一定的实用性和创新性。
