Improving playback quality of peer-to-peer live streaming systems by joint scheduling and distributed Hash table based compensation

This chapter considers the various parameters that affect the user’s Quality-of-Experience (QoE) in mobile peer-to-peer streaming systems, which are a form of content delivery network. Network and content providers do not necessarily focus on users’ QoE when designing the content delivery strategies and business models. The outcome of this is quite often the over-provisioning of network resources and also a lack of knowledge in respect to the user’s satisfaction. The focus is the methodology for quantifying the user’s perception of service quality for mobile video services and user contexts. The statistical technique of discriminant analysis is employed in defining prediction models to map Quality-of-Service (QoS) parameters onto estimates of the user’s QoE ratings. The chapter considers the relative contribution of the QoS parameters to predicting user responses. The chapter also demonstrates the value of the prediction models in developing QoE management strategies in order to optimize network resource utilization. To investigate the versatility of the framework, a feasibility study was applied to a P2P TV system. P2P systems continue to develop and as such, not a lot is known about their QoE characteristics, which situation this chapter seeks to remedy.

Download Full-text

Security Enhancement of Peer-to-Peer Session Initiation

Threats, Countermeasures, and Advances in Applied Information Security - Advances in Information Security, Privacy, and Ethics ◽

10.4018/978-1-4666-0978-5.ch015 ◽

2012 ◽

pp. 281-308

Author(s):

Xianghan Zheng ◽

Vladimir Oleshchuk

Keyword(s):

Communication System ◽

Communication Systems ◽

Hash Table ◽

Peer To Peer ◽

Distributed Hash Table ◽

Peer Communication ◽

Security Issues ◽

Security Enhancement ◽

Advantages And Disadvantages ◽

The Cost

Today, Peer-to-Peer SIP based communication systems have attracted much attention from both the academia and industry. The decentralized nature of P2P might provide the distributed peer-to-peer communication system without help of the traditional SIP server. However, the decentralization features come to the cost of the reduced manageability and create new concerns. Until now, the main focus of research was on the availability of the network and systems, while few attempts are put on protecting privacy. In this chapter, we investigate on P2PSIP security issues and introduce two enhancement solutions: central based security and distributed trust security, both of which have their own advantages and disadvantages. After that, we study appropriate combination of these two approaches to get optimized protection. Our design is independent of the DHT (Distributed Hash Table) overlay technology. We take the Chord overlay as the example, and then, analyze the system in several aspects: security & privacy, number-of the hops, message flows, etc.

Download Full-text

Usage of Broadcast Messaging in a Distributed Hash Table for Intrusion Detection

Privacy, Intrusion Detection and Response ◽

10.4018/978-1-60960-836-1.ch003 ◽

2011 ◽

pp. 77-93

Author(s):

Zoltán Czirkos ◽

Gábor Hosszú

Keyword(s):

Intrusion Detection ◽

Intrusion Detection System ◽

Detection System ◽

High Reliability ◽

Hash Table ◽

User Interaction ◽

Overlay Network ◽

Peer To Peer ◽

Transport Layer ◽

Distributed Hash Table

In this chapter, the authors present a novel peer-to-peer based intrusion detection system called Komondor, more specifically, its internals regarding the utilized peer-to-peer transport layer. The novelty of our intrusion detection system is that it is composed of independent software instances running on different hosts and is organized into a peer-to-peer network. The maintenance of this overlay network does not require any user interaction. The applied P2P overlay network model enables the nodes to communicate evenly over an unstable network. The base of our Komondor NIDS is a P2P network similar to Kademlia. To achieve high reliability and availability, we had to modify the Kademlia overlay network in such a way so that it would be resistent to network failures and support broadcast messages. The main purpose of this chapter is to present our modifications and enhancements on Kademlia.

Download Full-text

IOTA-BT: A P2P File-Sharing System Based on IOTA

Electronics ◽

10.3390/electronics9101610 ◽

2020 ◽

Vol 9 (10) ◽

pp. 1610 ◽

Cited By ~ 1

Author(s):

Li-Yuan Hou ◽

Tsung-Yi Tang ◽

Tyng-Yeu Liang

Keyword(s):

Single Point ◽

Hash Table ◽

File Sharing ◽

Peer To Peer ◽

Cyber Attacks ◽

Distributed Hash Table ◽

P2p File Sharing ◽

File Sharing System ◽

Transaction Fees ◽

Quantum Resistant Cryptography

