z-logo
open-access-imgOpen Access
Survivable K-Node (Edge) Content Connected Virtual Optical Network (KC-VON) Embedding Over Elastic Optical Data Center Networks
Author(s) -
Xin Li,
Tao Gao,
Lu Zhang,
Ying Tang,
Yongjun Zhang,
Shanguo Huang
Publication year - 2018
Publication title -
ieee access
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.587
H-Index - 127
ISSN - 2169-3536
DOI - 10.1109/access.2018.2852814
Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom