• DocumentCode
    3077533
  • Title

    Adaptive and Cost-Effective Service Placement

  • Author

    Tran, Khanh-Toan ; Agoulmine, Nazim

  • Author_Institution
    IBISC Lab., Univ. of Evry, Evry, France
  • fYear
    2011
  • fDate
    5-9 Dec. 2011
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    In this paper we will discuss the problem of placing service replicas in the cloud network to fulfil customers\´ demand. Such a problem hass been well studied in "Facility Location" topic; however, in this area opening a new facility is costly and its migration is an expensive decision which makes the solution static. In cloud network infrastructures, services are pieces of software that can be migrated from one server to another in an easier way and therefore the dynamic service placement should be part of the solution. This paper aims to propose a new scheme of optimal dynamic service placement in the context of changing network environment. This scheme reinforces the existing solutions proposed in "Facility Location", allowing at each period of time to find the best locations for services given the network topology, resource availability and customers\´ demand. The scheme considers the efficiency of the new locations versus the necessary modifications that have to be made to obtain them. The solution has been evaluated by simulation and has shown that small modification in service deployment can achieve high performance close to optimal solutions.
  • Keywords
    cloud computing; adaptive service placement; cloud network; cost-effective service placement; facility location; network topology; optimal dynamic service placement; Approximation algorithms; Approximation methods; Hamming distance; Heuristic algorithms; IEEE Communications Society; Peer to peer computing; Servers;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE
  • Conference_Location
    Houston, TX, USA
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-9266-4
  • Electronic_ISBN
    1930-529X
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2011.6134019
  • Filename
    6134019