1 A Scalable Execution Control Method for Context- dependent Services Wataru Uchida, Hiroyuki Kasai, Shoji Kurakake Network Laboratories, NTT DoCoMo, Inc.

Slides:



Advertisements
Similar presentations
Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms Chenyang Lu, John A. Stankovic, Gang Tao, Sang H. Son Presented by Josh Carl.
Advertisements

Normal Distributions: Finding Probabilities
Real time vehicle tracking and driver behavior monitoring using a cellular handset based on accelerometry and GPS data Kevin Burke 4 th Electronic and.
Statistical Issues in Research Planning and Evaluation
1 1 Slide IS 310 – Business Statistics IS 310 Business Statistics CSU Long Beach.
6/2/ An Automatic Personalized Context- Aware Event Notification System for Mobile Users George Lee User Context-based Service Control Group Network.
Department of Electrical and Computer Engineering Development of a Portable Work Zone Traffic Safety Information System using DSRC Based V2I and V2V Communication.
Team Members: Cliff Clark, Gary Hollingshead, and Elizabeth Reese 1 TEAM FAULT FINDERS SENIOR DESIGN REVIEW Sponsors: Idaho Power Others Involved: Schweitzer.
Urban Sensing Jonathan Yang UCLA CS194 Fall 2007 Jonathan Yang UCLA CS194 Fall 2007.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
Final Year Project LYU0301 Location-Based Services Using GSM Cell Information over Symbian OS Mok Ming Fai CEG Lee Kwok Chau CEG
A Real-Time Video Multicast Architecture for Assured Forwarding Services Ashraf Matrawy, Ioannis Lambadaris IEEE TRANSACTIONS ON MULTIMEDIA, AUGUST 2005.
© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-1 Operations Management Simulation Module F.
1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.
1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.
Empirical Analysis of Transmission Power Control Algorithms for Wireless Sensor Networks CENTS Retreat – May 26, 2005 Jaein Jeong (1), David Culler (1),
Geographic Information Business and Interoperability: The Future of GIS Andrew U. Frank Geoinfo TU Vienna overheads available.
Supervisory Systems.
© 2010 Pearson Education Inc.Goldstein/Schneider/Lay/Asmar, CALCULUS AND ITS APPLICATIONS, 12e – Slide 1 of 15 Chapter 12 Probability and Calculus.
Speed and Direction Prediction- based localization for Mobile Wireless Sensor Networks Imane BENKHELIFA and Samira MOUSSAOUI Computer Science Department.
Smartphones for Seniors Apps presentation by WIT Software.
Business Process Performance Prediction on a Tracked Simulation Model Andrei Solomon, Marin Litoiu– York University.
Testing Hypotheses I Lesson 9. Descriptive vs. Inferential Statistics n Descriptive l quantitative descriptions of characteristics n Inferential Statistics.
Introduction to HP LoadRunner Getting Familiar with LoadRunner >>>>>>>>>>>>>>>>>>>>>>
1 1 Slide © 2005 Thomson/South-Western Chapter 9, Part B Hypothesis Tests Population Proportion Population Proportion Hypothesis Testing and Decision Making.
Towards A User-Centric Identity-Usage Monitoring System - ICIMP Daisuke Mashima and Mustaque Ahamad College of Computing Georgia Institute of Technology.
Ch2 Data Preprocessing part2 Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2009.
Subjective Sound Quality Assessment of Mobile Phones for Production Support Thorsten Drascher, Martin Schultes Workshop on Wideband Speech Quality in Terminals.
Best-Case WiBro Performance for a Single Flow 1 MICNET 2009 Shinae Woo †, Keon Jang †, Sangman Kim † Soohyun Cho *, Jaehwa Lee *, Youngseok Lee ‡, Sue.
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random Walks Bo Han, Aravind Srinivasan University of Maryland.
Axis Intelligent Video Strategy Focus on Embedded Video Analytics.
Prepared By :.  Introduction  Techniques Used  Case Study  Advantages  Application  Conclusion OUTLINE.
Recommendation system MOPSI project KAROL WAGA
Department of Computer Science City University of Hong Kong Department of Computer Science City University of Hong Kong 1 Probabilistic Continuous Update.
ABC Manufacturing Demonstration of Attendance Enterprise.
Bandwidth Reallocation for Bandwidth Asymmetry Wireless Networks Based on Distributed Multiservice Admission Control Robert Schafrik Lakshman Krishnamurthy.
Structure of a Waiting Line System Queuing theory is the study of waiting lines Four characteristics of a queuing system: –The manner in which customers.
Multi-hop-based Monte Carlo Localization for Mobile Sensor Networks
Hybrid Simulation with Qualitative and Quantitative Integrated Model under Uncertainty Business Environment Masanori Akiyoshi (Osaka University) Masaki.
IPower: An Energy Conservation System for Intelligent Buildings International Journal of Sensor Networks Yu-Chee Tseng, You-Chiun Wang, and Lun- Wu Yeh.
1 Bayesian Methods. 2 Naïve Bayes New data point to classify: X=(x 1,x 2,…x m ) Strategy: – Calculate P(C i /X) for each class C i. – Select C i for which.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Chapter 11 Understanding Randomness.
Tracking Irregularly Moving Objects based on Alert-enabling Sensor Model in Sensor Networks 1 Chao-Chun Chen & 2 Yu-Chi Chung Dept. of Information Management.
1 1 Slide © 2005 Thomson/South-Western Slides Prepared by JOHN S. LOUCKS St. Edward’s University Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
EXPERIENCE | Transportation Adding Value for Economic Development Presented to: KCADC Economic Development Alliance September 29, 2006 Mobile Device Technology.
Handling Session Classes for Predicting ASP.NET Performance Metrics Ágnes Bogárdi-Mészöly, Tihamér Levendovszky, Hassan Charaf Budapest University of Technology.
Technical Session I MCRDR Classifier & Database Design Presenter Yangsok Kim School of Computing.
A. Hangan, L. Vacariu, O. Cret, H. Hedesiu Technical University of Cluj-Napoca A Prototype for the Remote Monitoring of Water Parameters.
Stretchable Architectures for Next Generation Cellular Networks Presented By Shashidhar Lakkavalli, Ansuya Negi and Dr. Suresh Singh Portland State University.
Data Scheduling for Multi-item and transactional Requests in On-demand Broadcast Nitin Pabhu Vijay Kumar MDM 2005.
Comparison of Tarry’s Algorithm and Awerbuch’s Algorithm CS 6/73201 Advanced Operating System Presentation by: Sanjitkumar Patel.
An Efficient Localization Algorithm Focusing on Stop-and-Go Behavior of Mobile Nodes IEEE PerCom 2011 Takamasa Higuchi, Sae Fujii, Hirozumi Yamaguchi and.
© 2002 GMU SYST 495 AATMS Team Autonomous Air Traffic Management System (AATMS): The Management and Design of an Affordable Ground-Based Air Traffic Management.
Dec. 13, 2003W 2 Implementation and Evaluation of an Adaptive Neighborhood Information Retrieval System for Mobile Users Yoshiharu Ishikawa.
Simulation in Healthcare Ozcan: Chapter 15 ISE 491 Fall 2009 Dr. Burtner.
Author Utility-Based Scheduling for Bulk Data Transfers between Distributed Computing Facilities Xin Wang, Wei Tang, Raj Kettimuthu,
Ensieea Rizwani An energy-efficient management mechanism for large-scale server clusters By: Zhenghua Xue, Dong, Ma, Fan, Mei 1.
Power Guru: Implementing Smart Power Management on the Android Platform Written by Raef Mchaymech.
1 Discriminative Frequent Pattern Analysis for Effective Classification Presenter: Han Liang COURSE PRESENTATION:
Learning and Inferring Transportation Routines Lin Liao, Don Patterson, Dieter Fox, Henry Kautz Department of Computer Science and Engineering University.
Central Network Management in the University Environment alias Ballad on One University Network Administration Milan Šorm, Petr Dadák, Hana Netrefová.
Dynamic Resource Allocation for Shared Data Centers Using Online Measurements By- Abhishek Chandra, Weibo Gong and Prashant Shenoy.
Purdue University, Georgia Institute of Technology, AT&T Labs Research
Distributed Network Traffic Feature Extraction for a Real-time IDS
Apple Pay Research on NFC and the security threat
“Location Privacy Protection for Smartphone Users”
Presentation transcript:

