Abstract
Service discovery middleware allows users to find and use services through service discovery protocols in heterogeneous and ubiquitous environments without previous knowledge of the specific service location or characteristics, and with minimum manual effort. For this reason, in recent years, a number of researchers have studied service discovery middleware and many of papers dealing with this field have been published. However, when a number of service consumers request services from middle agents (e.g. matchmaker, broker, yellow page, blackboard, lookup server, etc) within the service discovery middleware, the middle agents do not guarantee efficient and rapid matching results because they use only a simple matching algorithm based on set theory for match processing. In this paper we address issues of existing matching algorithms, and propose a new matchmaking method adopting the marriage matching algorithm of the ATM network [1] to improve middle agent performance, complementing shortcomings of the existing matching algorithms. Furthermore, we use traffic type (e.g. voice/video applications, data-sharing applications, convenience applications, and so on) priority information for providing application-oriented QoS.
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
Gusfield, D., Irving, R.W.: The stable marriage problem structure and algorithms. MIT Press, Cambridge (1989)
Service Location Protocol Version 2, Internet Engineering Task Force (IETF), RFC 2608 (June 1999)
Helal, S.: Standards for service discovery and delivery. Pervasive Computing, IEEE 1(3), 95–100 (2002)
Overview about Gnutella technology and product application, http://www.gnutella.com/
Jini, Sun Microsystems (1999), http://www.sun.com/jini
Universal Plug and Play Specification, v1.0, http://www.upnp.org
Paolucci, M., Kawmura, T., Payne, T., Sycara, K.: Semantic Matching of Web Services Capabilities. In: First Int. Semantic Web Conference, Sardinia, Italy (2002)
OWL-S: Semantic markup for web services, http://www.daml.org/services/owl-s/1.0/
Trastour, D., Bartolini, C., Gonzalez-Castillo, J.: A semantic web approach to service description for matchmaking of services. In: Proceedings of the International Semantic Web Working Symposium, Stanford, CA, USA (2001)
Sycara, K., Klusch, M., Widoff, S., Lu, J.: Dynamic service matchmaking among agents in open information environments. In: SIGMOD, vol. 28(1), pp. 47–53 (1999)
Sycara, K., Wido, S., Klusch, M., Lu, J.: LARKS: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace. In: Autonomous Agents and Multi-Agent Systems, pp. 173–203 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, KH., Lee, K.M., Shin, H.J., Shin, DR. (2005). Efficient Algorithm for Service Matchmaking in Ubiquitous Environments. In: Bauknecht, K., Pröll, B., Werthner, H. (eds) E-Commerce and Web Technologies. EC-Web 2005. Lecture Notes in Computer Science, vol 3590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11545163_26
Download citation
DOI: https://doi.org/10.1007/11545163_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28467-3
Online ISBN: 978-3-540-31736-4
eBook Packages: Computer ScienceComputer Science (R0)