A Hierarchical Name System Based on Hybrid P2P for Data-Centric Networks

P2P networks are a technology able to deliver real time and video-on-demand services over IP networks. Layered video coding techniques are being introduced due to their ability to deliver streams at different scales (temporal, spatial and SNR) that solve the heterogeneity problem. This eases transmission in the case of limited bandwidth, as the devices can pick and decode the minimum bit rate base layer. Existing work examines layered video in client-server scenarios. In contrast, this paper analyzes scalable coding H.264/SVC over P2P networks based on an SNR-temporal Codec. Due to the interdependency between the different SVC layers, issues of reliability and quality of experience arise unless proper measures are taken to protect the base layer. The authors explore the effectiveness of a combination of P2P strategies, for example, hybrid P2P architecture, P2P locality, and P2P redundancy, to assess the viability and benefits of scalable video coding over P2P. The resulting performance is compared with a state-of-the-art P2P TV platform.

Download Full-text

An Efficient Framework for Network Code based Multimedia Content Distribution in Hybrid P2P Network

Journal of Circuits System and Computers ◽

10.1142/s0218126620501571 ◽

2019 ◽

Vol 29 (10) ◽

pp. 2050157

Author(s):

M. Anandaraj ◽

P. Ganeshkumar ◽

K. Selvaraj ◽

K. P. Vijayakumar

Keyword(s):

Network Coding ◽

Content Distribution ◽

Network Code ◽

Coding System ◽

Topology Change ◽

Good Reliability ◽

Coding Scheme ◽

Stated Problem ◽

Hybrid P2p ◽

Multimedia Content Distribution

Most of the existing peer-to-peer (P2P) content distribution schemes carry out a random or rarest piece first content dissemination procedure to avoid duplicate transmission of the same pieces of data and rare pieces of data occurring in the network. This problem is solved using P2P content distribution based on network coding scheme. Network coding scheme uses random linear combination of coded pieces. Hence, the above-stated problem is solved easily and simply. Our proposed mechanism uses network coding mechanism in which several contents having the same message are grouped into different groups and coding operation is performed only within the same group. The interested peers are also divided into several groups with each group having the responsibility to spread one set of contents of messages. The coding system is designed to assure the property that any subset of the messages can be utilized to decode the original content as long as the size of the subset is suitably large. To meet this condition, dynamic smart network coding (DSNC) scheme is defined which assures the preferred property, then peers are connected in the same group to send the corresponding message, and connect peers in different groups to disseminate messages for carrying out decoding operation. Moreover, the proposed system is readily expanded to support topology change to get better system performance further in terms of reliability, link stress and throughput. The simulation results prove that the proposed system can attain 20–25% higher throughput than existing systems, good reliability, link failure and robustness to peer churn.

Download Full-text