Towards an understanding of EASE and its properties

Abstract

We propose a model under which several inherent properties of the exponential age search routing protocol can be derived. By making simplifications on this model, we are able to address the issue of the optimality of a parameter of the protocol and to improve the existing upper bound on its performance.