scholarly journals Analysis and Implementation of Gossip-Based P2P Streaming with Distributed Incentive Mechanisms for Peer Cooperation

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.

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.


2020 ◽  
pp. 208-215
Author(s):  
Mina N. Abadeer ◽  
Rowayda A. Sadek ◽  
Gamal I. Selim

Quality of live video streaming technology is based on quality of Experiences parameters (QoE). Approaching the peer-to-peer (P2P) or peer-assisted networks as a sympathetic solution is highly required, especially in light of its authentic scalability and its extremely low initial cost requirements. However, the design of robust, efficient, and performing P2P streaming systems remains a high challenge when real-time constraints are part of the quality of service (QoS), as in TV distribution or conferencing applications. One of the P2P main issues that affect the quality of streaming is the neighbor selection methodology. The proposed work presents an effective mesh-based neighbor selection approaches for video streaming – Uniform Peer Distribution Algorithm (UPDA) – based on QoS and QoE Parameters. UPDA shortens the latency to be ranging from 10 ms to 50 ms servicing up to 4000 online peers under failure / recovery tests. Simulation results demonstrate that the proposed UPDA achieves good performance in End-to End delay with a percentage of 10.4 % and packet delay variation about 2% compared to random neighbor selection method.


2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Yingcheng Zhang ◽  
Gang Zhao

The smart cities provide a better connection between services and citizens based on new Internet technologies. During the building process of smart cities, some burgeoning applications have been emerging and changing the daily lifestyle of people, e.g., live streaming applications. Especially, the live-soccer event applications have attracted much attention and can improve people’s enjoyment of life to a great extent, such as the Europe five major league matches and FIFA world cup. For such applications, the traditional routing strategies cannot do Quality-of-Service (QoS) awareness, and thus, the network performance and the Quality of Experience (QoE) of users cannot be guaranteed. In this paper, we employ Software-Defined Networking (SDN) to make QoS awareness for the special live-soccer event applications, in which the QoS-aware routing mechanism is proposed, called LSEA. Meanwhile, delay, delay jitter, and packet loss rate are considered as three objects. On this basis, the improved Dijkstra routing algorithm and SDN-based disjoint routing algorithm are devised. Finally, the proposed LSEA is implemented over Mininet, and the experimental results demonstrate its feasibility and efficiency.


2021 ◽  
Vol 10 (2) ◽  
pp. 30
Author(s):  
Radwan S. Abujassar ◽  
Husam Yaseen ◽  
Ahmad Samed Al-Adwan

Nowadays, networks use many different paths to exchange data. However, our research will construct a reliable path in the networks among a huge number of nodes for use in tele-surgery using medical applications such as healthcare tracking applications, including tele-surgery which lead to optimizing medical quality of service (m-QoS) during the COVID-19 situation. Many people could not travel due to the current issues, for fear of spreading the covid-19 virus. Therefore, our paper will provide a very trusted and reliable method of communication between a doctor and his patient so that the latter can do his operation even from a far distance. The communication between the doctor and his/her patient will be monitored by our proposed algorithm to make sure that the data will be received without delay. We test how we can invest buffer space that can be used efficiently to reduce delays between source and destination, avoiding loss of high-priority data packets. The results are presented in three stages. First, we show how to obtain the greatest possible reduction in rate variability when the surgeon begins an operation using live streaming. Second, the proposed algorithm reduces congestion on the determined path used for the online surgery. Third, we have evaluated the affection of optimal smoothing algorithm on the network parameters such as peak-to-mean ratio and delay to optimize m-QoS. We propose a new Smart-Rout Control algorithm (s-RCA) for creating a virtual smart path between source and destination to transfer the required data traffic between them, considering the number of hops and link delay. This provides a reliable connection that can be used in healthcare surgery to guarantee that all instructions are received without any delay, to be executed instantly. This idea can improve m-QoS in distance surgery, with trusted paths. The new s-RCA can be adapted with an existing routing protocol to track the primary path and monitor emergency packets received in node buffers, for direct forwarding via the demand path, with extended features.


Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 948
Author(s):  
Carlos Eduardo Maffini Santos ◽  
Carlos Alexandre Gouvea da Silva ◽  
Carlos Marcelo Pedroso

Quality of service (QoS) requirements for live streaming are most required for video-on-demand (VoD), where they are more sensitive to variations in delay, jitter, and packet loss. Dynamic Adaptive Streaming over HTTP (DASH) is the most popular technology for live streaming and VoD, where it has been massively deployed on the Internet. DASH is an over-the-top application using unmanaged networks to distribute content with the best possible quality. Widely, it uses large reception buffers in order to keep a seamless playback for VoD applications. However, the use of large buffers in live streaming services is not allowed because of the induced delay. Hence, network congestion caused by insufficient queues could decrease the user-perceived video quality. Active Queue Management (AQM) arises as an alternative to control the congestion in a router’s queue, pressing the TCP traffic sources to reduce their transmission rate when it detects incipient congestion. As a consequence, the DASH client tends to decrease the quality of the streamed video. In this article, we evaluate the performance of recent AQM strategies for real-time adaptive video streaming and propose a new AQM algorithm using Long Short-Term Memory (LSTM) neural networks to improve the user-perceived video quality. The LSTM forecast the trend of queue delay to allow earlier packet discard in order to avoid the network congestion. The results show that the proposed method outperforms the competing AQM algorithms, mainly in scenarios where there are congested networks.


2021 ◽  
Author(s):  
Shujjat A. Khan

The streaming capacity for a channel is defined as the maximum streaming rate that can be achieved by every user in the channel. In the thesis, we investigated the streaming capacity problem in both tree-based and mesh-based Peer-to-Peer (P2P) live streaming systems, respectively. In tree-based multi-channel P2P live streaming systems, we propose a crosschannel resource sharing approach to improve the streaming capacity. We use cross-channel helpers to establish the cross-channel overlay links, with which the unused upload bandwidths in a channel can be utilized to help the bandwidth-deficient peers in another channel, thus improving the streaming capacity. In meshed-based P2P live streaming systems, we propose a resource sharing approach to improve the streaming capacity. In mesh-based P2P streaming systems, each peer exchanges video chunks with a set of its neighbors. We formulate the streaming capacity problem into an optimal resource allocation problem. By solving the optimization problem, we can optimally allocate the link rates for each peer, thus improve the streaming capacity.


Author(s):  
Zaixi Shang ◽  
Joshua P. Ebenezer ◽  
Yongjun Wu ◽  
Hai Wei ◽  
Sriram Sethuraman ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document