Efficient algorithms for constructing broadcast disks programs in asymmetric communication environments
- 41 Downloads
A well-known technique for broadcast program construction is the Broadcast Disks technique. However, in the Broadcast Disks approach there are some important disadvantages. For example some parts of the broadcast program remain empty during the construction procedure and the disk relative frequencies have to be selected very carefully. This paper gives a new approach of the broadcast program construction in a Broadcast Disk System, presenting three new algorithms, which face successfully these problems. According to this approach, the broadcast program is constructed with the minimum possible length, while retaining the selected disk relative frequencies and keeps the average delays on retrieving data-items low. The constructed broadcast programs have no empty parts, and retain their desired properties in any numbered combination of disk relative frequencies. We implemented all methods in a simulator application and experimental results show that our approach is more efficient than Broadcast Disks in all cases.
KeywordsBroadcast disks Asymmetric communication environments Data broadcasting
Unable to display preview. Download preview PDF.
- 2.Acharya, S. et al. (1994). Broadcast disks: data management for asymmetric communication environments (Technical Report No. CS-94-43). Google Scholar
- 4.Vaidya, N. H., & Hameed, S. (1996). Data broadcast in asymmetric wireless environments. In Proceedings of WOSBIS 1996. Google Scholar
- 7.Nicopolitidis, P. (2005). Performance optimization of an adaptive wireless push system in environments with locality of demand. Computer Communications, 29(13–14), 2542–2549. Google Scholar
- 9.German, G., Gopal, G., Lee, K., & Weinrib, A. (1987). The datacycle architecture for very high throughput database systems. In Proceedings of the ACM international conference on management of data (SIGMOD), pp. 97–103. Google Scholar
- 13.Yee, W. G., Navathe, S. B., Omiecinski, E., & Jermaine, C. (2002). Bridging the gap between response time and energy efficiency in broadcast schedule design. In Proceedings of international conference on extending database technology (EDBT), pp. 572–589. Google Scholar
- 14.Yee, W. G., Omiecinski, E., & Navathe, S. B. (2001). Efficient data allocation for broadcast disk arrays (Technical Report GIT-CC-02-20). Georgia Institute of Technology, College of Computing, Atlanta, Georgia. Google Scholar
- 15.Acharya, S., Franklin, M., & Zdonik, S. (1997). Balancing push and pull for data broadcast. In Proceedings of ACM SIGMOD, pp. 183–194. Google Scholar
- 17.Stathatos, K., Roussopoulos, N., & Baras, J. S. (1997). Adaptive data broadcast in hybrid networks. In Proceedings of international conference on very large data bases (VLDB), pp. 326–335. Google Scholar
- 18.Acharya, S., Franklin, M., & Zdonik, S. (1996). Disseminating updates on broadcast disks. In Proceedings of 2nd VLDB conference, pp. 354–365. Google Scholar