An update game approach is a new model
for studying networks and infinite duration processes.
In this paper we analyze the routing in (bipartite) update networks.
First we show how to simplify update networks.
Second we prove that strategies independent of the relying graph
have to use at least logarithmic space
w.r.t.\  number of some branching vertices.
Third we prove that
playing randomly is
an independent of the relying graph routing strategy
for update networks.