Skip to main content

Abstract

The number of services on the web is growing every day and finding useful and efficient ranking methods for services has become an important issue in modern web applications. In this paper we present a link-based importance model and efficient algorithms for distributed services collaborating through service calls. We adapt the PageRank algorithm and define a service importance that reflects its activity and its contribution to the quality of other services.

An erratum to this chapter can be found at http://dx.doi.org/10.1007/11914853_71.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Abiteboul, S., Preda, M., Cobena, G.: Adaptive On-Line Page Importance Computation. In: Proc. Intl. World Wide Web Conference (WWW), pp. 280–290 (2003)

    Google Scholar 

  2. Albert, R., Jeong, H., Barabási, A.-L.: The Diameter of the World Wide Web. Science 286, 509–512 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. The Active XML Project, http://activexml.net

  4. Baeza-Yates, R.A., Castillo, C., Saint-Jean, F.: Web Dynamics, Structure, and Page Quality. In: Web Dynamics, pp. 93–112 (2004)

    Google Scholar 

  5. Bertsekas, D.P., Tsitsiklis, J.N.: Some aspects of parallel and distributed iterative algorithms-a survey. Automatica 27(1), 3–21 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bianchini, M., Gori, M., Scarselli, F.: Inside PageRank. ACM Transactions on Internet Technology (TOIT) 5(1), 92–128 (2005)

    Article  Google Scholar 

  7. Caverlee, J., Liu, L., Rocco, D.: Discovering and ranking web services with BASIL: a personalized approach with biased focus. In: Proc. Intl. Conf. on Service-Oriented Computing (ICSOC), pp. 153–162 (2004)

    Google Scholar 

  8. Cho, J., Roy, S., Adams, R.: Page Quality: In Search of an Unbiased Web Ranking. In: Proc. ACM Symp. on the Management of Data (SIGMOD) (2005)

    Google Scholar 

  9. Constantin, C., Amann, B., Gross-Amblard, D.: A Link-based Ranking Model for Services long version (2006), http://www-poleia.lip6.fr/~amann/coopis_long.pdf

  10. Corso, G.M.D., Gulli, A., Romani, F.: Ranking a Stream of News. In: Proc. Intl. World Wide Web Conference (WWW), pp. 97–106 (2005)

    Google Scholar 

  11. Emekçi, F., Sahin, O.D., Agrawal, D., Abbadi, A.E.: A Peer-to-Peer Framework for Web Service Discovery with Ranking. In: Proc. Intl. Conf. on Web Services (ICWS), pp. 192–199 (2004)

    Google Scholar 

  12. Kalepu, S., Krishnaswamy, S., Loke, S.W.: Reputation = f(User Ranking, Compliance, Verity). In: Proc. Intl. Conf. on Web Services (ICWS), pp. 200–207 (2004)

    Google Scholar 

  13. Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The Eigentrust algorithm for reputation management in P2P networks. In: Proc. Intl. World Wide Web Conference (WWW), pp. 640–651 (2003)

    Google Scholar 

  14. Kleinberg, J.M.: Authoritative Sources in a Hyperlinked Environment. J. ACM 46(5), 604–632 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kollias, G., Gallopoulos, E., Szyld, D.B.: Asynchronous Iterative Computations with Web Information Retrieval Structures: the PageRank Case. In: Proc. Intl. Conf. on Parallel Computing (PARCO) (2005)

    Google Scholar 

  16. Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Random Graph Models for the Web Graph. In: Proc. Intl. Symp. on Foundations of Computer Science (FOCS), pp. 57–65 (2000)

    Google Scholar 

  17. Liu, Y., Ngu, A.H.H., Zeng, L.: QoS computation and policing in dynamic web service selection. In: Proc. Intl. World Wide Web Conference (WWW), pp. 66–73 (2004)

    Google Scholar 

  18. Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web. Technical report, Stanford Digital Library Technologies Project (1998)

    Google Scholar 

  19. Parreira, J.X., Weikum, G.: JXP: Global Authority Scores in a P2P Network. In: Proc. Intl. Workshop on the Web and Databases (WebDB), pp. 31–36 (2005)

    Google Scholar 

  20. Sankaralingam, K., Sethumadhavan, S., Browne, J.C.: Distributed Pagerank for P2P Systems. In: Proc. Intl. Symp. on High Performance Distributed Computing (HPDC), pp. 58–69 (2003)

    Google Scholar 

  21. Vu, L.-H., Hauswirth, M., Aberer, K.: QoS-Based Service Selection and Ranking with Trust and Reputation Management. In: Proc. Intl. Conf. on Cooperative Information Systems (CoopIS), pp. 466–483 (2005)

    Google Scholar 

  22. Wang, Y., DeWitt, D.J.: Computing PageRank in a Distributed Internet Search Engine System. In: Proc. Intl. Conf. on Very Large Data Bases (VLDB), pp. 420–431 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Constantin, C., Amann, B., Gross-Amblard, D. (2006). A Link-Based Ranking Model for Services. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE. OTM 2006. Lecture Notes in Computer Science, vol 4275. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11914853_20

Download citation

  • DOI: https://doi.org/10.1007/11914853_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48287-1

  • Online ISBN: 978-3-540-48289-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics