Abstract
Broadcasting is scalable in terms of served users but not in terms of served data volume. Additionally, waiting time deadlines may be difficult to uphold due to the data clutter, forcing the clients to flee the system. This work proposes a way of selecting subsets of the original data that ensure near-optimal service ratio. The proposed technique relies on the novel data compatibility distance, which is introduced herein. Clustering techniques are then used for defining optimal data subsets. Comparison with related work and brute force-derived solutions yielded superior and near-optimal service ratios in all test cases. Thus, it is demonstrated that a system can attract more clients by using just a small portion of the available data pool.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Acharya, S., Alonso, R., Franklin, M., Zdonik, S.: Broadcast disks. ACM SIGMOD Record 24(2), 199–210 (1995)
Balli, U., Wu, H., Ravindran, B., Anderson, J., Jensen, E.: Utility Accrual Real-Time Scheduling under Variable Cost Functions. IEEE Transactions on Computers 56(3), 385–401 (2007)
Chen, J., Lee, V.C.S., Zhan, C.: Efficient Processing of Real-Time Multi-item Requests with Network Coding in On-demand Broadcast Environments. In: Proceedings of the 15th Int. Conf. on Embedded and Real-Time Computing Systems and Applications (RTCSA 2009), Beijing, China (August 2009)
Gecsei, J.: The Architecture of Videotex Systems. Prentice-Hall, Englewood Cliffs (1983)
Jiang, S., Vaidya, N.H.: Scheduling data broadcast to “impatient” users. In: Proceedings of the 1st ACM International Workshop on Data Engineering for Wireless and Mobile Access (MoBiDe 1999), Seattle, Washington, United States, pp. 52–59. ACM (1999)
Jiang, S., Vaidya, N.H.: Response time in data broadcast systems: mean, variance and tradeoff. Mobile Networks and Applications 7(1), 37–47 (2002)
Xu, J., Tang, X., Lee, W.-C.: Time-critical on-demand data broadcast: algorithms, analysis, and performance evaluation. IEEE Transactions on Parallel and Distributed Systems 17(1), 3–14 (2006)
Kakali, V.L., Sarigiannidis, P.G., Papadimitriou, G.I., Pomportsis, A.S.: A Novel Adaptive Framework for Wireless Push Systems Based on Distributed Learning Automata. Wireless Personal Communications 57(4), 591–606 (2011)
Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: An efficient k-means clustering algorithm: analysis and implementation. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(7), 881–892 (2002)
Liaskos, C., Petridou, S., Papadimitriou, G.: Cost-Aware Wireless Data Broadcasting. IEEE Transactions on Broadcasting 56(1), 66–76 (2010)
Liaskos, C., Petridou, S., Papadimitriou, G.: Towards Realizable, Low-Cost Broadcast Systems for Dynamic Environments. IEEE/ACM Transactions on Networking 19(2), 383–392 (2011)
Liaskos, C., Petridou, S., Papadimitriou, G., Nicopolitidis, P., Pomportsis, A.: On the Analytical Performance Optimization of Wireless Data Broadcasting. IEEE Transactions on Vehicular Technology 59, 884–895 (2010)
Pietronero, L., Tosatti, E., Tosatti, V., Vespignani, A.: Explaining the uneven distribution of numbers in nature: The laws of Benford and Zipf. Physica A: Statistical Mechanics and its Applications 293(1-2), 297–304 (2001)
Vincent Poor, H., Hadjiliadis, O.: Quickest detection. Cambridge University Press, Cambridge (2009)
Raissi-Dehkordi, M., Baras, J.S.: Broadcast Scheduling for Time-Constrained Information Delivery. In: Proceedings of the 2007 IEEE Global Telecommunications Conference (GLOBECOM 2007), Washington, DC, USA, pp. 5298–5303 (November 2007)
Su, C.-J., Tassiulas, L., Tsotras, V.J.: Broadcast scheduling for information distribution. Wireless Networks Journal 5(2), 137–147 (1999)
Vaidya, N.H., Hameed, S.: Scheduling data broadcast in asymmetric communication environments. Wireless Networks 5(3), 171–182 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liaskos, C., Tsioliaridou, A., Papadimitriou, G.I. (2012). More for Less. In: Koucheryavy, Y., Mamatas, L., Matta, I., Tsaoussidis, V. (eds) Wired/Wireless Internet Communication. WWIC 2012. Lecture Notes in Computer Science, vol 7277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30630-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-30630-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30629-7
Online ISBN: 978-3-642-30630-3
eBook Packages: Computer ScienceComputer Science (R0)