DocumentCode
1770366
Title
Resilient mesh-tree overlay for differentiated temporal requirement service in P2P streaming
Author
Jiaming Li ; Chai Kiat Yeo ; Ing Yann Soon
Author_Institution
Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore, Singapore
fYear
2014
fDate
10-13 Jan. 2014
Firstpage
301
Lastpage
308
Abstract
Robustness is an important issue in tree based P2P streaming applications. In this paper, a new criterion to evaluate robustness is proposed. The criterion is derived from examining the weakest link of stream sources serving a peer. The quality of connection is defined as how complementary the connection is to the other existing connections in order to improve the completeness of the downloading stream as well as the backup copies. Peers can thus find better connection combination and experience the best stream quality and backup robustness from the existing connections. The collective maximization of robustness among peers rather than maximization of a peer´s own resource alleviates the contention for resources, and helps the peers to reasonably allocate and utilize the limited network resources. Simulation results show marked performance improvement over other related proposals in terms of stream quality, speed of recovery from failure and ability to respond quickly to changing overlay and network dynamics.
Keywords
DiffServ networks; overlay networks; peer-to-peer computing; trees (mathematics); P2P streaming; differentiated temporal requirement service; peer-to-peer computing; resilient mesh-tree overlay; tree based P2P streaming; Availability; Bandwidth; Complexity theory; Peer-to-peer computing; Polynomials; Robustness; Runtime; differentiated temporary requirement; overlay; peer-to-peer; streaming;
fLanguage
English
Publisher
ieee
Conference_Titel
Consumer Communications and Networking Conference (CCNC), 2014 IEEE 11th
Conference_Location
Las Vegas, NV
Print_ISBN
978-1-4799-2356-4
Type
conf
DOI
10.1109/CCNC.2014.6866587
Filename
6866587
Link To Document