1. 1 CIS 6930: Mobile Computing Mobile Computing Models Sumi Helal 6

2. 2 References 4 5.1: J. Jing, A. Helal, A. Elmagarmid, "Client-Server Computing in Mobile Environments," ACM Computing Surveys, June 1999. 4 5.2: B. Noble, M.Satyanarayanan, D. Narayanan, J. Tilton, J. Flinn, K. Walker "Agile Application-Aware Adaptation for Mobility," Proceedings of the Sixteenth ACM Symposium on Operating Systems. 4 5.3: M. Ebling and M. Satyanarayanan, "On the Importance of Translucence for Mobile Computing," Proceedings of the 15th ACM Symposium on Operating Systems Principles, May 1998,, CO 4 5.4: A. Joseph and M. Kaashoek, "Building Reliable Mobile-Aware Applications using the Rover Toolkit," To appear in ACM Wireless Networks (WINET). 4 5.5: R. Gray, D. Kotz, S. Nog, D. Rus, and G. Cybenko, "Mobile Agents for Mobile omputing," Technical Report PCS-TR96-285, Dept. of Computer Science, Dartmouth College, May 1996. 4 5.6: B. Zenel and D. Duchamp, "A General Purpose Proxy Filtering Mechanism Applied to the Mobile Environment," Proceedings of the third annual ACM/IEEE Conference on Mobile Computing and Networking, Sept. 1997.

3. 3 References 4 5.7 Data Dissemination: – 5.7.1: S. Zdonik, M. Franklin, S. Acharya, and R. Alonso, "Are ``Disks in the Air'' Just Pie in the Sky?," Proceedings of the IEEE Workshop on Mobile Computing Systems Applications, Santa Cruz, CA, December 1994 –5.7.2: S. Acharya, R. Alonso, M. Franklin and S. Zdonik,"Broadcast Disks: Data Management for Asymmetric Communication Environments," Proceedings of the ACM SIGMOD, Conference, San Jose, CA, May 1995. – 5.7.3: S. Hameed and N. Vaidya, "Log-time Algorithms for Scheduling Single and Multiple Channel Data Broadcast," Proceedings of the third annual ACM/IEEE Conference on Mobile Computing and Networking, Sept. 1997. 4 5.8 Client/Server Caching: –5.8.1: J. Jing, A. Elmagarmid, A. Helal, and R. Alonso, Bit-Sequences, "An Adaptive Cache Invalidation Method in Mobile Client/Server Environments," the ACM-Baltzer Journal on Special Topics in Mobile Networks and Applications (MONET), Volume 2, Number 2, pp115-127, October 1997 –5.8.2: H. Lei and D. Duchamp, "An analytical approach to file prefetching," USENIXAnnual Technical Conference, 1997.

4. 4 Mobile Computing Models 4 Hierarchy of Computing Models 4 Taxonomy of C/S Adaptations 4 Unaware Client/Server Model 4 Client/Proxy/Server Model 4 Thin Client/Server Model 4 Disconnected Operation 4 Dynamic Client/Server Models 4 Mobile Agents

5. 5 Hierarchy of Computing Models Fixed Network Servers and clients Mobile Workflow Mobile Client Mobile Transaction Mobile Query Mobile Client Ad-hoc Mobile Server Client/Server

6. 6 Client/Server Computing Request Reply Cache Coherency: - cache invalidation - update propagation client cache Client Server Client State TLI RPC Sockets RMI TLI RPC Sockets RMI Fixed Network server cache

7. 7 Client/Server Design 4 Stateless/stateful client/server design 4 Caching and cache invalidation –server invalidates client cache and/or –client requests server to validate its cache. –file system caching: writes => update propagation 4 Connectionless/connection-oriented design 4 TCP/IP & Interfaces 4 Other issues: multi-threading &deadlocks

8. 8 Fixed Network C/S Assumptions 4 Client Connectivity –client is always connected with availability comparable to the server’s. Server can always invalidate the client cache 4 Server Availability & Reliability –server is highly available. Reliable if stateless (but state info is exchanged in every C/S interaction), or if implements recovery procedures (may require client availability) 4 Network –fast*, reliable*, BER < 10 -6, bounded delay variance

9. 9 Taxonomy of C/S Adaptations  System-transparent, application-transparent  The conventional, “unaware” client/server model  System-aware, application-transparent  the client/proxy/server model  the disconnected operation model  System-transparent, application-aware  dynamic client/server model  the mobile agent (object) model  System-aware, application-aware

10. 10 The Unaware Client/Server Model 4 Full client on mobile host and full server on fixed network (SLIP/PPP C/S) 4 Client and Server are not mobility-aware 4 Client caching does not work as the client can be disconnected when the server invalidates the cache 4 Not reliable and of unpredictable performance 4 Requires special cache invalidation algorithms to enable caching despite long client disconnections

11. 11 The Client/Proxy/Server Model 4 Adding mobility-awareness between the client and the server. Client and server are not mobility-aware. 4 Proxy functions as a client to the fixed network server, and as a mobility-aware server to the mobile client 4 Proxy may be placed in the mobile host (Coda’s Venus), or the fixed network, or both (WebExpress) 4 Application- and user-dependent 4 One advantage: enables thin client design for resource-poor mobile computers

12. 12 Thin Client/Server Model 4 Thin client fits in resource poor info appliances 4 Bounded communication 4 Requires at least weak connection 4 CITRIX WinFrame and ICA thin client 4 InfoPad Keyboard and mouse events Display events Server Thin Client

13. 13 The Disconnected Operation Model 4 Approach I: –Provide full client and a thin version of the server on the mobile platform. In addition, needed data is replicated into the mobile platform. Upon reconnection, updated replicas are synchronized with the home server. Conflict resolution strategies are needed (Coda/Venus & Oracle Lite) 4 Approach II: –Provide a full client and a mobility agent that intercepts requests to the unreachable server, emulates the server, buffers the requests, and transmit them upon reconnection (Oracle Mobile Agents)

14. 14 The Dynamic Client/Server Model 4 Servers (or their thin versions) dynamically relocate between mobile and fixed hosts. Proxies created and relocated dynamically 4 A spectrum of design and adaptation possibilities 4 Dynamic availability/performance tuning

15. 15 Dynamic Client/Server Model 4 Mobile objects: –applications programmed with dynamic object relocation policies for adaptation (Rover’s RDOs) 4 Collaborative Groups: –disconnected mobile clients turns into a group of collaborating, mobile servers and clients connected via an ad- hoc net. (Bayou architecture) 4 Virtual Mobility of Servers: –servers relocate in the fixed network, near the mobile host, transparently, as the latter moves.

16. 16 The Mobile Agent Model 4 Mobile agent programmed with platform limitations and user profile receives a request; moves into the fixed network near the requested service 4 Mobile agent acts as a client to the server, or invokes a client to the server 4 Based on the nature of the results, experienced communication delays, and programmed knowledge, the mobile agent performs transformations and filtering. 4 Mobile agent returns back to mobile platform, when the client is connected.

17. 17 Mobile Agents in the Mobile Environment

18. 18 File System Proxy in Coda 4 Disconnected operation (Venus): hoarding, emulating, reintegrating 4 Weakly connected operation: both object and volume call-backs 4 Isolation-Only Transactions

19. 19 Isolation-Only Transactions in Coda 4 Isolation-Only Transactions (AC I D): no failure atomicity guarantees. Also Durability is guaranteed only conditionally.

20. 20 Web Proxy in WebExpress The WebExpress Intercept Model

21. 21 Wireless Web Browser in Mowgli

22. 22 Thin Client InfoPad Architecture

23. 23 Mobile Data Management in C/S Design 4 Push/Pull data dissemination 4 Broadcast disks 4 Indexing on air 4 Client caching strategies and cache invalidation algorithms

24. 24 Push/Pull Data Dissemination upstream downstream B/W 4 Pull data delivery: clients request (validate) data by sending uplink msgs to server 4 Push data delivery: servers push data (and validation reports) through a broadcast channel,to a community of clients

25. 25 Broadcast Disks 4 Periodic broadcast of one or more disks using a broadcast channel 4 Each disk can be bcast at different speed 4 Disk speed can be changed based on client access pattern

26. 26 inx Indexing on Air 4 Server dynamically adjusts bcast hotspot 4 Clients read the index, enters into doze mode, and then perform selective tuning –Query Time: time taken from point a client issues a query until answer is received –Listening Time: time spent by client listening to the channel.

