We address the problem of efficient deployment of software services into a networked environment. Services are considered that are provided by collaborating components. The problem of obtaining efficient mappings for components to host in a network is challenged by multiple dimensions of quality of service requirements. In this paper we consider execution costs for components and communication costs for the collaborations between them. Our proposed solution to the deployment problem is a nature inspired distributed heuristic algorithm that we apply from the service provider’s perspective. We present simulation results for different example scenarios and present an integer linear program to validate the results obtained by simulation of our algorithm.


Integer Linear Program Communication Cost Execution Cost Autonomic Computing Cross Entropy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Helvik, B.E., Wittner, O.: Using the Cross Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks. In: Pierre, S., Glitho, R.H. (eds.) MATA 2001. LNCS, vol. 2164, p. 255. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  2. 2.
    Heegaard, P.E., Helvik, B.E., Wittner, O.J.: The Cross Entropy Ant System for Network Path Management. Telektronikk 104(01), 19–40 (2008)Google Scholar
  3. 3.
    Heegaard, P.E., Wittner, O.J.: Overhead Reduction in Distributed Path Management System. In: Computer Networks (August 13, 2009) (in Press) (Available online) (Accepted Manuscript)Google Scholar
  4. 4.
    Csorba, M.J., Heegaard, P.E., Herrmann, P.: Cost Efficient Deployment of Collaborating Components. In: Meier, R., Terzis, S. (eds.) DAIS 2008. LNCS, vol. 5053, pp. 253–268. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  5. 5.
    Rouvoy, R., et al.: Composing components and services using a planning-based adaptation middleware. In: Pautasso, C., Tanter, É. (eds.) SC 2008. LNCS, vol. 4954, pp. 52–67. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Ardagna, D., Trubian, M., Zhang, L.: SLA based resource allocation policies in autonomic environments. Journal of Parallel and Distributed Computing 67 (2007)Google Scholar
  7. 7.
    Sabharwal, R.: Grid Infrastructure Deployment using SmartFrog Technology. In: Proc. of the Int’l. Conf. on Networking and Services (ICNS), Santa Clara, USA (July 2006)Google Scholar
  8. 8.
    Xu, J., et al.: On the use of fuzzy modeling in virtualized data center management. In: Proc. of the Int’l. Conf. on Autonomic Computing (ICAC), Jacksonville, FL, USA (June 2007)Google Scholar
  9. 9.
    Heimfarth, T., Janacik, P.: Ant based heuristic for OS service distribution on adhoc networks. Biologically Inspired Cooperative Computing (2006)Google Scholar
  10. 10.
    Jung, G., et al.: Generating adaptation policies for multi-tier applications in consolidated server environments. In: Proc. of the 5th Int’l. Conf. on Autonomic Computing (ICAC), Chicago, IL, USA (June 2008)Google Scholar
  11. 11.
    Malek, S.: A User-Centric Framework for Improving a Distributed Software System’s Deployment Architecture. In: Proc. of the doctoral track at the 14th ACM SIGSOFT Symposium on Foundation of Software Engineering, Portland, USA (2006)Google Scholar
  12. 12.
    Csorba, M.J., Heegaard, P.E., Herrmann, P.: Adaptable model-based component deployment guided by artificial ants. In: Proc. 2nd Int’l. Conf. on Autonomic Computing and Communication Systems (Autonomics). ICST/ACM, Turin (September 2008)Google Scholar
  13. 13.
    Di Caro, G., Dorigo, M.: AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research 9 (1998)Google Scholar
  14. 14.
    Rubinstein, R.Y.: The Cross-Entropy Method for Combinatorial and Continuous Optimization. Methodology and Computing in Applied Probability (1999)Google Scholar
  15. 15.
    Helvik, B.E., Wittner, O.: Using the Cross Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks. In: Pierre, S., Glitho, R.H. (eds.) MATA 2001. LNCS, vol. 2164, p. 255. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  16. 16.
    Wittner, O.: Emergent Behavior Based Implements for Distributed Network Management. PhD thesis, Norwegian University of Science and Technology, NTNU, Department of Telematics (2003)Google Scholar
  17. 17.
    Widell, N., Nyberg, C.: Cross Entropy based Module Allocation for Distributed Systems. In: Proc. of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems, Cambridge (2004)Google Scholar
  18. 18.
    Efe, K.: Heuristic models of task assignment scheduling in distributed systems. Computer (June 1982)Google Scholar
  19. 19.
    Csorba, M.J., Meling, H., Heegaard, P.E., Herrmann, P.: Foraging for Better Deployment of Replicated Service Components. In: Senivongse, T., Oliveira, R. (eds.) DAIS 2009. LNCS, vol. 5523, pp. 87–101. Springer, Heidelberg (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Máté J. Csorba
    • 1
  • Poul E. Heegaard
    • 1
  1. 1.Department of TelematicsNorwegian University of Science and TechnologyTrondheimNorway

Personalised recommendations