Characterizing Chord, Kelips and Tapestry algorithms in P2P streaming applications over wireless network

Author(s):  
Hung Nguyen Chan ◽  
Khang Nguyen Van ◽  
Giang Ngo Hoang
2013 ◽  
Vol 756-759 ◽  
pp. 1889-1893
Author(s):  
Lei Kai ◽  
Huang Huai ◽  
Wen Min Wang ◽  
Qiang Ma

P2P(peer to peer) live streaming is currently a popular research topic, but for the defective of system architecture and scheduling policy, existing P2P streaming applications have poor user experience, such as long startup delay, long playback delay, and low playback continuity. In this paper, we aim at reducing the playback delay from the source in the environment of heterogeneous upload bandwidth, heterogeneous and dynamic propagation delays. We propose a neighbor selection method in order to utilize the capacity of the peer and consider their scheduler playback deadline. This new peering strategy typically leads to low scheduling delays and improve the playback continuity. Finally we apply a receiver driven chunk selection with a mix scheduling algorithm. Through simulation, we can observe that our scheduler can outperform.


2014 ◽  
Vol 989-994 ◽  
pp. 4556-4561 ◽  
Author(s):  
Kai Lei ◽  
Li Hua Li ◽  
Cheng Peng ◽  
Long Yu Yu

P2P live streaming is a hot research topic of Internet, but for the defective of system architecture and scheduling policy, P2P streaming applications have poor user experience, such as long start-delay, long play-delay, and low play-continuity and so on. Firstly, based on the analysis of the advantages and disadvantages of previous works, this paper designed and implemented a hierarchical P2P streaming system. The system is composed by three layers: source management servers, region management servers, and peers. The underlying P2P overlay network is organized through Mesh-pull mechanism. We propose a new scheduling strategy to utilize the capacity of the peer. The new adaptive scheduling strategy considers the urgency and scarcity of the data blocks, and selects the appropriate neighbor nodes by monitoring neighbor nodes’ the maximum load. The study of a real-life system provides valuable insights for the future development of P2P live streaming systems.


SIMULATION ◽  
2019 ◽  
Vol 96 (2) ◽  
pp. 185-197
Author(s):  
Adel A Ahmed ◽  
Omar Barukab

Real-time video communication has become one of the most significant applications extensively used by homogeneous/heterogeneous wireless network technologies, such as Wi-Fi, the Internet of things, the wireless sensor network (WSN), 5G, etc. This leads to enhanced deployment of multimedia streaming applications over wireless network technologies. In order to accomplish the optimal performance of real-time multimedia streaming applications over the homogeneous/heterogeneous wireless network, it is therefore necessary to develop a simulation tool-set that effectively measures the quality of service (QoS) for different multimedia streaming applications over transport layer protocols. This paper proposes an autonomous simulation tool (AST) that is entirely independent from the source code of transport layer protocols. Furthermore, the AST is integrated into NS-2 to evaluate the QoS of real-time video streaming over numerous transport layer protocols and it uses new QoS measurement tools to test the video delivery quality based on I-frames to speeds up the assessment of multimedia streaming quality and ensure high accuracy of performance metrics. The simulation results show that using the AST to simulate real-time multimedia stream results in between 13% and 36% higher delivery ratio and 150–250% less cumulative jitter delay compared with using baseline simulation tools. Also, the AST guarantees an optimal QoS performance measurements in terms of the peak signal-to-noise Ratio and visual quality of the received video.


2007 ◽  
Vol 2007 ◽  
pp. 1-12 ◽  
Author(s):  
Sachin Agarwal ◽  
Jatinder Pal Singh ◽  
Shruti Dube

Peer-to-peer (P2P) systems are becoming a popular means of streaming audio and video content but they are prone to bandwidth starvation if selfish peers do not contribute bandwidth to other peers. We prove that an incentive mechanism can be created for a live streaming P2P protocol while preserving the asymptotic properties of randomized gossip-based streaming. In order to show the utility of our result, we adapt a distributed incentive scheme from P2P file storage literature to the live streaming scenario. We provide simulation results that confirm the ability to achieve a constant download rate (in time, per peer) that is needed for streaming applications on peers. The incentive scheme fairly differentiates peers' download rates according to the amount of useful bandwidth they contribute back to the P2P system, thus creating a powerful quality-of-service incentive for peers to contribute bandwidth to other peers. We propose a functional architecture and protocol format for a gossip-based streaming system with incentive mechanisms, and present evaluation data from a real implementation of a P2P streaming application.


Author(s):  
Majed Alhaisoni ◽  
Antonio Liotta

Media streaming is an essential element of many applications, including the emerging area of mobile systems and services. Internet broadcasting, conferencing, video-on-demand, online gaming, and a variety of other time-constrained applications are gaining significant momentum. Yet, streaming in a pervasive environment is not mature enough to address challenges such as scalability, heterogeneity, and latency. In a client-server system, streaming servers introduce computational and network bottlenecks affecting the scalability of the system and mobile client exhibit intermittent behavior and high-latency connections. This chapter explores ways that several proposed peer-to-peer (P2P) streaming systems deploy to address some of these challenges. An initial introduction on P2P network fundamentals and classifications provides the necessary background information to focus on and assimilate the different mechanisms that enable scalable and resilient streaming in a pervasive environment. The most interesting developments are presented in an accessible way by revisiting the features of common P2P streaming applications. This approach helps in identifying a range of burning research issues that are still undergoing investigation.


Author(s):  
Abhishek Bhattacharya ◽  
Zhenyu Yang ◽  
Deng Pan

Peer-to-Peer (P2P)-based approach for on-demand video streaming systems (P2P-VoD) characterized by asynchronous user-interactivity has proven to be practical and effective in recent years with real-world Internet-scale deployment (Huang, Li, & Ross, 2007). Current state-of-art P2P-VoD systems employ tracker server for discovering content suppliers which poses scalability and bottleneck issues. Temporal-DHT is a structured P2P based approach which can efficiently accommodate the large number of update operations with the continuous change of user’s playing position and supporting asynchronous jumps (Bhattacharya, Yang, & Zhang, 2010). The authors propose different query adaptation strategies based upon content popularity distributions and shortage bandwidth ratios which are proved to be effective in improving the performance of P2P streaming system by deriving certain optimized solutions. They formulate valuable optimization problems in the context of a P2P-VoD system such as minimization of query search cost, server bandwidth consumption, and a joint cost-load framework. The authors provide optimized solutions that achieve the best result for the above mentioned optimization objectives. They show extensive simulation studies under various scenarios of search cost, streaming quality, and other associated factors in a dynamic network environment where users are free to asynchronously join/leave the system.


Sign in / Sign up

Export Citation Format

Share Document