Bridging the digital divide: storage media + postal network = generic high-bandwidth communication

Making high-bandwidth Internet access pervasively available to a large worldwide audience is a difficult challenge, especially in many developing regions. As we wait for the uncertain takeoff of technologies that promise to improve the situation, we propose to explore an approach that is potentially more easily realizable: the use of digital storage media transported by the postal system as a general digital communication mechanism. We shall call such a system a Postmanet. Compared to more conventional wide-area connectivity options, the Postmanet has several important advantages, including wide global reach, great bandwidth potential, low cost, and ease of incremental adoption. While the idea of sending digital content via the postal system is not a new one, none of the existing attempts have turned the postal system into a generic and transparent communication channel that not only can cater to a wide array of applications, but also effectively manage the many idiosyncrasies associated with using the postal system. In the proposed Postmanet, we see two recurring themes at many different levels of the system. One is the simultaneous exploitation of the Internet and the postal system so we can combine their latency and bandwidth advantages. The other is the exploitation of the abundant capacity and bandwidth of the Postmanet to improve its latency, cost, and reliability.

[1]  Akihiro Nakao,et al.  Postmanet: turning the postal system into a generic digital communication mechanism , 2004, SIGCOMM 2004.

[2]  Waylon Brunette,et al.  Data MULEs: modeling a three-tier architecture for sparse sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[3]  Jim Gray,et al.  A Conversation with Jim Gray , 2003, ACM Queue.

[4]  M. Frans Kaashoek,et al.  Rover: a toolkit for mobile information access , 1995, SOSP.

[5]  Mendel Rosenblum,et al.  The design and implementation of a log-structured file system , 1991, SOSP '91.

[6]  S. Louis Hakimi,et al.  Fault-Tolerant Routing in DeBruijn Comrnunication Networks , 1985, IEEE Transactions on Computers.

[7]  de Ng Dick Bruijn A combinatorial problem , 1946 .

[8]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[9]  Dhiraj K. Pradhan,et al.  The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.

[10]  Xiang Yu,et al.  PersonalRAID: Mobile Storage for Distributed and Disconnected Computers , 2002, FAST.

[11]  Kumar N. Sivarajan,et al.  Multihop lightwave networks based on De Bruijn graphs , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[12]  Hisashi Kobayashi,et al.  Highly secure and efficient routing , 2004, IEEE INFOCOM 2004.

[13]  David R. Karger,et al.  Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.

[14]  A. Hasson DakNet: A Road To Universal Broadband Connectivity Wireless Internet UN ICT Conference Case Study , 2003 .

[15]  Dunlap,et al.  Postman Always Rings Twice , 1934 .

[16]  Pierre Fraigniaud,et al.  Broadcasting and Gossiping in de Bruijn Networks , 1994, SIAM J. Comput..

[17]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[18]  Yilei Shao,et al.  Distance Learning Technologies for Basic Education in Disadvantaged Areas , 2004 .