Recently, 10 Gbps or higher speed links are being widely deployed in data centers. Novel high-speed packet I/O frameworks have emerged to keep pace with such high-speed links. These frameworks mainly use techniques, s...Recently, 10 Gbps or higher speed links are being widely deployed in data centers. Novel high-speed packet I/O frameworks have emerged to keep pace with such high-speed links. These frameworks mainly use techniques, such as memory preallocation, busy polling, zero copy, and batch processing, to replace costly operations(e.g., interrupts, packet copy, and system call) in native OS kernel stack. For high-speed packet I/O frameworks,costs per packet, saturation throughput, and latency are performance metrics that are of utmost concern, and various factors have an effect on these metrics. To acquire a comprehensive understanding of high-speed packet I/O, we propose an analytical model to formulate its packet forwarding(receiving–processing–sending) flow. Our model takes the four main techniques adopted by the frameworks into consideration, and the concerned performance metrics are derived from it. The validity and correctness of our model are verified by real system experiments. Moreover, we explore how each factor impacts the three metrics through a model analysis and then provide several useful insights and suggestions for performance tuning.展开更多
This article puts forward an Ad-hoc on-demand distance vector routing （AODV） routing overhead analysis method in mobile Ad-hoc network （MANET）.Although multiple routing protocols have been proposed to improve the ...This article puts forward an Ad-hoc on-demand distance vector routing （AODV） routing overhead analysis method in mobile Ad-hoc network （MANET）.Although multiple routing protocols have been proposed to improve the performance,scarcely any paper analyzed the routing overhead caused by routing setup and maintenance processes in mathematical way.Routing overhead consumes part of network resources and limits the supported traffic in the network.For on-demand routing protocols like AODV,the routing overhead depends on the link failure probability to a great extent.This article analyzes the collision probability caused by hidden-node problem and the impact on link failure probability.In chain and rectangle scenarios,it presents a mathematical analysis of the theoretical routing overhead of AODV protocol based on link failure probability.Simulations on OPNET 14.5 platform match well with the theoretical derivation which confirms the effectiveness of the analysis method.展开更多
基金supported in part by the National Key Research and Development Program of China (No. 2018YFB1700103)the National Natural Science Foundation of China (No.61872208)。
文摘Recently, 10 Gbps or higher speed links are being widely deployed in data centers. Novel high-speed packet I/O frameworks have emerged to keep pace with such high-speed links. These frameworks mainly use techniques, such as memory preallocation, busy polling, zero copy, and batch processing, to replace costly operations(e.g., interrupts, packet copy, and system call) in native OS kernel stack. For high-speed packet I/O frameworks,costs per packet, saturation throughput, and latency are performance metrics that are of utmost concern, and various factors have an effect on these metrics. To acquire a comprehensive understanding of high-speed packet I/O, we propose an analytical model to formulate its packet forwarding(receiving–processing–sending) flow. Our model takes the four main techniques adopted by the frameworks into consideration, and the concerned performance metrics are derived from it. The validity and correctness of our model are verified by real system experiments. Moreover, we explore how each factor impacts the three metrics through a model analysis and then provide several useful insights and suggestions for performance tuning.
基金supported by the Hi-Tech Research and Development Program of China (2008AA01A322)the National Natural Science Foundation of China (60772109)
文摘This article puts forward an Ad-hoc on-demand distance vector routing （AODV） routing overhead analysis method in mobile Ad-hoc network （MANET）.Although multiple routing protocols have been proposed to improve the performance,scarcely any paper analyzed the routing overhead caused by routing setup and maintenance processes in mathematical way.Routing overhead consumes part of network resources and limits the supported traffic in the network.For on-demand routing protocols like AODV,the routing overhead depends on the link failure probability to a great extent.This article analyzes the collision probability caused by hidden-node problem and the impact on link failure probability.In chain and rectangle scenarios,it presents a mathematical analysis of the theoretical routing overhead of AODV protocol based on link failure probability.Simulations on OPNET 14.5 platform match well with the theoretical derivation which confirms the effectiveness of the analysis method.
