Sleepers & Workaholics Caching Strategies in Mobile Computing Dr. Daniel Barbará Dr. Tomasz Imielinski.

Slides:



Advertisements
Similar presentations
Dynamic Generation of Data Broadcasting Programs for Dynamic Generation of Data Broadcasting Programs for a Broadcast Disk Array in a Mobile Computing.
Advertisements

Energy Efficient Data Collection In Distributed Sensor Environments Qi Han, Sharad Mehrotra, Nalini Venkatasubramanian {qhan, sharad,
Dissemination-based Data Delivery Using Broadcast Disks.
Destage Algorithms for Disk Arrays with Nonvolatile Caches IEEE TRANSACTIONS ON COMPUTERS, VOL. 47, NO. 2, JANUARY 1998 Anujan Varma, Member, IEEE, and.
Introduction to Computer Networks Spanning Tree 1.
Energy Conservation in Datacenters through Cluster Memory Management and Barely-Alive Memory Servers Vlasia Anagnostopoulou Susmit.
About Me Joshua Silver  4th year CS major – graduating in May  Specialization: Databases  Interests:  The business side of computing … and no, not.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
1 Prediction-based Strategies for Energy Saving in Object Tracking Sensor Networks Yingqi Xu, Wang-Chien Lee Proceedings of the 2004 IEEE International.
Hit or Miss ? !!!.  Cache RAM is high-speed memory (usually SRAM).  The Cache stores frequently requested data.  If the CPU needs data, it will check.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
On Reducing Communication Cost for Distributed Query Monitoring Systems. Fuyu Liu, Kien A. Hua, Fei Xie MDM 2008 Alex Papadimitriou.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Computer Science Department Stony Brook University.
ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Department of Computer Science Stony Brook University.
1 Ultra-Low Duty Cycle MAC with Scheduled Channel Polling Wei Ye Fabio Silva John Heidemann Presented by: Ronak Bhuta Date: 4 th December 2007.
1 SMART ANTENNA TECHNIQUES AND THEIR APPLICATION TO WIRELESS AD HOC NETWORKS JACK H. WINTERS /11/13 碩一 謝旻欣.
CS4514 Networks1 Distributed Dynamic Channel Selection in Chaotic Wireless Networks By: Matthias Ihmig and Peter Steenkiste Presented by: James Cialdea.
Infostations Niraj Patel. Background An Infostation is a wireless information service, confined to a small geographical location with a limited coverage.
SAIU: An Efficient Cache Replacement Policy for Wireless On-demand Broadcasts Jianliang Xu, Qinglong Hu, Dik Lun Department of Computer Science in HK University.
1Bloom Filters Lookup questions: Does item “ x ” exist in a set or multiset? Data set may be very big or expensive to access. Filter lookup questions with.
Web Caching Schemes For The Internet – cont. By Jia Wang.
Jianliang XU, Dik L. Lee, and Bo Li Dept. of Computer Science Hong Kong Univ. of Science & Technology April 2002 On Bandwidth Allocation for Data Dissemination.
Client-Server Computing in Mobile Environments
Daeho Jeong Zachary Kotary James Campbell Ming Qian Faye Nguyen MIS Credit Rating Service.
Module 8: Monitoring SQL Server for Performance. Overview Why to Monitor SQL Server Performance Monitoring and Tuning Tools for Monitoring SQL Server.
Wang, Z., et al. Presented by: Kayla Henneman October 27, 2014 WHO IS HERE: LOCATION AWARE FACE RECOGNITION.
The Need for Speed. The PDF-4+ database is designed to handle very large amounts of data and provide the user with an ability to perform extensive data.
Jani Pousi Supervisor: Jukka Manner Espoo,
Mobile Databases: a Selection of Open Issues and Research Directions Authors: Rachid Guerraoui et al. Sources: SIGMOD Record, 33(2), pp.78-83, 2004 Adviser:
AN OPTIMISTIC CONCURRENCY CONTROL ALGORITHM FOR MOBILE AD-HOC NETWORK DATABASES Brendan Walker.
A Theoretical Study of Optimization Techniques Used in Registration Area Based Location Management: Models and Online Algorithms Sandeep K. S. Gupta Goran.
Kanika Chawla Parth Shah Sowmith Boyanpalli MEMORY MANAGEMENT IN MOBILE ENVIRONMENT.
Capacity Scaling with Multiple Radios and Multiple Channels in Wireless Mesh Networks Oguz GOKER.
Higashino Lab. Maximizing User Gain in Multi-flow Multicast Streaming on Overlay Networks Y.Nakamura, H.Yamaguchi and T.Higashino Graduate School of Information.
Managing Handoff. For operations and management to detect and isolating Handoff being particularly challenging, therefore it is important to understand.
Department of Computer Science City University of Hong Kong Department of Computer Science City University of Hong Kong 1 Probabilistic Continuous Update.
Automatic Gain Control Response Delay and Acquisition in Direct- Sequence Packet Radio Communications Sure 2007 Stephanie Gramc Dr. Noneaker.
ONLINE GAME NETWORK TRAFFIC OPTIMIZATION Jaewoo kim Youngho yi Minsik cho.
ECO-DNS: Expected Consistency Optimization for DNS Chen Stephanos Matsumoto Adrian Perrig © 2013 Stephanos Matsumoto1.
A Low-Overhead Coherence Solution for Multiprocessors with Private Cache Memories Also known as “Snoopy cache” Paper by: Mark S. Papamarcos and Janak H.
1 ACTIVE FAULT TOLERANT SYSTEM for OPEN DISTRIBUTED COMPUTING (Autonomic and Trusted Computing 2006) Giray Kömürcü.
By Shruti poundarik.  Data Objects and Files are replicated to increase system performance and availability.  Increased system performance achieved.
Mobile Data Access1 Replication, Caching, Prefetching and Hoarding for Mobile Computing.
Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,
DCIM: Distributed Cache Invalidation Method for Maintaining Cache Consistency in Wireless Mobile Networks.
Energy-Efficient Data Caching and Prefetching for Mobile Devices Based on Utility Huaping Shen, Mohan Kumar, Sajal K. Das, and Zhijun Wang P 邱仁傑.
Data Scheduling for Multi-item and transactional Requests in On-demand Broadcast Nitin Pabhu Vijay Kumar MDM 2005.
Minkyoon Kim, Sangjin Han1 Querying in Highly Mobile Distributed Environments T.Imielinski and B. R. Badrinath Minkyoon Kim Sangjin Han.
CPET 565 Mobile Computing Systems Data Dissemination and Management (2) Lecture 8 Hongli Luo Indiana University-Purdue University Fort Wayne.
Module 12: Configuring Windows XP Professional for Mobile Computing.
Optimized M2M interworking with mobile networks Group Name: oneM2M REQ Source: Takanori Iwai, NEC, Meeting Date: Agenda.
Optimization Problems in Wireless Coding Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
Wireless Cache Invalidation Schemes with Link Adaptation and Downlink Traffic Presented by Ying Jin.
Movement-Based Check-pointing and Logging for Recovery in Mobile Computing Systems Sapna E. George, Ing-Ray Chen, Ying Jin Dept. of Computer Science Virginia.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©
1 Wireless World Wide Web: Mobile Access to Web Resources 王讚彬 台中教育大學資訊系.
Feb 5, ECET 581/CPET/ECET 499 Mobile Computing Technologies & Apps Data Dissemination and Management 3 of 4 Lecture 8 Paul I-Hai Lin, Professor Electrical.
WUR-based Broadcast Reference Signal
Chapter 25: Advanced Data Types and New Applications
Data Dissemination and Management - Topics
Data Dissemination and Management (2) Lecture 10
Distributed Multimedia Systems
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT -Sumanth Kandagatla Instructor: Prof. Yanqing Zhang Advanced Operating Systems (CSC 8320)
CSE 4340/5349 Mobile Systems Engineering
CSE 4340/5349 Mobile Systems Engineering
Dissemination of Dynamic Data on the Internet
Data Dissemination and Management (3)
Data Dissemination and Management (2) Lecture 10
Presentation transcript:

Sleepers & Workaholics Caching Strategies in Mobile Computing Dr. Daniel Barbará Dr. Tomasz Imielinski

About Me Peter Rosegger  5th year Computer Science  Specialization: Databases  Graduation: December 2007

Sleepers & Workaholics Caching Strategies in Mobile Computing Dr. Daniel Barbará  Professor at George Mason University  Several patents associated with mobile caching Dr. Tomasz Imielinski  Professor at Rutgers University  Senior VP: Search Technology at Ask.com

million cellular subscribers in US

1994

The Future of Mobile Computing Use Habits:  Large # of users  Check weather, stocks, scores, etc.  Mobile between cells (& wireless networks) Hardware:  Low-powered palmtop machines  Poor battery life  Narrow bandwidth

The Future of Mobile Computing Query complex databases, but…  Frequently powered off to save battery  Frequently changing cells  Network traffic must be minimized to conserve bandwidth

Why Caching is Important Conserve: 1.COMPUTATIONAL RESOURCES 2.BATTERY LIFE 3.BANDWIDTH

Traditional Strategies Fail Server lacks knowledge of:  Which units are in its cell  Which units are powered ON Client caches cannot be tracked

The Solution Purpose of Sleepers & Workaholics: "…to propose a taxonomy of different cache invalidation strategies and study the impact of clients' disconnection times on their performance."

Strategies  Timestamps (TS)  Amnesic Terminals (AT)  Signatures (SIG) Control Strategy:  No Cache (NC)

Timestamps -Cache entries have timestamps -Synchronous, history based, uncompressed reports SERVER: Notify clients of identifiers of items changed within last w seconds CLIENT: For each item in cache: If in report, purge from cache If NOT in report, update timestamp to current time

Amnesic Terminals -Cache entries have identifiers -Synchronous, history based, uncompressed reports SERVER: Notify clients of identifiers of items changed within last w seconds CLIENT: For each item in cache: If in report, purge from cache If NOT in report, do nothing

Signatures -Checksums calculated over value of data to form Signature -Signatures combined using XOR -Synchronous, state based, compressed reports SERVER: Server broadcasts the set of combined signatures CLIENT: Item in cache is declared invalid if it belongs to “too many” unmatching signatures (suspected of being out of date)

Analysis Calculate THROUGHPUT for each strategy… L = time between invalidation report broadcasts W = bandwidth B = # bits in the broadcast (invalidation reports) # bits available for answering queries (cache misses) C

Analysis T = THROUGHPUT; queries per interval handled by the system h = cache hit rate, expressed [0, 1] b = # bits for a query b = # bits to answer a query Traffic (in bits) due to cache misses q a

Throughput

Effectiveness of a Strategy

Maximal Throughput Server knows: -What units are in the cell -What those units have in their caches Server can: -instantaneously notify units when an item changes

Maximal Hit Ratio The Hit Ratio achieved in ideal conditions:

Maximal Throughput

No Caching -No invalidation report -No intervals

Timestamps

Amnesic Terminals

Signatures Consider the probability of false diagnosis:  Probability of a false positive  Probability of a false negative

Asymptotic Analysis Analyze throughput in extreme cases:  As probability of sleeping s  0, s  1 Analyze throughput as system parameters vary:  Database size  Update frequency  Bandwidth  Etc.

Workaholics Unit sleeps less and less: s  0  All hit ratios approach the same value  SIG lags behind TS and AT by a factor of BEST THROUGHPUT:  AT, because its report is the shortest

Sleepers Unit sleeps more and more: s  1  All hit ratios approach 0 BEST THROUGHPUT:  No Caching eventually wins as s becomes very large  For practical purposes, SIG is the best choice

Infrequent Updates Effectiveness as s ranges from 0 to 1

Increase Database Size & Bandwidth Effectiveness as s ranges from 0 to 1

Update Intensive Effectiveness as s ranges from 0 to 1

Increase Database Size & Bandwidth Effectiveness as s ranges from 0 to 1

Conclusions on Effectiveness Strategy depends on circumstances:  SIG is best for sleepers  TS is best for query-intensive scenarios, but…  AT is best for workaholics How can we improve effectiveness?

Relax: Consistency of the Cache Depending on data type, data may not need to be exact… EX: stocks, weather, etc. Makes shorter invalidation reports possible

How Do We Decide to Update? - Consider cached copies to be quasi-copies - Each quasi-copy has a coherency condition attached to it Coherency Conditions: Delay Condition - updated based on time Arithmetic Condition - updated based on difference between data and quasi-copy

Adaptive Invalidation Reports -Start with TS strategy Use algorithms to optimize strategy. Examples:  If an item is queried very often by units that sleep a lot, include it in reports for longer  If an item changes frequently, do not bother caching

Criticism  Units rarely powered down Battery life better than predicted Battery life does not dictate use  Units still lose reception frequently Today’s most common “sleeper” condition -- explicitly excluded from definition in S&W  Bandwidth better than predicted

However…  Adjust “sleeper” to include lost reception  Caching is still important Endless demand for computational resources Endless demand for battery life Endless demand for more bandwidth