Advertisement

Telecommunication Systems

, Volume 41, Issue 3, pp 185–209 | Cite as

Efficient algorithms for constructing broadcast disks programs in asymmetric communication environments

  • Eleftherios Tiakas
  • Stefanos Ougiaroglou
  • Petros NicopolitidisEmail author
Article

Abstract

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.

Keywords

Broadcast disks Asymmetric communication environments Data broadcasting 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Acharya, S., Franklin, M., & Zdonik, S. (1995). Dissemination-based data delivery using broadcast disks. IEEE Personal Communications, 2(6), 50–60. CrossRefGoogle Scholar
  2. 2.
    Acharya, S. et al. (1994). Broadcast disks: data management for asymmetric communication environments (Technical Report No. CS-94-43). Google Scholar
  3. 3.
    Vaidya, N. H., & Hameed, S. (1999). Scheduling data broadcast in asymmetric communication environments. ACM/Baltzer Wireless Networks, 5, 171–182. CrossRefGoogle Scholar
  4. 4.
    Vaidya, N. H., & Hameed, S. (1996). Data broadcast in asymmetric wireless environments. In Proceedings of WOSBIS 1996. Google Scholar
  5. 5.
    Nicopolitidis, P., Papadimitriou, G. I., & Pomportsis, A. S. (2002). Using learning automata for adaptive push-based data broadcasting in asymmetric wireless environments. IEEE Transactions on Vehicular Technology, 51(6), 1652–1660. CrossRefGoogle Scholar
  6. 6.
    Nicopolitidis, P., Papadimitriou, G. I., & Pomportsis, A. S. (2006). Exploiting locality of demand to improve the performance of wireless data broadcasting. IEEE Transactions on Vehicular Technology, 55(4), 1347–1361. CrossRefGoogle Scholar
  7. 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
  8. 8.
    Bowen, T. (1992). The datacycle architecture. Communications of the ACM, 35(12), 71–81. CrossRefGoogle Scholar
  9. 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
  10. 10.
    Gifford, D. (1990). Polychannel systems for mass digital communications. Communications of the ACM, 33(2), 141–151. CrossRefGoogle Scholar
  11. 11.
    Ammar, M. H., & Wong, J. W. (1985). The design of teletext broadcast cycles. Performance Evaluation, 5(4), 235–242. CrossRefGoogle Scholar
  12. 12.
    Ammar, M. H., & Wong, J. W. (1987). On the optimality of cyclic transmission in teletext systems. IEEE Transactions on Communications, 35(1), 68–73. CrossRefGoogle Scholar
  13. 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. 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. 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
  16. 16.
    Lee, W.-C., Hu, Q., & Lee, D. L. (1999). A study on channel allocation for data dissemination in mobile computing environments. ACM/Kluwer Mobile Network and Applications, 4(2), 117–129. CrossRefGoogle Scholar
  17. 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. 18.
    Acharya, S., Franklin, M., & Zdonik, S. (1996). Disseminating updates on broadcast disks. In Proceedings of 2nd VLDB conference, pp. 354–365. Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Eleftherios Tiakas
    • 1
  • Stefanos Ougiaroglou
    • 1
  • Petros Nicopolitidis
    • 1
    Email author
  1. 1.Department of InformaticsAristotle University of ThessalonikiThessalonikiGreece

Personalised recommendations