Subscribe

Issue No.06 - June (2013 vol.24)

pp: 1077-1086

Aris Leivadeas , National Technical University of Athens (NTUA), Athens

Chrysa Papagianni , National Technical University of Athens (NTUA), Athens

Symeon Papavassiliou , National Technical University of Athens (NTUA), Athens

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.204

ABSTRACT

The cloud represents a computing paradigm where shared configurable resources are provided as a service over the Internet. Adding intra- or intercloud communication resources to the resource mix leads to a networked cloud computing environment. Following the cloud infrastructure as a Service paradigm and in order to create a flexible management framework, it is of paramount importance to address efficiently the resource mapping problem within this context. To deal with the inherent complexity and scalability issue of the resource mapping problem across different administrative domains, in this paper a hierarchical framework is described. First, a novel request partitioning approach based on Iterated Local Search is introduced that facilitates the cost-efficient and online splitting of user requests among eligible cloud service providers (CPs) within a networked cloud environment. Following and capitalizing on the outcome of the request partitioning phase, the embedding phase—where the actual mapping of requested virtual to physical resources is performed can be realized through the use of a distributed intracloud resource mapping approach that allows for efficient and balanced allocation of cloud resources. Finally, a thorough evaluation of the proposed overall framework on a simulated networked cloud environment is provided and critically compared against an exact request partitioning solution as well as another common intradomain virtual resource embedding solution.

INDEX TERMS

Substrates, Cloud computing, Partitioning algorithms, Availability, Special issues and sections, Scalability, virtualized infrastructures, Cloud computing, resource mapping

CITATION

Aris Leivadeas, Chrysa Papagianni, Symeon Papavassiliou, "Efficient Resource Mapping Framework over Networked Clouds via Iterated Local Search-Based Request Partitioning",

*IEEE Transactions on Parallel & Distributed Systems*, vol.24, no. 6, pp. 1077-1086, June 2013, doi:10.1109/TPDS.2012.204REFERENCES

