PDF
Full
Outline
To address the issue of reduced network schedulability when the shortest path is adopted for all transmission traffic, a flow attribute-aware evaluation function and redundant routing scheduling method for time-triggered flows are proposed. The heuristic algorithm is used to solve the routing scheme with the largest evaluation function, and the integer linear programming is used to solve the scheduling. The simulation experiment results demonstrate that, in the region-oriented electronic and electrical architecture network topology, compared with the K Shortest Path (KSP) and Degree of Conflict (DoC) routing schemes, the proposed scheme enhances the success rate of scheduling by 38.9% and 14% respectively while guaranteeing network reliability, and further validates the effectiveness of this method.
PDF
201
82
| 科 Family | 属数 Number of genus | 种数 Number of species | 占总种数比例 Percentage of total species (%) | 属 Genus | 种数 Number of species | 占总种数比例 Percentage of total species (%) |
|---|---|---|---|---|---|---|
| 鹅膏菌科Amanitaceae | 2 | 11 | 5.26 | 鹅膏菌属 Amanita | 10 | 4.78 |
| 小菇科 Mycenaceae | 2 | 12 | 5.74 | 丝盖伞属 Inocybe | 5 | 2.39 |
| 多孔菌科 Polyporaceae | 8 | 14 | 6.70 | 蜡蘑属 Laccaria | 5 | 2.39 |
| 红菇科 Russulaceae | 3 | 23 | 11.00 | 小皮伞属 Marasmius | 6 | 2.87 |
| 小菇属 Mycena | 11 | 5.26 | ||||
| 光柄菇属 Pluteus | 5 | 2.39 | ||||
| 红菇属 Russula | 17 | 8.13 | ||||
| 栓菌属 Trametes | 5 | 2.39 |
关闭全屏
No. 86 Xueyuan South Road, Haidian District, Beijing
010-62199257
qkjq@cast.org.cn
Copyright © 2025 China Association for Science and Technology. All rights reserved. For all open access content, the relevant licensing terms apply.
Sponsored by the Office of the Leading Group for Cybersecurity and Informatization of CAST, and supported by Science and Technology Review Publishing House
