Publishing Service

Polishing & Checking

Frontiers of Information Technology & Electronic Engineering

ISSN 2095-9184 (print), ISSN 2095-9230 (online)

An efficient and coordinated mapping algorithm in virtualized SDN networks

Abstract: Software-defined networking (SDN) enables the network virtualization through SDN hypervisors to share the underlying physical SDN network among multiple logically isolated virtual SDN networks (vSDNs), each with its own controller. The vSDN embedding, which refers to mapping a number of vSDNs to the same substrate SDN network, is a key problem in the SDN virtualization environment. However, due to the distinctions of the SDN, such as the logically centralized controller and different virtualization technologies, most of the existing embedding algorithms cannot be applied directly to SDN virtualization. In this paper, we consider controller placement and virtual network embedding as a joint vSDN embedding problem, and formulate it into an integer linear programming with objectives of minimizing the embedding cost and the controller-to-switch delay for each vSDN. Moreover, we propose a novel online vSDN embedding algorithm called CO-vSDNE, which consists of a node mapping stage and a link mapping stage. In the node mapping stage, CO-vSDNE maps the controller and the virtual nodes to the substrate nodes on the basis of the controller-to-switch delay and takes into account the subsequent link mapping at the same time. In the link mapping stage, CO-vSDNE adopts the k-shortest path algorithm to map the virtual links. The evaluation results with simulation and Mininet emulation show that the proposed CO-vSDNE not only significantly increases the long-term revenue to the cost ratio and acceptance ratio while guaranteeing low average and maximum controller-to-switch delay, but also achieves good vSDN performance in terms of end-to-end delay and throughput.

Key words: Software-defined networking (SDN), Network virtualization, Controller placement, Virtual network embedding, Coordination

Chinese Summary  <25> é¢å‘虚拟SDN网络的高效å调映射算法

目的:针对SDN网络虚拟化环境,考虑虚拟网络映射和控制器部署,以最å°åŒ–交æ¢æœºåˆ°æŽ§åˆ¶å™¨çš„å¹³å‡æ—¶å»¶å’Œæ˜ å°„开销为目标,建立虚拟SDN网络(vSDN)映射问题的数学模型,并æ出一ç§é«˜æ•ˆå调的虚拟SDN网络映射算法。
创新点:基于底层节点和链路的å¯ç”¨èµ„æºæ•°é‡ã€åº•å±‚节点间的时延和è·ç¦»ç­‰å› ç´ ï¼Œæ出一ç§æ”¯æŒæ—¶å»¶ä¼˜åŒ–的高效å调虚拟SDN网络映射算法。
方法:将vSDN中的控制器作为一个特殊的虚拟节点,在vSDN映射过程中åŒæ—¶è¿›è¡ŒæŽ§åˆ¶å™¨çš„优化部署,并以最å°åŒ–交æ¢æœºåˆ°æŽ§åˆ¶å™¨çš„å¹³å‡æ—¶å»¶å’Œåº•å±‚SDN网络映射开销为目标,建立vSDN映射的整数线性规划模型,并æ出一ç§æ”¯æŒæ—¶å»¶ä¼˜åŒ–的高效åè°ƒvSDN映射算法。该算法在节点映射阶段首先进行控制器的部署,然åŽè¿›è¡Œè™šæ‹ŸèŠ‚点的映射。在控制器部署过程中,考虑底层节点å¯ç”¨èµ„æºå’ŒèŠ‚点之间的通信时延,引入控制器ä½ç½®é€‰æ‹©å› å­(CLSF)对底层节点进行排åºï¼Œå¹¶å°†vSDN的控制器映射到CLSF值最大的底层节点上。在虚拟节点映射过程中,首先构建虚拟节点的映射树,并考虑底层节点å¯ç”¨èµ„æºã€åº•å±‚节点到控制器的时延和è·ç¦»ç­‰å› ç´ ï¼Œå¼•å…¥èŠ‚点映射因å­(NR)对底层节点进行排åºã€‚然åŽæŒ‰ç…§å¹¿åº¦ä¼˜å…ˆæœç´¢ç­–略将虚拟节点映射至NR值最大的底层节点上。节点映射完æˆåŽï¼Œé‡‡ç”¨k最短路径法映射虚拟链路。
结论:本文æ出的虚拟SDN网络映射算法能够有效å调控制器部署ã€è™šæ‹ŸèŠ‚点映射和链路映射三个阶段,ä¿æŒäº†è¾ƒé«˜çš„映射收益开销比和vSDN请求接å—率,并有效é™ä½Žäº†äº¤æ¢æœºåˆ°æŽ§åˆ¶å™¨çš„时延(图3-6)。

关键è¯ç»„:软件定义网络;网络虚拟化;控制器部署;虚拟网络映射;åè°ƒ


Share this article to: More

Go to Contents

References:

<Show All>

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





DOI:

10.1631/FITEE.1500387

CLC number:

TP393

Download Full Text:

Click Here

Downloaded:

2667

Download summary:

<Click Here> 

Downloaded:

1880

Clicked:

6873

Cited:

1

On-line Access:

2016-07-05

Received:

2015-11-10

Revision Accepted:

2016-02-16

Crosschecked:

2016-06-09

Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952276; Fax: +86-571-87952331; E-mail: jzus@zju.edu.cn
Copyright © 2000~ Journal of Zhejiang University-SCIENCE