Abstract
Building efficient lookup services for the Internet constitutes an active area of research. Recent issues concentrate on building Internet-scale distributed hash tables as building block of Peer-to-Peer systems, see e.g., [505], [575]. Castro et al. proposed the VIA protocol, which enables location of application data across multiple service discovery domains, using a self-organizing hierarchy [111]. Recently, Sun and Garcia-Molina introduced a partial lookup service, exploiting the fact that for many applications it is sufficient to resolve a key to a subset of all matching values [581]. The paper discusses various design alternatives for a partial lookup service in the Internet. However, none of these papers consider distributed lookup services for mobile ad-hoc networks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lindemann, C., Waldhorst, O.P. (2005). 26. Epidemic Data Dissemination for Mobile Peer-to-Peer Lookup Services. In: Steinmetz, R., Wehrle, K. (eds) Peer-to-Peer Systems and Applications. Lecture Notes in Computer Science, vol 3485. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11530657_26
Download citation
DOI: https://doi.org/10.1007/11530657_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29192-3
Online ISBN: 978-3-540-32047-0
eBook Packages: Computer ScienceComputer Science (R0)