Query：
学者姓名：林霄
Refining：
Year
Type
Indexed by
Source
Complex
Co-
Language
Clean All
Abstract ：
为满足冷、热业务实时、高效的算力调度需求，提出一种基于自适应噪声完全集合经验模态分解(CEEMDAN)与时间卷积网络(TCN)的算力负载预测模型(简称C-TCN模型)，并设计了基于C-TCN与Q学习的资源协同调度算法(CTQ算法)，利用C-TCN模型提前感知下一时刻负载变化，通过Q学习协同调度波长与存储资源，寻找最佳波长划分与边缘存储分配方案。实验结果表明：CTQ算法的调度性能不仅优于现有调度算法，能满足冷、热业务调度性能要求，而且还能提高波长利用率。
Keyword ：
数据传输 数据传输 算力调度 算力调度 网络优化 网络优化 资源调度 资源调度 边缘光算力网络 边缘光算力网络
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 王蕴 , 林霄 , 楼芝兰 et al. 面向边缘光算力网络的上行链路资源协同调度算法 [J]. | 光通信技术 , 2024 , 48 (03) : 45-51 . |
| MLA | 王蕴 et al. "面向边缘光算力网络的上行链路资源协同调度算法" . | 光通信技术 48 . 03 (2024) : 45-51 . |
| APA | 王蕴 , 林霄 , 楼芝兰 , 李军 , 孙卫强 . 面向边缘光算力网络的上行链路资源协同调度算法 . | 光通信技术 , 2024 , 48 (03) , 45-51 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
A GCN-assisted scheduling method is presented to schedule bulk transfers across the inter-DCN in a store-and-forward manner. Simulations demonstrate that the proposed method obtains better network performance and lower complexity than the conventional methods. (c) 2022 The Author(s)
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, Xiao , Zheng, Lanfang , Li, Yajie et al. GCN-Assisted SnF Scheduling Method for Inter-Datacenter Bulk Transfers [J]. | 2023 OPTICAL FIBER COMMUNICATIONS CONFERENCE AND EXHIBITION, OFC , 2023 . |
| MLA | Lin, Xiao et al. "GCN-Assisted SnF Scheduling Method for Inter-Datacenter Bulk Transfers" . | 2023 OPTICAL FIBER COMMUNICATIONS CONFERENCE AND EXHIBITION, OFC (2023) . |
| APA | Lin, Xiao , Zheng, Lanfang , Li, Yajie , Shi, Keqin . GCN-Assisted SnF Scheduling Method for Inter-Datacenter Bulk Transfers . | 2023 OPTICAL FIBER COMMUNICATIONS CONFERENCE AND EXHIBITION, OFC , 2023 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Antimony sulfide (Sb2S3) with a 1D molecular structure has strong bending characteristics, showing great application potential in flexible devices. Herein, the flexible substrate-structured Sb2S3 solar cells is developed and improve device performances by the back interface selenization. The high-quality Sb2S3 film with an optimal thickness of 1.8 mu m, ensuring efficient spectra utilization, is deposited on flexible Mo foils by the rapid thermal evaporation technique. To solve the issues of back interfacial recombination and charge transport, the 20 nm MoSe2 layer between Sb2S3 film and Mo foil is fabricated by substrate selenization in the tube furnace. Further investigations indicate that the MoSe2 layer improves the interfacial energy band alignments and induces the [hk1] orientation of Sb2S3 film, thereby passivating defects and enhancing the carrier transport capacity. The flexible solar cell in the structure of Mo foil/MoSe2/Sb2S3/CdS/ITO/Ag, exhibiting good flexibility to stand thousands of bending, achieves an efficiency of 3.75%, which is the highest for Sb2S3 devices in substrate configuration. The presented flexible structure and back interfacial selenization study will provide new prospects for inorganic Sb2S3 thin film solar cells.
Keyword ：
flexible flexible MoSe2 MoSe2 orientations orientations Sb2S3 solar cells Sb2S3 solar cells substrate configurations substrate configurations
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Deng, Hui , Cheng, Yingshun , Chen, Zekun et al. Flexible Substrate-Structured Sb2S3 Solar Cells with Back Interface Selenization [J]. | ADVANCED FUNCTIONAL MATERIALS , 2023 , 33 (12) . |
| MLA | Deng, Hui et al. "Flexible Substrate-Structured Sb2S3 Solar Cells with Back Interface Selenization" . | ADVANCED FUNCTIONAL MATERIALS 33 . 12 (2023) . |
| APA | Deng, Hui , Cheng, Yingshun , Chen, Zekun , Lin, Xiao , Wu, Jionghua , Zheng, Qiao et al. Flexible Substrate-Structured Sb2S3 Solar Cells with Back Interface Selenization . | ADVANCED FUNCTIONAL MATERIALS , 2023 , 33 (12) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
A GCN-assisted scheduling method is presented to schedule bulk transfers across the inter-DCN in a store-and-forward manner. Simulations demonstrate that the proposed method obtains better network performance and lower complexity than the conventional methods. © 2023 The Author(s).
Keyword ：
(060.4251) Networks, assignment and routing algorithms (060.4251) Networks, assignment and routing algorithms
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, X. , Zheng, L. , Li, Y. et al. GCN-Assisted SnF Scheduling Method for Inter-Datacenter Bulk Transfers [未知]. |
| MLA | Lin, X. et al. "GCN-Assisted SnF Scheduling Method for Inter-Datacenter Bulk Transfers" [未知]. |
| APA | Lin, X. , Zheng, L. , Li, Y. , Shi, K. . GCN-Assisted SnF Scheduling Method for Inter-Datacenter Bulk Transfers [未知]. |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Digital Twin Network (DTN) constructs a many-to-many mapping network by communicating and collaborating with massive Digital Twins (DTs), which can better assist the management and operation of large-scale modern systems. However, the emergence of DTN mirrors a growing demand for bulk data transfer between geo-distributed DT nodes in the physical network infrastructure. Conventional end-to-end connections are facing a great challenge in the presence of the background traffic fluctuation. In this paper, we propose a graph convolutional network (GCN)-enabled scheduling method to schedule bulk data transfers across the DTN in a store-and-forward (SnF) manner. Instead of solving the complex SnF scheduling problem on the entire network, the proposed method decomposes the problem into multiple sub-problems on different pre-computed routes. Instead of learning the scheduling results directly, the GCN model is used to predict the reachability of DT nodes. These unreachable nodes will be excluded from the scheduling process. Our studies show that the proposed method obtains better network performance and lower complexity when compared with the conventional scheduling methods.
Keyword ：
Bulk data transfers Bulk data transfers digital twin networks digital twin networks graph convolutional network graph convolutional network routing routing store-and-forward store-and-forward
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, Xiao , Zheng, Lanfang , Shi, Keqin et al. Bulk Transfers With GCN Scheduling In Digital Twin Networks [J]. | ICC 2023 - IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS , 2023 : 447-452 . |
| MLA | Lin, Xiao et al. "Bulk Transfers With GCN Scheduling In Digital Twin Networks" . | ICC 2023 - IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (2023) : 447-452 . |
| APA | Lin, Xiao , Zheng, Lanfang , Shi, Keqin , Li, Yajie . Bulk Transfers With GCN Scheduling In Digital Twin Networks . | ICC 2023 - IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS , 2023 , 447-452 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
ANN-assisted scheduling method is presented to schedule bulk transfers across optical computing power networks in a single-path/SnF-multi-path manner. Studies demonstrate that the method outperforms the conventional methods in terms of blocking probability and computation time. © 2023 IEEE.
Keyword ：
Artificial neural network Artificial neural network bulk data transfer bulk data transfer computing power network computing power network multi-path routing multi-path routing optical network optical network store-and-forward store-and-forward
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, X. , Lin, H. , Zhang, C. et al. ANN-Assisted Scheduling Method for Bulk Data Transfers in Optical Computing Power Networks [未知]. |
| MLA | Lin, X. et al. "ANN-Assisted Scheduling Method for Bulk Data Transfers in Optical Computing Power Networks" [未知]. |
| APA | Lin, X. , Lin, H. , Zhang, C. , Li, J. , Shi, K. , Sun, W. et al. ANN-Assisted Scheduling Method for Bulk Data Transfers in Optical Computing Power Networks [未知]. |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In recent years, the development of edge computing technology has brought many conveniences to people’s lives and many outstanding works have been proposed. However, these efforts do not focus on the selection and routing problem of computing nodes. In this paper, an algorithm is designed to integrate and downscale the link adjacency matrix and computing resource table of multiple moments to one dimension, changing the multi-layer topology into a single-layer topology. Based on this, a model of resource evaluation is proposed, which can evaluate the availability of link and node resources more accurately. Specifically, a bandwidth and computing resource fusion method based on network topology is proposed. On this basis, an anycast scheduling method is proposed, which features: 1) using a resource evaluation model evaluate computing and bandwidth resources; 2) introducing auxiliary points to achieve computing and bandwidth resource fusion, integrating resource availability evaluation values into the same topology and performing routing and resource scheduling; 3) updating the resource evaluation table in real time, thus achieving load balancing. Meanwhile the edge computing network scenario is established to realize the simulation of dynamic processes such as background flow and anycast service. On this basis, the performance of the traditional anycast scheduling method and the scheduling method proposed in this paper are compared. The experimental results show that the algorithm has excellent performance in terms of blocking rate and utilization, and has good practicality and superiority to meet the computing offloading tasks between nodes in edge computing networks. © 2023, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.
Keyword ：
Anycast Anycast Edge Computing Edge Computing
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wu, L. , Lin, X. , Shi, Y. . Research on Anycast Scheduling Algorithm in Edge Computing Networks [未知]. |
| MLA | Wu, L. et al. "Research on Anycast Scheduling Algorithm in Edge Computing Networks" [未知]. |
| APA | Wu, L. , Lin, X. , Shi, Y. . Research on Anycast Scheduling Algorithm in Edge Computing Networks [未知]. |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The increasing demand of bulk data transfer imposes significant challenges in inter-datacenter networks that span multiple domains. Storing data temporarily at domain borders and forward it at later off-peak hours (SnF) can reduce congestion and improve network utilization. However, performance gains from SnF transfer still requires further quantitative study. In this article, we model deadline-constrained SnF transfers in networks with congested inter-domain links, where traffic has slightly varying peak hour and diurnal patterns. A closed-form estimation for the two-links case is derived to quantify the performance gain of intermediate storage (IS) and edge storage (ES). Our study shows that if bulk data transfer requests arrive with equal probability in a day, increase the allowed waiting time will increase the successful transfer probability linearly. Increasing the aggregated network load, defined as the summed duration of the background traffic peak-hour and data transfer, will result in linear decrease in successful transfer probability, when the network is moderately loaded. Our research also shows that IS has significant advantages over ES under heavy network load, and the maximum benefit occurs when the allowed waiting time is two times the aggregated network load.
Keyword ：
modeling methodologies modeling methodologies performance of systems performance of systems Store and forward networks Store and forward networks wide-area networks wide-area networks
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Yue, Shengnan , Lin, Xiao , Sun, Weiqiang et al. Modeling Sparse Store-and-Forward Bulk Data Transfers in Inter-Datacenter Networks With Multiple Congested Links [J]. | IEEE TRANSACTIONS ON CLOUD COMPUTING , 2023 , 11 (3) : 2725-2738 . |
| MLA | Yue, Shengnan et al. "Modeling Sparse Store-and-Forward Bulk Data Transfers in Inter-Datacenter Networks With Multiple Congested Links" . | IEEE TRANSACTIONS ON CLOUD COMPUTING 11 . 3 (2023) : 2725-2738 . |
| APA | Yue, Shengnan , Lin, Xiao , Sun, Weiqiang , Hu, Weisheng . Modeling Sparse Store-and-Forward Bulk Data Transfers in Inter-Datacenter Networks With Multiple Congested Links . | IEEE TRANSACTIONS ON CLOUD COMPUTING , 2023 , 11 (3) , 2725-2738 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Traffic fluctuations make conventional end-To-end delay-sensitive (DS) transfers difficult to fully utilize the residual bandwidth in the inter-datacenter networks. In this paper, we introduce datacenter storage and multi-path routing into DS transfers, and present a scheduling method. On one hand, it can split data into shorter segments and route them through multiple paths. On the other hand, it leverages temporary storage at intermediate sites to segment each path into sub-paths when provisioning the end-To-end lightpath fails. Studies show that compared with the state-of-The-Art scheduling methods, the proposed method can accommodate more DS transfers, shorten delivery time and accelerate DS transfers efficiently. © 2022 IFIP TC6 WG6.10.
Keyword ：
Delay-sensitive applications Delay-sensitive applications Digital storage Digital storage Fiber optic networks Fiber optic networks Scheduling Scheduling
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, Xiao , Ji, Shuo , Yue, Shengnan et al. Adaptive Multi-Path SnF Scheduling Method for Delay-Sensitive Transfers Across Inter-Datacenter Optical Networks [C] . 2022 . |
| MLA | Lin, Xiao et al. "Adaptive Multi-Path SnF Scheduling Method for Delay-Sensitive Transfers Across Inter-Datacenter Optical Networks" . (2022) . |
| APA | Lin, Xiao , Ji, Shuo , Yue, Shengnan , Li, Jun , Sun, Weiqiang , Hu, Weisheng . Adaptive Multi-Path SnF Scheduling Method for Delay-Sensitive Transfers Across Inter-Datacenter Optical Networks . (2022) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In this paper, we use the wavelet transform and the ANN model to predict the dynamic traffic demands. Moreover, we use ANN models to estimate the task performance in an MEC system. By leveraging the ANN predictor and the ANN estimators, we present a resource partitioning scheme for data transfers in the MEC system to dynamically adjust the resource partitioning based on the predicted demands and the performance requirements. Results show that our proposed scheme offers near-optimal results compared with the existing scheme. © 2022 IEEE.
Keyword ：
Data transfer Data transfer Edge computing Edge computing Fiber optic networks Fiber optic networks Neural networks Neural networks Traffic control Traffic control Wavelet transforms Wavelet transforms
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, Xiao , Lin, Songlei , Li, Yaping et al. Double-ANN-Aided Resource Partitioning Scheme for Data Transfers in MEC System over EON [C] . 2022 : 926-931 . |
| MLA | Lin, Xiao et al. "Double-ANN-Aided Resource Partitioning Scheme for Data Transfers in MEC System over EON" . (2022) : 926-931 . |
| APA | Lin, Xiao , Lin, Songlei , Li, Yaping , Shao, Junyi , Li, Yajie . Double-ANN-Aided Resource Partitioning Scheme for Data Transfers in MEC System over EON . (2022) : 926-931 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
