Abstract:

Peer-to-Peer streaming is an effectual and promising way to distribute media content. In this paper, we present a novel substreamoriented lowdelay scheduling strategy under the pushpull hybrid framework. First the substream scheduling problem is transformed into the matching problem of the weighted bipartite graph. Then the wellknown Hungarian Algorithm is ameliorated, and a minimum delay, maximum matching algorithm is presented. Not only maximum matching is reserved by the new improved algorithm, but also the transmitting delay of each substream is as low as possible. The simulation results show that our method can greatly reduce the transmission delay.

Key words: P2P streaming;scheduling;substream;weighted bipartite graph;matching