Search

Nowadays, peer-to-peer network plays a significant role in data transfer and communication. The past few years have witnessed considerable growth in this area because of its inherent advantages. Peer-to-peer live streaming has a significant impact on video transmission over the Internet. Major factors that influence the performance of P2P live streaming are overlay construction and scheduling strategies. Although, a large number of scheduling schemes are developed but none of them is comprehensive enough to provide solutions to live streaming issues. These suffer from substantial delay and low video quality at the receiver side. In this paper, a new start-up-based selection procedure and slack time-based scheduling scheme is proposed. The start-up selection procedure defines the start-up buffer location for new peer, and the scheduling scheme selects both the chunk and peers. The proposed scheduling scheme uses both push and pull priority-based strategies. The simulation results of the proposed approach demonstrates significant improvement in both the network performance and video quality at the receiver side. It is observed that playback delay, startup delay, and end-to-end delay in the network are reduced and quality of the video at receiver side is improved as the distortion and frame loss ratio is decreased. [ABSTRACT FROM AUTHOR]

Peer-to-peer networks are overlay networks that are built on top of communication networks that are called underlay networks. In these networks, peers are unaware of the underlying networks, so the peers choose their neighbors without considering the underlay positions, and therefore, the resultant overlay network may have mismatches with its underlying network, causing redundant end-to-end delay. Landmark clustering algorithms, such as mOverlay, are used to solve topology mismatch problem. In the mOverlay algorithm, the overlay network is formed by clusters in which each cluster has a landmark peer. One of the drawbacks of mOverlay is that the selected landmark peer for each cluster is fixed during the operation of the network. Because of the dynamic nature of peer-to-peer networks, using a non-adaptive landmark selection algorithm may not be appropriate. In this paper, an adaptive landmark clustering algorithm obtained from the combination of mOverlay and learning automata is proposed. Learning automata are used to adaptively select appropriate landmark peers for the clusters in such a way that the total communication delay will be minimized. Simulation results have shown that the proposed algorithm outperforms the existing algorithms with respect to communication delay and average round-trip time between peers within clusters. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

This work describes a novel live video streaming system for P2P networks, referred to as P2broadcast. The video streaming service has bandwidth requirements to guarantee presentation quality. Therefore, a scalable strategy to quickly find a path from a media server to a client with abundant bandwidth is very important. A common approach in the literature is the bandwidth first (BF) scheme, which allows a newcomer to adopt a BF tree traversal scheme to find its parent peer on the P2P overlay tree to retrieve the media content. The BF scheme is likely to build a deep overlay tree, resulting in long start-up latency as the number of peers on the overlay tree grows. P2broadcast reduces start-up latency by organizing peers into hierarchical clusters and making the overlay tree become a ‘short-and-wide’ tree. The hierarchical clustering structure enables a newcomer to find its parent peer among the set of peers that are more likely to provide large available bandwidth only. Limiting the set of potential parent peers not only reduces start-up latency but also improves the system availability. Additionally, unlike the BF scheme that only concerns available bandwidth, P2broadcast utilizes a cost function to evaluate the appropriateness of a potential parent peer. The cost function considers the depth of the newcomer on the overlay tree, making the overlay tree become a short-and-wide tree. In addition to start-up latency reduction, the short-and-wide tree feature also alleviates the service interruption probability due to the leaving or failure of a peer. Our simulation results show that P2broadcast greatly outperforms the BF scheme in terms of system availability, and achieves around 66% savings in start-up latency and 10% decrement in service interruption probability. Copyright © 2005 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]