TY - JOUR
T1 - An efficient resource embedding algorithm in software defined virtualized data center
AU - Wen, Xuemin
AU - Han, Yanni
AU - Yuan, Hanning
AU - Zhou, Xu
AU - Xu, Zhen
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015
Y1 - 2015
N2 - Cloud computing is a promising paradigm for future computing platform. It enables the physical resources(computing, storage, networking, etc) to be provided on-demand. Despite the cloud computing brings many benefits to the IT network structure, it still faces new challenges for allocating heterogeneous resources automatically to services. Software Defined Networking (SDN) is a new concept of the network infrastructure as it decouples the control and data planes.With its characteristic of programmability, it's feasible to achieve network virtualization or create a slice of network in the form of virtual data centers(VDCs), which have pushed huge development of cloud computing. The VDCs embedding problem deals with allocating VDC requests to fulfill the requirements of cloud services with minimal cost and high revenue, which is an NPhard problem. In this paper, we propose an algorithm based on Entropy Weighted topological Potential considering multiple types of resources to tackle the problem in SDN-enabled data center network. Extensive simulations show that our proposed algorithm can embed more virtual requests efficiently with higher acceptance ratio and resource revenue over time.
AB - Cloud computing is a promising paradigm for future computing platform. It enables the physical resources(computing, storage, networking, etc) to be provided on-demand. Despite the cloud computing brings many benefits to the IT network structure, it still faces new challenges for allocating heterogeneous resources automatically to services. Software Defined Networking (SDN) is a new concept of the network infrastructure as it decouples the control and data planes.With its characteristic of programmability, it's feasible to achieve network virtualization or create a slice of network in the form of virtual data centers(VDCs), which have pushed huge development of cloud computing. The VDCs embedding problem deals with allocating VDC requests to fulfill the requirements of cloud services with minimal cost and high revenue, which is an NPhard problem. In this paper, we propose an algorithm based on Entropy Weighted topological Potential considering multiple types of resources to tackle the problem in SDN-enabled data center network. Extensive simulations show that our proposed algorithm can embed more virtual requests efficiently with higher acceptance ratio and resource revenue over time.
UR - http://www.scopus.com/inward/record.url?scp=84964917641&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2014.7417556
DO - 10.1109/GLOCOM.2014.7417556
M3 - Conference article
AN - SCOPUS:84964917641
SN - 2334-0983
JO - Proceedings - IEEE Global Communications Conference, GLOBECOM
JF - Proceedings - IEEE Global Communications Conference, GLOBECOM
M1 - 7417556
T2 - 58th IEEE Global Communications Conference, GLOBECOM 2015
Y2 - 6 December 2015 through 10 December 2015
ER -