Static multi-sourced data retrieval in elastic optical networks
Static multi-sourced data retrieval in elastic optical networks
复制标题
DOI：
10.1364/jocn.465019
复制
发表时间：
2022-08
影响因子：
5
通讯作者：
Juzi Zhao;V. Vokkarane
中科院分区：
文献类型：
--
作者：
Juzi Zhao;V. Vokkarane
极端规模的科学应用是高度创新和不断发展的。预计它们将生成PB和EB范围内的数据。擦除编码已广泛用于数据中心网络中的数据存储，其中数据被编码并存储在多个位置。因此，需要有效的数据检索服务来将编码数据从选定的多个存储节点传输到单个目的地。弹性光网络能够高效、灵活地为异构业务需求分配巨大的光带宽，是一种很有前途的数据中心通信骨干技术。研究了弹性光网络中静态业务的擦除编码多源数据检索路由与调度问题，目标是最小化所有请求的总传输完成时间.提出了一个整数线性规划公式和低复杂度的启发式算法。此外，分析下界推导和元启发式，禁忌搜索，采用解决问题。数值结果表明所提出的方法的有效性。
Extreme-scale science applications are highly innovative and constantly evolving. They are expected to generate data in the petabyte and exabyte ranges. Erasure coding has been widely adopted for data storage in data center networks, where the data are encoded and stored in multiple locations. Therefore, an efficient data retrieval service is needed to transfer encoded data from selected multiple stored nodes to a single destination. Elastic optical networks are a promising backbone technology for data center communication due to their capability to efficiently and flexibly allocate the huge optical bandwidth to heterogeneous traffic demands. In this paper, the erasure-coded multi-sourced data retrieval routing and scheduling problem is studied for static traffic in elastic optical networks, and the objective is to minimize the total transmission completion time of all the requests. An integer linear programming formulation and low-complexity heuristic are proposed. Furthermore, analytical lower bounds are derived and a meta-heuristic, Tabu Search, is adopted to solve the problem. Numerical results are presented to show the effectiveness of the proposed methods.