27. 27 Caching in Mobile Client/Server: Problems 4 Cashing is critical to many applications such as Web browsing and file and database systems 4 Classical cache invalidation techniques do not work effectively in the mobile environment because of: –client disconnection (call-backs do not work) –slow and limited up-link bandwidth for client invalidation (detection approach is inefficient) –very limited scalability for application servers with a large number of clients –limited caching capacity due to client memory and power consumption limitations

28. 28 Caching in Mobile Client/Server: Solutions 4 Variable granularity of cache coherency (Coda) 4 Enabling ideas: –Broadcast disks: periodic broadcast of disk-organized data; does not require upstream communication for disk reads –Indexing on the air: broadcast of disk and its index; allows selective tuning; increases access time but reduces tuning time; allows dormant state 4 Cache cache invalidation: –Broadcasting Timestamps [Barbará et al] –Bit Sequence [Jing et al]

29. 29 Varied Granularity of Cache Coherency in Coda 4 Server maintains version stamps for each object and its containing volume. When an object is updated, the server updates its version stamp and that of its containing volume. 4 In anticipation of disconnection, clients cache volume version stamps 4 Upon reconnection, clients present volume version stamps to server for validation 4 If valid, so is every object cached at the client, otherwise, cached objects are invalidated individually

30. 30 Cache Invalidation Reports 4 Server bcast invalidation report showing all items updated within preceding w seconds 4 Client connected: invalidation is straightforward 4 Clients must invalidate their entire cache if their disconnection period exceeds w seconds. id, ts Broadcast period Time Window

31. 31 The Bit-Sequences Caching Strategy 4 Addresses invalidation report size optimizations: –bit-sequence naming (each bit in a BS represents one data object) –update aggregation (one timestamp for a group of updates) 4 Effectiveness of invalidation report: accuracy of validating the status of cached data items w.r.t. invalidation report size 4 Addresses invalidation report effectiveness for clients with unpredictable disconnection time –hierarchical structure of BS’s (clients with different disconnection times can use different BS’s in the structure)

32. 32 Basic Bit-Sequences Method 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 1 0 0 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 0 1 1 0 1 1 0 1 1 0 1 0 TS(B 4 ) TS(B 1 ) TS(B 2 ) TS(B 3 ) DB time 50 200 16 0 140 B4B4 B1B1 B2B2 B3B3 4 Server: Bit-Sequences construction algorithm 4 Client: cache invalidation algorithm 4 Design: different bit- mapping strategies 4 Report size: L= 2N+b T log(N)

33. 33 Bit-Sequences Invalidation Precision x xxxxx x UPDATE TS(B k )TS(B k-2 )TS(B k-1 ) TdTd Scenario 1 x xxxxx x UPDATE TS(B k )TS(B k-2 )TS(B k-1 ) TdTd Scenario 2

34. 34 Case Studies 4 Bayou 4 Odyssey 4 Rover

35. 35 Case Study1: Bayou 4 Main Features 4 Novel Aspects 4 Bayou architecture 4 Bayou application-specific conflict resolution 4 Bayou replication management

36. 36 Main Features of Bayou 4 Replicated, weakly consistent storage system for collaborative applications 4 Ad-hoc network of portable computers participate in managing a mobile, replicated storage system 4 Suitable for a group of collaborators, all mobile and disconnected from fixed network, sharing (reading/writing) appointment calendars, meeting notes, evolving design documents, etc.

37. 37 Novel Aspects of Bayou 4 Support for application-specific detection and resolution of update conflicts –dependency checks –client-provided, per-write conflict resolution (merge procedures) 4 Eventual replica convergence through a peer--wise anti-entropy process 4 Per-client consistency guarantees 4 Roll-back and undo capabilities

38. 38 The Bayou Architecture Anti-entropy Storage System Server State Storage System Server State Storage System Server State Storage System Server State Bayou API Application Client Stub Bayou API Application Client Stub Client Server Read or Write Read or Write Server Client

39. 39 Application-Specific Conflict Resolution in Bayou 4 Along with desired update, a write operation includes a dependency check: – server query & expected query results 4 As a pre-condition to performing the write operation, the dependency check must succeed 4 A conflict is detected if query, when run against server data, does not produce same results.

40. 40 Application-Specific Conflict Resolution in Bayou 4 If dependency check fails, write is not performed and server runs a merge procedure: –also submitted along with the write operation –templates or rules written in a high-level interpretive language –uses server data and application-specific data to resolve the conflict –when run, produces a revised update request 4 Write operations are atomic

