© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt Vijay Kumar & Nitin Prabhu SCE, Computer Networking University of Missouri-Kansas.

Slides:



Advertisements
Similar presentations
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 9 Fundamentals.
Advertisements

Recovery Techniques in Mobile Databases Prepared by Ammar Hamamra.
1 Integrity Ioan Despi Transactions: transaction concept, transaction state implementation of atomicity and durability concurrent executions serializability,
Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.
Data Integrity Proofs in Cloud Storage Sravan Kumar R, Ashutosh Saxena Communication Systems and Networks (COMSNETS), 2011 Third International Conference.
The State of the Art in Distributed Query Processing by Donald Kossmann Presented by Chris Gianfrancesco.
SELECT: Self-Learning Collision Avoidance for Wireless Networks Chun-Cheng Chen, Eunsoo, Seo, Hwangnam Kim, and Haiyun Luo Department of Computer Science,
Introduction CSCI 444/544 Operating Systems Fall 2008.
Advanced Database Systems September 2013 Dr. Fatemeh Ahmadi-Abkenari 1.
Database Replication techniques: a Three Parameter Classification Authors : Database Replication techniques: a Three Parameter Classification Authors :
Distributed Systems 2006 Styles of Client/Server Computing.
Jang, Donghyun 2011/4/4 1/21.
Analysis of Using Broadcast and Proxy for Streaming Layered Encoded Videos Wilson, Wing-Fai Poon and Kwok-Tung Lo.
1 Distributed Databases Chapter Two Types of Applications that Access Distributed Databases The application accesses data at the level of SQL statements.
Transaction Management and Concurrency Control
Ncue-csie1 A QoS Guaranteed Multipolling Scheme for Voice Traffic in IEEE Wireless LANs Der-Jiunn Deng 、 Chong-Shuo Fan 、 Chao-Yang Lin Speaker:
A Trust Based Assess Control Framework for P2P File-Sharing System Speaker : Jia-Hui Huang Adviser : Kai-Wei Ke Date : 2004 / 3 / 15.
APPLAUS: A Privacy-Preserving Location Proof Updating System for Location-based Services Zhichao Zhu and Guohong Cao Department of Computer Science and.
“On the Integration of MPEG-4 streams Pulled Out of High Performance Mobile Devices and Data Traffic over a Wireless Network” Spyros Psychis, Polychronis.
Transaction Management and Concurrency Control
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 34 – Media Server (Part 3) Klara Nahrstedt Spring 2012.
Research in Computer Science and Telecommunication Research in Computer Science and Telecommunication Vijay Kumar Vijay Kumar Computer Science School of.
Computer System Lifecycle Chapter 1. Introduction Computer System users, administrators, and designers are all interested in performance evaluation. Whether.
AN OPTIMISTIC CONCURRENCY CONTROL ALGORITHM FOR MOBILE AD-HOC NETWORK DATABASES Brendan Walker.
Efficient Scheduling of Heterogeneous Continuous Queries Mohamed A. Sharaf Panos K. Chrysanthis Alexandros Labrinidis Kirk Pruhs Advanced Data Management.
Introduction and Overview Questions answered in this lecture: What is an operating system? How have operating systems evolved? Why study operating systems?
Freshness-Aware Scheduling of Continuous Queries in the Dynamic Web Mohamed A. Sharaf Alexandros Labrinidis Panos K. Chrysanthis Kirk Pruhs Advanced Data.
Spring Efficient Dissemination of Enterprise Summary Data to Mobile Clients Mohamed A. Sharaf University of Pittsburgh.
1 Adaptive QoS Framework for Wireless Sensor Networks Lucy He Honeywell Technology & Solutions Lab No. 430 Guo Li Bin Road, Pudong New Area, Shanghai,
Mutual Exclusion in Wireless Sensor and Actor Networks IEEE SECON 2006 Ramanuja Vedantham, Zhenyun Zhuang and Raghupathy Sivakumar Presented.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Video Streaming over Cooperative Wireless Networks Mohamed Hefeeda (Joint.
William Easton. Introduction  Mobile Environments  Locking and Data Starvation  Mobile DB Architecture  Timing Mechanisms  Static Timer  Dynamic.
Managing Real-Time Transactions in Mobile Ad-Hoc Network Databases Le Gruenwald The University of Oklahoma School of Computer Science Norman, Oklahoma,
Transaction Lectured by, Jesmin Akhter, Assistant professor, IIT, JU.
November 4, 2003APOC 2003 Wuhan, China 1/14 Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs Presented by Ruibiao Qiu Department of Computer.
Multi-Criteria Routing in Pervasive Environment with Sensors Santhanakrishnan, G., Li, Q., Beaver, J., Chrysanthis, P.K., Amer, A. and Labrinidis, A Department.
CMPT 354, Simon Fraser University, Fall 2008, Martin Ester 136 Database Systems I SQL Modifications and Transactions.
Zone Sharing: A Hot-Spots Decomposition Scheme for Data-Centric Storage in Sensor Networks Mohamed Aly Nicholas Morsillo Panos K. Chrysanthis Kirk Pruhs.
Low Cost Commit Protocols for Mobile Computing Environments Marc Perron & Baochun Bai.
Cell Zooming for Cost-Efficient Green Cellular Networks
Downlink Scheduling With Economic Considerations to Future Wireless Networks Bader Al-Manthari, Nidal Nasser, and Hossam Hassanein IEEE Transactions on.
____________________________ XML Access Control for Semantically Related XML Documents & A Role-Based Approach to Access Control For XML Databases BY Asheesh.
1 Recovery in the Mobile Wireless Environment Using Mobile Agents S. Gadiraju, V. Kumar Presented by Yamin Yu.
Optimistic Methods for Concurrency Control By: H.T. Kung and John Robinson Presented by: Frederick Ramirez.
Energy-Efficient Data Caching and Prefetching for Mobile Devices Based on Utility Huaping Shen, Mohan Kumar, Sajal K. Das, and Zhijun Wang P 邱仁傑.
©Silberschatz, Korth and Sudarshan14.1Database System Concepts - 6 th Edition Chapter 14: Transactions Transaction Concept Transaction State Concurrent.
Data Scheduling for Multi-item and transactional Requests in On-demand Broadcast Nitin Pabhu Vijay Kumar MDM 2005.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
Using Proxy Cache Relocation to Accelerate Web Browsing in Wireless/Mobile Comm. Authors: Stathes Hadjiefthymiades and Lazaros Merakos Dept. of Informatics.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
30 Copyright © 2009, Oracle. All rights reserved. Using Oracle Business Intelligence Delivers.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
Video Caching in Radio Access network: Impact on Delay and Capacity
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.
1 Using Network Coding for Dependent Data Broadcasting in a Mobile Environment Chung-Hua Chu, De-Nian Yang and Ming-Syan Chen IEEE GLOBECOM 2007 Reporter.
A Low Interference Channel Assignment Algorithm for Wireless Mesh Networks Can Que 1,2, Xinming Zhang 1, and Shifang Dai 1 1.Department of Computer Science.
Architecture for Resource Allocation Services Supporting Interactive Remote Desktop Sessions in Utility Grids Vanish Talwar, HP Labs Bikash Agarwalla,
Chapter 13 Managing Transactions and Concurrency Database Principles: Fundamentals of Design, Implementation, and Management Tenth Edition.
Cost-Effective Video Streaming Techniques Kien A. Hua School of EE & Computer Science University of Central Florida Orlando, FL U.S.A.
2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)
5G MOBILE TECHNOLOGY By J.YOGESH 08M31A0425.
Transaction Management and Concurrency Control
On Scheduling of Peer-to-Peer Video Services
Chapter 10 Transaction Management and Concurrency Control
CSE 4340/5349 Mobile Systems Engineering
Distributed Databases
Introduction of Week 13 Return assignment 11-1 and 3-1-5
WELCOME TO SEMINAR.
Brahim Ayari, Abdelmajid Khelil and Neeraj Suri
Presentation transcript:

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt Vijay Kumar & Nitin Prabhu SCE, Computer Networking University of Missouri-Kansas City Kansas City, MO 64110, USA Panos K. Chrysanthis Computer Science University of Pittsburgh Pittsburgh, PA 15260, USA HDC - Hot Data Caching in Mobile Database Systems Presenter: Mohamed A. Sharaf Computer Science University of Pittsburgh

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt Topics covered Introduction to Mobile Database System Data caching in mobile environment Transaction processing Performance Conclusions HDC - Hot Data Caching in Mobile Database Systems

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt Mobile Database System – MDS This architecture is based on GSM (Global System for Mobile Communication) Mobile Unit (MU) A mobile user interacts with MDS through this unit It communicates with the Base Station (BS) through a wireless channel Examples: PDA, laptop, or a cell phone Base Station (BS) A BS serves a cell. It manages communication in its cell. It communicates with BSC through wired line. Base Station Controller (BSC) It manages the activities of a set of BSs Database Server (DBS) All mobile transactions are processed by one or more DBS A MU reaches a set of DBSs through its BS

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt Problem Statement: Problem Statement: Maximize the throughput (Minimize the response time) of Read-only transactions submitted at a mobile unit Contribution: Contribution: An integrated data-transaction shipping scheme that uses hot data caching to maximize correct local execution of Read- only transactions Approach: Approach: An overlay caching of hot data that: 1.Maximizes the number of transactions satisfied by the cached snapshot of the database 2.Minimizes rollbacks due to inconsistent data views HDC - Hot Data Caching in Mobile Database Systems

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt Topics covered Introduction to Mobile Database System Data caching in mobile environment Transaction processing Performance Conclusions HDC - Hot Data Caching in Mobile Database Systems

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt A user initiates transactions through a MU. Then, the MU performs the following steps: Data identification for caching Identifies the transaction’s data requirement Preprocessing method Profile-driven method Builds a data structure, refer to as “cache matrix”, to store these data Combines the new needed data with the data already cached

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt D1D8D10D11D15D20D22D30 T11111 T21 T3111 T411 T511 T6111 T71 T811 T911 T1011 Sum Data identification phase – An example Data Items Transactions “1” means: The transaction needs the data item 1.Low sum value identifies the least popular data item 2.Remove the least popular item 3.Remove transactions that access the least popular item D1D8D10D11D15D20D22D30 T11111 T21 T3111 T411 T511 T6111 T71 T811 T911 T1011 Sum

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt D1D10D15D30 T21 T6111 T811 T911 Sum2331 D1, D10, D15, D30  current cache contents (empty initially) = D1, D10, D15, D30 Hot Data = Data items for caching Warm Data = Data items required by T1, T3, T4, T5, T7, and T10 Data identification phase – An example The elimination continues until the number of data items is less than or equal to the cache size Example, if cache size = 4, then cache matrix is:

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt Topics covered Introduction to Mobile Database System Data caching in mobile environment Transaction processing Performance Conclusions HDC - Hot Data Caching in Mobile Database Systems

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt Transaction execution A transactions will fall into one of the following classes: 1.Active Transaction (AT): Uses the hot data and it is immediately scheduled for execution 2.Waiting Transaction (WT): Uses the warm data and it is transferred to the wait queue 3.New Transaction: Will join the AT or WT according to its data requirements How to schedule the execution of the transaction mix ?

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt 1.Schedule the new transaction immediately for execution if all of its required data is available in cache (i.e., hot date) 2.Add the new transaction to the wait queue if few of its desired data is available in cache (i.e., warm data) 3.Send the new transaction to the DBS if none of its desired data is available in cache (i.e., cold data) 4.After a predefined interval, create a new cache matrix and refresh the cache Some of the waiting transactions will become active Some of the waiting transactions will continue waiting 5.To avoid starvation, a waiting transaction is sent to the server after a predefined number of cache refreshes Transaction Scheduling

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt Topics covered Introduction to Mobile Database System Data caching in mobile environment Transaction processing Performance Conclusions HDC - Hot Data Caching in Mobile Database Systems

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt Simulation Model Assumptions: An upper limit on the number of transactions that can be executed concurrently, called MPL A new cache matrix is created if the number of waiting transactions is equal to MPL A waiting transaction is shipped to the server after two cache refreshes

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt Average transaction wait time with cache size Performance measurement

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt % of transactions executed in each phase CacheInitial cache1 refresh2 refreshTo server 10012%21%7%60% 15023%48%7%22% 20030%70%0% 25039%61%0% Performance measurement

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt Performance comparison Percentage Transaction executed at MU in HDC and LFU

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt Transaction wait time in HDC and LFU Performance comparison

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt Throughput with MPL in HDC and LFU Performance comparison

© Vijay Kumar, Nitin Prabhu, Panos K. Chrysanthis, USA AICCSA – 2005, Cairo, Egypt Conclusions The work proposed the following: 1.The Hot Data Caching (HDC) policy which is especially suitable for the mobile transaction processing 2.A transaction scheduling mechanism that integrates data and transaction shipping to reduce the average transaction wait time Preliminary results show that using our proposed HDC leads to increasing the number of transactions that are locally executed at the mobile host. This feature allows HDC to significantly reduces transactions’ wait time compared to existing caching policies.