MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Dataspace - querying and monitoring deeply networked collections in physical space (2000) [58 citations — 0 self]

Download:
Download as a PDF | Download as a PS
by Samir Goel
IEEE Personal Communications
http://cereal.rutgers.edu/~gsamir/techreport/dcs-tr-381.ps.gz
Add To MetaCart

Abstract:

Figure 1: DataSpace is three dimensional physical space stretching from 10 kilometers below the surface of earth to 100 kilometers above the surface of earth, that is accessible to the network. DataSpace enables one to issue queries within every cubic millimeter block of physical space 1 The DataSpace is a three dimensional physical space 100 kilometers above and 10 kilometers below the surface of earth that is accessible to the network. It is addressed geographically as opposed to the current \logical " addressing scheme of the Internet. With the enormous 128 bit addressing space of IP version 6, one can individually address every cubic centimeter of the physical space in DataSpace with approximately 90 bits of area code. This would include every street, building, room, basement or even drawer of a desk. The DataSpace would thus serve as the host for the entire part of the physical world that is connected to the network. The billions of objects populating the DataSpace, each aware of its own geographic location 1 will form \data ocks", mobile object classes which can be selectively queried, monitored and controlled. To support the DataSpace, we propose a version of the multicast protocol called \spacecast". Here, the network plays the role of a Database machine, handling queries through spacecast which \illuminate " selected datacubes and gather multiple responses from the objects that respond to the query. The user will interact with the DataSpace through spacecast in the same way that a person interacts with his physical environment through the information in re ected light waves. 1

Citations

289 Core based trees (CBT): An architecture for scalable inter-domain multicast routing – Ballardie, Francis, et al. - 1993
153 Geocast - geographic addressing and routing – Navas, Imielinski - 1997
17 et al, “The PIM Architecture for Wide-Area Multicast Routing – Deering - 1996
17 et.al. Simple Multicast: A Design for Simple, Low-Overhead Multicast. Internet Engineering Task Force – Perlman - 1999
10 Badrinath and Pradeep Sudame. Gathercast: The design and implementation of a programmable aggregation mechanism for the internet – R - 1998
9 RFC 2373: IP version 6 addressing architecture – Hinden, Deering - 1998
6 and Tomasz Imielinski. Geographic addressing and routing – Navas - 1997
3 Deering et al., “The PIM Architecture for Wide-Area Multicast Routing – unknown authors - 1996
3 An architecture for intentional name resolution and application-level routing – Adjie-Winoto, Schwartz, et al. - 1999
1 Dataspace - Querying and Monitoring Deeply CALL – Imielinski, Goel - 1999
1 http://www.navcen. uscg.mil/gps/geninfo/gpsdocuments/sigspec/default.htm [9 – Badrinath, Sudame - 1995
1 gsamir@cs.rutgers.edu) is currently a research assistant in the Computer Science Department at – GOEL - 1997
1 RFC 2362: Protocol independent multicast-sparse mode (pim-sm): Protocol speci – Estrin, Farinacci, et al. - 1998