In this paper, we study how to optimize mesh-based overlay in a contribution aware manner. We have designed a suite of protocols to construct and optimize the overlay. Our core idea is to promote nodes with larger contribution closer to the source node so as to keep a compact and efficient mesh-based streaming overlay. Our method is evaluated through extensive simulations. Compared with the non-optimized overlay, the p2p streaming applications using our method could cut down the average latency by 20-50% and enhanced the continuity index up to 120%.

This paper presents a novel video service system DCSVS (distributed collaborative set-top-box video service), which encompasses several practical and effective solutions to both live and VoD (video-on-demand) services. DCSVS is established on an overlay DHT (distributed hash table) network, which improves Kademlia protocol to fit for real-time application. We use several types of pre-fetching to enhance continuity rate of VoD service, and we employ an effective scheduling algorithm based on transferring priorities. We design the inner-first and proxy-forward strategy to relieve transferring failure, and we use Window-based storage and hashing to achieve better system performance. Both theoretical analysis and experimental results show that strategies in DCSVS perform well in terms of efficiency and robustness, and could maintain a fine state and scalability in large-scale networking.

In a typical video application, such as video-on-demand, videos are continuously streamed from a video server to a distributed set of receivers. The constant-quality video compression technique commonly used, variable bit rate (VBR) encoding, produces flows with multiple time-scale rate variability, so smoothing the VBR video traffic within an entire distribution tree presents a challenging task. This paper proposes a novel wavelet-based traffic smoothing (WTS) algorithm. Unlike existing algorithms, the WTS algorithm considers traffic smoothing at multiple resolutions. It results in a pruned version of a full tree, which corresponds to the original VBR traffic. Theoretical analysis and numerical evaluation demonstrate that: 1) WTS performs well across several metrics in smoothing bursty traffic and 2) for a video bit stream with N frames, the computational complexity of WTS is O(NlogN).

Although VBR coding is more efficient than CBR coding, the burstiness of VBR video traffic brings great difficulty to network resource management. To address this problem, we propose a novel wavelet-based traffic smoothing (WTS) algorithm. Unlike existing algorithms, which only have one resolution, the WTS algorithm has a multiresolution property that is preferable for smoothing VBR video traffic that exhibits a self-similar behavior. WTS allows traffic smoothing at multiple resolutions and the best transmission schedule is searched as a pruned subtree of a full binary tree, which corresponds to the original VBR video traffic. WTS optimizes several metrics simultaneously for both the single and multiple flow cases while traditional algorithms only optimize one or two metrics for a single flow. The computational complexity of the WTS algorithm is also lower.