Abstract | ||
---|---|---|
Among all the data broadcasting schemes, the harmonic scheme has been reported to provide the best performance for user latency; however, it does not always deliver the video data to the users in time. To provide the video data reliably, its two main variants, i.e., cautious and quasi-harmonic schemes have been proposed. These variants require a video to be divided into large number of subsegments that leads to a problem of management complexity. Besides the manageability problem, these variants require more bandwidth than the original harmonic scheme. The cautious and the quasi-harmonic schemes need, respectively, 0.50*b and 0.1771*b more bandwidth than the original harmonic scheme in limiting case. In this paper, we propose a new broadcasting scheme that is named as the geometrico-harmonic scheme. This scheme provides the video data to the users in time unlike the original harmonic scheme, and also its bandwidth requirement is very much same as that of the original harmonic scheme. In comparison to the cautious and the quasi-harmonic schemes, it has better performance for the user latency and the buffer space. For disk transfer rate, its performance is same as that of the cautious harmonic scheme, but in comparison the quasi-harmonic scheme, it performs better |
Year | DOI | Venue |
---|---|---|
2007 | 10.1109/TCSVT.2006.887072 | IEEE Trans. Circuits Syst. Video Techn. |
Keywords | Field | DocType |
user latency,popular videos,cautious harmonic scheme,geometrico-harmonic data broadcasting,new broadcasting scheme,original harmonic scheme,data broadcasting scheme,video data,geometrico-harmonic scheme,receiving scheme,harmonic scheme,quasi-harmonic scheme,bandwidth requirement,bandwidth allocation,broadcasting,harmonic analysis | Bandwidth allocation,Computer science,Latency (engineering),Real-time computing,Harmonic analysis,Artificial intelligence,Computer engineering,Broadcasting,Computer vision,Bandwidth requirement,Harmonic,Bandwidth (signal processing),Limiting | Journal |
Volume | Issue | ISSN |
17 | 1 | 1051-8215 |
Citations | PageRank | References |
0 | 0.34 | 30 |
Authors | ||
2 |