Virtual Network Embedding Based on the Degree and Clustering Coefficient Information
The issue of virtual network (VN) embedding constitutes an important aspect of network virtualization, which is considered to be one of the most crucial techniques to overcome the Internet ossification problem. The main purpose of VN embedding is to efficiently utilize the limited physical network resources to offer the supporting of virtual nodes and virtual links from the VNs. Due to the fact that the VN embedding problem is proved to be NP-hard, previous works have put forward some of heuristic algorithms to solve this VN embedding problem. However, most of the existing research works only consider the local resources of nodes, ignoring the topological attributes of its neighborhood nodes, and lead to lower resource utilization of the substrate network. To address this issue, we proposed an approach of VN embedding algorithm called VNE-DCC , which based on the node degree and the clustering coefficient information, we adopted the technique of node importance metric to rank the substrate nodes aim to select the node with the most embedding potential for every virtual node in each VN requests, and exploited the breadth-first-search algorithm to embed the virtual nodes aiming at reducing the resource utilization of substrate links so as to increase the acceptance ratio of VN requests and increase the revenues of operational providers. Extensive simulations have shown that the efficiency of our algorithm is better than the other state-of-the-art algorithms in terms of Revenue/Cost ratio and acceptance ratio.
- 원문이 없습니다.
원문복사신청을 하시면, 일부 해외 인쇄학술지의 경우 외국학술지지원센터(FRIC)에서
무료 원문복사 서비스를 제공합니다.
NDSL에서는 해당 원문을 복사서비스하고 있습니다. 위의 원문복사신청 또는 장바구니 담기를 통하여 원문복사서비스 이용이 가능합니다.
- 이 논문과 함께 출판된 논문 + 더보기