Broadcast Levels: Efficient and Lightweight Schedule Construction for Push-Based Data Broadcasting Systems

  • Home/
  • Broadcast Levels: Efficient and Lightweight Schedule Construction for Push-Based Data Broadcasting Systems

Broadcast Levels: Efficient and Lightweight Schedule Construction for Push-Based Data Broadcasting Systems

  • Post by:
  • January 1, 2015
  • Comments off

S. Mavridopoulos, P. Nicopolitidis, G. Papadimitriou, P. Sarigiannidis: Broadcast Levels: Efficient and Lightweight Schedule Construction for Push-Based Data Broadcasting Systems. In: IEEE Transactions on Broadcasting, vol. 61, no. 3, pp. 470-481, 2015.

Abstract

In wireless push-based systems traffic is asymmetric meaning that the server has much more bandwidth available, as compared to the clients. Since it is often not possible or desirable for the clients to send any requests, the server should broadcast the data periodically. The performance of this system relies heavily on the proper scheduling of the broadcast data. The well known algorithm proposed by Vaidya and Hameed battles this challenge and achieves state-of-the-art performance. However, this performance comes with a computational complexity linear to the number of data items that are broadcast. Furthermore, Vaidya's and Hameed's proposed solution for this time complexity degenerates performance. This paper proposes a scheduling algorithm for wireless push-based data broadcasting systems, which performs near optimal and has low computational complexity. Performance evaluation results are presented to demonstrate its efficient performance despite its low computational demands. © 1963-12012 IEEE.

Links

BibTeX (Download)

@article{Mavridopoulos2015470,
title = {Broadcast Levels: Efficient and Lightweight Schedule Construction for Push-Based Data Broadcasting Systems},
author = { S. Mavridopoulos and P. Nicopolitidis and G. Papadimitriou and P. Sarigiannidis},
url = {https://www.researchgate.net/publication/279770864_Broadcast_Levels_Efficient_and_Lightweight_Schedule_Construction_for_Push-Based_Data_Broadcasting_Systems?_sg=0j_ejC8-35oRtU2DLJIJKl7iGe88YpazLBtSgzLPGJ8-cvUO2V89ykQQXbEwvStZzzVlda7jumqwv90},
doi = {10.1109/TBC.2015.2444334},
year  = {2015},
date = {2015-01-01},
journal = {IEEE Transactions on Broadcasting},
volume = {61},
number = {3},
pages = {470-481},
abstract = {In wireless push-based systems traffic is asymmetric meaning that the server has much more bandwidth available, as compared to the clients. Since it is often not possible or desirable for the clients to send any requests, the server should broadcast the data periodically. The performance of this system relies heavily on the proper scheduling of the broadcast data. The well known algorithm proposed by Vaidya and Hameed battles this challenge and achieves state-of-the-art performance. However, this performance comes with a computational complexity linear to the number of data items that are broadcast. Furthermore, Vaidya's and Hameed's proposed solution for this time complexity degenerates performance. This paper proposes a scheduling algorithm for wireless push-based data broadcasting systems, which performs near optimal and has low computational complexity. Performance evaluation results are presented to demonstrate its efficient performance despite its low computational demands. © 1963-12012 IEEE.},
keywords = {adaptive, Broadcast, low computational complexity, multiple channels, push-based system, wireless},
pubstate = {published},
tppubtype = {article}
}
Categories:
Skip to content