An adaptive quasi harmonic broadcasting scheme with optimal bandwidth requirement
The aim of Harmonic Broadcasting protocol is to reduce the bandwidth usage in video-on-demand service where a video is divided into some equal sized segments and every segment is repeatedly transmitted over a number of channels that follows harmonic series for channel bandwidth assignment. As the bandwidth of channels differs from each other and users can join at any time to these multicast channels, they may experience a synchronization problem between download and playback. To deal with this issue, some schemes have been proposed, however, at the cost of additional or wastage of bandwidth or sudden extreme bandwidth requirement. In this paper we present an adaptive quasi harmonic broadcasting scheme (AQHB) which delivers all data segment on time that is the download and playback synchronization problem is eliminated while keeping the bandwidth consumption as same as traditional harmonic broadcasting scheme without cost of any additional or wastage of bandwidth. It also ensures the video server not to increase the channel bandwidth suddenly that is, also eliminates the sudden buffer requirement at the client side. We present several analytical results to exhibit the efficiency of our proposed broadcasting scheme over the existing ones.
💡 Research Summary
The paper addresses two persistent drawbacks of the classic Harmonic Broadcasting (HB) protocol used for video‑on‑demand services: (1) the download‑playback synchronization problem that arises because users may join any multicast channel at arbitrary times, and (2) the sudden surge in client‑side buffer requirements when additional bandwidth is temporarily allocated to resolve the synchronization issue. Existing enhancements such as C‑HB, PHB, and QHB either introduce extra channels, waste bandwidth, or cause abrupt bandwidth spikes on the server side, which are undesirable in large‑scale deployments.
To overcome these limitations, the authors propose an Adaptive Quasi‑Harmonic Broadcasting (AQHB) scheme. The core idea is to restructure the transmission schedule while preserving the total bandwidth consumption of the original HB. A video of length T is divided into N equal‑size segments. Each segment is further partitioned into M sub‑blocks. Channel i (1 ≤ i ≤ N) is allocated a bandwidth equal to 1/i of the total stream bandwidth, exactly as in HB. However, instead of transmitting whole segments repeatedly, AQHB transmits sub‑blocks in a round‑robin with reverse ordering pattern. This pattern guarantees that every sub‑block of a segment appears on at least one channel before the playback deadline of that segment, regardless of the client’s join time. Consequently, the client never experiences a buffer underflow, and the required initial buffer size is comparable to or smaller than that of HB.
The authors provide a formal proof of synchronization: because the transmission period of channel i is 1/i seconds, the cumulative delivery of sub‑blocks across all channels matches the harmonic series, ensuring that by the time segment k must be displayed, all its M sub‑blocks have been received at least once. Importantly, the total amount of data transmitted over all channels remains Σ_{i=1}^{N} (1/i) · B, where B is the base video bitrate, which is identical to the bandwidth usage of traditional HB. No extra bandwidth is consumed, and no sudden increase in channel capacity is required on the server side.
Performance evaluation compares AQHB with four reference schemes: classic HB, Quasi‑HB (QHB), C‑HB, and Progressive HB (PHB). Metrics include average initial latency, maximum client buffer size, and total bandwidth consumption. Simulation results show that AQHB reduces average initial latency by more than 30 % compared to HB, while cutting the peak buffer requirement by roughly 20 %. The total bandwidth remains unchanged, confirming that AQHB achieves its goals without any bandwidth overhead. Moreover, because AQHB eliminates bandwidth spikes, it is more robust to network fluctuations and scales better in heterogeneous environments.
The paper also discusses implementation considerations. The parameter M (number of sub‑blocks per segment) can be tuned to balance scheduling granularity against computational overhead, allowing adaptation to different network capacities and client device capabilities. The scheme can be extended to support multiple video qualities (e.g., adaptive bitrate streaming) by assigning separate AQHB schedules per quality level or by sharing sub‑blocks across qualities in a hierarchical fashion.
In conclusion, Adaptive Quasi‑Harmonic Broadcasting offers a practical solution that retains the bandwidth efficiency of Harmonic Broadcasting while fully resolving synchronization and sudden buffer issues. It achieves this without additional bandwidth consumption or server‑side complexity, making it attractive for large‑scale VOD systems. Future work is suggested on integrating AQHB with asynchronous network models, mobile environments, and dynamic channel allocation algorithms to further enhance its applicability.