Locating application data across service discovery domains

  • Authors:
  • Paul Castro;Benjamin Greenstein;Richard Muntz;Chatschik Bisdikian;Parviz Kermani;Maria Papadopouli

  • Affiliations:
  • University of California, Los Angeles, Los Angeles, CA;University of California, Los Angeles, Los Angeles, CA;University of California, Los Angeles, Los Angeles, CA;IBM T.J. Watson Research Center, 30 Saw Mill River Road, Hawthorne, NY;IBM T.J. Watson Research Center, 30 Saw Mill River Road, Hawthorne, NY;Columbia University, 1214 Amsterdam Ave., Mail Code: 0401, New York, NY

  • Venue:
  • Proceedings of the 7th annual international conference on Mobile computing and networking
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The bulk of proposed pervasive computing devices such as PDAs and cellular telephones operate as thin clients within a larger infrastructure. To access services within their local environment, these devices participate in a service discovery protocol which involves a master directory that registers all services available in the local environment. These directories typically are isolated from each other. Devices that move across service discovery domains have no access to information outside their current local domain. In this paper we propose an application-level protocol called VIA that enables data sharing among discovery domains. Each directory maintains a table of active links to other directories that share related information. A set of linked directories forms a data cluster that can be queried by devices for information. The data cluster is distributed, self-organizing, responsive to data mobility, and robust to failures. Using application-defined data schemas, clusters organize themselves into a hierarchy for efficient querying and network resource usage. Through analysis and simulation we describe the behavior of VIA under different workloads and show that the protocol overhead for both maintaining a cluster and handling failures grows slowly with the number of gateways.