Efficient algorithm for service matchmaking in ubiquitous environments

Authors:
Kee-Hyun Choi;Kyu Min Lee;Ho Jin Shin;Dong-Ryeol Shin
Affiliations:
School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Gyeonggi-do, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Gyeonggi-do, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Gyeonggi-do, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Gyeonggi-do, Korea
Venue:
EC-Web'05 Proceedings of the 6th international conference on E-Commerce and Web Technologies
Year:
2005

Citing 5
Cited 1

The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
Dynamic service matchmaking among agents in open information environments

ACM SIGMOD Record
Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace

Autonomous Agents and Multi-Agent Systems
Standards for Service Discovery and Delivery

IEEE Pervasive Computing
Semantic Matching of Web Services Capabilities

ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web

Design and implementation of middleware for context-aware service discovery in ubiquitous computing environments

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV

Quantified Score

Hi-index	0.00

Visualization

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.