Efficient segment scheduling for video streaming over peer-to-peer network

Efficient Segment Scheduling for Video Streaming over Peer to Peer Network

Greg Kowalski and Mohamed Hefeeda

School of Computing Science

Simon Fraser University

Surrey , Canada gkowalsk , mhefeeda cs .sfu .ca

February 5 , 2009

Technical Report : TR 2006-xx

Abstract : Data scheduling among multiple peers is an important aspect of a peer-to-peer (P2P ) streaming system . Unlike most literature , that focus on overlay management , this concentrates on segment scheduling because it minimizes of scheduling operator segments with maximum memory release capacity . This describes an efficient segment scheduling algorithm for video

streaming over a P2P network , defines several algorithm comparison metrics , and validates the theory by presenting PlanetLab experimental results

Introduction : P2P systems were introduced keeping in mind the limitations of client-server architecture in an Internet-scale distributed environment (such as World Wide Web . In P2P systems , every node acts both as a client and a server and contributes by providing access to its computing resources . It follows three main principles which provide a generic overview of any p2p framework The principle of sharing resources : all P2P systems involve an aspect of resource sharing , where resources can be physical resources , such as disk space or network bandwidth , as well as , logical resources , such as services or different forms of knowledge . By sharing of resources applications can be realized which could not be set up by a single node The principle of decentralization : this is an immediate consequence of sharing of resources . Parts of the system or even the whole...