2016
Conference article
Open Access
Self-optimising Decentralised Service Placement in Heterogeneous Cloud Federation
Carlini E., Coppola M., Dazzi P., Mordacchini M., Passarella A.
Future Internet Internet of Things
Clouds have been relevant business drivers and computationalbackends for a wide range of applications, includingIoT, e-health, data analytics. To match the complex needs ofsuch comprehensive set of different kinds of applications, inrecent times there is an emerging need for new paradigmsand forms of Clouds, organised according to a federated, heterogeneousand distributed structure. To exploit heterogeneityand localisation, in order to enhance the overall performances,ensure energy efficiency, reduce costs for resource providers andin the meantime enhance the user experience, proper serviceplacement solutions are required. However, conducting efficientdeployments in such a scenario is complex due to the dynamicnature of applications, resources, users. As a consequence, therethe a need for scalable, distributed, adaptive, context-awaresolutions characterised by high-efficiency and reduced overhead.We propose a highly distributed, self-adaptive solution aimed atoptimising the overall deployment of cloud services by means ofpoint-to-point interactions occurring among clouds and cloudletsbelonging to the same federation. The contribution of this paperis the definition of a service exchange mechanism, its Markovchainbased modelling and thorough experimental evaluation.
Source: SASO 2016 - 10th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, pp. 110–119, Augsburg, Germany, 12-16 September 2016
[1] L. Wang, R. Ranjan, J. Chen, and B. Benatallah, Cloud computing: methodology, systems, and applications. CRC Press, 2011.
[2] T. Kurze, M. Klems, D. Bermbach, A. Lenk, S. Tai, and M. Kunze, “Cloud federation,” in CLOUD COMPUTING 2011 : The 2nd Int.l Conference on Cloud Computing, GRIDs, and Virtualization. IARIA, 2011.
[3] R. Moreno-Vozmediano, R. S. Montero, and I. M. Llorente, “Iaas cloud architecture: From virtualized datacenters to federated cloud infrastructures,” Computer, no. 12, pp. 65-72, 2012.
[4] M. M. Hassan, M. S. Hossain, A. J. Sarkar, and E.-N. Huh, “Cooperative game-based distributed resource allocation in horizontal dynamic cloud federation platform,” Information Systems Frontiers, vol. 16, no. 4, pp. 523-542, 2014.
[5] E. Carlini, M. Coppola, P. Dazzi, L. Ricci, and G. Righetti, “Cloud federations in contrail,” in Euro-Par 2011: Parallel Processing Workshops. Springer, 2011, pp. 159-168.
[6] Gartner, “Eight trends will shape the colocation market in 2016.” [Online]. Available: https://www.gartner.com/doc/reprints?id= 1-2X9EKB9&ct=160128&st=sb.
[7] L. Schubert, K. G. Jeffery, and B. Neidecker-Lutz, The Future of Cloud Computing: Opportunities for European Cloud Computing Beyond 2010:-expert Group Report. European Commission, Information Society and Media, 2010.
[8] R. Moreno-Vozmediano, R. S. Montero, and I. M. Llorente, “Key challenges in cloud computing: Enabling the future internet of services,” Internet Computing, IEEE, vol. 17, no. 4, pp. 18-25, 2013.
[9] J. Warren, “Equinix says hybrid cloud is the future.” [Online]. Available: http://www.forbes.com/sites/justinwarren/2016/03/ 09/equinix-says-hybrid-cloud-is-the-future/#7b53a602a953
[10] S. R. Carter, “Techniques for dynamic cloud-based edge service computing,” Nov. 17 2011, uS Patent App. 12/780,328.
[11] S. Choy, B. Wong, G. Simon, and C. Rosenberg, “A hybrid edgecloud architecture for reducing on-demand gaming latency,” Multimedia Systems, vol. 20, no. 5, pp. 503-519, 2014.
[12] M. Satyanarayanan, R. Schuster, M. Ebling, G. Fettweis, H. Flinck, K. Joshi, and K. Sabnani, “An open ecosystem for mobile-cloud convergence,” Communications Magazine, IEEE, vol. 53, no. 3, pp. 63-70, 2015.
[13] G. F. Anastasi, P. Cassara, P. Dazzi, A. Gotta, M. Mordacchini, and A. Passarella, “A hybrid cross-entropy cognitive-based algorithm for resource allocation in cloud environments,” in Self-Adaptive and SelfOrganizing Systems (SASO), 2014 IEEE Eighth International Conference on. IEEE, 2014, pp. 11-20.
[14] R. Baraglia, P. Dazzi, G. Capannini, and G. Pagano, “A multi-criteria job scheduling framework for large computing farms,” in 10th IEEE International Conference on Computer and Information Technology. IEEE, 2010, pp. 187-194.
[15] G. F. Anastasi, E. Carlini, M. Coppola, and P. Dazzi, “Qbrokage: A genetic approach for qos cloud brokering,” in Cloud Computing (CLOUD), 2014 IEEE 7th International Conference on. IEEE, 2014, pp. 304-311.
[16] M. Danelutto and P. Dazzi, “A java/jini framework supporting stream parallel computations,” in Proceedings of the International Conference ParCo 2005, G. R. J. et al., Ed., 2005.
[17] P. T. Endo, A. V. de Almeida Palhares, N. N. Pereira, G. E. Goncalves, D. Sadok, J. Kelner, B. Melander, and J.-E. Ma˚ngs, “Resource allocation for distributed cloud: concepts and research challenges,” Network, IEEE, vol. 25, no. 4, pp. 42-46, 2011.
[18] M. Steiner, B. G. Gaglianello, V. Gurbani, V. Hilt, W. D. Roome, M. Scharf, and T. Voith, “Network-aware service placement in a distributed cloud environment,” ACM SIGCOMM Computer Communication Review, vol. 42, no. 4, pp. 73-74, 2012.
[19] Y. Kessaci, N. Melab, and E.-G. Talbi, “A pareto-based metaheuristic for scheduling hpc applications on a geographically distributed cloud federation,” Cluster Computing, vol. 16, no. 3, pp. 451-468, 2013.
[20] R. Baraglia, P. Dazzi, M. Mordacchini, L. Ricci, and L. Alessi, “Group: A gossip based building community protocol,” in Smart Spaces and Next Generation Wired/Wireless Networking. Springer Berlin Heidelberg, 2011, pp. 496-507.
[21] M. Mordacchini, P. Dazzi, G. Tolomei, R. Baraglia, F. Silvestri, and S. Orlando, “Challenges in designing an interest-based distributed aggregation of users in p2p systems,” in 2009 International Conference on Ultra Modern Telecommunications & Workshops. IEEE, 2009, pp. 1-8.
[22] M. Mordacchini, R. Baraglia, P. Dazzi, and L. Ricci, “A p2p recommender system based on gossip overlays (prego),” in IEEE 10th International Conference on Computer and Information Technology (CIT), 2010. IEEE, 2010, pp. 83-90.
[23] E. Carlini, M. Coppola, P. Dazzi, D. Laforenza, S. Martinelli, and L. Ricci, “Service and resource discovery supports over p2p overlays,” in Ultra Modern Telecommunications & Workshops, 2009. ICUMT'09. International Conference on. IEEE, 2009, pp. 1-8.
[24] P. Dazzi, P. Felber, L. Leonini, M. Mordacchini, R. Perego, M. Rajman, and E´. Rivie`re, “Peer-to-peer clustering of web-browsing users,” Proc. LSDS-IR, pp. 71-78, 2009.
[25] R. Baraglia, P. Dazzi, B. Guidi, and L. Ricci, “Godel: Delaunay overlays in p2p networks via gossip,” in IEEE 12th International Conference on Peer-to-Peer Computing (P2P). IEEE, 2012, pp. 1-12.
[26] R. Buyya, R. Ranjan, and R. N. Calheiros, “Intercloud: Utility-oriented federation of cloud computing environments for scaling of application services,” in Algorithms and architectures for parallel processing. Springer, 2010, pp. 13-31.
[27] B. Rochwerger, D. Breitgand, E. Levy, A. Galis, K. Nagin, I. M. Llorente, R. Montero, Y. Wolfsthal, E. Elmroth, J. Caceres et al., “The reservoir model and architecture for open federated cloud computing,” IBM Journal of Research and Development, vol. 53, no. 4, pp. 4-1, 2009.
[28] A. J. Ferrer, F. Herna´ndez, J. Tordsson, E. Elmroth, A. Ali-Eldin, C. Zsigri, R. Sirvent, J. Guitart, R. M. Badia, K. Djemame et al., “Optimis: A holistic approach to cloud service provisioning,” Future Generation Computer Systems, vol. 28, no. 1, pp. 66-77, 2012.
[29] A. Ismail and V. Cardellini, Advances in Service-Oriented and Cloud Computing: Workshops of ESOCC 2014, Manchester, UK, September 2-4, 2014, Revised Selected Papers. Cham: Springer International Publishing, 2015, ch. Decentralized Planning for SelfAdaptation in Multi-cloud Environment, pp. 76-90. [Online]. Available: http://dx.doi.org/10.1007/978-3-319-14886-1 9
[30] D. Barbagallo, E. Di Nitto, D. J. Dubois, and R. Mirandola, A Bioinspired Algorithm for Energy Optimization in a Self-organizing Data Center. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 127- 151. [Online]. Available: http://dx.doi.org/10.1007/978-3-642-14412-7 7
[31] M. Sedaghat, F. Herna´ndez-Rodriguez, E. Elmroth, and S. Girdzijauskas, “Divide the task, multiply the outcome: Cooperative vm consolidation,” in Cloud Computing Technology and Science (CloudCom), 2014 IEEE 6th International Conference on. IEEE, 2014, pp. 300-305.
[32] T. Sun, Y. Xu, and Q. He, “Improving asynchronous search for distributed generalized assignment problem,” in Web Intelligence and Intelligent Agent Technology (WI-IAT), 2012 IEEE/WIC/ACM International Conferences on, vol. 2, Dec 2012, pp. 38-42.
[33] D. J. Dubois, G. Valetto, D. Lucia, and E. D. Nitto, “Mycocloud: Elasticity through self-organized service placement in decentralized clouds,” in 2015 IEEE 8th International Conference on Cloud Computing, June 2015, pp. 629-636.
[34] P. L. Snyder, R. Greenstadt, and G. Valetto, “Myconet: A fungiinspired model for superpeer-based peer-to-peer overlay topologies,” in 2009 Third IEEE International Conference on Self-Adaptive and SelfOrganizing Systems. IEEE, 2009, pp. 40-50.
[35] R. Kuntschke, M. Specht, M. van Amelsvoort, M. Wagler, M. Winter, and R. Witzmann, “Economic optimization in virtual power plants vs. stable grid operation - bridging the gap,” in 2015 IEEE 20th Conference on Emerging Technologies Factory Automation (ETFA), Sept 2015, pp. 1-5.
[36] D. P. Hans Kellerer, Ulrich Pferschy, Knapsack Problems. SpringerVerlag Berlin Heidelberg, 2004.
[37] J. Munkres, “Algorithms for the assignment and transportation problems,” Journal of the Society for Industrial and Applied Mathematics, vol. 5, no. 1, pp. 32-38, 1957. [Online]. Available: http://www.jstor.org/stable/2098689
[38] L. Fleischer, M. X. Goemans, V. S. Mirrokni, and M. Sviridenko, “Tight approximation algorithms for maximum general assignment problems,” in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, ser. SODA '06. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2006, pp. 611-620. [Online]. Available: http://dl.acm.org/citation.cfm?id=1109557.1109624
[39] M. Jelasity, W. Kowalczyk, and M. Van Steen, “Newscast computing,” Technical Report IR-CS-006, Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam, The Netherlands, Tech. Rep., 2003.
[40] S. Voulgaris, D. Gavidia, and M. Van Steen, “Cyclon: Inexpensive membership management for unstructured p2p overlays,” Journal of Network and Systems Management, vol. 13, no. 2, pp. 197-217, 2005.
[41] M. Jelasity, R. Guerraoui, A.-M. Kermarrec, and M. Van Steen, “The peer sampling service: Experimental evaluation of unstructured gossipbased implementations,” in Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware. Springer-Verlag New York, Inc., 2004, pp. 79-98.
[42] R. Bakhshi, D. Gavidia, W. Fokkink, and M. Van Steen, “An analytical model of information dissemination for a gossip-based protocol,” Computer Networks, vol. 53, no. 13, pp. 2288-2303, 2009.
[43] R. Bruno, M. Conti, M. Mordacchini, and A. Passarella, “An analytical model for content dissemination in opportunistic networks using cognitive heuristics,” in Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems (MSWiM 2012). ACM, 2012, pp. 61-68.
[44] D. Chakrabarti, J. Leskovec, C. Faloutsos, S. Madden, C. Guestrin, and M. Faloutsos, “Information survival threshold in sensor and p2p networks,” in INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE. IEEE, 2007, pp. 1316-1324.
[45] A. Montresor and M. Jelasity, “Peersim: A scalable p2p simulator,” in Peer-to-Peer Computing, 2009. P2P'09. IEEE Ninth International Conference on. IEEE, 2009, pp. 99-100.
[46] I. S. Moreno, P. Garraghan, P. Townend, and J. Xu, “An approach for characterizing workloads in google cloud to derive realistic resource utilization models,” in Service Oriented System Engineering (SOSE), 2013 IEEE 7th International Symposium on. IEEE, 2013, pp. 49-60.
[47] E. Carlini, L. Ricci, and M. Coppola, “Flexible load distribution for hybrid distributed virtual environments,” Future Generation Computer Systems, vol. 29, no. 6, pp. 1561-1572, 2013.
[48] R. Cohen, L. Katzir, and D. Raz, “An efficient approximation for the generalized assignment problem,” Information Processing Letters, vol. 100, no. 4, pp. 162-166, 2006.
[2] T. Kurze, M. Klems, D. Bermbach, A. Lenk, S. Tai, and M. Kunze, “Cloud federation,” in CLOUD COMPUTING 2011 : The 2nd Int.l Conference on Cloud Computing, GRIDs, and Virtualization. IARIA, 2011.
[3] R. Moreno-Vozmediano, R. S. Montero, and I. M. Llorente, “Iaas cloud architecture: From virtualized datacenters to federated cloud infrastructures,” Computer, no. 12, pp. 65-72, 2012.
[4] M. M. Hassan, M. S. Hossain, A. J. Sarkar, and E.-N. Huh, “Cooperative game-based distributed resource allocation in horizontal dynamic cloud federation platform,” Information Systems Frontiers, vol. 16, no. 4, pp. 523-542, 2014.
[5] E. Carlini, M. Coppola, P. Dazzi, L. Ricci, and G. Righetti, “Cloud federations in contrail,” in Euro-Par 2011: Parallel Processing Workshops. Springer, 2011, pp. 159-168.
[6] Gartner, “Eight trends will shape the colocation market in 2016.” [Online]. Available: https://www.gartner.com/doc/reprints?id= 1-2X9EKB9&ct=160128&st=sb.
[7] L. Schubert, K. G. Jeffery, and B. Neidecker-Lutz, The Future of Cloud Computing: Opportunities for European Cloud Computing Beyond 2010:-expert Group Report. European Commission, Information Society and Media, 2010.
[8] R. Moreno-Vozmediano, R. S. Montero, and I. M. Llorente, “Key challenges in cloud computing: Enabling the future internet of services,” Internet Computing, IEEE, vol. 17, no. 4, pp. 18-25, 2013.
[9] J. Warren, “Equinix says hybrid cloud is the future.” [Online]. Available: http://www.forbes.com/sites/justinwarren/2016/03/ 09/equinix-says-hybrid-cloud-is-the-future/#7b53a602a953
[10] S. R. Carter, “Techniques for dynamic cloud-based edge service computing,” Nov. 17 2011, uS Patent App. 12/780,328.
[11] S. Choy, B. Wong, G. Simon, and C. Rosenberg, “A hybrid edgecloud architecture for reducing on-demand gaming latency,” Multimedia Systems, vol. 20, no. 5, pp. 503-519, 2014.
[12] M. Satyanarayanan, R. Schuster, M. Ebling, G. Fettweis, H. Flinck, K. Joshi, and K. Sabnani, “An open ecosystem for mobile-cloud convergence,” Communications Magazine, IEEE, vol. 53, no. 3, pp. 63-70, 2015.
[13] G. F. Anastasi, P. Cassara, P. Dazzi, A. Gotta, M. Mordacchini, and A. Passarella, “A hybrid cross-entropy cognitive-based algorithm for resource allocation in cloud environments,” in Self-Adaptive and SelfOrganizing Systems (SASO), 2014 IEEE Eighth International Conference on. IEEE, 2014, pp. 11-20.
[14] R. Baraglia, P. Dazzi, G. Capannini, and G. Pagano, “A multi-criteria job scheduling framework for large computing farms,” in 10th IEEE International Conference on Computer and Information Technology. IEEE, 2010, pp. 187-194.
[15] G. F. Anastasi, E. Carlini, M. Coppola, and P. Dazzi, “Qbrokage: A genetic approach for qos cloud brokering,” in Cloud Computing (CLOUD), 2014 IEEE 7th International Conference on. IEEE, 2014, pp. 304-311.
[16] M. Danelutto and P. Dazzi, “A java/jini framework supporting stream parallel computations,” in Proceedings of the International Conference ParCo 2005, G. R. J. et al., Ed., 2005.
[17] P. T. Endo, A. V. de Almeida Palhares, N. N. Pereira, G. E. Goncalves, D. Sadok, J. Kelner, B. Melander, and J.-E. Ma˚ngs, “Resource allocation for distributed cloud: concepts and research challenges,” Network, IEEE, vol. 25, no. 4, pp. 42-46, 2011.
[18] M. Steiner, B. G. Gaglianello, V. Gurbani, V. Hilt, W. D. Roome, M. Scharf, and T. Voith, “Network-aware service placement in a distributed cloud environment,” ACM SIGCOMM Computer Communication Review, vol. 42, no. 4, pp. 73-74, 2012.
[19] Y. Kessaci, N. Melab, and E.-G. Talbi, “A pareto-based metaheuristic for scheduling hpc applications on a geographically distributed cloud federation,” Cluster Computing, vol. 16, no. 3, pp. 451-468, 2013.
[20] R. Baraglia, P. Dazzi, M. Mordacchini, L. Ricci, and L. Alessi, “Group: A gossip based building community protocol,” in Smart Spaces and Next Generation Wired/Wireless Networking. Springer Berlin Heidelberg, 2011, pp. 496-507.
[21] M. Mordacchini, P. Dazzi, G. Tolomei, R. Baraglia, F. Silvestri, and S. Orlando, “Challenges in designing an interest-based distributed aggregation of users in p2p systems,” in 2009 International Conference on Ultra Modern Telecommunications & Workshops. IEEE, 2009, pp. 1-8.
[22] M. Mordacchini, R. Baraglia, P. Dazzi, and L. Ricci, “A p2p recommender system based on gossip overlays (prego),” in IEEE 10th International Conference on Computer and Information Technology (CIT), 2010. IEEE, 2010, pp. 83-90.
[23] E. Carlini, M. Coppola, P. Dazzi, D. Laforenza, S. Martinelli, and L. Ricci, “Service and resource discovery supports over p2p overlays,” in Ultra Modern Telecommunications & Workshops, 2009. ICUMT'09. International Conference on. IEEE, 2009, pp. 1-8.
[24] P. Dazzi, P. Felber, L. Leonini, M. Mordacchini, R. Perego, M. Rajman, and E´. Rivie`re, “Peer-to-peer clustering of web-browsing users,” Proc. LSDS-IR, pp. 71-78, 2009.
[25] R. Baraglia, P. Dazzi, B. Guidi, and L. Ricci, “Godel: Delaunay overlays in p2p networks via gossip,” in IEEE 12th International Conference on Peer-to-Peer Computing (P2P). IEEE, 2012, pp. 1-12.
[26] R. Buyya, R. Ranjan, and R. N. Calheiros, “Intercloud: Utility-oriented federation of cloud computing environments for scaling of application services,” in Algorithms and architectures for parallel processing. Springer, 2010, pp. 13-31.
[27] B. Rochwerger, D. Breitgand, E. Levy, A. Galis, K. Nagin, I. M. Llorente, R. Montero, Y. Wolfsthal, E. Elmroth, J. Caceres et al., “The reservoir model and architecture for open federated cloud computing,” IBM Journal of Research and Development, vol. 53, no. 4, pp. 4-1, 2009.
[28] A. J. Ferrer, F. Herna´ndez, J. Tordsson, E. Elmroth, A. Ali-Eldin, C. Zsigri, R. Sirvent, J. Guitart, R. M. Badia, K. Djemame et al., “Optimis: A holistic approach to cloud service provisioning,” Future Generation Computer Systems, vol. 28, no. 1, pp. 66-77, 2012.
[29] A. Ismail and V. Cardellini, Advances in Service-Oriented and Cloud Computing: Workshops of ESOCC 2014, Manchester, UK, September 2-4, 2014, Revised Selected Papers. Cham: Springer International Publishing, 2015, ch. Decentralized Planning for SelfAdaptation in Multi-cloud Environment, pp. 76-90. [Online]. Available: http://dx.doi.org/10.1007/978-3-319-14886-1 9
[30] D. Barbagallo, E. Di Nitto, D. J. Dubois, and R. Mirandola, A Bioinspired Algorithm for Energy Optimization in a Self-organizing Data Center. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 127- 151. [Online]. Available: http://dx.doi.org/10.1007/978-3-642-14412-7 7
[31] M. Sedaghat, F. Herna´ndez-Rodriguez, E. Elmroth, and S. Girdzijauskas, “Divide the task, multiply the outcome: Cooperative vm consolidation,” in Cloud Computing Technology and Science (CloudCom), 2014 IEEE 6th International Conference on. IEEE, 2014, pp. 300-305.
[32] T. Sun, Y. Xu, and Q. He, “Improving asynchronous search for distributed generalized assignment problem,” in Web Intelligence and Intelligent Agent Technology (WI-IAT), 2012 IEEE/WIC/ACM International Conferences on, vol. 2, Dec 2012, pp. 38-42.
[33] D. J. Dubois, G. Valetto, D. Lucia, and E. D. Nitto, “Mycocloud: Elasticity through self-organized service placement in decentralized clouds,” in 2015 IEEE 8th International Conference on Cloud Computing, June 2015, pp. 629-636.
[34] P. L. Snyder, R. Greenstadt, and G. Valetto, “Myconet: A fungiinspired model for superpeer-based peer-to-peer overlay topologies,” in 2009 Third IEEE International Conference on Self-Adaptive and SelfOrganizing Systems. IEEE, 2009, pp. 40-50.
[35] R. Kuntschke, M. Specht, M. van Amelsvoort, M. Wagler, M. Winter, and R. Witzmann, “Economic optimization in virtual power plants vs. stable grid operation - bridging the gap,” in 2015 IEEE 20th Conference on Emerging Technologies Factory Automation (ETFA), Sept 2015, pp. 1-5.
[36] D. P. Hans Kellerer, Ulrich Pferschy, Knapsack Problems. SpringerVerlag Berlin Heidelberg, 2004.
[37] J. Munkres, “Algorithms for the assignment and transportation problems,” Journal of the Society for Industrial and Applied Mathematics, vol. 5, no. 1, pp. 32-38, 1957. [Online]. Available: http://www.jstor.org/stable/2098689
[38] L. Fleischer, M. X. Goemans, V. S. Mirrokni, and M. Sviridenko, “Tight approximation algorithms for maximum general assignment problems,” in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, ser. SODA '06. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2006, pp. 611-620. [Online]. Available: http://dl.acm.org/citation.cfm?id=1109557.1109624
[39] M. Jelasity, W. Kowalczyk, and M. Van Steen, “Newscast computing,” Technical Report IR-CS-006, Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam, The Netherlands, Tech. Rep., 2003.
[40] S. Voulgaris, D. Gavidia, and M. Van Steen, “Cyclon: Inexpensive membership management for unstructured p2p overlays,” Journal of Network and Systems Management, vol. 13, no. 2, pp. 197-217, 2005.
[41] M. Jelasity, R. Guerraoui, A.-M. Kermarrec, and M. Van Steen, “The peer sampling service: Experimental evaluation of unstructured gossipbased implementations,” in Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware. Springer-Verlag New York, Inc., 2004, pp. 79-98.
[42] R. Bakhshi, D. Gavidia, W. Fokkink, and M. Van Steen, “An analytical model of information dissemination for a gossip-based protocol,” Computer Networks, vol. 53, no. 13, pp. 2288-2303, 2009.
[43] R. Bruno, M. Conti, M. Mordacchini, and A. Passarella, “An analytical model for content dissemination in opportunistic networks using cognitive heuristics,” in Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems (MSWiM 2012). ACM, 2012, pp. 61-68.
[44] D. Chakrabarti, J. Leskovec, C. Faloutsos, S. Madden, C. Guestrin, and M. Faloutsos, “Information survival threshold in sensor and p2p networks,” in INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE. IEEE, 2007, pp. 1316-1324.
[45] A. Montresor and M. Jelasity, “Peersim: A scalable p2p simulator,” in Peer-to-Peer Computing, 2009. P2P'09. IEEE Ninth International Conference on. IEEE, 2009, pp. 99-100.
[46] I. S. Moreno, P. Garraghan, P. Townend, and J. Xu, “An approach for characterizing workloads in google cloud to derive realistic resource utilization models,” in Service Oriented System Engineering (SOSE), 2013 IEEE 7th International Symposium on. IEEE, 2013, pp. 49-60.
[47] E. Carlini, L. Ricci, and M. Coppola, “Flexible load distribution for hybrid distributed virtual environments,” Future Generation Computer Systems, vol. 29, no. 6, pp. 1561-1572, 2013.
[48] R. Cohen, L. Katzir, and D. Raz, “An efficient approximation for the generalized assignment problem,” Information Processing Letters, vol. 100, no. 4, pp. 162-166, 2006.
Metrics
Back to previous page
BibTeX entry
@inproceedings{oai:it.cnr:prodotti:359366,
title = {Self-optimising Decentralised Service Placement in Heterogeneous Cloud Federation},
author = {Carlini E. and Coppola M. and Dazzi P. and Mordacchini M. and Passarella A.},
doi = {10.1109/saso.2016.17},
booktitle = {SASO 2016 - 10th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, pp. 110–119, Augsburg, Germany, 12-16 September 2016},
year = {2016}
}
0000-0003-3643-5404CNR ExploRA
ISTI Repository
DOIAlso available from
ISTI Repository
DOIAlso available from
