Name
Abstract | ||
|---|---|---|
After studying the node degree distribution and average path length of the kernel module call graphs of 223 Linux kernels (V1.1.0 to V2.4.35), we have found that the call graphs of the file system, drivers, kernel, and memory management modules are scale-free small-world complex networks that exhibit strong clustering tendency. Using the random error case and attack case methods, we investigated the robustness of the modules by removing the nodes in their call graphs. We further proposed the Critical Removal Ratio to measure the robustness of these modules from the point view of complex networks. Finally, we showed correlations between robustness and the complex network features of kernel modules. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/SATE.2017.18 | 2017 International Conference on Software Analysis, Testing and Evolution (SATE) |
Keywords | Field | DocType |
Linux kernel,robustness,complex networks | Average path length,Computer science,Algorithm,Robustness (computer science),Memory management,Complex network,Degree distribution,Configfs,Cluster analysis,Operating system,Linux kernel | Conference |
ISBN | Citations | PageRank |
978-1-5386-3688-6 | 0 | 0.34 |
References | Authors | |
14 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lei Wang | 1 | 401 | 111.60 |
| Xinchen Wang | 2 | 7 | 1.51 |
| Dingzeyu Wu | 3 | 1 | 0.70 |