TY - JOUR
T1 - Content-selection strategies for the periodic prefetching of WWW resources via satellite
AU - Dikaiakos, M.
AU - Stassopoulou, A.
PY - 2001/1/1
Y1 - 2001/1/1
N2 - In this paper we study satellite-caching, that is, the employment of satellite multicasting for the dissemination of prefetched content to WWW caches. This approach is currently being deployed by major satellite operators and ISPs around the world. We introduce a theoretical framework to study satellite-caching and formalize the notions of Utility and Quality of Service. We explore two charging schemes, Usage- and Subscription-based pricing, and propose a framework for negotiating the provision of the satellite-caching service between a satellite operator and its potential clients. We use this negotiation framework to compare theoretically the two pricing schemes at hand. We apply our modeling to formulate the selection of Web-content for satellite-multicasting as a combinatorial optimization problem. We study the complexity of Web-content selection and prove it is NP-complete. Finally, we propose and implement an approximation algorithm for content selection, and conduct experiments to assess its efficiency, validity and applicability.
AB - In this paper we study satellite-caching, that is, the employment of satellite multicasting for the dissemination of prefetched content to WWW caches. This approach is currently being deployed by major satellite operators and ISPs around the world. We introduce a theoretical framework to study satellite-caching and formalize the notions of Utility and Quality of Service. We explore two charging schemes, Usage- and Subscription-based pricing, and propose a framework for negotiating the provision of the satellite-caching service between a satellite operator and its potential clients. We use this negotiation framework to compare theoretically the two pricing schemes at hand. We apply our modeling to formulate the selection of Web-content for satellite-multicasting as a combinatorial optimization problem. We study the complexity of Web-content selection and prove it is NP-complete. Finally, we propose and implement an approximation algorithm for content selection, and conduct experiments to assess its efficiency, validity and applicability.
UR - http://www.scopus.com/inward/record.url?scp=0035155891&partnerID=8YFLogxK
U2 - 10.1016/S0140-3664(00)00292-9
DO - 10.1016/S0140-3664(00)00292-9
M3 - Article
AN - SCOPUS:0035155891
SN - 0140-3664
VL - 24
SP - 93
EP - 104
JO - Computer Communications
JF - Computer Communications
IS - 1
ER -