140 likes | 239 Views
A Framework for Composing Pervasive Applications. Oleg Davidyuk , Ivan Sanchez, Jon Imanol Duran and Jukka Riekki. University of Oulu, Finland. Advances in Methods of Information and Communication Technology (AMICT'08) Workshop. plasma display. web/database servers. Resources.
E N D
A Framework for Composing Pervasive Applications Oleg Davidyuk, Ivan Sanchez, Jon Imanol Duran and Jukka Riekki University of Oulu, Finland Advances in Methods of Information and Communication Technology (AMICT'08) Workshop
plasma display web/database servers • Resources • speaker system • projector mobile phone laptop The concept • Application • User
speech text touch video gestures audio From: http://press.web.cern.ch/press/PressReleases/Releases2003/Images/ Potential Application Scenarios • Virtual Devices (or Resource Sharing) • Load Distribution (Grids and Web services) • Multimodal User Interfaces (speech, video kinetic, tactile)
Composed pervasive applications S3 R2 S1 R3 S4 S2 R1 Service discovery Application Assembly Resource Management Ubiquitous middleware Conceptual Architecture Context providers
Differences from the related work • Related work • Selecting resources according to a goal (COCOA) • Applications with proprietary architecture (Gaia) • Semantically independent systems (AURA, COCOA) • Our approach • Applications adapt their architecture • Support for applications regardless of their specific properties
Application Model Platform Model Application and Platform Graphs • 30 nodes
Increasing The objective function values Index Proposed Solution • Conclusions from the previous work: • The search problem is uncorrelated • Larger graphs higher failure ratios • The algorithms: • Evolutionary (EA) and Genetic (GA) allocation algorithms • Hybrid problem handling (both CSP and OP) • Novel solution validation schema
Comparison of the Algorithms • Evolutionary Algorithm • Simple implementation • Relies on random mutation operator • Genetic Algorithm • Complex (population handling, sorting, etc) • Uses guided genetic operators
The fastest Performance Quality Most Stable Failure Ratio Difference 5~12% Analysis Logarithmic scale
RFid tag RFid tag Practical Contribution • Installation: • Displays and media servers • 3 application components Remote UI
Application setup time Average time, ms 79% 84% 91% 93% Number of resources in the enviroment The scalability test
User experiments • Resources: 8 displays, 3 media servers • 10 users, STO’s students and research personnel • 100% of them wanted an additional control over the algorithm’s choices: • 70% wanted to confirm choices manually • 30% wanted to receive additional notifications • Users indicated usefulness of the approach, especially in public places • Many options to choose (many available resources) • Unfamiliar environment • 80% were satisfied with the algorithm’s choices (20% expected different results) • The usability was rated very high (9,5 out of 10 points)
Future work • Increase the algorithm’s performance • Implement the next application scenario • Modify user interfaces and provide functionality required by the users • Study human-related aspects of application composition