Abstract
In recent years, we observe a growing interest focused on distributed computing systems. Both industry and academia require increasing computational power to process and analyze large amount of data, including significant areas like analysis of medical data, earthquake, or weather forecast. Since distributed computing systems – similar to computer networks – are vulnerable to failures, survivability mechanisms are indispensable to provide the uninterrupted service. Therefore, in this paper we propose a novel 1 + 1 protection mechanism. We formulate an ILP model related to optimization of survivable distributed computing systems. The objective is to allocate computational tasks to computing nodes and dimension network capacity in order to minimize the operational cost of the computing system and satisfy survivability constraints. To facilitate high computational complexity caused by NP-completeness in solving the ILP problem, we propose additional cut inequalities that can be applied for the branch-and-cut algorithm. We consider the cut-and-branch variant of the B&C algorithm. To construct additional cut inequalities we use the idea of cover inequalities and mixed integer rounding (MIR) inequalities. Results of experiments conducted using CPLEX solver are provided and discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Akbari, B., Rabiee, H., Ghanbari, M.: An optimal discrete rate allocation for overlay video multicasting. Comput. Commun. 31(3), 551–562 (2008)
Barnhart, C., Hane, C.A., Vance, P.H.: Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. 48(2), 318–326 (2000)
Buysse, J., De Leenheer, M., Dhoedt, B., Develder, C.: Providing resiliency for optical grids by exploiting relocation: a dimensioning study based on ILP. Comput. Commun. 34(12), 1389–1398 (2011)
Develder, C., Buysse, J., Shaikh, A., Jaumard, B., De Leenheer, M., Dhoedt, B.: Survivable optical grid dimensioning, anycast routing with server and network failure protection. In: Proceedings of IEEE ICC 2011, Kyoto, pp. 1–5 (2011)
Grover, W.D.: Mesh-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET, and ATM Networking. Prentice Hall PTR, Upper Saddle River (2003)
Gunluk, O.: Branch-and-cut algorithm for capacitated network design problems. Math. Program. 86, 17–39 (1999)
ILOG CPLEX, 12.0 User’s Manual, France (2007)
Jaumard, B., Shaikh, A.: Maximizing access to IT services on resilient optical grids. In: Proceedings of 3rd International Workshop on Reliable Networks Design and Modeling (RNDM), Budapest, pp. 151–156 (2011)
Kacprzak, T., Walkowiak, K., Wozniak, M.: Optimization of overlay distributed computing systems for multiple classifier system – heuristic approach. Log. J. IGPL. doi:10.1093/jigpal/jzr020 (2011)
Marchand, H., Wolsey, L.: Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49, 363–371 (2001)
Mitchell, J.: Branch-and-cut methods for combinatorial optimization problems. In: Handbook of Applied Optimization, Oxford University Press, Oxford/New York (2002)
Nabrzyski, J., Schopf, J., Weglarz, J. (eds.): Grid Resource Management: State of the Art and Future Trends. Kluwer Academic, Boston (2004)
Pioro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann, Amsterdam/Boston (2004)
Shen, X., Yu, H., Buford, J., Akon, M. (eds.): Handbook of Peer-to-Peer Networking. Springer, New York/London (2009)
Thysebaert, P., De Leenheer, M., Volckaert, B., De Turck, F., Dhoedt, B., Demeester, P.: Scalable dimensioning of resilient lambda grids. Future Gener. Comput. Syst. 24(6), 549–560 (2008)
Vasseur, J.P., Pickavet, M., Demeester, P.: Network Recovery. Elsevier, Burlington (2004)
Wilkinson, B.: Grid Computing: Techniques and Applications. Chapman & Hall/CRC Computational Science. Chapman & Hall, London (2009)
Zhu, Y., Li, B.: Overlay networks with linear capacity constraints. IEEE Trans. Parallel Distrib. Syst. 19(2), 159–173 (2008)
Acknowledgements
The work was supported in part by Ministry of Science and Higher Education, Poland, under the European Regional Development Fund, Grant No. POIG.01.01.02-00-045/09-00 Future Internet Engineering.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Walkowiak, K., Rak, J. (2014). Optimization Issues in Distributed Computing Systems Design. In: Bock, H., Hoang, X., Rannacher, R., Schlöder, J. (eds) Modeling, Simulation and Optimization of Complex Processes - HPSC 2012. Springer, Cham. https://doi.org/10.1007/978-3-319-09063-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-09063-4_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09062-7
Online ISBN: 978-3-319-09063-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)