An Interleaving Slotted-PolyHarmonic-Staircase Broadcasting Protocol for Near Video-on-Demand Services

This work presents an Interleaving Slotted-PolyHarmonic-Staircase Broadcasting protocol. Suppose a video is transmitted using y · b bandwidth, where b is the consumption rate under normal playback conditions and y is a positive integer. In the proposed protocol, prior bandwidth (y − 1) · b is divided into (h − c + 1) channels with bandwidths b/c, b/(c + 1), … ,b/h, 2 ⩽ c ⩽ h and ∑i=ch1/i⩽y-1<∑i=ch+11/i, in Harmonic sequence; each channel periodically broadcasts a segment in interleaving way only. The remaining bandwidth b will be partitioned into h + 1 channels with the same bandwidth b/(h + 1) to broadcast h + 1 segments in interleaving staircase method. The maximum waiting time for the proposed protocol is (c + 1/m) · L/(2h − c + 2) where L is the time length of a video and m is a positive integer for interleaving. The buffer requirement is 25% of video size. Compared with Interleaving Harmonic-Staircase Broadcasting, the maximum waiting time is decreased by about 30%, under equivalent bandwidth and buffer requirements.