Key generation rates – BasejumpQDN can not increase the rate at which keys are generated by third-party QKD devices, but it can ensure that all keys are utilized for the benefit of the network. By increasing utilization and decreasing the number of keys that expire/age out, this decreases cost-per-key metrics.
Distance – BasejumpQDN can increase the reach of the overall QKD network by implementing a trusted node scheme.
Latency – BasejumpQDN limits latency of QKD key requests by applications and devices that it is serving. This is achieved this by anticipating, storing, and queuing up enough QKD key material local to the requesting applications/devices so that an application/device does not need to wait for a lower level QKD protocol to first generate key material. This latency-saving step is why BasejumpQDN uses demand and capacity estimates in routing calculations for the network.
BasejumpQDN optimizes overall satisfaction of demand in the network through linear programming techniques. The routing solution calculates a solution to maximize the satisfaction of the demand pairings in the network given the current link capacities. The key swapping routes reflect this demand optimization, so longer routes may be chosen to better address overall network demand. The optimization populates key pools between node pairs proactively so that client key requests can be filled immediately instead of being subject to the latency that would be otherwise be required for an interactive key swap to occur.