skip to main content
article

Supporting ad-hoc resource sharing on the Web: A peer-to-peer approach to hypermedia link services

Published:01 May 2007Publication History
Skip Abstract Section

Abstract

The key element to support ad-hoc resource sharing on the Web is to discover resources of interest. The hypermedia paradigm provides a way of overlaying a set of resources with additional information in the form of links to help people find other resources. However, existing hypermedia approaches primarily develop mechanisms to enable resource sharing in a fairly static, centralized way. Recent developments in distributed computing, on the other hand, introduced peer-to-peer (P2P) computing that is notable for employing distributed resources to perform a critical function in a more dynamic and ad-hoc scenario. We investigate the feasibility and potential benefits of bringing together the P2P paradigm with the concept of hypermedia link services to implement ad-hoc resource sharing on the Web. This is accomplished by utilizing a web-based Distributed Dynamic Link Service (DDLS) as a testbed and addressing the issues arising from the design, implementation, and enhancement of the service. Our experimental result reveals the behavior and performance of the semantics-based resource discovery in DDLS and demonstrates that the proposed enhancing technique for DDLS, topology reorganization, is appropriate and efficient.

References

  1. Anderson, K. M. 1997. Integrating open hypermedia systems with the World Wide Web. In Proceedings of the ACM Conference on Hypertext. ACM Press, 157--166. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Andrews, K., Kappe, F., and Maurer, H. 1995. Serving information to the Web with Hyper-G. In Proceedings of the 3rd International World Wide Web Conference. Elsevier North-Holland, Inc., Darmstadt, Germany. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Berners-Lee, T. 1996. The World Wide Web---Past, present and future. J. Digital inform. 1, 1.Google ScholarGoogle Scholar
  4. Berners-Lee, T., Hendler, J., and Lassila, O. 2001. The Semantic Web. Scientific American 284, 5, 34--43.Google ScholarGoogle ScholarCross RefCross Ref
  5. Breslau, L., Cao, P., Fan, L., Phillips, G., and Shenker, S. 1999. Web caching and Zipf-like distributions: Evidence and implications. In Proceedings of IEEE INFOCOM'99. IEEE Computer Society, 126--134.Google ScholarGoogle Scholar
  6. Brickley, D. and Guha, R. 2004. RDF vocabulary description language 1.0: RDF schema. W3c recommendation, World Wide Web Consortium.Google ScholarGoogle Scholar
  7. Carr, L., De Roure, D., Hall, W., and Hill, G. 1998. Implementing an open link service for the World Wide Web. WWW J. 1, 2, 61--71. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Carr, L. A., De Roure, D. C., Hall, W., and Hill, G. J. 1995. The distributed link service: A tool for publishers, authors and readers. WWW J. 1, 1, 647--656.Google ScholarGoogle Scholar
  9. Clark, D. 2001. Face-to-face with peer-to-peer networking. Comput. J. 34, 1, 18--21. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Crespo, A. and Garcia-Molina, H. 2002. Routing indices for peer-to-peer systems. In Proceedings of the 22nd International Conference on Distributed Computing Systems. IEEE Computer Society, 23--34. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. De Roure, D. C., Walker, N. G., and Carr, L. A. 2000. Investigating link service infrastructures. In Proceedings of the 11th ACM Conference on Hypertext and Hypermedia. ACM Press, 67--76. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., and Harshman, R. 1990. Indexing by latent semantic analysis. J. Amer. Soc. Inform. Sci. 41, 6, 391--407.Google ScholarGoogle ScholarCross RefCross Ref
  13. Foster, I., Kesselman, C., and Tuecke, S. 2001. The anatomy of the grid: Enabling scalable virtual organization. Int. J. High Perform. Comput. Appl. 15, 3, 200--222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Fountain, A. M., Hall, W., Heath, I., and Davis, H. C. 1990. MICROCOSM: An open model for hypermedia with dynamic linking. In Proceedings of the European Conference on Hypertext (ECHT'90), A. Rizk, N. Streitz, and J. Andre, Eds. Cambridge University Press, 298--311.Google ScholarGoogle Scholar
  15. Goose, S. 1997. A framework for distributed open hypermedia. Ph.D. thesis, University of Southampton.Google ScholarGoogle Scholar
  16. Grønbæk, K., Hem, J. A., Madsen, O. L., and Sloth, L. 1993. Designing Dexter-based cooperative hypermedia systems. In Proceedings of the 5th ACM Conference on Hypertext. ACM Press, 25--38. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Guha, R., McCool, R., and Miller, E. 2003. Semantic search. In Proceedings of the 12th International Conference on the World Wide Web. ACM Press, 700--709. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Heflin, J. and Hendler, J. 2000. Searching the Web with SHOE. In AAAI Workshop on Artificial Intelligence for Web Search. AAAI Press, Menlo Park, CA, 35--40.Google ScholarGoogle Scholar
  19. Larsen, R. D. and Bouvin, N. O. 2004. HyperPeer: Searching for resemblance in a P2P network. In Proceedings of the 15th ACM Conference on Hypertext and Hypermedia. ACM Press, 268--269. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Lassila, O. and Swick, R. R. 1999. Resource description framework (RDF) model and syntax specification. W3C Recommendation, World Wide Web Consortium.Google ScholarGoogle Scholar
  21. Li, J., Pease, A., and Barbee, C. 2002. Experimenting with ASCS semantic search. Project report, Teknowlege Corporation, Palo Alto, CA.Google ScholarGoogle Scholar
  22. Lowe, D. and Hall, W. 1999. Hypermedia and the Web. John Wiley and Sons, Inc. West Sussex. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Lukka, T. J. and Fallenstein, B. 2002. Freenet-like GUIDs for implementing Xanalogical hypertext. In Proceedings of the 13th ACM Conference on Hypertext and Hypermedia. ACM Press, 194--195. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Martin, D., Paolucci, M., McIlraith, S., Burstein, M., McDermott, D., McGuinness, D., Parsia, B., Payne, T., Sabou, M., Solanki, M., Srinivasan, N., and Sycara, K. 2004. Bringing semantics to Web services: The OWL-S approach. In Proceedings of the 1st International Workshop on Semantic Web Services and Web Process Composition (SWSWPC 2004). Lecture Notes in Computer Science, vol. 3387. Springer, 26--42. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Mullin, J. 1990. Optimal semijoins for distributed database systems. IEEE Trans. Softw. Eng. 16, 5, 558--560. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Pearl, A. 1989. Sun's link service: A protocol for open linking. In Proceedings of the 2nd Annual ACM Conference on Hypertext. ACM Press, 137--146. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Schenker, S. 2001. A scalable content-addressable network. In Proceedings of the ACM SIGCOMM Conference. ACM Press, 161--172. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Rosenblatt, M. 1956. Remarks on some nonparametric estimates of a density function. Anna. Mathem. Statist. 27, 832--837.Google ScholarGoogle ScholarCross RefCross Ref
  29. Rowstron, A. I. T. and Druschel, P. 2001. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (Middleware'01). Springer-Verlag, 329--350. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Silverman, B. W. 1986. Density estimation for statistics and data analysis. In Monographs on Statistics and Applied Probability.Google ScholarGoogle Scholar
  31. Smith, M. K., Welty, C., and McGuinness, D. L. 2004. Owl Web ontology language guide. W3c recommendation, World Wide Web Consortium.Google ScholarGoogle Scholar
  32. Sripanidkulchai, K. 2001. The popularity of Gnutella queries and its implications on scalability. Featured on O'Reilly's www.openp2p.com website.Google ScholarGoogle Scholar
  33. Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., and Balakrishnan, H. 2001. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM Conference. ACM Press, 149--160. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. The Open Group. 1997. DCE 1.1: Remote Procedure Call. Technical Standard C706, The Open Group.Google ScholarGoogle Scholar
  35. Wiil, U. K. 1997. Open hypermedia: Systems, interoperability and standards. J. Digital Inform. 1, 2.Google ScholarGoogle Scholar
  36. Wiil, U. K. and Leggett, J. J. 1997. Workspaces: The HyperDisco approach to Internet distribution. In Proceedings of the 8th ACM Conference on Hypertext. ACM Press, 13--23. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Zhou, J. 2004. DDLS: Extending open hypermedia systems into peer-to-peer environments. Ph.D. thesis, University of Southampton.Google ScholarGoogle Scholar
  38. Zhou, J., Dialani, V. K., De Roure, D. C., and Hall, W. 2003. A Distance-based semantic search algorithm for peer-to-peer open hypermedia systems. In Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'03). IEEE Computer Society, 7--11.Google ScholarGoogle Scholar
  39. Zhou, J., Hall, W., and De Roure, D. 2004. When open hypermedia meets peer-to-peer computing. In Proceedings of the 15th ACM Conference on Hypertext and Hypermedia. ACM Press, 266--267. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Zipf, G. K. 1949. Human Behavior and the Principle of Least Effort. Addison-Wesley, Cambridge, MA.Google ScholarGoogle Scholar

Index Terms

  1. Supporting ad-hoc resource sharing on the Web: A peer-to-peer approach to hypermedia link services

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader
            About Cookies On This Site

            We use cookies to ensure that we give you the best experience on our website.

            Learn more

            Got it!