On Data Compatibility and Broadcast Stream Formation

The Web offers abundant amounts of information anytime, anyplace. Multimedia provision companies bloom and die, seeking to attract a viable share of the data dissemination market. More often than not, failure is attributed to unsuitable content orientation. The present work contributes a novel conte...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 2014-09, Vol.63 (9), p.2369-2375
Main Authors: Liaskos, Christos K., Tsioliaridou, Angeliki N., Papadimitriou, Georgios I., Nicopolitidis, Petros, Pomportsis, Andreas S.
Format: Article
Language:English
Subjects:
Algorithms
Analytical models
Companies
Computer simulation
Data dissemination
data selection
Focusing
Markets
Mathematical analysis
Mathematical models
Multimedia
Optimization
Push
service ratio optimization
Streams
Wireless communication
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Web offers abundant amounts of information anytime, anyplace. Multimedia provision companies bloom and die, seeking to attract a viable share of the data dissemination market. More often than not, failure is attributed to unsuitable content orientation. The present work contributes a novel content specialization scheme for periodic, push-based data streaming services. Its goal is to maximize the ratio of user requests served within their respective deadlines. In this sense, optimality is proven to be achievable only by discarding all requests for certain data items, focusing solely on the streaming of the remaining ones. Thus, the service achieves the content specialization that yields the most clients. The methodology workflow is as follows. By means of mathematical analysis we quantify data compatibility in terms of boosting the system's service ratio. A data selection algorithm is then proposed, which follows a sort-and-segment approach. Through simulations, the algorithm is shown to surpass related solutions, while coinciding with bruteforce results and analytical expectations.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2013.104