Query：
学者姓名：李小燕
Refining：
Year
Type
Indexed by
Source
Complex
Former Name
Co-
Language
Clean All
Abstract ：
With the surge of bandwidth demand for cloud applications and the exponential growth of data, data center networks (DCNs) are expanding rapidly, followed by the daily increasing likelihood of failures. Such failures, whether due to device or link issues, are inevitable and often lead to packet loss, transmission delays, and even system downtime. Thus, it is crucial to assess the fault-tolerant capabilities of data center networks using appropriate reliability metrics when failures occur. BCube is a well-known server-centric data center network with many advantages, such as rich low-diameter paths, high throughput, and excellent expandability. Not only do the recently proposed matroidal connectivity and conditional matroidal connectivity have reasonable fault assumptions that align well with the structural characteristics of data center networks, but they also significantly enhance the fault tolerance performance of DCNs. This paper determines the matroidal connectivity and conditional matroidal connectivity of BCube, which is the first study to apply the two reliability metrics in DCNs. Then, we extend the conclusions about (conditional) matroidal connectivity to analyze the fault tolerance of BCube in the occurrence of switch failures. In addition, we develop an efficient algorithm to identify the structural features of minimum faulty edge sets, where the cardinality of these edge sets corresponds to the conditional matroidal connectivity of BCube. Finally, we experimentally evaluate the effects of both link and switch failures on BCube's performance under the matroidal restriction. The experimental analyses reveal that BCube DCNs exhibit high fault tolerance under matroidal constraints, with the ability to withstand both link and switch failures.
Keyword ：
BCube BCube conditional matroidal connectivity conditional matroidal connectivity data center networks (DCNs) data center networks (DCNs) Data centers Data centers Fault tolerance Fault tolerance Fault tolerant systems Fault tolerant systems link failures link failures Matroidal connectivity Matroidal connectivity Network topology Network topology Reliability Reliability Resilience Resilience Routing Routing Servers Servers Switches Switches switch failures switch failures Topology Topology
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, Wanling , Li, Xiao-Yan , Chang, Jou-Ming et al. Link/Switch Failure Analysis of Data Center Networks on Matroidal Connectivity [J]. | IEEE TRANSACTIONS ON NETWORKING , 2025 , 33 (3) : 1220-1235 . |
| MLA | Lin, Wanling et al. "Link/Switch Failure Analysis of Data Center Networks on Matroidal Connectivity" . | IEEE TRANSACTIONS ON NETWORKING 33 . 3 (2025) : 1220-1235 . |
| APA | Lin, Wanling , Li, Xiao-Yan , Chang, Jou-Ming , Jia, Xiaohua . Link/Switch Failure Analysis of Data Center Networks on Matroidal Connectivity . | IEEE TRANSACTIONS ON NETWORKING , 2025 , 33 (3) , 1220-1235 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In the context of large-scale datacenter networks, the distinct mechanisms of these two protocols result in mutual interference when TCP and RoCE flows traverse shared segments of network. TCP may preempt the bandwidth allocated to RoCE, leading to unfair allocation of shared buffers. Nevertheless, due to the cost trade-off, the consideration of shared buffers becomes necessary. Therefore, isolating through traffic classes does not effectively address the issue. To meet the challenge, in this paper, we present BufferConcede, a switch-based traffic control method that allows TCP traffic to occupy more buffer space in non-hybrid switch, thereby weakening TCP traffic’s greediness for buffer space. We integrate it with practical congestion control approaches such as DCQCN, DCTCP. We evaluate BufferConcede in both implementation and large-scale simulations. Compared with state of the act, BufferConcede can reduce bandwidth allocation errors under 2.0% and reduce the average FCT of RoCE traffic by approximately 4.8%–10.2%. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
Keyword ：
Bandwidth Bandwidth Congestion control (communication) Congestion control (communication) Traffic congestion Traffic congestion Transmission control protocol Transmission control protocol
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Meng, Lingxuan , Liu, Kaiyun , Fan, Weibei et al. BufferConcede: Conceding Buffer for RoCE Traffic in TCP/RoCE Mix-Flows [C] . 2025 : 41-53 . |
| MLA | Meng, Lingxuan et al. "BufferConcede: Conceding Buffer for RoCE Traffic in TCP/RoCE Mix-Flows" . (2025) : 41-53 . |
| APA | Meng, Lingxuan , Liu, Kaiyun , Fan, Weibei , Xiao, Fu , Lv, Mengjie , Han, Lei et al. BufferConcede: Conceding Buffer for RoCE Traffic in TCP/RoCE Mix-Flows . (2025) : 41-53 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
With the increase of network scale and complexity, network failure is inevitable. Interconnection networks require sustained and dependable operation, along with efficient routing algorithms for data transmission between processors. Fault-tolerant routing, particularly with the existence of independent spanning trees (ISTs), is essential. The 3-ary n-cube network (Qn3), an extension of the hypercube, offers properties such as low vertex degree, edge symmetry, regularity, and ease of implementation. In this paper, we focus on constructing 2n ISTs in Qn3 and develop a fault-tolerant routing system based on them. Simulated data show increasing transmission success rates with higher dimensionality, nearly reaching 100%. Although the analysis is done for a particular regular network (Qn3), the outcome can serve as a useful reference, and can shed light on the effectiveness of the fault-tolerant communication for a large group of cube-based systems. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
Keyword ：
Data communication systems Data communication systems Hypercube networks Hypercube networks Trees (mathematics) Trees (mathematics)
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Xu, Yuzhen , Fan, Weibei , Lv, Mengjie et al. An Efficient Fault-Tolerant Communication Scheme in 3-Ary n-Cube Networks [C] . 2025 : 342-354 . |
| MLA | Xu, Yuzhen et al. "An Efficient Fault-Tolerant Communication Scheme in 3-Ary n-Cube Networks" . (2025) : 342-354 . |
| APA | Xu, Yuzhen , Fan, Weibei , Lv, Mengjie , Sun, Xueli , Li, Xiaoyan , Xiao, Fu . An Efficient Fault-Tolerant Communication Scheme in 3-Ary n-Cube Networks . (2025) : 342-354 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Star networks play an essential role in designing parallel and distributed systems. With the massive growth of faulty edges and the widespread applications of the longest paths and cycles, it is crucial to embed the longest fault-free paths and cycles in edge-faulty networks. However, the traditional fault model allows a concentrated distribution of faulty edges and thus can only tolerate faults that depend on the minimum degree of the network vertices. This article introduces an improved fault model called the partitioned fault model, which is an emerging assessment model for fault tolerance. Based on this model, we first explore the longest fault-free paths and cycles by proving the edge fault-tolerant Hamiltonian laceability, edge fault-tolerant strongly Hamiltonian laceability, and edge fault-tolerant Hamiltonicity in the n-dimensional star network S-n. Furthermore, based on the theoretical proof, we give an O(nN) algorithm to construct the longest fault-free paths in star networks based on the partitioned fault model, where N is the number of vertices in S-n. We also make comparisons to show that our result of edge fault tolerance has exponentially improved other known results.
Keyword ：
Bipartite graph Bipartite graph Computational modeling Computational modeling emerging assessment model emerging assessment model fault tolerance fault tolerance Fault tolerance Fault tolerance Fault tolerant systems Fault tolerant systems Hypercubes Hypercubes large-scale missing edges large-scale missing edges longest paths longest paths Program processors Program processors Star networks Star networks Stars Stars
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Li, Xiao-Yan , Chang, Jou-Ming . LP-Star: Embedding Longest Paths into Star Networks With Large-Scale Missing Edges Under an Emerging Assessment Model [J]. | IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING , 2025 , 13 (1) : 147-161 . |
| MLA | Li, Xiao-Yan et al. "LP-Star: Embedding Longest Paths into Star Networks With Large-Scale Missing Edges Under an Emerging Assessment Model" . | IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING 13 . 1 (2025) : 147-161 . |
| APA | Li, Xiao-Yan , Chang, Jou-Ming . LP-Star: Embedding Longest Paths into Star Networks With Large-Scale Missing Edges Under an Emerging Assessment Model . | IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING , 2025 , 13 (1) , 147-161 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Diagnosability is an important parameter to measure the fault tolerance of a multiprocessor system. If we only care about the state of a node, instead of doing the global diagnosis, Hsu and Tan proposed the idea of local diagnosis. Chiang and Tan provided an extended star structure to diagnose a node under comparison model. In this work, we evaluate the local diagnosability better by proposing a tree structure around this node. We provide the corresponding algorithm to diagnose the node. Simulation results are presented for different failure probability of a node in the tree and different percentage of faulty nodes in the tree, showing the performance of our algorithm. © 2024 Institute of Information Science. All rights reserved.
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Meirun , Li, Xiao-Yan , Lin, Cheng-Kuan et al. A New Tree Structure for Local Diagnosis [J]. | Journal of Information Science and Engineering , 2024 , 40 (2) : 231-244 . |
| MLA | Chen, Meirun et al. "A New Tree Structure for Local Diagnosis" . | Journal of Information Science and Engineering 40 . 2 (2024) : 231-244 . |
| APA | Chen, Meirun , Li, Xiao-Yan , Lin, Cheng-Kuan , Pai, Kung-Jui . A New Tree Structure for Local Diagnosis . | Journal of Information Science and Engineering , 2024 , 40 (2) , 231-244 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Fault detection and localization are vital for ensuring the stability of data center networks (DCNs). Specifically, adaptive fault diagnosis is deemed a fundamental technology in achieving the fault tolerance of systems. The highly scalable data center network (HSDC) is a promising structure of server-centric DCNs, as it exhibits the capacity for incremental scalability, coupled with the assurance of low cost and energy consumption, low diameter, and high bisection width. In this paper, we first determine that both the connectivity and diagnosability of the m-dimensional complete HSDC, denoted by HSDCm(m), are m. Further, we propose an efficient adaptive fault diagnosis algorithm to diagnose an HSDCm(m) within three test rounds, and at most N+4m(m-2) tests with m >= 3 (resp. at most nine tests with m=2), where N=m center dot 2m is the total number of nodes in HSDCm(m). Our experimental outcomes demonstrate that this diagnosis scheme of HSDC can achieve complete diagnosis and significantly reduce the number of required tests.
Keyword ：
adaptive diagnosis adaptive diagnosis cycle decomposition cycle decomposition data center networks data center networks diagnosability diagnosability hamiltonian hamiltonian
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, Wanling , Li, Xiao-Yan , Chang, Jou-Ming et al. An Improved Fault Diagnosis Algorithm for Highly Scalable Data Center Networks [J]. | MATHEMATICS , 2024 , 12 (4) . |
| MLA | Lin, Wanling et al. "An Improved Fault Diagnosis Algorithm for Highly Scalable Data Center Networks" . | MATHEMATICS 12 . 4 (2024) . |
| APA | Lin, Wanling , Li, Xiao-Yan , Chang, Jou-Ming , Wang, Xiangke . An Improved Fault Diagnosis Algorithm for Highly Scalable Data Center Networks . | MATHEMATICS , 2024 , 12 (4) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Diagnosability is an important parameter to measure the fault tolerance of a multiprocessor system. If we only care about the state of a node, instead of doing the global diagnosis, Hsu and Tan proposed the idea of local diagnosis. Chiang and Tan provided an extended star structure to diagnose a node under comparison model. In this work, we evaluate the local diagnosability better by proposing a tree structure around this node. We provide the corresponding algorithm to diagnose the node. Simulation results are presented for different failure probability of a node in the tree and different percentage of faulty nodes in the tree, showing the performance of our algorithm.
Keyword ：
comparison model comparison model diagnosis algorithm diagnosis algorithm fault diagnosis fault diagnosis local diagnosability local diagnosability tree tree
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Meirun , Li, Xiao-Yan , Lin, Cheng-Kuan et al. A New Tree Structure for Local Diagnosis [J]. | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING , 2024 , 40 (2) : 231-244 . |
| MLA | Chen, Meirun et al. "A New Tree Structure for Local Diagnosis" . | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 40 . 2 (2024) : 231-244 . |
| APA | Chen, Meirun , Li, Xiao-Yan , Lin, Cheng-Kuan , Pai, Kung-Jui . A New Tree Structure for Local Diagnosis . | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING , 2024 , 40 (2) , 231-244 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
云计算与物联网安全课程是信息安全专业本科生的必修课,培养学生运用所学的云计算与物联网技术分析和解决问题.本教学创新成果报告围绕3个课堂教学真实问题:一是学生多学科交叉基础知识不足;二是学生解决实际问题和实践能力不足;三是存在产学落差,学生所学技术无法符合产业需求.并且分别提出3个教学方案解决对应的课堂教学真实问题:一是开发"AI助教"APP,以增强现实(AR)和人工智能(AI)语音问答协助学生的学习过程,结合创新性;二是引入心率带、脑波仪、机器人等设备,强化学生的自主学习动机和学习习惯,培养学生解决问题的思维能力,提升高阶性;三是结合"码云"分享开源代码,由企业下载和评价,增加挑战度.
Keyword ：
人工智能 人工智能 信息教育 信息教育 物联网 物联网
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 吴伶 , 李小燕 , 陈志华 et al. 人工智能与增强现实应用于本科教育 [J]. | 科学咨询 , 2024 , (4) : 131-134 . |
| MLA | 吴伶 et al. "人工智能与增强现实应用于本科教育" . | 科学咨询 4 (2024) : 131-134 . |
| APA | 吴伶 , 李小燕 , 陈志华 , 钟展良 . 人工智能与增强现实应用于本科教育 . | 科学咨询 , 2024 , (4) , 131-134 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Blockchain-based healthcare IoT technology research enhances security for smart healthcare services such as real-time monitoring and remote disease diagnosis. To incentivize positive behavior among participants within a blockchain-based smart healthcare system, existing efforts employ benefit distribution and reputation assessment methods to enhance performance. Yet, there remains a significant gap in multidimensional assessment strategies and consensus improvements in addressing complex healthcare scenarios. In this paper, we propose a blockchain and trusted reputation assessment-based incentive mechanism for healthcare services (BtRaI). BtRaI provides a realistic and comprehensive reputation assessment with feedback to motivate blockchain consensus node participation, thus effectively defending against malicious behavior in the healthcare service system. Specifically, BtRaI first introduces multiple moderation factors for comprehensive multidimensional reputation assessment and credibly records the assessment results on the blockchain. Then, we propose an improved PBFT algorithm, grounded in the reputation assessment, to augment blockchain consensus efficiency. Finally, BtRaI designs a token-based reward and punishment mechanism to motivate honest participation in the blockchain, inhibit potential misbehavior, and promote enhanced service quality in the healthcare system. Theoretical analysis and simulation experiments conducted across various scenarios demonstrate that BtRaI effectively suppresses malicious attacks in healthcare services, improves blockchain node fault tolerance rates, and achieves blockchain transaction processing efficiency within 0.5 s in a 100-node consortium chain. BtRaI's reputation assessment and token incentive mechanism, characterized by realistic differentiation granularity and change curves, are well-suited for dynamic and complex healthcare service environments.
Keyword ：
Blockchain Blockchain Consensus mechanism Consensus mechanism Healthcare Internet of Things Healthcare Internet of Things Incentive mechanism Incentive mechanism PBFT algorithm PBFT algorithm Reputation assessment Reputation assessment
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Yanhua , Liu, Zhihuang , Zhang, Qiu et al. Blockchain and trusted reputation assessment-based incentive mechanism for healthcare services [J]. | FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE , 2024 , 154 : 59-71 . |
| MLA | Liu, Yanhua et al. "Blockchain and trusted reputation assessment-based incentive mechanism for healthcare services" . | FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 154 (2024) : 59-71 . |
| APA | Liu, Yanhua , Liu, Zhihuang , Zhang, Qiu , Su, Jinshu , Cai, Zhiping , Li, Xiaoyan . Blockchain and trusted reputation assessment-based incentive mechanism for healthcare services . | FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE , 2024 , 154 , 59-71 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The kary n-cube Q(n)(k) serves as an indispensable interconnection network in the design of data center networks, network-on-chips, and parallel computing systems since it possesses numerous attractive properties. In these parallel architectures, the paired (or unpaired) many-to-many m-disjoint path cover (m-DPC) plays a significant role in message transmission. Nevertheless, the construction of m-DPC is severely obstructed by large-scale edge faults due to the rapid growth of the system scale. In this paper, we investigate the existence of paired 2-DPC in Q(n)(k) under the partitioned edge fault (PEF) model, which is a novel fault model for enhancing the networks' fault-tolerance related to path embedding problem. We exploit this model to evaluate the edge fault-tolerance of Q(n)(k) when a paired 2-DPC is embedded into Q(n)(k). Compared to the other known works, our results can help Q(n)(k) to achieve large-scale edge fault-tolerance.
Keyword ：
Fault-tolerant embedding Fault-tolerant embedding Interconnection networks Interconnection networks k-ary n-cubes k-ary n-cubes Paired 2-disjoint path cover Paired 2-disjoint path cover PEF model PEF model
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhuang, Hongbin , Li, Xiao-Yan , Chang, Jou-Ming et al. Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model [J]. | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING , 2024 , 190 . |
| MLA | Zhuang, Hongbin et al. "Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model" . | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 190 (2024) . |
| APA | Zhuang, Hongbin , Li, Xiao-Yan , Chang, Jou-Ming , Liu, Ximeng . Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model . | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING , 2024 , 190 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