1 A Scalable Execution Control Method for Context- dependent Services Wataru Uchida, Hiroyuki Kasai, Shoji Kurakake Network Laboratories, NTT DoCoMo, Inc. Jun. 28, 2006

2 Outline Background and motivation Proposal of service execution control method Simulation results Conclusions and future works

3 Background Cellular networks are expected to provide context- dependent services  assist user's real world activities  continuously monitor context and are executed when the context satisfies pre-defined condition.

4 Context-dependent services Push-based restaurant recommendation automatically recommends nearby restaurants which have vacant tables. French restaurant "la mère" menu context: ・ location of user ・ availability of tables Child surveillance user user terminal's display child's terminal with GPS mother's terminal I arrived at the school! automatically notify mother of her child's arrival to school/station/private school. Other examples: 24hours healthcare service, Friend-finder service,... context: location of child

5 Problem and objective Need tremendous number of operations for execution controls  We have to continuously acquire and collect many kinds of context determine execution for a large number of services.  Example Restaurant-recommendation: continuously locate user, measure number of vacant tables, collect them and determine to recommend or not Execution control operations with low frequency doesn't always work well (risk of missing execution timing). Objective: reduce cost of execution control while preserving the service quality

6 Service execution control Context acquisition terminals (ex. cell phones with GPS device, non-contact type IC cards,...) ・・ ・ Server A User execution ③ Determination of service execution Network Server BServer C Execution condition ① Context acquisition ② Context collection : execution control operations