41. 41 Conflict Resolution in Bayou 4 Example (Application-specific): Write { reserve an hour time slot by meeting room sched application; dependency_check: (list of previously scheduled meetingsthat overlap with requested time slot, NULL);merge_procedure: (); } 4 Others: –detect read/write conflicts –detect write/write conflicts

42. 42 Replication Management in Bayou 4 Clients send their writes to only one server (weak consistency) 4 Bayou servers propagate their writes during pair-wise contacts. This process is called Anti-entropy and results on the two server agreeing on the writes and their order. 4 Eventually all writes will reach all servers (eventual consistency)

43. 43 Bayou: Summary

44. 44 Case Study 2: Odyssey 4 Odyssey client architecture 4 Odyssey system components 4 Odyssey applications: –Video player –Web browser

45. 45 Odyssey Client Architecture Cache Manager Viceroy Generic Support API Extensions (Kernel) Applications Wardens Type-Specific Support

46. 46 Main Features of Odyssey 4 Application-aware adaptation approach 4 Odyssey monitors system resources and notifies applications of relevant changes 4 Applications decide when and how to adapt, to maintain certain level of fidelity 4 General support for adaptation: Viceroy 4 Type-specific support: Warden 4 Caching support

47. 47 Odyssey System Components 4 Odyssey Objects 4 Client API to allow applications to: –operate on Odyssey objects –express resource needs (expectations) –be notified when needed resources are no longer available –respond by changing levels of fidelity

48. 48 Odyssey API Request( in path, in resource_descriptor, out request_id) Cancel(in request_id) Resource_id lower bound upper bound name of upcall handler Tsop( in path, in opcode, in insize, in inbuf, in out outsize, out outbuf) Handle( in request_id, in resource_id, in resource-level) Network Bandwidthbytes/second Network Latencymicroseconds Disk cache SpaceKilobytes CPUSPECCint95 Battery Powerminutes Moneycents Resource Negotiation Operations Generic Resources in Odyssey Resource Descriptor Fileds Type-specific Operations Upcall Handler

49. 49 Video Player in Odyssey

50. 50 Web Browser in Odyssey

51. 51 Odyssey: Summary

52. 52 Case Study 3: Rover 4 Basic features of Rover 4 Novel features of Rover 4 Rover system components 4 Constructing mobile applications using Rover 4 Rover applications

53. 53 Basic Features of Rover 4 Rover is a ToolKit for developing applications that can be used in both the fixed and mobile environment 4 Supports both application-transparent and application-aware adaptations 4 Supports the dynamic client/server model 4 Can build Rover apps from scratch or migrate existing apps (with some effort) to be mobile

54. 54 Novel Features of Rover 4 Support for: –Mobile objects –disconnected operation –dynamic client/server 4 Mixed communication/computation modes: –Relocatable Dynamic Objects (RDO) –Queued Remote Procedure Calls (QRPC) 4 Applications decide to use RDO or QRPC

55. 55 Relocatable Dynamic Objects (RDO) 4 Objects can be relocated from the fixed network to the mobile computer. Client applications then interacts directly with the local copy of the RDA 4 If cached RDO is updated it can be tentatively considered the primary copy and is exported back to the fixed network 4 Advantages: Performance (under weak connectivity) and functionality (under disconnections)

56. 56 Queued RPC (QRPC) 4 Non-blocking remote procedure calls, even when fixed host is disconnected 4 Client applications use QRPC to fetch RDO’s. Upon connection, or when an RDO arrives, the requesting client is called back 4 QRPC is also used to commit updates made to RDO’s 4 Non-executed QRPC’s are kept in an operation log 4 As network connection comes and goes, the operation logs are flushed back to the servers

57. 57 Rover’s Relocatable Dynamic Object (RDO) Architecture

58. 58 Rover Component Architecture erver

59. 59 Constructing Mobile Applications in Rover 4 Split the application into clients and servers modules 4 Decide where each module resides initially (mobile host or fixed network) 4 Encapsulate each module as an RDO 4 Add application-specific semantics to RDOs 4 Add application-specific conflict resolution procedures.

60. 60 Rover Applications 4 Application-transparent adaptation –Rover NNTP proxy and Rover HTTP proxy 4 Application-aware adaptation –Rover Exmh (mail browser), Rover Webcal (distributed calendar system), Rover Irolo (graphical Rolodex tool), and Rover stock market watcher

61. 61 Rover: Summary