scholarly journals A peer-to-peer delivery system for internet short video sharing

2021 ◽  
Author(s):  
Maryam Bashardoust Tajali

In this thesis, we considered the effect of the content delivery network architecture on the popular short video sharing websites such as YouTube. The high number of users demanding videos impacts YouTube scalability which requires a new content delivery structure. Considering the high performance of P2P overlay networks, we propose an efficient peer-to-peer based system for short video sharing in the Internet in which all participant peers are responsible to distribute video replicas they have stored. This system comprises of a BitTorrent like network and a central media streaming server. To proficiently utilize P2P in our system, we propose some important approaches including an efficient and reliable indexing scheme, an efficient downloading strategy, a reliable content distribution mechanism, and a fairness policy. The simulations results demonstrate that the proposed system significantly increases client peers download speed while reduces the server workload and the startup delay for an improved playback quality.

2021 ◽  
Author(s):  
Maryam Bashardoust Tajali

In this thesis, we considered the effect of the content delivery network architecture on the popular short video sharing websites such as YouTube. The high number of users demanding videos impacts YouTube scalability which requires a new content delivery structure. Considering the high performance of P2P overlay networks, we propose an efficient peer-to-peer based system for short video sharing in the Internet in which all participant peers are responsible to distribute video replicas they have stored. This system comprises of a BitTorrent like network and a central media streaming server. To proficiently utilize P2P in our system, we propose some important approaches including an efficient and reliable indexing scheme, an efficient downloading strategy, a reliable content distribution mechanism, and a fairness policy. The simulations results demonstrate that the proposed system significantly increases client peers download speed while reduces the server workload and the startup delay for an improved playback quality.


2021 ◽  
pp. 1351-1360
Author(s):  
Weichao Gong ◽  
Dongyan Zhao ◽  
Yidong Yuan ◽  
Wuyang Zhang ◽  
Sujie Shao

2012 ◽  
Vol 601 ◽  
pp. 312-317
Author(s):  
Zheng He ◽  
Fan Wei ◽  
Xiao Hong Huang ◽  
Yan Ma

Overlay networks have emerged as a promising paradigm for providing customizable and reliable services at the application layer, such as fault-resilient routing, multicast, and content delivery. Among the overlay network architecture, overlay routing is an important aspect of the overlay network design. In this paper, we develop a one-hop source routing, called heuristic-K algorithm using Ant Colony Optimization, to allow individual nodes to optimize route selection based on specific metrics like delay, loss rate, or throughput. Moreover, due to the selfish operating manner of overlay routing, we also take the traffic engineering element into consideration in the design process of our proposal. The experimental results demonstrate the effectiveness of the routing algorithm.


Author(s):  
Jerald Hughes ◽  
Karl Reiner Lang

In 1999, exchanges of digital media objects, especially files of music, came to constitute a significant portion of Internet traffic, thanks to a new set of technologies known as peer-to-peer (P2P) file-sharing systems. The networks created by software applications such as Napster and Kazaa have made it possible for millions of users to gain access to an extraordinary range of multimedia files. However, the digital product characteristics of portability and replicability have posed great challenges for businesses that have in the past controlled the markets for image and sound recordings. ‘Peer-to-peer’ is a type of network architecture in which the various nodes may communicate directly with other nodes, without having to pass messages through any central controlling node (Whinston, Parameswaran, & Susarla, 2001). The basic infrastructure of the Internet relies on this principle for fault tolerance; if any single node ceases to operate, messages can still reach their destination by rerouting through other still-functioning nodes. The Internet today consists of a complex mixture of peer-to-peer and client-server relationships, but P2P file-sharing systems operate as overlay networks (Gummadi, Saroiu, & Gribble, 2002) upon that basic Internet structure. P2P file-sharing systems are software applications which enable direct communications between nodes in the network. They share this definition with other systems used for purposes other than file sharing, such as instant messaging, distributed computing, and media streaming. What these P2P technologies have in common is the ability to leverage the combined power of many machines in a network to achieve results that are difficult or impossible for single machines to accomplish. However, such networks also open up possibilities for pooling the interests and actions of the users so that effects emerge which were not necessarily anticipated when the network technology was originally created (Castells, 2000). In a narrow sense, P2P file-sharing systems refer to applications that exchange content over computer networks where the nodes act both as client and server machines, requesting and serving files (e.g., Kazaa, BitTorrent). In a wider sense, P2P file-sharing systems also include any application that lets peer users exchange digital content among themselves (e.g., YouTube, Flickr).


Author(s):  
Haiying Shen

Structured peer-to-peer (P2P) overlay networks like Distributed Hash Tables (DHTs) map data items to the network based on a consistent hashing function. Such mapping for data distribution has an inherent load balance problem. Thus, a load balancing mechanism is an indispensable part of a structured P2P overlay network for high performance. The rapid development of P2P systems has posed challenges in load balancing due to their features characterized by large scale, heterogeneity, dynamism, and proximity. An efficient load balancing method should flexible and resilient enough to deal with these characteristics. This chapter will first introduce the P2P systems and the load balancing in P2P systems. It then introduces the current technologies for load balancing in P2P systems, and provides a case study of a dynamism-resilient and proximity-aware load balancing mechanism. Finally, it indicates the future and emerging trends of load balancing, and concludes the chapter.


Sign in / Sign up

Export Citation Format

Share Document