Composition of services in pervasive environments: A divide and conquer approach

Gilbert Cassar, Payam Barnaghi, Wei Wang, Suparna De, Klaus Moessner

Research output: Chapter in Book or Report/Conference proceedingConference Proceedingpeer-review

11 Citations (Scopus)


In pervasive environments, availability and reliability of a service cannot always be guaranteed. In such environments, automatic and dynamic mechanisms are required to compose services or compensate for a service that becomes unavailable during the runtime. Most of the existing works on services composition do not provide sufficient support for automatic service provisioning in pervasive environments. We propose a Divide and Conquer algorithm that can be used at the service runtime to repeatedly divide a service composition request into several simpler sub-requests. The algorithm repeats until for each sub-request we find at least one atomic service that meets the requirements of that sub-request. The identified atomic services can then be used to create a composite service. We discuss the technical details of our approach and show evaluation results based on a set of composite service requests. The results show that our proposed method performs effectively in decomposing a composite service requests to a number of sub-requests and finding and matching service components that can fulfill the service composition request.

Original languageEnglish
Title of host publication2013 IEEE Symposium on Computers and Communications, ISCC 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages7
ISBN (Print)9781479937554
Publication statusPublished - 2013
Externally publishedYes
Event18th IEEE Symposium on Computers and Communications, ISCC 2013 - Split, Croatia
Duration: 7 Jul 201310 Jul 2013

Publication series

NameProceedings - IEEE Symposium on Computers and Communications
ISSN (Print)1530-1346


Conference18th IEEE Symposium on Computers and Communications, ISCC 2013


  • Semantics
  • Sensors
  • Service Composition

Cite this