Skip to Main content Skip to Navigation
Journal articles

Algorithms for Composing Pervasive Applications

Abstract : Pervasive computing environments enable the composition of applications from components allocated across different devices. The applications have to be composed at run-time, to cope with changes in context and resource availability in the environment. In addition, this functionality has to be automated in order to minimize user involvement in application management. We propose two new algorithms which are capable of dynamic allocation of application components to multiple networking devices. These algorithms optimize the selection of the networking devices and the structure of composite applications according to a given criteria, such as minimizing hardware requirements, maximizing the application QoS or other criteria specified by the user. The algorithms are based on generic models. This allows the approach to be used in multiple application domains. We analyze the performance of these algorithms in a simulated environment and suggest a system that utilizes our algorithms for pervasive application composition.
Document type :
Journal articles
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download
Contributor : Oleg Davidyuk Connect in order to contact the contributor
Submitted on : Tuesday, March 31, 2009 - 5:47:50 PM
Last modification on : Friday, February 4, 2022 - 3:08:14 AM
Long-term archiving on: : Thursday, June 10, 2010 - 7:25:13 PM


Files produced by the author(s)


  • HAL Id : inria-00372212, version 1



Oleg Davidyuk, Istvan Selek, Jon Imanol Duran, Jukka J. R. Riekki. Algorithms for Composing Pervasive Applications. International Journal of Software Engineering and Its Applications, SERSC : Science & Engineering Research Support Center, 2008, 2 (2), pp.71-94. ⟨inria-00372212⟩



Record views


Files downloads