A Tabu Search Algorithm for Optimization of Survivable Overlay Computing Systems

  • Krzysztof Walkowiak
  • Wojciech Charewicz
  • Maciej Donajski
  • Jacek Rak
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 189)


Recently, distributed computing paradigm is gaining much interest since both industry and academia require large computational power to process and analyze huge amount of data. As distributed computing systems - similar to other network systems - are vulnerable to failures, survivability guarantees are indispensable to provide the uninterrupted service. Consequently, in this work we consider a survivable computing systems based on a 1+1 protection mechanism. The goal of the system is to provide scheduling of tasks to computing nodes and dimensioning of network capacity in order to minimize the operational cost of the system and satisfy survivability constraints. Since the problem is NP-complete and computationally demanding, we propose an effective heuristic algorithm based on Tabu Search approach. Extensive numerical experiments are run to verify effectiveness of the heuristic against optimal results provided by CPLEX and other heuristic algorithms.


distributed computing ILP modeling optimization cut inequalities 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Wilkinson, B.: Grid Computing: Techniques and Applications. Chapman & Hall/CRC Computational Science (2009)Google Scholar
  2. 2.
    Nabrzyski, J., Schopf, J., Węglarz, J. (eds.): Grid resource management:state of the art and future trends. Kluwer Academic Publishers, Boston (2004)MATHGoogle Scholar
  3. 3.
    Milojicic, D., et al.: Peer to Peer computing. HP Laboratories Palo Alto, Technical Report HPL-2002-57 (2002)Google Scholar
  4. 4.
    Travostino, F., Mambretti, J., Karmous Edwards, G.: Grid Networks Enabling grids with advanced communication technology. Wiley (2006)Google Scholar
  5. 5.
    Taylor, I.: From P2P to Web services and grids: peers in a client/server world. Springer (2005)Google Scholar
  6. 6.
    Buford, J., Yu, H., Lua, E.: P2P Networking and Applications. Morgan Kaufmann (2009)Google Scholar
  7. 7.
    Shen, X., Yu, H., Buford, J., Akon, M. (eds.): Handbook of Peer-to-Peer Networking. Springer (2009)Google Scholar
  8. 8.
    Grover, W.D.: Mesh-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET, and ATM Networking. Prentice Hall PTR, New Jersey (2003)Google Scholar
  9. 9.
    Walkowiak, K., Rak, J.: 1+1 Protection of Overlay Distributed Computing Systems: Modeling and Optimization. In: Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2012, Part IV. LNCS, vol. 7336, pp. 498–513. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  10. 10.
    Pioro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers (2004)Google Scholar
  11. 11.
    Vasseur, J.P., Pickavet, M., Demeester, P.: Network Recovery. Elsevier (2004)Google Scholar
  12. 12.
    Thysebaert, P., et al.: Scalable Dimensioning of Resilient Lambda Grids. Future Generation Computer Systems 24(6), 549–560 (2008)CrossRefGoogle Scholar
  13. 13.
    Develder, C., et al.: Survivable Optical Grid Dimensioning: Anycast Routing with Server and Network Failure Protection. In: Proc. of IEEE ICC 2011, pp. 1–5 (2011)Google Scholar
  14. 14.
    Buysse, J., De Leenheer, M., Dhoedt, B., Develder, C.: Providing Resiliency for Optical Grids by Exploiting Relocation: A Dimensioning Study Based on ILP. Computer Communications 34(12), 1389–1398 (2011)CrossRefGoogle Scholar
  15. 15.
    Jaumard, B., Shaikh, A.: Maximizing Access to IT Services on Resilient Optical Grids. In: Proc. of 3rd International Workshop on Reliable Networks Design and Modeling (RNDM 2011), pp. 151–156 (2011)Google Scholar
  16. 16.
    Akbari, B., Rabiee, H., Ghanbari, M.: An optimal discrete rate allocation for overlay video multicasting. Computer Communications 31(3), 551–562 (2008)CrossRefGoogle Scholar
  17. 17.
    Zhu, Y., Li, B.: Overlay Networks with Linear Capacity Constraints. IEEE Transactions on Parallel and Distributed Systems 19(2), 159–173 (2008)CrossRefGoogle Scholar
  18. 18.
    Kacprzak, T., Walkowiak, K., Woźniak, M.: Optimization of Overlay Distributed Computing Systems for Multiple Classifier System – Heuristic Approach. Logic Journal of IGPL (2011), doi: 10.1093/jigpal/jzr020Google Scholar
  19. 19.
    Glover, F.: Tabu Search - Part I. ORSA J. on Computing 1(3), 190–206 (1989)MATHCrossRefGoogle Scholar
  20. 20.
    Glover, F.: Tabu Search - Part II. ORSA J. on Computing 2(1), 4–32 (1990)MATHCrossRefGoogle Scholar
  21. 21.
    ILOG CPLEX, 12.0 User’s Manual, France (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Krzysztof Walkowiak
    • 1
  • Wojciech Charewicz
    • 1
  • Maciej Donajski
    • 1
  • Jacek Rak
    • 2
  1. 1.Wrocław University of TechnologyWroclawPoland
  2. 2.Gdansk University of TechnologyGdanskPoland

Personalised recommendations