• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Lin Xiao, Ji Shuo, Yue Shengnan, Sun Weiqiang, Hu Weisheng. Node-Constraint Store-and-Forward Scheduling Method for Inter-Datacenter Networks[J]. Journal of Computer Research and Development, 2021, 58(2): 319-337. DOI: 10.7544/issn1000-1239.2021.20200384
Citation: Lin Xiao, Ji Shuo, Yue Shengnan, Sun Weiqiang, Hu Weisheng. Node-Constraint Store-and-Forward Scheduling Method for Inter-Datacenter Networks[J]. Journal of Computer Research and Development, 2021, 58(2): 319-337. DOI: 10.7544/issn1000-1239.2021.20200384

Node-Constraint Store-and-Forward Scheduling Method for Inter-Datacenter Networks

Funds: This work was supported by the National Natural Science Foundation of China for Young Scientists (61901118), the Key Program of the National Natural Science Foundation of China (61433009), and the Open Foundation of the State Key Laboratory of Advanced Optical Communication Systems and Networks (2019GZKF03003).
More Information
  • Published Date: January 31, 2021
  • Performing store-and-forward (SnF) using abundant storage resources inside datacenters has been proven to be effective in overcoming the challenges faced by inter-datacenter bulk transfers. Most prior studies attempt to fully leverage the network infrastructure and maximize the flexibility of the SnF scheme. Their proposed scheduling methods hence aim at a full storage placement where all network nodes (e.g., datacenters) are SnF-enabled and every node is taken into account in the scheduling process. However, the computational complexity of the prior methods exponentially increases with the network scale. As a result, the prior methods may become too complicated to implement for large-scale networks and online scheduling. In this work, based on the inter-datacenter optical network, SnF models are presented to quantify the impact of the number of SnF-enabled nodes on the performance and the complexity of the SnF scheduling problem. Our key findings show that taking a few SnF-enabled nodes into account in the scheduling process can provide high performance while maintaining low complexity under certain circumstances. It is unnecessary to take every node into account in the scheduling process. Therefore, a node-constraint SnF scheduling method is proposed, whose features are twofold: 1) by taking a portion of nodes into account, it reduces the complexity of the SnF scheduling problem; 2) by introducing a topology abstraction, it condenses the link states between the considered nodes and hence reduces the problem size, which improves its efficiency in solving the SnF scheduling problem. Simulations demonstrate that the proposed method outperforms the prior method in terms of blocking probability and computation time.
  • Related Articles

    [1]Fu Maozhong, Hu Haiyang, Li Zhongjin. Dynamic Resource Scheduling Method for GPU Cluster[J]. Journal of Computer Research and Development, 2023, 60(6): 1308-1321. DOI: 10.7544/issn1000-1239.202220149
    [2]Wang Yawen, Guo Yunfei, Liu Wenyan, Hu Hongchao, Huo Shumin, Cheng Guozhen. A Task Scheduling Method for Cloud Workflow Security[J]. Journal of Computer Research and Development, 2018, 55(6): 1180-1189. DOI: 10.7544/issn1000-1239.2018.20170425
    [3]Liu Bingtao, Wang Da, Ye Xiaochun, Fan Dongrui, Zhang Zhimin, Tang Zhimin. The Data-Flow Block Based Spatial Instruction Scheduling Method[J]. Journal of Computer Research and Development, 2017, 54(4): 750-763. DOI: 10.7544/issn1000-1239.2017.20160138
    [4]Li Xuejun, Xu Jia, Zhu Erzhou, Zhang Yiwen. A Novel Computation Method for Adaptive Inertia Weight of Task Scheduling Algorithm[J]. Journal of Computer Research and Development, 2016, 53(9): 1990-1999. DOI: 10.7544/issn1000-1239.2016.20151175
    [5]Zhang Jun, He Yanxiang, Shen Fanfan, Jiang Nan, Li Qing’an. Two-Stage Synchronization Based Thread Block Compaction Scheduling Method of GPGPU[J]. Journal of Computer Research and Development, 2016, 53(6): 1173-1185. DOI: 10.7544/issn1000-1239.2016.20150114
    [6]He Yanxiang, Chen Yong, Wu Wei, Xu Chao, Li Qingan. Bus-Invert Encoding Oriented Low Power Scheduling Method[J]. Journal of Computer Research and Development, 2014, 51(8): 1773-1780. DOI: 10.7544/issn1000-1239.2014.20130066
    [7]Zheng Xiaowei, Xiang Ming, Zhang Dawei, and Liu Qingkun. An Adaptive Tasks Scheduling Method Based on the Ability of Node in Hadoop Cluster[J]. Journal of Computer Research and Development, 2014, 51(3): 618-626.
    [8]Wang Xin, Yuan Xiaojie, Wang Chenying, and Zhang Haiwei. XN-Store: A Storage Scheme for Native XML Databases[J]. Journal of Computer Research and Development, 2008, 45(7).
    [9]Ma Yili, Fu Xianglin, Han Xiaoming, and Xu Lu. The Separation between Storage and Computation[J]. Journal of Computer Research and Development, 2005, 42(3).
    [10]Wen Yanzhi, Lian Ruiqi, Wu Chengyong, Feng Xiaobing, and Zhang Zhaoqing. A Micro-Scheduling Method on Directed Cyclic Graph[J]. Journal of Computer Research and Development, 2005, 42(3).
  • Cited by

    Periodical cited type(12)

    1. 许辰宏,于刘. 基于云计算的航空飞行试验数据中心任务调度优化架构设计. 计算机测量与控制. 2024(02): 168-173 .
    2. 马薏雯. 基于数据挖掘的大学生就业指导资源挖掘方法. 信息技术. 2024(02): 128-131+137 .
    3. 宁克,刘志伟,侯滨. 全渠道供应链网络节点约束存储转发调度方法. 电子设计工程. 2024(08): 134-138 .
    4. 周海飞,芦翔,胡春芬. 基于模糊评判的无线传感器网络簇间数据转发算法. 传感技术学报. 2024(06): 1067-1072 .
    5. 由春辉. 基于策略梯度算法的工业数据中心通信调度性能评估. 现代工业经济和信息化. 2024(09): 122-123+126 .
    6. 李斌,刘思尧,王敏,秦振威. 高稳定性区块链节点存储数据防篡改仿真. 单片机与嵌入式系统应用. 2023(09): 33-36+40 .
    7. 关智华,郭志彪. 基于遗传算法的通信网络节点自适应调度方法. 现代传输. 2023(05): 63-66 .
    8. 杨裴裴,黄燕,叶海智. 启发式规划算法下云边缘节点均衡调度仿真. 计算机仿真. 2023(09): 416-419+425 .
    9. 廖伟国,文明瑶. 基于偏高免疫网络的低功耗节点调度方法仿真. 计算机仿真. 2023(11): 365-369 .
    10. 刘松旭,符太东. 基于时序预测的网络数据传输阻塞控制仿真. 计算机仿真. 2023(11): 379-383 .
    11. 张媛,李文娟,高鹏. 基于数据挖掘的复杂光通信网络节点调度方法. 激光杂志. 2022(02): 139-143 .
    12. 王然,张宇超,王文东,徐恪,崔来中. 基于预测的数据中心间混合流量调度算法. 计算机研究与发展. 2021(06): 1307-1317 . 本站查看

    Other cited types(2)

Catalog

    Article views (738) PDF downloads (298) Cited by(14)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return