Geometrico-harmonic broadcasting scheme with continuous redundancy
The harmonic broadcasting scheme has the best performance for the user latency. It, however, does not always provide the video data in time to the users. To provide the video data reliably, its two main variants-cautious and quasi-harmonic schemes have been proposed. They require more bandwidth than the harmonic scheme. The cautious and quasi-harmonic schemes need 0.50b and 0.1771b more bandwidth, respectively, than the harmonic scheme in limiting case. In this paper, a new broadcasting scheme: geometrico-harmonic scheme with continuous redundancy is proposed. This scheme provides the video data in time unlike the harmonic scheme, and its bandwidth requirement can be had as close to that of the harmonic scheme as we please. Moreover, the extra bandwidth required in this scheme can be evaluated at any point of time, that is, it can be estimated for a fractional size of a segment and/or subsegment. The bandwidth is a scarce resource and its requirement for any fractional size of segments (or subsegments) may be helpful while dealing with the variable bandwidth rate-encoded videos. In the proposed scheme, the user latency can be made arbitrarily close to that of the harmonic scheme. In comparison to the cautious and the quasi-harmonic schemes, it has better performance for the user latency as well as the buffer storage. For disk transfer rate, it performs better than the quasi-harmonic scheme and in comparison to the cautious harmonic scheme its performance is same.
quasi-harmonic scheme harmonic scheme cautious harmonic scheme logical channel polyharmonic scheme video channel