Efficient search and scheduling in P2P-based media-on-demand streaming service

We are interested in providing a media-on-demand streaming service to a large population of clients using a peer-to-peer approach. Since the demands of different clients are asynchronous and the contents of clients´ buffers are continuously changing, finding partners with expected data and collaborating with them for future content delivery are very important and challenging problems. In this paper, we propose a generic buffer-assisted search (BAS) scheme to improve partner search efficiency by reducing the size of index overlay. We have also developed a novel scheduling algorithm based on deadline-aware network coding (DNC) to fully exploit network resources by dynamically adjusting the coding window size. Extensive simulation results demonstrate that BAS can provide a faster response time with less control cost than the existing search methods, and DNC improves the network capacity utilization and provides high streaming quality under different network conditions.