Scheduling and Capacity Design in Overlay Computing Systems

  • Krzysztof Walkowiak
  • Andrzej Kasprzak
  • Michał Kosowski
  • Marek Miziołek
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7336)


Parallel to new developments in the fields of computer networks and high performance computing, effective distributed systems have emerged to answer the growing demand to process huge amounts of data. Comparing to traditional network systems aimed mostly to send data, distributed computing systems are also focused on data processing what introduces additionally requirements in the system performance and operation. In this paper we assume that the distributed system works in an overlay mode, which enables fast, cost-effective and flexible deployment comparing to traditional network model. The objective of the design problem is to optimize task scheduling and network capacity in order to minimize the operational cost and to realize all computational projects assigned to the system. The optimization problem is formulated in the form of an ILP (Integer Linear Programming) model. Due to the problem complexity, four heuristics are proposed including evolutionary algorithms and Tabu Search algorithm. All methods are evaluated in comparison to optimal results yielded by the CPLEX solver. The best performance is obtained for the Tabu Search method that provides average results only 0.38% worse than optimal ones. Moreover, for larger problem instances with 20-minute limit of the execution time, the Tabu Search algorithm outperforms CPLEX for some cases.


distributed computing overlays ILP modeling optimization 


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)zbMATHGoogle 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.
    Tarkoma, S.: Overlay Networks: Toward Information Networking. Auerbach Publications (2010)Google Scholar
  9. 9.
    Stevens, T., et al.: Multi-Cost Job Routing and Scheduling in Optical Grid Networks. Future Generation Computer Systems 25(8), 912–925 (2009)CrossRefGoogle Scholar
  10. 10.
    Thysebaert, P., et al.: Scalable Dimensioning of Resilient Lambda Grids. Future Generation Computer Systems 24(6), 549–560 (2008)CrossRefGoogle Scholar
  11. 11.
    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
  12. 12.
    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
  13. 13.
    Akbari, B., Rabiee, H., Ghanbari, M.: An optimal discrete rate allocation for overlay video multicasting. Computer Communications 31(3), 551–562 (2008)CrossRefGoogle Scholar
  14. 14.
    Zhu, Y., Li, B.: Overlay Networks with Linear Capacity Constraints. IEEE Transactions on Parallel and Distributed Systems 19(2), 159–173 (2008)CrossRefGoogle Scholar
  15. 15.
    Pioro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers (2004)Google Scholar
  16. 16.
    Michalewicz, Z.: Evolutionary Algorithms + Data Structures = Evolution Programs. Springer (1999)Google Scholar
  17. 17.
    Gendreau, M., Potvin, J.: Handbook of metaheuristics. Springer (2010)Google Scholar
  18. 18.
    Glover, F.: Tabu Search - Part I. ORSA J. on Computing 1(3), 190–206 (1989)zbMATHCrossRefGoogle Scholar
  19. 19.
    Karlsson, L., Yang, L., Lin, M.: Heuristic techniques: scheduling partially ordered tasks in a multi-processor environment with tabu search and genetic algorithms. In: Proceedings Seventh International Conference on Parallel and Distributed Systems, pp. 515–523 (2000)Google Scholar
  20. 20.
    Jaziri, W.: Local Search Techniques: Focus on Tabu Search. Inteh (2008)Google Scholar
  21. 21.
    ILOG CPLEX, 12.0 User’s Manual, France (2007)Google Scholar
  22. 22.
    Miziolek, M.: Optimization of distributed computing systems with the use of evolutionary algorithms. M.Sc. Thesis, Wroclaw University of Technology (2011)Google Scholar
  23. 23.
    Kosowski, M.: Optimization of distributed computing systems with the use of Tabu Search algorithm. M.Sc. Thesis, Wroclaw University of Technology (2011)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Krzysztof Walkowiak
    • 1
  • Andrzej Kasprzak
    • 1
  • Michał Kosowski
    • 1
  • Marek Miziołek
    • 1
  1. 1.Department of Systems and Computer Networks, Faculty of ElectronicsWrocław University of TechnologyWroclawPoland

Personalised recommendations