Priority-based scheduling scheme for live video streaming in peer-to-peer network

Pal, Kunwar; Govil, Mahesh Chandra; Ahmed, Mushtaq

doi:10.1007/s11042-018-5741-y

Cited by 10 publications

(4 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors' effort in [36,37] was that peer with higher upload bandwidths would have a higher pull rate. In [38], a priority-based scheduling algorithm is used for chunk selection in which parameters such as deadline, rarity, layer number, and packet size are used to prioritise chunks and a bandwidth-aware approach is also used to select peers. References such as [4,39] have provided more comprehensive studies of pullbased scheduling schemes.…”

Section: Related Workmentioning

confidence: 99%

WidePLive: a coupled low‐delay overlay construction mechanism and peer‐chunk priority‐based chunk scheduling for P2P live video streaming

et al. 2020

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

WidePLive: a coupled low‐delay overlay construction mechanism and peer‐chunk priority‐based chunk scheduling for P2P live video streaming

et al. 2020

View full text Add to dashboard Cite

“…Several other works are related to P2P streaming in mobile Adhoc networks (MANET) [15] or P2P live streaming [16][17][18]. Hu et al [15] used a delay-sensitive segment scheduling strategy to provide timely P2P streaming services in mobile Adhoc networks.…”

Section: Related Workmentioning

confidence: 99%

“…In their scheme, the start-up buffer location of the new peer is defined based on the start-up-based selection process, and the block and peer are selected simultaneously in the scheduling scheme. The authors of [18] proposed a Priority-based Scheduling Scheme (PrSS). The PrSS considers four factors at the same time, including a deadline, rarity and layer number for chunk selection as will as variable size chunk selection strategy.…”

Section: Related Workmentioning

confidence: 99%

MOPSO-based Data Scheduling Scheme for P2P Streaming Systems

2019

KSII TIIS

View full text Add to dashboard Cite

In the Peer-to-Peer (P2P) streaming systems, peers randomly form a network overlay to share video resources with a data scheduling scheme. A data scheduling scheme can have a great impact on system performance, which should achieve two optimal objectives at the same time ideally. The two optimization objectives are to improve the perceived video quality and maximize the network throughput, respectively. Maximizing network throughput means improving the utilization of peer's upload bandwidth. However, maximizing network throughput will result in a reduction in the perceived video quality, and vice versa. Therefore, to achieve the above two objects simultaneously, we proposed a new data scheduling scheme based on multi-objective particle swarm optimization data scheduling scheme, called MOPSO-DS scheme. To design the MOPSO-DS scheme, we first formulated the data scheduling optimization problem as a multi-objective optimization problem. Then, a multi-objective particle swarm optimization algorithm is proposed by encoding the neighbors of peers as the position vector of the particles. Through extensive simulations, we demonstrated the MOPSO-DS scheme could improve the system performance effectively.

show abstract

“…The potential of P2P technology for enhancing video streaming has been extensively researched over the past two decades, as evidenced by numerous studies exploring various P2P streaming architectures and protocols [7][8][9][10][11][12]. These prior works provide a strong foundation for developing robust and efficient P2P-based solutions for high-quality HTTP streaming, addressing the limitations of traditional server-centric approaches.…”

mentioning

confidence: 99%

Enhancing Crowd-Sourced Video Sharing through P2P-Assisted HTTP Video Streaming

Geng,

Fujita

2024

Electronics

View full text Add to dashboard Cite

This paper introduces a decentralized architecture designed for the sharing and distribution of user-generated video streams. The proposed system employs HTTP Live Streaming (HLS) as the delivery method for these video streams. In the architecture, a creator who captures a video stream using a smartphone camera subsequently transcodes it into a sequence of video chunks called HLS segments. These chunks are then stored in a distributed manner across the worker network, forming the core of the proposed architecture. Despite the presence of a coordinator for bootstrapping within the worker network, the selection of worker nodes for storing generated video chunks and autonomous load balancing among worker nodes are conducted in a decentralized fashion, eliminating the need for central servers. The worker network is implemented using the Golang-based IPFS (InterPlanetary File System) client, called kubo, leveraging essential IPFS functionalities such as node identification through Kademlia-DHT and message exchange using Bitswap. Beyond merely delivering stored video streams, the worker network can also amalgamate multiple streams to create a new composite stream. This bundling of multiple video streams into a unified video stream is executed on the worker nodes, making effective use of the FFmpeg library. To enhance download efficiency, parallel downloading with multiple threads is employed for retrieving the video stream from the worker network to the requester, thereby reducing download time. The result of the experiments conducted on the prototype system indicates that those concerned with the transmission time of the requested video streams compared with a server-based system using AWS exhibit a significant advantage, particularly evident in the case of low-resolution video streams, and this advantage becomes more pronounced as the stream length increases. Furthermore, it demonstrates a clear advantage in scenarios characterized by a substantial volume of viewing requests.

show abstract

Priority-based scheduling scheme for live video streaming in peer-to-peer network

Cited by 10 publications

References 51 publications

WidePLive: a coupled low‐delay overlay construction mechanism and peer‐chunk priority‐based chunk scheduling for P2P live video streaming

WidePLive: a coupled low‐delay overlay construction mechanism and peer‐chunk priority‐based chunk scheduling for P2P live video streaming

MOPSO-based Data Scheduling Scheme for P2P Streaming Systems

Enhancing Crowd-Sourced Video Sharing through P2P-Assisted HTTP Video Streaming

Contact Info

Product

Resources

About