Abstract
This paper proposes an exponential replicate broadcasting (ERB) algorithm for data dissemination to improve data access efficiency. The proposed ERB algorithm first constructs a broadcast tree to determine the broadcast frequency of each data and splits the broadcast tree into some broadcast wood to generate the broadcast program. In addition, this paper develops an analytical model to derive the mean access latency of the generated broadcast program. In light of the derived results, both the index channel's bandwidth and the data channel's bandwidth can be optimally allocated to maximize bandwidth utilization. This paper presents experiments to help evaluate the effectiveness of the proposed strategy. From the experimental results, it can be seen that the proposed mechanism is feasible in practice.
Original language | English |
---|---|
Article number | 136 |
Pages (from-to) | 1-15 |
Number of pages | 15 |
Journal | Eurasip Journal on Wireless Communications and Networking |
Volume | 2014 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Dec 2014 |
Externally published | Yes |
Keywords
- Access time
- Bandwidth allocation
- ERB algorithm
- Indexing technique
- Skewed broadcast
- Tuning time