7 Determination of execution Calculate expected utility (EU) for execution( a 1 ) and non-execution( a 2 ), and chose one with higher EU  Utility: effect of execution/non-execution for the user  EU for a 1 and a 2 : : state of context : utility of action EU of non-execution ( ) EU of execution ( ) execution time t Expected utility (EU)

8 principle of our method Reduction of execution control operations Probability of satisfying execution condition (=risk of missing chance of execution) varies with time. Reduce execution control operations when probability of satisfying execution condition is low t high frequency (large risk) low frequency (small risk of missing chance) EU EU of non-execution ( ) EU of execution ( )

9 Interchange probability estimation Predict context values Utility in future can be estimated using predicted values Compare estimated with EU t now estimated EU of non-execution ( ) EU of execution ( ) Low probability High probability :probability distribution of EU

10 Collecting context with large effect Interchange probability depends on the values of each context.  Each context's effect on the probability is not equal. Context with large effect is collected more frequently. Each context's effect can be calculated using conditional probabilities.

11 Utility estimation use Bayesian network  can handle probability distributions of context. Distance ( D ) Option ( O ) customer number ( C ) Accepts the user ( B ) Utility (U) Action (A) a 1 : recommend a 2 : don't recommend Utility table OBAU YES a1a1 200 a2a NO a1a1 -50 a2a2 100 NO YES a1a1 -50 a2a2 100 NO a1a a2a2 150

12 System architecture Server-side controller Server AServer BServer C Context 1 acquisition terminal Invoke execution Register execution condition Context 2 acquisition terminal Collect context with high effect frequently when probability of satisfying execution condition is high. ... Each terminal send values when the value enters "alert region" (estimation is incorrect and execution time approaches ) (Future work)

13 Simulation setup Metrics: number of collections, service quality (explained in following slides) Assumed service: restaurant recommendation Compared with: method which Periodically performs Execution Control operations (PEC) 3km User Max speed: 100m/min Restaurant Context: distance from restaurant, availability of tables Random-walk Num. vacant tables increased or decreased at every minute ・・ ・

14 Service quality (1/2) We measured execution ratio: (num. of timings service is executed) / (num. of timings execution condition is satisfied)  Service quality is high when the ratio is high. t :Timings services are executed :Timings execution condition is satisfied Execution ratio = 4 / 8 = 50%

15 Service quality (2/2) Also measured deviation from ideal decisions:  Sum of times when the decision is different from that of the ideal case (execution control with the highest frequency) Service quality is high when the value is small. t Timings in the ideal case t Timings the method detected Time when the decision is different

16 Result 1/2: Execution ratio Cost: high Number of collections Service quality: high Reduce 90% of the total cost

17 Result 2/2: deviation from ideal decisions Cost: high Number of collections Service quality: high

18 Conclusions Scalable execution control method for context- dependent services  Methodology: gather context when the service execution condition is about to be satisfied  Simulation results: execution control operations are reduced while preserving service quality [Future works] Development of execution control using alert region Service quality loss-less (e.g. execution guaranteed) method

19 Thank you!