Efficient algorithm for service matchmaking in ubiquitous environments

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. © Springer-Verlag Berlin Heidelberg 2005.