A Two Way Systems and Algorithms for Targeted Online Data Delivery
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
We demonstrate an option and more adaptable approach that extends client utility by fulfilling all clients. It does this while minimizing the use of system resources. We investigate the advantages of this last approach and build up an adaptable observing arrangement Satisfy User Profiles (SUPs). Through formal examination, we see adequate optimality conditions for SUP. Utilizing authentic (RSS channels) and fabricated tails, we observationally look at the lead of SUP under advancing conditions. Our trials show that we can complete an unusual condition of fulfillment of client utility when the estimations of SUP about gage the honest to goodness event stream, and can spare an impressive measure of system resources. We besides display that SUP can abuse contribution to upgrade customer utility with only an immediate augmentation in resource utilization.
Abstract
We demonstrate an option and more adaptable approach that extends client utility by fulfilling all clients. It does this while minimizing the use of system resources. We investigate the advantages of this last approach and build up an adaptable observing arrangement Satisfy User Profiles (SUPs). Through formal examination, we see adequate optimality conditions for SUP. Utilizing authentic (RSS channels) and fabricated tails, we observationally look at the lead of SUP under advancing conditions. Our trials show that we can complete an unusual condition of fulfillment of client utility when the estimations of SUP about gage the honest to goodness event stream, and can spare an impressive measure of system resources. We besides display that SUP can abuse contribution to upgrade customer utility with only an immediate augmentation in resource utilization.
참고문헌 (18)
- L. Bright, "Using latency-recency profiles for data delivery on the web", Proc. Very Large Data Bases (2002)
- D. Carney, "Scalable application-aware data freshening", Proc. ICDE (2003)
- M. Cherniack, "Profile-Driven Cache Management", Proceedings of 19th International Conference on Data Engineering (ICDE) (2003)
- J. Cho, "Synchronizing a database to improve freshness", Proc. ACM SIGMOD Conf. (2000)
- E. Cohen, "Refreshment Policiesfor Web Content Caches", Proceedings of IEEE INFOCOM (2001)
- P. Deolasee, "Adaptive push-pull: Disseminating dynamic web data", Proc. 10th WWW Conf. (2001)
- A. Gal, "Managing periodically updated data in relational databases : a stochastic modeling approach", Journal of the ACM, 48(6), pp.1141~1183 (2001)
- J. Gwertzman, "World wide web cache consistency", Proc. USENIX Technical Conference (1996)
- S. Pandey, "Wic: A general purpose algorithm for monitoring web information sources", Proceedings of Very Large Databases (VLDB) (2004)
- S. Pandey, "Monitoring the dynamic web to respond to continuous queries", Proceedings of the International World Wide Web Conference (WWW), pp.659~668 (2003)
- "RSS"[URL]
- R. Wolski, "Performance Information Services for Computational Grids" (2004), Kluwer
- 이성운, "지능형 컨테이너를 위한 익명성과 추적 기능을 제공하는 인증 및 키교환 프로토콜", 보안공학연구논문지, 13(1), pp.1~10 (2016), 보안공학연구지원센터[DOI]
- 임헌욱, "산업보안 패러다임 변화에 따른 보안 교육방안 고찰", 보안공학연구논문지, 12(6), pp.597~608 (2015), 보안공학연구지원센터[DOI]
- Regin Joy Conejar, "A Review on Mobile Services Secure Mobility Platform", 보안공학연구논문지, 12(5), pp.525~532 (2015), 보안공학연구지원센터[DOI]
- 이정하, "IoT 생태계 S-P-N-D-Se 모형으로 본 국내 사물인터넷 보안 연구 동향 분석", 보안공학연구논문지, 12(4), pp.397~414 (2015), 보안공학연구지원센터[DOI]
- 선복근, "스마트카드 기반의 안전하고 경량화된 모바일 지급결제 프로토콜", 보안공학연구논문지, 12(3), pp.259~272 (2015), 보안공학연구지원센터[DOI]
- 박시용, "센서 네트워크의 수명 연장을 위한 혼잡회피 정책", 보안공학연구논문지, 12(2), pp.169~180 (2015), 보안공학연구지원센터[DOI]