A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Saddle policies for secure routing in communication networks
Proceedings of the 41st IEEE Conference on Decision and Control, 2002.
In this paper we prove that the off-line policies proposed in a previous paper  for secure routing in communication networks are actually saddle-point solutions and therefore not overly "conservative." We show this in a more general setting than the one originally proposed in  as it allows us to handle, e.g., attacks on nodes. It had been shown before that secure routing designed to handle single-link attacks maximizes throughput by maximally distributing packets over the available pathsdoi:10.1109/cdc.2002.1184717 fatcat:tiinkgpdr5eh3ef7ilemuduhwe