Abstract
Data broadcasting is an efficient method to disseminate information to a large group of requesters with common interests. Performing such broadcasts typically involve the determination of a broadcast schedule intended to maximize the quality of service provided by the broadcast system. Earlier studies have proposed solutions to this problem in the form of heuristics and local search techniques designed to achieve minimal deadline misses or maximal utility. An often ignored factor in these studies is the possibility of the data items being not available locally, but rather have to be fetched from data servers distributed over a network, thereby inducing a certain level of stochasticity in the actual time required to serve a data item. This stochasticity is introduced on behalf of the data servers which themselves undergo a dynamic management of serving data requests. In this paper we revisit the problem of real time data broadcasting under such a scenario. We investigate the efficiency of heuristics that embed the stochastic nature of the problem in their design and compare their performance with those proposed for non-stochastic broadcast scheduling. Further, we extend our analysis to understand the various factors in the problem structure that influence these heuristics, and are often exploited by a better performing one.
Similar content being viewed by others
References
Acharya S, Muthukrishnan S (1998) Scheduling on-demand broadcasts: new metrics and algorithms. In: Proceedings of the fourth annual ACM/IEEE international conference on mobile computing and networking, pp 43–54
Aksoy D, Franklin M (1999) RxW: a scheduling approach for large-scale on-demand data broadcast. IEEE/ACM Trans Netw 7(6):846–860
Aksoy D, Franklin M, Zdonik S (2001) Data staging for on-demand broadcast. In: Proceedings of the 27th international conference on very large data bases, pp 571–580
Barford P, Crovella M (1998) Generating representative web workloads for network and server performance evaluation. ACM SIGMETRICS Perform Eval Rev 26(1):151–160
Breslau L, Cao P, Fan L, Phillips G, Shenker S (1999) Web caching and Zipf-like distributions: evidence and implications. In: Proceedings of the IEEE INFOCOM ’99, pp 126–134
Buttazzo G, Spuri M, Sensini F (1995) Value vs deadline scheduling in overload conditions. In: Proceedings of the 16th IEEE real-time systems symposium, pp 90–99
Dempster MAH, Lenstra JK, Kan AHGR (1982) Deterministic and stochastic scheduling. Reidel, Dordrecht
Dewri R, Ray I, Ray I, Whitley D (2008) Optimizing on-demand data broadcast scheduling in pervasive environments. In: Proceedings of the 11th international conference on extending database technology, pp 559–569
Fernandez J, Ramamritham K (2004) Adaptive dissemination of data in time-critical asymmetric communication environments. Mob Netw Appl 9(5):491–505
Jensen E, Locke C, Tokuda H (1985) A time driven scheduling model for real-time operating systems. In: Proceedings of the sixth IEEE real-time systems symposium, pp 112–122
Lee VC, Wu X, Ng JKY (2006) Scheduling real-time requests in on-demand data broadcast environments. Real-Time Syst 34(2):83–99
Megow N, Uetz M, Vredeveld T (2006) Models and algorithms for stochastic online scheduling. Math Oper Res 31(3):513–525
Omotayo A, Hammad MA, Barker K (2006) Update-aware scheduling algorithms for hierarchical data dissemination systems. In: Proceedings of the 7th international conference on mobile data management, p 18
Press WH, Vetterling WT, Teukolsky SA, Flannery BP (1992) Numerical recipes in C: The art of scientific computing, 2nd edn. Cambridge University Press, Cambridge, pp 538–545
Ravindran B, Jensen ED, Li P (2005) On recent advances in time/utility function real-time scheduling and resource management. In: Proceedings of the eight IEEE international symposium on object-oriented real-time distributed computing, pp 55–60
Su CJ, Tassiulas L (1997) Broadcast scheduling for information distribution. In: Proceedings of the INFOCOM ’97, pp 109–117
Sun W, Shi W, Shi B, Yu Y (2003) A cost-efficient scheduling algorithm of on-demand broadcasts. Wirel Netw 9(3):239–247
Triantafillou P, Harpantidou R, Paterakis M (2002) High performance data broadcasting systems. Mob Netw Appl 7(4):279–290
Wu X, Lee VC (2005) Wireless real-time on-demand data broadcast scheduling with dual deadlines. J Parallel Distrib Comput 65(6):714–728
Xu J, Tang X, Lee WC (2006) Time-critical on-demand data broadcast: algorithms, analysis and performance evaluation. IEEE Trans Parallel Distrib Syst 17(1):3–14
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dewri, R., Ray, I., Ray, I. et al. Real time stochastic scheduling in broadcast systems with decentralized data storage. Real-Time Syst 45, 143–175 (2010). https://doi.org/10.1007/s11241-010-9102-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11241-010-9102-9