Popularity Awareness in Temporal-DHT for P2P-based Media Streaming Applications

Author(s):  
Abhishek Bhattacharya ◽  
Zhenyu Yang ◽  
Deng Pan
2015 ◽  
Vol 26 (4) ◽  
pp. 1021-1033 ◽  
Author(s):  
Amr Alasaad ◽  
Kaveh Shafiee ◽  
Hatim M. Behairy ◽  
Victor C.M. Leung

Author(s):  
Hyunggon Park ◽  
Rafit Izhak Ratzin ◽  
Mihaela van der Schaar

P2P applications have become enormously popular and currently take into account a large majority of the traffic transmitted over the Internet. A unique characteristic of P2P networks is their flexible and robust operation, which is enabled by the peers’ ability to serve as both servers and clients. Thus, P2P networks are able to provide a cost effective and easily deployable solution for sharing large files among participating peers with no significant help from a de facto, centralized infrastructure. Due to these advantages, P2P networks have also recently become popular for multimedia streaming. The requirements for general file sharing and real-time media streaming are very different and thus, we discuss in this chapter solutions for both these applications. We begin the chapter with an overview of various P2P network structures and their advantages and disadvantages. We then present in detail the BitTorrent system, which is one of the most popular file sharing protocols. We then overview existing P2P-based media streaming applications, and discuss mechanisms that have been developed to support such applications. We also discuss state-of-the-art research in P2P networks which is based on several game theoretic approaches.


2009 ◽  
Author(s):  
Jian Wang ◽  
Ruimin Shen ◽  
Heng Luo ◽  
Changyong Niu ◽  
Liping Shen

2013 ◽  
Vol 303-306 ◽  
pp. 2260-2264
Author(s):  
Zhi Ye Huang ◽  
Jin Xiang Peng ◽  
Jian Zhang

Firstly challenges in P2P media streaming applications were pointed out, then some recent research results such as application-level multicast tree, heterogeneity of network and incentive mechanism and so on were introduced. This paper has proposed a new model of application level multicast named DHCM (density-based hierarchical clustering multicast)which has improved IHC arithmetic.DHCM divides the hosts into many hierarchies according to their density,and constructs a density tree to realize the shortest routing.The tree delivers the content of video server to each host in density tree and uses a P2P scheme in data transmission.By this way the application-level multicast has been realized.This density tree has the homogeneity and monotonic properties.The experiment result has proved that DHCM can transmit the video stream efficiently and robustly.


Author(s):  
Erdinc Korpeoglu ◽  
Cetin Sahin ◽  
Divyakant Agrawal ◽  
Amr El Abbadi ◽  
Takeo Hosomi ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document