- [1] RAD Lab, "Above the Clouds: A Berkeley View of Cloud Computing," UC Berkeley Technical Report UCB/EECS 2009-28, 2009.
- [2] P. Mell and T. Grance, "The NIST Definition of Cloud Computing,"
Recommendations of the National Institute of Standards and Technology, pp. 800-145, NIST Special Publication, 2011.- [3] Y. Xin, I. Baldine, A. Mandal, C. Heermann, J. Chase, and A. Yumerefendi, "Embedding Virtual Topologies in Networked Clouds,"
Proc. Sixth Int'l Conf. Future Internet Technologies (CFI' 11), June 2011, doi:10.1145/2002396.2002403. - [4] S. Paul, J. Pan, and R. Jain, "Architectures for the Future Networks and the Next Generation Internet: A Survey,"
Computer Comm., vol. 34, no. 1, pp. 2-42, Jan. 2011, doi:10.1016/j.comcom.2010. 08.001. - [5] F. Zaheer, J. Xiao, and R. Boutaba, "Multi-Provider Service Negotiation and Contracting in Network Virtualization,"
Proc. IEEE Network Operations and Management Symp. (NOMS), pp. 471-478, June 2010, doi: 10.1109/NOMS.2010.5488487. - [6] X. Cheng, S. Su, Z. Zhang, H. Wang, F. Yang, Y. Luo, and J. Wang, "Virtual Network Embedding through Topology-Aware Node Ranking,"
SIGCOMM Computing Comm. Rev., vol. 41, no. 2, pp. 38-47, Apr. 2011, doi:http://doi.acm.org/10.1145/1971162. 1971168. - [7] M. Chowdhury, M.R. Rahman, and R. Boutaba, "ViNEYard: Virtual Network Embedding Algorithms with Coordinated Node and Link Mapping,"
IEEE/ACM Trans. Networking, vol. 20, no. 1, pp. 206-219, Feb. 2012, doi: 10.1109/TNET.2011. 2159308. - [8] C. Papagianni, A. Leivadeas, S. Papavassiliou, V. Maglaris, C. Cervello-Pastor, and A. Monje, "On the Optimal Allocation of Virtual Resources in Cloud Computing Networks," Submitted 2011 (currently under revision), 2011.
- [9] B. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs,"
Bell Systems Technical J., vol. 49, no. 1, pp. 291-307, 1970.- [10] L. Tao, C. Zhao, K. Thulasiraman, and M.N.S. Swamy, "Simulated Annealing and Tabu Search Algorithms for Mulitway Graph Partitioning,"
J. Circuits Systems, and Computers, vol. 2, no. 2, pp. 159-185, 1992, doi:10.1142/S021812669200012X. - [11] O. Goldschmidt, "Polynomial Algorithm for the k-CUT Problem,"
Proc. 29th Ann. Symp. Foundations of Computer Science, pp. 444-451, Oct. 1988, doi: 10.1109/SFCS.1988.21960. - [12] I. Houidi, W. Louati, W.B. Ameur, and D. Zeghlache, "Virtual Network Provisioning Across Multiple Substrate Network,"
ELSEVIER Computer Networks, vol. 55, no. 2, pp. 1011-1023, 2011, doi.org/10.1016/j.comnet.2010.12.011. - [13] L.A. Sanchis, "Multiple-Way Network Partitioning,"
IEEE Trans. Computers, vol. 38, no. 1, pp. 62-81, Jan. 1989, doi: 10.1109/12.8730. - [14] S.J. Kang and B.R. Moon, "A Hybrid Genetic Algorithm for Multiway Graph Partitioning,"
Proc. Genetic and Evolutionary Computation Conf., 2000, doi: 10.1.1.152.8394. - [15] S. Kapoor, "On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees,"
Proc. Fifth Int'l IPCO Conf. Integer Programming and Combinatorial Optimization, vol. 1084, pp. 132-146, 1996, doi: 10.1007/3-540-61310-2_11. - [16] M. Stoer and F. Wagner, "A Simple Min-Cut Algorithm,"
J. ACM, vol. 44, no. 4, pp. 585-591, July 1997, doi:10.1145/263867.263872. - [17] D. Andersen, "Theoretical Approaches To Node Assignment," Unpublished Manuscript, http://www-2.cs.cmu.edu/dga/ papersandersen-assign.ps , 2002.
- [18] M. Yu, Y. Yi, J. Rexford, and M. Chiang, "Rethinking Virtual Network Embedding: Substrate Support for Path Splitting and Migration,"
ACM SIGCOMM Computer Comm. Rev., vol. 38, no. 2, pp. 17-29, Apr. 2008, doi:10.1145/1355734.1355737. - [19] J. Lischka and K. Holger, "A Virtual Mapping Algorithm Based on Subgraph Isomorphism Detection,"
Proc. ACM Workshop Virtualized Infrastructure Systems and Architectures (SIGCOMM '09), pp. 81-88, Aug. 2009, doi:10.1145/1592648.1592662. - [20] Y. Zhu and M.H. Ammar, "Algorithms for Assigning Substrate Network Resources to Virtual Network Components,"
Proc. IEEE INFOCOM '06, pp. 1-12, Apr. 2006, doi:10.1109/INFOCOM.2006.322. - [21] I. Houidi, W. Louati, D. Zeghlache, P. Papadimitriou, and L. Mathy, "Adaptive Virtual Network Provisioning,"
Proc. ACM SIGCOMM, pp. 41-48, Sept. 2010, doi:10.1145/1851399. 1851407. - [22] S. Zhang, Z. Qiant, S. Guo, and S. Lu, "FELL: A Flexible Virtual Network Embedding Algorithm with Guaranteed Load Balancing,"
Proc. IEEE Int'l Conf. Comm. (ICC '11), pp. 1-5, June 2011, doi: 10.1109/icc.2011.5962960. - [23] I. Fajjari, N. Aitsaadi, G. Pujolle, and H. Zimmermann, "VNE-AC : Virtual Network Embedding Algorithm Based on Ant Colony Metaheuristic,"
Proc. IEEE Int'l Conf. Comm. (ICC), pp. 1-6, June 2011, doi: 10.1109/icc.2011.5963442. - [24] M. Gendreau and J. Potvin,
Handbook of Metaheuristics, second ed. Springer, 2010.- [25] D.P. Bertsekas,
Network Optimization: Continuous and Discrete Models. Athena Scientific, 1998.- [26]
Local Search in Combinatorial Optimization. Princeton Univ. Press, 2003.- [27] R. Buyya, C.S. Yeo, and S. Venugopal, "Market-Oriented Cloud Computing: Vision, Hype, and Reality for Delivering It Services as Computing Utilities,"
Proc. IEEE Int'l Conf. High Performance Computing and Comm. (HPCC '08), pp. 5-13, Sept. 2008, doi: 10.1109/HPCC.2008.172. - [28] T. Stutzle, "Iterated Local Search for the Quadratic Assignment Problem,"
European J. Operational Research, vol. 174, no. 3, pp. 1519-1539, http://dx.doi.org/10.1016j.ejor.2005.01.066 , Nov. 2006.- [29] P. Raghavan and C.D. Thompson, "Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs,"
Combinatorica, vol. 7, no. 4, pp. 365-374, Dec. 1987, doi:10.1007/BF02579324. - [30] H. Khazaei, J. Misic, and V.B. Misic, "Performance Analysis of Cloud Computing Centers Using M/G/m/m+r Queueing Systems,"
IEEE Trans. Parallel and Distributed Systems, vol. 23, no. 5, pp. 936-943, May 2012, doi: 10.1109/TPDS.2011.199. |