This simple analysis looks at the bandwidth Honeyd can support when responding to ICMP ping requests. We check the number of returned ICMP packets for sending ping requests to the interface of the host that Honeyd runs on, to the IP address of the entry router that Honeyd simulates and to random IP addresses in C-class networks in the simulated routing topology. One C-class network is one hop away from the entry router, the other one is two hops away.

In general, Honeyd makes use of advanced data structures to increase performance. The routing topology at each router uses ternary trees and provides O(log(n)) lookups for networks. Other data structures within Honeyd use hash tables or splay trees.