Skip to main content

Fuzzy Reward Modeling for Run-Time Peer Selection in Peer-to-Peer Networks

  • Conference paper
Fuzzy Systems and Knowledge Discovery (FSKD 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3613))

Included in the following conference series:

  • 1072 Accesses

Abstract

A good query plan in p2p networks is crucial to increase the query performance. Optimization of the plan requires effective and suitable remote cost estimation of the candidate peers on the basis of the information concerning the candidates’ run-time cost model and online time. We propose a fuzzy reward model to evaluate a candidate peer’s online reliability relative to the query host, and utilize a real-time cost model to estimate the query execution time. The optimizer is based on the run-time information to generate an effective query plan.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Risson, J., Moors, T.: Survey of research towards robust peer-to-peer networks search methods. In: Technical Report UNSW-EE-P2P-1-1, Univ. of New South Wales, Sydney, Australia (2004)

    Google Scholar 

  2. Wang, L.P.: Soft Computing in Communications. Springer, Heidelberg (2003)

    Google Scholar 

  3. Bosc, P., Damiani, E., Fugini, M.: Fuzzy service selection in a distributed object-oriented environment. IEEE TRAN. on fuzzy systems 9(5), 682–698 (2001)

    Article  Google Scholar 

  4. Adali, S., Candan, K.S., Papakonstantinou, Y., Subrahmanian, V.: Query caching and optimization in distributed mediator systems. In: Proc. of the 1996 ACM SIGMOD Int. Conf. on Management of Data, Montreal, Canada, pp. 137–148 (1996)

    Google Scholar 

  5. Zhu, Q., Larson, P.A.: Solving local cost estimation problem for global query optimization in multidatabase-systems. Distributed and Parallel Databases 6, 373–420 (1998)

    Article  Google Scholar 

  6. Khan, L., McLeod, D., Shahabi, C.: An Adaptive Probe-Based Technique to Optimize Join Queries in Distributed Internet Databases. J. Database Manag. 12(4), 3–14 (2001)

    Article  Google Scholar 

  7. Ling, B., Ng, W.S., Shu, Y., Zhou, A.: Fuzzy Cost Modeling for Peer-to-Peer Systems. In: Moro, G., Sartori, C., Singh, M.P. (eds.) AP2PC 2003. LNCS (LNAI), vol. 2872, pp. 138–143. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Bourne, R.A., Excelente-Toledo, C.B., Jennings, N.R.: Run-Time Selection of Coordination Mechanisms in Multi-Agent Systems. In: Proc. 14th European Conf. on Artificial Intelligence, Berlin, Germany, pp. 348–352 (2000)

    Google Scholar 

  9. Jang, J.S.R., Sun, C.T., Mizutani, E.: Neuro-fuzzy and soft computing. Prentice-Hall, Englewood Cliffs (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, H., Liu, X., Liu, P. (2005). Fuzzy Reward Modeling for Run-Time Peer Selection in Peer-to-Peer Networks. In: Wang, L., Jin, Y. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2005. Lecture Notes in Computer Science(), vol 3613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539506_66

Download citation

  • DOI: https://doi.org/10.1007/11539506_66

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28312-6

  • Online ISBN: 978-3-540-31830-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics