메뉴 건너뛰기




Volumn 24, Issue 6, 2013, Pages 1077-1086

Efficient resource mapping framework over networked clouds via iterated local search-based request partitioning

Author keywords

Cloud computing; resource mapping; virtualized infrastructures

Indexed keywords

BALANCED ALLOCATION; CLOUD COMPUTING ENVIRONMENTS; CLOUD INFRASTRUCTURES; CLOUD SERVICE PROVIDERS; COMMUNICATION RESOURCES; ITERATED LOCAL SEARCH; RESOURCE MAPPING; VIRTUALIZED INFRASTRUCTURES;

EID: 84877727320     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2012.204     Document Type: Article
Times cited : (60)

References (30)
  • 4
    • 78149465725 scopus 로고    scopus 로고
    • Architectures for the future networks and the next generation internet: A survey
    • Jan. doi:10.1016/j.comcom.2010. 08.001
    • 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.
    • (2011) Computer Comm , vol.34 , Issue.1 , pp. 2-42
    • Paul, S.1    Pan, J.2    Jain, R.3
  • 5
    • 77957761113 scopus 로고    scopus 로고
    • Multi-provider service negotiation and contracting in network virtualization
    • June doi: 10.1109/NOMS.2010.5488487
    • 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.
    • (2010) Proc IEEE Network Operations and Management Symp. (NOMS) , pp. 471-478
    • Zaheer, F.1    Xiao, J.2    Boutaba, R.3
  • 6
    • 81355142269 scopus 로고    scopus 로고
    • Virtual network embedding through topology-aware node ranking
    • Apr. doi:http://doi acm.org/10.1145/1971162. 1971168
    • 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.
    • (2011) SIGCOMM Computing Comm. Rev , vol.41 , Issue.2 , pp. 38-47
    • Cheng, X.1    Su, S.2    Zhang, Z.3    Wang, H.4    Yang, F.5    Luo, Y.6    Wang, J.7
  • 7
    • 84857355987 scopus 로고    scopus 로고
    • Vineyard: Virtual network embedding algorithms with coordinated node and link mapping
    • Feb. doi: 10.1109/TNET.2011. 2159308
    • 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.
    • (2012) IEEE/ACM Trans. Networking , vol.20 , Issue.1 , pp. 206-219
    • Chowdhury, M.1    Rahman, M.R.2    Boutaba, R.3
  • 9
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • B. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs," Bell Systems Technical J., vol. 49, no. 1, pp. 291-307, 1970.
    • (1970) Bell Systems Technical J , vol.49 , Issue.1 , pp. 291-307
    • Kernighan, B.1    Lin, S.2
  • 10
    • 0344291225 scopus 로고
    • Simulated annealing and tabu search algorithms for mulitway graph partitioning
    • doi:10.1142/S021812669200012X
    • 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.
    • (1992) J. Circuits Systems, and Computers , vol.2 , Issue.2 , pp. 159-185
    • Tao, L.1    Zhao, C.2    Thulasiraman, K.3    Swamy, M.N.S.4
  • 11
    • 0024135613 scopus 로고
    • Polynomial algorithm for the k-cut problem
    • Oct doi: 10.1109/SFCS.1988.21960
    • 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.
    • (1988) Proc. 29th Ann. Symp. Foundations of Computer Science , pp. 444-451
    • Goldschmidt, O.1
  • 12
    • 79952038726 scopus 로고    scopus 로고
    • Virtual network provisioning across multiple substrate network
    • doi.org/10.1016/j.comnet.2010.12.011
    • 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.
    • (2011) ELSEVIER Computer Networks , vol.55 , Issue.2 , pp. 1011-1023
    • Houidi, I.1    Louati, W.2    Ameur, W.B.3    Zeghlache, D.4
  • 13
    • 0024481167 scopus 로고
    • Multiple-way network partitioning
    • Jan doi: 10.1109/12.8730
    • L.A. Sanchis, "Multiple-Way Network Partitioning," IEEE Trans. Computers, vol. 38, no. 1, pp. 62-81, Jan. 1989, doi: 10.1109/12.8730.
    • (1989) IEEE Trans. Computers , vol.38 , Issue.1 , pp. 62-81
    • Sanchis, L.A.1
  • 15
    • 84947924962 scopus 로고    scopus 로고
    • On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees
    • Integer Programming and Combinatorial Optimization
    • 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. (Pubitemid 126078615)
    • (1996) Lecture Notes in Computer Science , Issue.1084 , pp. 132-146
    • Kapoor, S.1
  • 16
    • 0031176702 scopus 로고    scopus 로고
    • A simple min-cut algorithm
    • 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. (Pubitemid 127617705)
    • (1997) Journal of the ACM , vol.44 , Issue.4 , pp. 585-591
    • Stoer, M.1    Wagner, F.2
  • 18
    • 85207468941 scopus 로고    scopus 로고
    • Rethinking virtual network embedding: Substrate support for path splitting and migration
    • Apr doi:10.1145/1355734.1355737
    • 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.
    • (2008) ACM SIGCOMM Computer Comm. Rev , vol.38 , Issue.2 , pp. 17-29
    • Yu, M.1    Yi, Y.2    Rexford, J.3    Chiang, M.4
  • 20
    • 39049102574 scopus 로고    scopus 로고
    • Algorithms for assigning substrate network resources to virtual network components
    • Apr doi:10.1109/INFOCOM. 2006.322
    • 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.
    • (2006) Proc IEEE INFOCOM '06 , pp. 1-12
    • Zhu, Y.1    Ammar, M.H.2
  • 22
    • 80052144076 scopus 로고    scopus 로고
    • FELL: A flexible virtual network embedding algorithm with guaranteed load balancing
    • June doi: 10.1109/icc.2011.5962960
    • 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.
    • (2011) Proc IEEE Int'l Conf. Comm. (ICC '11) , pp. 1-5
    • Zhang, S.1    Qiant, Z.2    Guo, S.3    Lu, S.4
  • 23
    • 80052151060 scopus 로고    scopus 로고
    • VNE-AC : Virtual network embedding algorithm based on ant colony metaheuristic
    • June doi: 10.1109/icc.2011.5963442
    • 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.
    • (2011) Proc IEEE Int'l Conf. Comm. (ICC) , pp. 1-6
    • Fajjari, I.1    Aitsaadi, N.2    Pujolle, G.3    Zimmermann, H.4
  • 27
    • 56349150824 scopus 로고    scopus 로고
    • Market-oriented cloud computing: Vision, hype, and reality for delivering it services as computing utilities
    • Sept doi: 10.1109/HPCC.2008.172
    • 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.
    • (2008) Proc IEEE Int'l Conf. High Performance Computing and Comm. (HPCC '08) , pp. 5-13
    • Buyya, R.1    Yeo, C.S.2    Venugopal, S.3
  • 28
    • 33747014280 scopus 로고    scopus 로고
    • Iterated local search for the quadratic assignment problem
    • DOI 10.1016/j.ejor.2005.01.066, PII S0377221705002651
    • 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.1016/j.ejor.2005.01.066, Nov. 2006. (Pubitemid 44202643)
    • (2006) European Journal of Operational Research , vol.174 , Issue.3 , pp. 1519-1539
    • Stutzle, T.1
  • 29
    • 51249173817 scopus 로고
    • Randomized rounding: A technique for provably good algorithms and algorithmic proofs
    • Dec doi:10.1007/BF02579324
    • 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.
    • (1987) Combinatorica , vol.7 , Issue.4 , pp. 365-374
    • Raghavan, P.1    Thompson, C.D.2
  • 30
    • 84859728505 scopus 로고    scopus 로고
    • Performance analysis of cloud computing centers using m/g/m/m+r queueing systems
    • May doi: 10.1109/TPDS.2011.199
    • 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.
    • (2012) IEEE Trans. Parallel and Distributed Systems , vol.23 , Issue.5 , pp. 936-943
    • Khazaei, H.1    Misic, J.2    Misic, V.B.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.