SPANC: Optimizing Scheduling Delay for Peer-to-Peer Live Streaming

Abstract--In peer-to-peer (P2P) live streaming using unstructured mesh, packet scheduling is an important factor in overall playback delay. In this paper, we propose a scheduling algorithm to minimize scheduling delay. To achieve low delay, our scheduling is predominantly push in nature, and the schedule needs to be changed only upon significant change in network states (due to, for examples, bandwidth change or parent churns). Our scheme, termed SPANC (Substream Pushing and Network Coding), pushes video packets in substreams and recovers packet loss using network coding. Given heterogeneous contents, delays, and bandwidths of parents of a peer, we formulate the substream assignment (SA) problem to assign substreams to parents with minimum delay. The SA problem can be optimally solved in polynomial time by transforming it to a max-weighted bipartite matching problem. We then formulate the fast recovery with network coding (FRNC) problem, which is to assign network coded packets to each...

• Type: Journal
• Year: 2010
• Where: TMM
• Authors: Tammy Kam-Hung Chan, Shueng-Han Gary Chan, Ali C. Begen
• Keywords: Management, Minimum Recovery Delay, Overall Playback Delay, Polynomial Time, TMM 2010