Abstract
Peer-to-peer systems (P2P) have attracted much current attention as a popular way to share huge volumes of resources directly within peers. Existing service discovery protocols and delivery mechanisms designed for decentralized peer-to-peer systems tend to be very inefficient in locating peers and retrieving services, either generating too much load on the system, or providing a bad user experience. To address this problem with least effort, we proposed a novel decentralized service discovery mechanism by creating a new service call P2P Registry (RP2Reg) in DNS. In our scheme, each peer is able to register and discover desirable services automatically through current DNS within a short duration in an efficient way. The proposed method not only performs least searching time and low bandwidth but also ensure that the search process results in a nearest peer that has the desired content. We also present the results of simulation work to validate the viability of our approach. Our simulation study showed that the proposed method achieves fast query response time without incurring excessive service discovery traffic with less server load as compare with Bruth-Force searching solution.
This research was supported by the National Science Council NSC-92-2213-E-324-006.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Young, K.: Look no Server. Network, 21–22, 26 ( March 1993)
Simon, S.: Peer-to-Peer Network Management in an IBM SNA Network. IEEE Network Magazine 5, 30–34 (1991)
Munindar, P.S.: Peering at Peer-to-Peer Computing. IEEE Internet Computing 2001 (January/February 2001)
Gnutella homepage, http://www.gnutella.wego.com
Peer-to-peer working group, http://www.peer-to-peerwg.org/
Open P2P website, http://www.openp2p.com
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: ACM SIGCOMM (August 2001)
Napster, Inc., http://www.napster.com
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: Work on Design Issues in Anonymity and Unobservability, July 2000, pp. 311–320 (2000)
Tsoumakos, D., Roussopoulos, N.: A Comparison of Peer-to-Peer Search Methods. In: International Workshop on the Web and Databases (WebDB), June 12-13 (2003)
Mockapetris, P.: Domain names-concepts and facilities., Internet Request for Comments (RFC 1034) (February 1987)
Kumar, A., Postel, J., Neuman, C., Danzig, P., Miller, S.: Common DNS implementation error and suggested fixes. Internet Request for Comments (RFC 1536) (October 1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, CW., Gan, PS., Yang, CH. (2004). A Rapid Service Discovery Mechanism with Low Bandwidth Requirement in Decentralized Peer-to-Peer Network. In: Yang, L.T., Guo, M., Gao, G.R., Jha, N.K. (eds) Embedded and Ubiquitous Computing. EUC 2004. Lecture Notes in Computer Science, vol 3207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30121-9_102
Download citation
DOI: https://doi.org/10.1007/978-3-540-30121-9_102
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22906-3
Online ISBN: 978-3-540-30121-9
eBook Packages: Springer Book Archive