BitTorrent (BT) is the most popular peer-to-peer file-sharing system. According to official BT information, more than 100 million active users use BT for file transfers every month. However, BT mainly relies on either a central tracker (tracker) or distributed hash table (DHT) for locating file seeders while it runs a risk of a single point of failure or cyber-attacks such as Sybil and Eclipses. To attack this problem, we proposed a Peer-to-Peer (P2P) file-sharing system called IOTA-BT by integrating BitTorrent with IOTA in this paper. The advantages of IOTA over blockchain include scalability for high throughput, compatibility with Internet of Things (IoT) footprints, zero transaction fees, partition-tolerant, and quantum-resistant cryptography. The autopeering and neighbor selection of the Coordicide of IOTA is aimed at defending a Sybil or Eclipse attack. IOTA-BT inherits these advantages from IOTA. Moreover, our experimental results have shown that the cost of executing BT functions, such as releasing torrent files and retrieving seeder information on IOTA-BT, is acceptable for improving the security of BT. IOTA-BT can indeed efficiently provide users with a P2P file-sharing environment of higher security.

Download Full-text

Routing Protocols of Distributed Hash Table Based Peer to Peer Networks

IOSR Journal of Computer Engineering ◽

10.9790/0661-16127074 ◽

2014 ◽

Vol 16 (1) ◽

pp. 70-74

Author(s):

S. Rajalakshmi ◽

◽

S. Balaji ◽

T.Godwin Selva Raja

Keyword(s):

Routing Protocols ◽

Hash Table ◽

Peer To Peer ◽

Peer Networks ◽

Distributed Hash Table ◽

Peer To Peer Networks

Download Full-text

REAL-TIME INTERACTIVE MECHANISM FOR LIVE STREAMING ON PEER-TO-PEER NETWORKS

International Journal of Computing ◽

10.47839/ijc.19.2.1763 ◽

2020 ◽

pp. 208-215

Author(s):

Mina N. Abadeer ◽

Rowayda A. Sadek ◽

Gamal I. Selim

Keyword(s):

Real Time ◽

Video Streaming ◽

Packet Delay ◽

Peer To Peer ◽

Live Streaming ◽

P2p Streaming ◽

Neighbor Selection ◽

Streaming Technology ◽

Selection Methodology

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.

Download Full-text

HIERARCHICAL PEER-TO-PEER SYSTEMS

Parallel Processing Letters ◽

10.1142/s0129626403001574 ◽

2003 ◽

Vol 13 (04) ◽

pp. 643-657 ◽

Cited By ~ 51

Author(s):

L. GARCÉS-ERICE ◽

E. W. BIERSACK ◽

K. W. ROSS ◽

P. A. FELBER ◽

G. URVOY-KELLER

Keyword(s):

Hash Table ◽

Overlay Network ◽

Peer To Peer ◽

Distributed Hash Table ◽

Hierarchical Design ◽

P2p Systems ◽

Lookup Services ◽

Peer To Peer Systems ◽

Responsible Group ◽

Overlay Management

Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.

Download Full-text

Token Based Mutual Exclusion in Peer-to-Peer Systems

Technologies and Protocols for the Future of Internet Design ◽

10.4018/978-1-4666-0203-8.ch011 ◽

2012 ◽

pp. 214-228 ◽

Cited By ~ 1

Author(s):

Mayank Singh ◽

Shashikala Tapaswi

Keyword(s):

Distributed Systems ◽

Message Passing ◽

Mutual Exclusion ◽

Hash Table ◽

Peer To Peer ◽

Distributed Hash Table ◽

Shared Resources ◽

Peer To Peer Systems ◽

Mutual Exclusion Algorithm ◽

Message Overhead

Mutual exclusion is one of the well-studied fundamental primitives in distributed systems, and a number of vital solutions have been proposed to achieve the same. However, the emerging Peer to Peer systems bring forward several challenges to protect consistent and concurrent access to shared resources, as classical peer-to-peer systems, like Napster, Gnutella, et cetera, have been mainly used for sharing files with read only permission. In this chapter, the authors propose a quorum based mutual exclusion algorithm that can be used over any Peer to Peer Distributed Hash Table (DHT). The proposed approach can be seen as extension to traditional Sigma protocol for mutual exclusion in Peer to Peer systems. The basic idea is to reduce message overhead with use of smart nodes present in each quorum set and message passing between the current owners of resource with next resource requester nodes.

Download Full-text