Survivable K-Node (Edge) Content Connected Virtual Optical Network (KC-VON) Embedding Over Elastic Optical Data Center Networks

To design a disaster-resilient optical data center network, the concept of k-node (edge) content connectivity has been proposed and researched. Based on this concept, the k-node (edge) content connected elastic optical data center network (KC-EODCN) has been defined. To realize the KC-EODCN, individ...

Full description

Bibliographic Details
Main Authors: Xin Li, Tao Gao, Lu Zhang, Ying Tang, Yongjun Zhang, Shanguo Huang
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8403222/
Description
Summary:To design a disaster-resilient optical data center network, the concept of k-node (edge) content connectivity has been proposed and researched. Based on this concept, the k-node (edge) content connected elastic optical data center network (KC-EODCN) has been defined. To realize the KC-EODCN, individually establishing k independent end-to-content paths for each user is a direct method with lower complexity. However, this method ignores the relevance among the users who request the same level of k-node (edge) content connectivity and causes more spectrum consumption. In this paper, a survivable k-node (edge) content connected virtual optical network (KC-VON) is defined. The users who require the same level of k-node (edge) content connectivity are organized into one KC-VON. The KC-VON satisfies the k-node (edge) content connectivity requirement that each user has at least k virtual independent end-to-content paths. The KC-VON embedding scheme is proposed instead of individually establishing k independent end-to-content paths for each user. Moreover, the KC-VON construction algorithm is developed to realize the KC-VON's construction. An integer linear program model and heuristic KC-VON embedding algorithms are developed to realize the virtual link mapping. Numerical results show that the KC-VON embedding scheme can greatly reduce the spectrum consumption more than the method of individually establishing k independent end-to-content paths for each user while realizing the KC-EODCN.
ISSN:2169-3536