The integration of reliable Video-on-Demand (VoD) broadcasting schemes in the DVB-h transmission system is studied, exemplary for Pyramid Broadcasting (PB). Sophisticated VoD broadcasting schemes such as PB allow rece...The integration of reliable Video-on-Demand (VoD) broadcasting schemes in the DVB-h transmission system is studied, exemplary for Pyramid Broadcasting (PB). Sophisticated VoD broadcasting schemes such as PB allow receivers to tune into the ongoing transmission of a video-stream at arbitrary time, while still being able to receive the multimedia sequence from the beginning to end, after a short initial playout latency. Raptor coding, integrated in the FLUTE protocol, is combined with the traditional PB scheme in order to provide high service and presentation reliability. We give a short overview on the DVB-h transmission system as well as on the FLUTE protocol. We present and discuss options for the integration of VoD broadcasting schemes in combination with Raptor coding. We achieve backward-compatibility even with terminals not supporting Raptor coding. Simulation results show the benefits of the discussed VoD scheme compared to existing carousel approaches in DVB-h.展开更多
Although Video-On-Demand (VOD) has been in existence for years, its cross-platform applicability in cloud service environments is still in increasing need. In this paper, an Adaptive Video-On-Demand (AVOD) framework t...Although Video-On-Demand (VOD) has been in existence for years, its cross-platform applicability in cloud service environments is still in increasing need. In this paper, an Adaptive Video-On-Demand (AVOD) framework that is suitable for private cloud environments is proposed. Private cloud has the key advantage of satisfying the real need of both consumers and providers. Hence, demands such as reasonable benefits for provider and high quality for consumers are essential design considerations in this framework. The difficulty is that these two factors are always high in one end and low in the other, and hard to find a delicate balance. Cloud service could be an opportunity for the multimedia providers to obtain higher benefits and cost less for the consumers but with an even better quality in service. An adaptive framework for such a cloud service environment is proposed to resolve this problem. Some interesting phenomena are observed from the experimental results including CPU utilization, data reading and writing speed, memory usage, port configuration execution time, and bandwidth.展开更多
Video-on-demand （VoD） services have become popular on the Internet in recent years. In VoD, it is challeng- ing to support the VCR functionality, especially the jumps, while maintaining a smooth streaming quality. P...Video-on-demand （VoD） services have become popular on the Internet in recent years. In VoD, it is challeng- ing to support the VCR functionality, especially the jumps, while maintaining a smooth streaming quality. Previous stud- ies propose to solve this problem by predicting the jump tar- get locations and prefetching the contents. However, through our analysis on traces from a real-world VoD service, we find that it would be fundamentally difficult to improve a viewer＇s VCR experience by simply predicting his future jumps, while ignoring the intentions behind these jumps. Instead of the prediction-based approach, in this paper, we seek to support the VCR functionality by bookmark- ing the videos. There are two key techniques in our pro- posed methodology. First, we infer and differentiate view- ers＇ intentions in VCR jumps by decomposing the inter- seek times, using an expectation-maximization （EM） algo- rithm, and combine the decomposed inter-seek times with the VCR jumps to compute a numerical interest score for each video segment. Second, based on the interest scores, we pro- pose an automated video bookrnarking algorithm. The algo- rithm employs the time-series change detection techniques of CUSUM and MB-GT, and bookmarks videos by detecting the abrupt changes on their interest score sequences. We evaluate our proposed techniques using real-world VoD traces from dozens of videos. Experimental results suggest that with our methods, viewers＇ interests within a video can be precisely extracted, and we can position bookmarks on the video＇shighlight events accurately. Our proposed video bookmark- ing methodology does not require any knowledge on video type, contents, and semantics, and can be applied on various types of videos.展开更多
Nowadays,video streaming applications are becoming one of the tendencies driving vehicular network users.In this work,considering the unpredictable vehicle density,the unexpected acceleration or deceleration of the di...Nowadays,video streaming applications are becoming one of the tendencies driving vehicular network users.In this work,considering the unpredictable vehicle density,the unexpected acceleration or deceleration of the different vehicles included in the vehicular traffic load,and the limited radio range of the employed communication scheme,we introduce the“Dynamic Vehicular Clustering”(DVC)algorithm as a new scheme for video streaming systems over vehicular ad-hoc networks(VANET).The proposed algorithm takes advantage of the small cells concept and the introduction of wireless backhauls,inspired by the different features and the performance of the Long Term Evolution(LTE)-Advanced network.Vehicles are clustered together to form dynamically ad-hoc sub-networks included in the vehicular network.The goal of our clustering algorithm is to take into account several characteristics,such as the vehicle’s position and acceleration to reduce latency and packet loss.Therefore,each cluster is counted as a small cell containing vehicular nodes and an access point that is elected regarding some particular specifications.Based on the exceptional features of the LTE-Advanced network(small cells and wireless backhauls)the DVC algorithm is a promising scheme for video streaming services over VANET systems.Experiments were carried out with a virtual topology of the VANET network created with four clusters to implement the DVC algorithm.The results were compared with other algorithms such as Virtual Trust-ability Data transmission(VTD),Named Data Networking(NDN),and Socially Aware Security Message Forwarding(SASMF).Our algorithm can effectively improve the transmission rate of data packets at the expense of a slight increase in end-to-end delay and control overhead.展开更多
Peer-to-peer (P2P) networking is a distributed architecture that partitions tasks or data between peer nodes. In this paper, an efficient Hypercube Sequential Matrix Partition (HS-MP) for efficient data sharing in P2P...Peer-to-peer (P2P) networking is a distributed architecture that partitions tasks or data between peer nodes. In this paper, an efficient Hypercube Sequential Matrix Partition (HS-MP) for efficient data sharing in P2P Networks using tokenizer method is proposed to resolve the problems of the larger P2P networks. The availability of data is first measured by the tokenizer using Dynamic Hypercube Organization. By applying Dynamic Hypercube Organization, that efficiently coordinates and assists the peers in P2P network ensuring data availability at many locations. Each data in peer is then assigned with valid ID by the tokenizer using Sequential Self-Organizing (SSO) ID generation model. This ensures data sharing with other nodes in large P2P network at minimum time interval which is obtained through proximity of data availability. To validate the framework HS-MP, the performance is evaluated using traffic traces collected from data sharing applications. Simulations conducting using Network simulator-2 show that the proposed framework outperforms the conventional streaming models. The performance of the proposed system is analyzed using energy consumption, average latency and average data availability rate with respect to the number of peer nodes, data size, amount of data shared and execution time. The proposed method reduces the energy consumption 43.35% to transpose traffic, 35.29% to bitrev traffic and 25% to bitcomp traffic patterns.展开更多
Peer-to-peer(P2P) swarm technologies have been shown to be very efficient for large scale content distribution systems, such as the well-known BitTorrent and eMule applications.However, these systems have been designe...Peer-to-peer(P2P) swarm technologies have been shown to be very efficient for large scale content distribution systems, such as the well-known BitTorrent and eMule applications.However, these systems have been designed for generic file sharing with little consideration of media streaming support, and the user cannot start a movie playback before it is completely downloaded.The playing-as-downloading capability would be particularly useful for a downloading peer to evaluate if a movie is valuable to be downloaded, and it could also help the P2P content distribution system to locate and eliminate the polluted contents.In this paper we address this issue by introducing a new algorithm, wish driven chunk distribution(WDCD), which enables the P2P file sharing system to support the video-on-demand(VOD) function while keeping the P2P native downloading speed.A new parameter named next-play-frequency is added to the content chunk to strike a replication balance between downloading and streaming requests.We modify the eMule as the test bed by adding the WDCD algorithm and then verify the prototype implementation by experiments.The experimental results show that the proposed algorithm can keep the high downloading throughput performance of the eMule system with a good playing-as-downloading function.展开更多
With the development of wireless network and the popularity of mobile terminal devices,users can watch videos through both the traditional fixed terminals and smart mobile terminals.However,network resources cannot be...With the development of wireless network and the popularity of mobile terminal devices,users can watch videos through both the traditional fixed terminals and smart mobile terminals.However,network resources cannot be effectively shared between fixed terminals and mobile terminals,which causes a huge waste of resources.To solve this problem,this paper proposes a super peer-based P2P VoD architecture for supporting multiple terminals.In the architecture,resources of various terminals can be shared and server load can be reduced.An architecture was first built based on super peers.And then,a super peer selection algorithm was proposed to select super peers to manage other terminals.Considering the characteristics of the different types of terminals,a corresponding caching mechanism was designed for different terminals to achieve efficient resource sharing.Final,the maintenance of the architecture was discussed.The experiment demonstrates that the architecture is feasible.The architecture can effectively improve the quality and fluency of video playback,and reduce the server load.展开更多
文摘The integration of reliable Video-on-Demand (VoD) broadcasting schemes in the DVB-h transmission system is studied, exemplary for Pyramid Broadcasting (PB). Sophisticated VoD broadcasting schemes such as PB allow receivers to tune into the ongoing transmission of a video-stream at arbitrary time, while still being able to receive the multimedia sequence from the beginning to end, after a short initial playout latency. Raptor coding, integrated in the FLUTE protocol, is combined with the traditional PB scheme in order to provide high service and presentation reliability. We give a short overview on the DVB-h transmission system as well as on the FLUTE protocol. We present and discuss options for the integration of VoD broadcasting schemes in combination with Raptor coding. We achieve backward-compatibility even with terminals not supporting Raptor coding. Simulation results show the benefits of the discussed VoD scheme compared to existing carousel approaches in DVB-h.
文摘Although Video-On-Demand (VOD) has been in existence for years, its cross-platform applicability in cloud service environments is still in increasing need. In this paper, an Adaptive Video-On-Demand (AVOD) framework that is suitable for private cloud environments is proposed. Private cloud has the key advantage of satisfying the real need of both consumers and providers. Hence, demands such as reasonable benefits for provider and high quality for consumers are essential design considerations in this framework. The difficulty is that these two factors are always high in one end and low in the other, and hard to find a delicate balance. Cloud service could be an opportunity for the multimedia providers to obtain higher benefits and cost less for the consumers but with an even better quality in service. An adaptive framework for such a cloud service environment is proposed to resolve this problem. Some interesting phenomena are observed from the experimental results including CPU utilization, data reading and writing speed, memory usage, port configuration execution time, and bandwidth.
文摘Video-on-demand （VoD） services have become popular on the Internet in recent years. In VoD, it is challeng- ing to support the VCR functionality, especially the jumps, while maintaining a smooth streaming quality. Previous stud- ies propose to solve this problem by predicting the jump tar- get locations and prefetching the contents. However, through our analysis on traces from a real-world VoD service, we find that it would be fundamentally difficult to improve a viewer＇s VCR experience by simply predicting his future jumps, while ignoring the intentions behind these jumps. Instead of the prediction-based approach, in this paper, we seek to support the VCR functionality by bookmark- ing the videos. There are two key techniques in our pro- posed methodology. First, we infer and differentiate view- ers＇ intentions in VCR jumps by decomposing the inter- seek times, using an expectation-maximization （EM） algo- rithm, and combine the decomposed inter-seek times with the VCR jumps to compute a numerical interest score for each video segment. Second, based on the interest scores, we pro- pose an automated video bookrnarking algorithm. The algo- rithm employs the time-series change detection techniques of CUSUM and MB-GT, and bookmarks videos by detecting the abrupt changes on their interest score sequences. We evaluate our proposed techniques using real-world VoD traces from dozens of videos. Experimental results suggest that with our methods, viewers＇ interests within a video can be precisely extracted, and we can position bookmarks on the video＇shighlight events accurately. Our proposed video bookmark- ing methodology does not require any knowledge on video type, contents, and semantics, and can be applied on various types of videos.
文摘Nowadays,video streaming applications are becoming one of the tendencies driving vehicular network users.In this work,considering the unpredictable vehicle density,the unexpected acceleration or deceleration of the different vehicles included in the vehicular traffic load,and the limited radio range of the employed communication scheme,we introduce the“Dynamic Vehicular Clustering”(DVC)algorithm as a new scheme for video streaming systems over vehicular ad-hoc networks(VANET).The proposed algorithm takes advantage of the small cells concept and the introduction of wireless backhauls,inspired by the different features and the performance of the Long Term Evolution(LTE)-Advanced network.Vehicles are clustered together to form dynamically ad-hoc sub-networks included in the vehicular network.The goal of our clustering algorithm is to take into account several characteristics,such as the vehicle’s position and acceleration to reduce latency and packet loss.Therefore,each cluster is counted as a small cell containing vehicular nodes and an access point that is elected regarding some particular specifications.Based on the exceptional features of the LTE-Advanced network(small cells and wireless backhauls)the DVC algorithm is a promising scheme for video streaming services over VANET systems.Experiments were carried out with a virtual topology of the VANET network created with four clusters to implement the DVC algorithm.The results were compared with other algorithms such as Virtual Trust-ability Data transmission(VTD),Named Data Networking(NDN),and Socially Aware Security Message Forwarding(SASMF).Our algorithm can effectively improve the transmission rate of data packets at the expense of a slight increase in end-to-end delay and control overhead.
文摘Peer-to-peer (P2P) networking is a distributed architecture that partitions tasks or data between peer nodes. In this paper, an efficient Hypercube Sequential Matrix Partition (HS-MP) for efficient data sharing in P2P Networks using tokenizer method is proposed to resolve the problems of the larger P2P networks. The availability of data is first measured by the tokenizer using Dynamic Hypercube Organization. By applying Dynamic Hypercube Organization, that efficiently coordinates and assists the peers in P2P network ensuring data availability at many locations. Each data in peer is then assigned with valid ID by the tokenizer using Sequential Self-Organizing (SSO) ID generation model. This ensures data sharing with other nodes in large P2P network at minimum time interval which is obtained through proximity of data availability. To validate the framework HS-MP, the performance is evaluated using traffic traces collected from data sharing applications. Simulations conducting using Network simulator-2 show that the proposed framework outperforms the conventional streaming models. The performance of the proposed system is analyzed using energy consumption, average latency and average data availability rate with respect to the number of peer nodes, data size, amount of data shared and execution time. The proposed method reduces the energy consumption 43.35% to transpose traffic, 35.29% to bitrev traffic and 25% to bitcomp traffic patterns.
基金Project (No. 2005C11001-02) supported by the Science and Technology Plan of Zhejiang Province, China
文摘Peer-to-peer(P2P) swarm technologies have been shown to be very efficient for large scale content distribution systems, such as the well-known BitTorrent and eMule applications.However, these systems have been designed for generic file sharing with little consideration of media streaming support, and the user cannot start a movie playback before it is completely downloaded.The playing-as-downloading capability would be particularly useful for a downloading peer to evaluate if a movie is valuable to be downloaded, and it could also help the P2P content distribution system to locate and eliminate the polluted contents.In this paper we address this issue by introducing a new algorithm, wish driven chunk distribution(WDCD), which enables the P2P file sharing system to support the video-on-demand(VOD) function while keeping the P2P native downloading speed.A new parameter named next-play-frequency is added to the content chunk to strike a replication balance between downloading and streaming requests.We modify the eMule as the test bed by adding the WDCD algorithm and then verify the prototype implementation by experiments.The experimental results show that the proposed algorithm can keep the high downloading throughput performance of the eMule system with a good playing-as-downloading function.
基金the National Natural Science Foundation(No.61762029,No.U1811264,No.61662012)Guangxi Natural Science Foundation(No.2016GXNSFAA380193)+1 种基金Guangxi Key Laboratory of Trusted Software(No.kx201726)and the Foundation of Key Laboratory of Cognitive Radio and Information Processing,Ministry of Education(No.CRKL150105)。
文摘With the development of wireless network and the popularity of mobile terminal devices,users can watch videos through both the traditional fixed terminals and smart mobile terminals.However,network resources cannot be effectively shared between fixed terminals and mobile terminals,which causes a huge waste of resources.To solve this problem,this paper proposes a super peer-based P2P VoD architecture for supporting multiple terminals.In the architecture,resources of various terminals can be shared and server load can be reduced.An architecture was first built based on super peers.And then,a super peer selection algorithm was proposed to select super peers to manage other terminals.Considering the characteristics of the different types of terminals,a corresponding caching mechanism was designed for different terminals to achieve efficient resource sharing.Final,the maintenance of the architecture was discussed.The experiment demonstrates that the architecture is feasible.The architecture can effectively improve the quality and fluency of video playback,and reduce the server load.
