In recent years, mesh-pull peer-to-peer streaming systems are popular. However, the service providers of these systems have to pay high expense for the high consumption of servers’ bandwidth. Therefore, the research on providing better video quality with limited supply of bandwidth is very meaningful. However, there are few works focusing on this topic. In this paper, we analyzed the optimal throughput scheduling problem, and proposed a near optimal scheduling algorithm BBS and an effective heuristic MRBF, they eliminate or reduce scheduling waste significantly and get high throughput. The results of extensive simulations shows: our solution can provide better streaming quality or sustain higher streaming rate with limited supply of bandwidth than existing scheduling methods.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.