November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 1 Updating Web views distributed over wide area networks Sidiropoulos Antonis Katsaros.

Slides:



Advertisements
Similar presentations
Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Advertisements

Dissemination-based Data Delivery Using Broadcast Disks.
Supporting Cooperative Caching in Disruption Tolerant Networks
What’s the Problem Web Server 1 Web Server N Web system played an essential role in Proving and Retrieve information. Cause Overloaded Status and Longer.
GREEN IPTV A Resource and Energy Efficient Network for IPTV.
Dimitrios Katsaros* † Yannis Manolopoulos* † Aristotle University, Greece *University of Thessaly, Greece Suffix Tree Based Prediction for Pervasive Computing.
A Taxonomy and Survey of Content Delivery Networks Meng-Huan Wu 2011/10/26 1.
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
1 Layer-Encoded Video in Scalable Adaptive Streaming Michael Zink, Jens Schmitt, and Ralf Steinmetz, Fellow, IEEE IEEE TRANSACTIONS ON MULTIMEDIA, VOL.
Multimedia Proxy Caching Mechanism for Quality Adaptive Streaming Applications in the Internet R. Rejaie, H. Yu, M. Handley, D. Estrin.
WebKDD 2001 Aristotle University of Thessaloniki 1 Effective Prediction of Web-user Accesses: A Data Mining Approach Nanopoulos Alexandros Katsaros Dimitrios.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Motivation Due to the development of new Internet access technologies (DSL's and HFC's), VoD services have become increasingly popular Despite the continuous.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
Improving Proxy Cache Performance: Analysis of Three Replacement Policies Dilley, J.; Arlitt, M. A journal paper of IEEE Internet Computing, Volume: 3.
Decentralized resource management for a distributed continuous media server Cyrus Shahabi and Farnoush Banaei-Kashani IEEE Transactions on Parallel and.
Improving Proxy Cache Performance: Analysis of Three Replacement Policies John Dilley and Martin Arlitt IEEE internet computing volume3 Nov-Dec 1999 Chun-Fu.
1 CAPS: A Peer Data Sharing System for Load Mitigation in Cellular Data Networks Young-Bae Ko, Kang-Won Lee, Thyaga Nandagopal Presentation by Tony Sung,
1 Probabilistic Models for Web Caching David Starobinski, David Tse UC Berkeley Conference and Workshop on Stochastic Networks Madison, Wisconsin, June.
2001 Dimitrios Katsaros Panhellenic Conference on Informatics (ΕΠΥ’8) 1 Efficient Maintenance of Semistructured Schema Katsaros Dimitrios Aristotle University.
March 15, rd Latin American Web Congress (LA-WEB 2005) 1 George Pallis Athena Vakali Konstantinos Stamos Antonis Sidiropoulos Dimitrios Katsaros.
1 Introduction to Load Balancing: l Definition of Distributed systems. Collection of independent loosely coupled computing resources. l Load Balancing.
Caching And Prefetching For Web Content Distribution Presented By:- Harpreet Singh Sidong Zeng ECE Fall 2007.
Wide Web Load Balancing Algorithm Design Yingfang Zhang.
Web Caching Schemes For The Internet – cont. By Jia Wang.
1 Crawling the Web Discovery and Maintenance of Large-Scale Web Data Junghoo Cho Stanford University.
Web Caching and CDNs March 3, Content Distribution Motivation –Network path from server to client is slow/congested –Web server is overloaded Web.
OStream: Asynchronous Streaming Multicast in Application-Layer Overlay Networks Yi Cui, Baochun Li, and Klara Nahrstedt IEEE Journal on Selected Areas.
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
World Wide Web Caching: Trends and Technology Greg Barish and Katia Obraczka USC Information Science Institute IEEE Communications Magazine, May 2000 Presented.
Distributing Content Simplifies ISP Traffic Engineering Abhigyan Sharma* Arun Venkataramani* Ramesh Sitaraman*~ *University of Massachusetts Amherst ~Akamai.
SCAN: a Scalable, Adaptive, Secure and Network-aware Content Distribution Network Yan Chen CS Department Northwestern University.
Freshness-Aware Scheduling of Continuous Queries in the Dynamic Web Mohamed A. Sharaf Alexandros Labrinidis Panos K. Chrysanthis Kirk Pruhs Advanced Data.
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
World Wide Web Caching: Trends and Technologys Gerg Barish & Katia Obraczka USC Information Sciences Institute, USA,2000.
An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.
Web Caching By Neeraj Agrawal. Caching Caching is widely used for improving performance in many context( e.g processor caches in hardware, buffer pool.
Design and Analysis of Advanced Replacement Policies for WWW Caching Kai Cheng, Yusuke Yokota, Yahiko Kambayashi Department of Social Informatics Graduate.
Understanding the Performance of Web Caching System with an Analysis Model and Simulation Xiaosong Hu Nur Zincir-Heywood Sep
Prefetching Challenges in Distributed Memories for CMPs Martí Torrents, Raúl Martínez, and Carlos Molina Computer Architecture Department UPC – BarcelonaTech.
Energy-Efficient Monitoring of Extreme Values in Sensor Networks Loo, Kin Kong 10 May, 2007.
/ 22 1 A Distributed and Efficient Flooding Scheme Using 1-hop Information in Mobile Ad Hoc Networks Hai Liu Xiaohua Jia Peng-Jun Wan Dept. of Comput.
Dynamic-Content Web Caching with Cooperative Proxy Scheme Βελισκάκης Μανώλης Εθνικό Μετσόβιο Πολυτεχνείο Dept. of Electrical & Computer Engineering Knowledge.
World Wide Web Caching CS457 Seminar Yutao Zhong 11/13/2001.
DCIM: Distributed Cache Invalidation Method for Maintaining Cache Consistency in Wireless Mobile Networks.
1 Time-scale Decomposition and Equivalent Rate Based Marking Yung Yi, Sanjay Shakkottai ECE Dept., UT Austin Supratim Deb.
What is Web Information retrieval from web Search Engine Web Crawler Web crawler policies Conclusion How does a web crawler work Synchronization Algorithms.
Martin Kruliš by Martin Kruliš (v1.1)1.
Web Prefetching Lili Qiu Microsoft Research March 27, 2003.
Content Delivery Networks: Status and Trends Speaker: Shao-Fen Chou Advisor: Dr. Ho-Ting Wu 5/8/
09/13/04 CDA 6506 Network Architecture and Client/Server Computing Peer-to-Peer Computing and Content Distribution Networks by Zornitza Genova Prodanoff.
Video Caching in Radio Access network: Impact on Delay and Capacity
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
/ Fast Web Content Delivery An Introduction to Related Techniques by Paper Survey B Li, Chien-chang R Sung, Chih-kuei.
Accelerating Peer-to-Peer Networks for Video Streaming
Nikos Dimokas1 Dimitrios Katsaros2 (presentation)
Coral: A Peer-to-peer Content Distribution Network
Effective Prediction of Web-user Accesses: A Data Mining Approach
Introduction to Load Balancing:
The Impact of Replacement Granularity on Video Caching
H.264/SVC Video Transmission Over P2P Networks
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
Dissemination-based Data Delivery Using Broadcast Disks
Determining the Peer Resource Contributions in a P2P Contract
Effective Prediction of Web-user Accesses: A Data Mining Approach
Nikos Dimokas1 Dimitrios Katsaros (presentation) Leandros Tassiulas2
Dynamic Replica Placement for Scalable Content Delivery
EE 122: Lecture 22 (Overlay Networks)
Existing CDNs Fail to Address these Challenges
Presentation transcript:

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 1 Updating Web views distributed over wide area networks Sidiropoulos Antonis Katsaros Dimitrios Aristotle Univ. of Thessaloniki, Greece Presentation by: Katsaros Dimitrios

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 2 Content Distribution Networks INTERNET 2 1 Origin Web server Web client CDN Cache Servers

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 3 Content Distribution Networks Advantages –prevention of the flush crowd problem –avoidance of network congestion –reduction of user-perceived latency e.g., Akamai –launced in early 1999 –12,000 servers –in 1,000 networks

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 4 Disseminating Updates

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 5 Related work & Motivation Proposed method Preliminary performance evaluation Conclusions & Future work Outline

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 6 Related work & Motivation Proposed method Preliminary performance evaluation Conclusions & Future work Presentation Outline

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 7 Lack of bandwidth to disseminate all updates Many caches Single point of updates generation Best-effort cache coherency

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 8 Static Web object caching/prefetching (Katsaros & Manolopoulos, ACM SAC’04) (Nanopoulos, Katsaros & Manolopoulos, IEEE TKDE’03) Dynamic Web object caching/prefetching –cache plays the central role i.e., prefetching (Cho & Garcia-Molina, SIGMOD’00) and (Gal & Eckstein, J.ACM’01) –minimizing the bandwidth consumption and query latency in the presence of constraints on the age or accuracy of cached objects (Bright & Raschid, VLDB’02; Cohen & Kaplan, Computer Networks’02; Olston & Widom, SIGMOD’01) –strong cache coherence maintenance (Challenger, Iyengar & Dantzig, INFOCOM’99) –update dissemination, best-effort but with a single cache (Labrinidis & Roussopoulos, VLDB’01) –caches and sources cooperate, best effort caching, (Olston & Widom, SIGMOD’02) –optimal tranmission of updates, but fixed assumptions about update rates and transmission capabilities (Wang, Evans & Kwok, Information Systems Frontiers,’03) Related work

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 9 Related work & Motivation Proposed method Preliminary performance evaluation Conclusions & Future work Presentation Outline

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 10 Web object freshness Freshness of object O over period [t i,t j ]Freshness of database D with N objects

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 11 The access pattern of Web objects is skewed Objects with higher access rates contribute more to what is perceived as database freshness For a database with N objects O i each with popularity f Oi the freshness is defined as : Weighted Web object freshness

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 12 Devise a sequence of update disseminations so as to maximize F(D,T) Hence: The “best-effort” cache coherence maintenance is a nonpreemptive scheduling problem Maintain best-effort coherency

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 13 FIFO scheduling Assume that there are sufficient –network resources –processing resources Use of the FIFO scheduling (First-Come- first-Served) Visualize our scheduling problem with the 2-dimensional Gantt charts (Goemans & Williamson, SIAM Journal on Discrete Mathematics’00)

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 14 We have three pending refreshes in the server's queue, i.e., Refresh1, Refresh2 and Refresh3, which occurred with the order mentioned Example of updates Total costPopularity Refresh145 Refresh234 Refresh312

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 15 2-D Gantt chart for FIFO popularity cost Divergence = 1 - Freshness = Area under the thick polygonal line = 64

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 16 Can we do better ? popularity cost 1 2 3

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 17 Can we do better ? popularity cost 1 2 3

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 18 Yes ! Schedule the max(pop/cost) Divergence = 1 - Freshness = Area under the thick polygonal line = 58 (10% gains even for this small example) popularity cost pop/cost Refresh15/4=1,25 Refresh24/3=1,33 Refresh32/1=2

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 19 Select for dissemination the update with the largest popularity/cost ratio It can be proved that this rule is optimal No longer optimal in the presence of dependencies Very efficient heuristic even when there exist dependencies Largest Slope Rule scheduling

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 20 Related work & Motivation Proposed method Preliminary performance evaluation Conclusions & Future work Presentation Outline

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 21 Simulated System Hardware MasterCDN CDN server n Routers/Gateways Parasol Node Parasol CPU Parasol Network Link Router CPU:2 CPU:1 CPU:0 CDN server 1CDN server 2

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 22 Simulated System Model Dispatcher Scheduler algorithm Relation updates DBMS ViewUpdater CDN1 updater CDN2 updater CDNn updater CDN1CDN2 CDNn DB updates Request for view update Master CDN

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 23 masterCDN components DBMS CPU:1 ViewUpdater Node:MasterCDN CPU:0 Dispatcher CPU:2 Pool of views to be updated Schedul er algorith m CDN1 updater Pool of views to trans mit CDN2 updater Pool of views to transmi t CDNn updater Pool of views to trans mit Rel. Queue Relation update

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 24 Synthetic (sample CDN with 10 edge servers) –Synthetic data generator Modeling network nodes, network bandwidth, size of documents, relations, views, view derivation hierarchy, update rates, popularity Examine the impact of: –update rate –number of relations Methodology

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 25 Freshness vs. Update rate

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 26 Freshness vs. Update rate

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 27 Freshness vs. Update rate

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 28 Freshness vs. #Relations

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 29 LSR Freshness vs. update rate

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 30 Freshness vs. (#Rel, dep_density) Top: 100 Rels Botom: 500 Rels Left: Sparse dep.Right: Dense dep.

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 31 Related work & Motivation Proposed method Preliminary performance evaluation Conclusions & Future work Presentation Outline

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 32 Conclusions –we proposed a best-effort cache coherence maintenance scheme for the edge servers of a CDN –it is a pure push-based dissemination method –the scheme is based on the LSR scheduling algorithm –we presented preliminary results to justify its efficiency Future work –Organize the edge serves into a (possibly) deep hierarchy, so as to parallelize the update dissemination Conclusions & Future work

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 33 1.L. Bright and L. Raschid, Using Latency-Recency Profiles for Data Delivery on the Web, Proc. of the VLDB, pp , J. Challenger, A. Iyengar, and P. Dantzig, A Scalable System for Consistently Caching Dynamic Web Data, Proc. of the IEEE INFOCOM, J. Cho and H. Garcia-Molina, Synchronizing a Database to Improve Freshness, Proc. of the ACM SIGMOD, pp , E. Cohen and H. Kaplan, Refreshment Policies for Web Content Caches, Computer Networks, 38(6), , A. Gal and J. Eckstein, Managing Periodically Updated Data in Relational Databases: A Stochastic Modeling Approach, Journal of the ACM, 48(6), pp , M.X. Goemans and D.P. Williamson, Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler, SIAM Journal on Discrete Mathematics, 13(3), pp , D. Katsaros and Y. Manolopoulos, Caching in Web Memory Hierarchies, Proc. of the ACM SAC, A. Labrinidis and N. Roussopoulos, Update Propagation Strategies for Improving the Quality of Data on the Web, Proc. of the VLDB, A. Nanopoulos, D. Katsaros and Y. Manolopoulos, A Data Mining Algorithm for Generalized Web Prefetching, IEEE Trans. on Knowledge and Data Engineering, 15(5), pp , C. Olston and J. Widom, Adaptive Precision Setting for Cached Approximate Values, Proc. of the ACM SIGMOD, pp , C. Olston and J. Widom, Best-Effort Cache Synchronization with Source Cooperation, Proc. of the ACM SIGMOD, pp , J.W. Wang, D. Evans and M. Kwok, On Staleness and the Delivery of Web Pages, Information Systems Frontiers, 5(2), pp , References

November 22, 2003 BCI 2003 Aristotle University of Thessaloniki 34 Sidiropoulos Antonis Dept. of Informatics Aristotle University Thessaloniki, 54124, Greece Katsaros Dimitrios Dept. of Informatics Aristotle University Thessaloniki, 54124, Greece Contact information