Scale and performance in a distributed file system
ACM Transactions on Computer Systems (TOCS)
Disconnected operation in the Coda File System
ACM Transactions on Computer Systems (TOCS)
Serverless network file systems
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Web caching with consistent hashing
WWW '99 Proceedings of the eighth international conference on World Wide Web
A group mobility model for ad hoc wireless networks
MSWiM '99 Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
PACA: A Cooperative File System Cache for Parallel Machines
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
Cooperative caching: using remote client memory to improve file system performance
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Load balanced routing protocols for ad hoc mobile wireless networks
IEEE Communications Magazine
A Framework for Service Convergence via Device Cooperation
UAHCI '09 Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments
Towards dynamic and cooperative multi-device personal computing
The disappearing computer
| Hi-index | 0.00 |
In this paper, we propose a new filesystem named Ad-hoc Filesystem which targets ad-hoc wireless networks. Ad-hoc Filesystem is a serverless filesystem which automatically generates temporary shared space among multiple mobile machines when they gather in a communicable range. The generated space is kept stable as long as possible even if some machines join or leave the communicable range. We have designed an initial prototype of Ad-hoc Filesystem and have conducted preliminary evaluations on the simulator. Our design is strongly based on an assumption such that people who wish to work together would form a stable group with a single mobility behavior. Based on the assumption, our prototype distributes files among multiple machines and duplicates each on two machines, then it keeps the pairs of such machines as long as possible. We also introduced another strategy to increase file availability by exploiting each machine's client cache. The simulation results show that controlling packets used in our prototype to maintain system state hardly affects the overall system performance. Also the result indicates that our strategy that keeps two replicas for each data and exploits client caching is effective to achieve high availability.