An update game is a new model for studying networks and
infinite duration processes.  In this paper we analyze
routing strategies in (bipartite) update networks. We show that any
routing strategy, both independent of a relying graph 
and with advice, uses a space of
size at least the logarithm of the number of vertices.
We also present a nearly optimal strategy with advice
to this lower bound.