Reliable peer-to peer multicast streaming

P2P is increasingly gaining its popularity for streaming multimedia contents. The architecture of streaming has shifted from traditional client server architecture to P2P architecture. Although it is scalable and robust it faces its own challenges and problems such as churn. In tree topology frequent joining and leaving of users in search for better quality and reliable streaming makes the P2P network instable. This thesis provides an effective approach to achieve a resilient network for streaming. Relying on a single tree to receive data from single parent may leave the user deprived of getting the data if any of its ancestors leaves the network. Therefore we present an ideal solution to this problem by introducing a backup tree for the existing base tree. The backup tree is constructed based on parameter such as bandwidth and delay. In case of failure of a node, its children along the tree receive the data from the nodes of backup tree. We present an efficient algorithm for the construction of base tree as well as the backup tree which are based on normalization of two entities of nodes: bandwidth and delay. Through mathematical formulation and experimental setups we show that introducing a backup tree for an existing base tree can help provide resilience to the network.

Name thesis:degree_name

Master of Science (MSc)

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Ontario Institute of Technology

Year dc:date.issued

2013

Author dc:creator

• Gautam, Sushant

Advisor dc:contributor.advisor

• Zhu, Ying

• Peer to peer (P2P)
• Multicast
• Base tree
• Backup tree

Language dc:language.iso

en

Handle dc:identifier.uri

https://hdl.handle.net/10155/303

OAI identifier oai:identifier

oai:ontariotechu.scholaris.ca:10155/303