Approximability and nonapproximability results for minimizing total flow time on a single machine
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Interior point algorithms: theory and analysis
Interior point algorithms: theory and analysis
Improved approximation algorthims for scheduling with release dates
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Distributing streaming media content using cooperative networking
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Video Processing and Communications
Video Processing and Communications
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
SIAM Journal on Computing
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Scheduling Algorithms
On the feasibility of commercial, legal P2P content distribution
ACM SIGCOMM Computer Communication Review
An analytical study of peer-to-peer media streaming systems
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Is high-quality vod feasible using P2P swarming?
Proceedings of the 16th international conference on World Wide Web
Optimizing the Throughput of Data-Driven Peer-to-Peer Streaming
IEEE Transactions on Parallel and Distributed Systems
BitTube: Case Study of a Web-Based Peer-Assisted Video-on-Demand System
ISM '08 Proceedings of the 2008 Tenth IEEE International Symposium on Multimedia
Load balancing for multimedia streaming in heterogeneous peer-to-peer systems
Proceedings of the 18th International Workshop on Network and Operating Systems Support for Digital Audio and Video
Content and overlay-aware scheduling for peer-to-peer streaming in fluctuating networks
Journal of Network and Computer Applications
Chainsaw: eliminating trees from overlay multicast
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
A Measurement Study of a Large-Scale P2P IPTV System
IEEE Transactions on Multimedia
On scheduling of peer-to-peer video services
IEEE Journal on Selected Areas in Communications
Mobile video streaming in modern wireless networks
Proceedings of the international conference on Multimedia
Multi-stream 3D video distribution over peer-to-peer networks
Image Communication
Hi-index | 0.00 |
In peer-to-peer (P2P) mesh-based streaming systems, each video sequence is typically divided into segments, which are then streamed from multiple senders to a receiver. The receiver needs to coordinate the senders by specifying a transmission schedule for each of them. We consider the scheduling problem in both live and on-demand P2P streaming systems. We formulate the problem of scheduling segment transmission in order to maximize the perceived video quality of the receiver. We prove that this problem is NP-Complete. We present an integer linear programming (ILP) formulation for this problem, and we optimally solve it using an ILP solver. This optimal solution, however, is computationally expensive and is not suitable for real-time streaming systems. Thus, we propose a polynomial-time approximation algorithm, which yields transmission schedules with analytical guarantees on the worst-case performance. More precisely, we show that the approximation factor is at most 3, compared to the absolutely optimal solution as a benchmark. We implement the proposed approximation and optimal algorithms in a packet-level simulator for P2P streaming systems. We also implement two other scheduling algorithms proposed in the literature and used in popular P2P streaming systems. By simulating large P2P systems and streaming nine real video sequences with diverse visual and motion characteristics, we demonstrate that our proposed approximation algorithm: (i) produces near-optimal perceived video quality, (ii) can run in real time, and (iii) outperforms other algorithms in terms of perceived video quality, smoothness of the rendered videos, and balancing the load across sending peers. For example, our simulation results indicate that the proposed algorithm outperforms heuristic algorithms used in current systems by up to 8 dB in perceived video quality and up to 20% in continuity index.