Calicrates Policroniades
ABSTRACT
In this paper we study the use of a semantically rich storage model to fulfill the data transmission requirements of challenged networking environments, which are characterised by long delays and frequent communication disruptions. Practical experience shows us that the highly successful data abstractions of mainstream storage systems (e.g. monolithic file representation) operate poorly in emergent networking environments such as Delay Tolerant Networks (DTNs); short contact times do not allow for complete file or bundle transmissions. We have ported and integrated two systems in order to provide a solution that overcomes many of the data transmission challenges of DTNs: a semantically rich storage system (Datom) and a network framework capable of exploiting this augmented expressive power (Haggle). Our solution, Bedouin, enables both systems to run on resource-constrained devices. It facilitates meaningful data exchanges in challenged networks supporting the principle of infrastructure-independent networking, and exploiting human mobility and opportunistic connectivity. The design and function of a proof-of-concept Bedouin-based peer-to-peer file sharing application for human networks, called Caravan, is included. Experimental results demonstrate that our solution enables applications to work correctly in spite of intermittent data exchanges and disruptions while maximising the amount of useful data delivered to applications.
- K. Arnold, J. Gosling, and D. Holmes. The Java Programming Language. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 3 edition, 2000. Google Scholar
Digital Library
- K. Brockschmidt. Inside OLE 2. Microsoft Press, 1994.Google Scholar
- R. G. G.Cattell, D. K. Barry, M. Berler, J. Eastman, D. Jordan, C. Russell, O. Schadow, T. Stanienda, and F. Velez. The Object Data Standard: ODMG 3.0. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2000. Google ScholarDigital Library
- J. Crowcroft and I. Phillips. TCP/IP and Linux Protocol Implementation: Systems Code for the Linux Internet. John Wiley & Sons, Inc., New York, NY, USA, 2002. Google ScholarDigital Library
- A. J. Demers, K. Petersen, M. J. Spreitzer, D. B. Terry, M. M. Theimer, and B. B. Welch. The Bayou Architecture: Support for Data Sharing among Mobile Users. In Proc. of the IEEE Workshop on Mobile Computing Systems and Applications (WMCSA 1994), 1994.Google ScholarDigital Library
- Delay Tolerant Networking Research Group, 2002. Available at http://www.dtnrg.org/.Google Scholar
- K. Fall. A Delay-Tolerant Network Architecture for Challenged Internets. In Proc. of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM'03), pages 27--34. ACM Press, 2003. Google ScholarDigital Library
- S. Gribble, E. Brewer, M. Hellerstein, and D. Culler. Scalable, Distributed Data Structures for Internet Service Construction. In Proc. of the Symposium on Operating Systems Design and Implementation (OSDI '00), pages 319--332. USENIX Association, October 2000. Google ScholarDigital Library
- Haggle Source Code, 2006. Available at http://sourceforge.net/projects/haggle/.Google Scholar
- A. L. Hors, P. L. Hégaret, L. Wood, G. Nicol, J. Robie, M. Champion, and S. Byrne. Document Object Model (DOM) Level 3 Core Specification Version 1.0. Technical report, World Wide Web Consortium, April 2004.Google Scholar
- S. R. Kleiman. Vnodes: An Architecture for Multiple File System Types in SUN UNIX. In Proc.of USENIXSummer Technical Conference (USENIX '86). USENIX Association, 1986.Google Scholar
- D. Kotz and T. Henderson. Crawdad: A community resource for archiving wireless data at dartmouth. IEEE Pervasive Computing, 04(4):12--14, 2005. Google ScholarDigital Library
- J. Leguay, A. Lindgren, J. Scott, T. Friedman, and J. Crowcroft. Opportunistic content distribution in an urban setting. In Proc. of the 2006 SIGCOMM Workshop on Challenged Networks (CHANTS '06), pages 205--212, New York, NY, USA, 2006. ACM Press. Google ScholarDigital Library
- J. MacCormick, N. Murphy, M. Najork, C. A. Thekkath, and L. Zhou. Boxwood: Abstractions as the Foundation for Storage Infrastructure. In Proc. of the 6th Symposium on Operating Systems Design and Implementation (OSDI '04), pages 105--120. USENIX Association, December 2004. Google ScholarDigital Library
- R. Nagar. Windows NT File System Internals. O'Reilly and Associates, September 1997. Google ScholarDigital Library
- .NET Framework Developer Center, 2005. Available at http://msdn.microsoft.com/netframework/.Google Scholar
- Objectivity, Inc. Objectivity/C++ Standard Template Library, Release 6.0, August 2000.Google Scholar
- C. Policroniades. Decomposing file data into discernible items. Technical Report UCAM-CL-TR-672, University of Cambridge, United Kingdom, August 2006.Google Scholar
- D. Roselli, J. R. Lorch, and T. E. Anderson. A Comparison of File System Workloads. In Proc. of 2000 USENIX Annual Technical Conference (USENIX '00). USENIX Association, June 2000. Google ScholarDigital Library
- M. Satyanarayanan, J. J. Kistler, P. Kumar, M. E. Okasaki, E. H. Siegel, and D. C. Steere. Coda: A highly available file system for a distributed workstation environment. In IEEE Transactions on Computers, 39(4):447--459, 1990. Google ScholarDigital Library
- Simple API for XML (SAX), 2005. Web site at http://www.saxproject.org/.Google Scholar
- J. Scott, P. Hui, J. Crowcroft, and C. Diot. Haggle: A Networking Architecture Designed around Mobile Users. In Proc. of the 2006 IFIP Conference on Wireless on Demand Network Systems and Services (IFIP WONS 2006), January 2006.Google Scholar
- K. Scott and S. Burleigh. Bundle Protocol Specification (IETF Internet Draft), May 2006.Google Scholar
- R. Shah, S. Roy, S. Jain, and W. Brunette. Data MULEs: Modeling a Three-tier Architecture for Sparse Sensor Networks. In Proc. of the 2003 IEEE International Workshop on Sensor Network Protocols and Applications (SNPA 2003), May 2003.Google ScholarCross Ref
- Silicon Graphics, Inc. Standard Template Library Programmer's Guide, May 2005.Google Scholar
- Sleepycat Software, Inc. Berkeley DB Collections Tutorial, September 2004.Google Scholar
- M. Stonebraker, L. A. Rowe, B. Lindsay, J. Gray, M. Carey, M. Brodie, P. Bernstain, and D. Beech. Third-Generation Data Base System Manifesto. ACM SIGMOD Record, 19(3):31--44, September 1990. Google ScholarDigital Library
- J. Su, J. Scott, P. Hui, E. Upton, M. H. Lim, C. Diot, J. Crowcroft, A. Goel, and E. de Lara. Haggle: Clean-slate networking for mobile devices. Technical Report UCAM-CL-TR-680, University of Cambridge, United Kingdom, January 2007.Google Scholar
- W. Vogels. File System Usage in Windows NT 4.0. In Proc. of the Symposium on Operating Systems Principles (SOSP '99), pages 93--109, New York, NY, USA, 1999. ACM Press. Google ScholarDigital Library
- W. Zhao, M. Ammar, and E. Zegura. A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks. In Proc. of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '04), pages 187--198, NY, USA, 2004. ACM Press. Google ScholarDigital Library
Index Terms
- Data management in human networks
Recommendations
FansyRoute: adaptive fan-out for variably intermittent challenged networks
We consider the problem of routing in a highly and variably intermittent wireless network to support delay-intolerant as well as delay tolerant applications. Specifically, the links in such a network are too volatile to maintain a consistent topology, ...
FansyRoute: adaptive fan-out for variably intermittent challenged networks
CHANTS '13: Proceedings of the 8th ACM MobiCom workshop on Challenged networksWe consider the problem of routing in a highly and variably intermittent wireless network to support delay-intolerant as well as delay tolerant applications. Specifically, the links in such a network are too volatile to maintain a consistent topology, ...
The challenges of disconnected delay-tolerant MANETs
This article is concerned with the challenges associated with supporting communication in disconnected MANETs with such a sparse population of nodes and so little (or no) fixed infrastructure that the network graph is rarely, if ever, connected. The ...
Comments