Consider a lossy packet network of queues, communicating over a wireless medium.
In the multi-cast setting, it is known that for such wireless erasure networks, 
capacity can be achieved using network coding techniques when the erasure locations 
are known at the destimation(s). In this paper we present a throughput-optimal 
transmission strategy for the unicast setting when feedback (in the form of an 
acknowledgement) is available from the destination. The strategy has the following 
features: It requires very little feedback (in fact, no feedback from intermediate 
nodes in the network); it is fully distributed (nodes in the network need no knowledge 
of the network topology, nor of the erasure locations of any of the packets); and it 
requires no form of coding (neither network coding nor rateless coding). In this scheme, 
communication at the information theoretic cut-set rate consists of each node randomly 
choosing a packet from its buffer to transmit at each opportunity, and removing a packet 
from its buffer only when it has been successfully received by the final destination. 
Our proof of this result is based on a novel Lyapunov function which properly encodes 
all the network cut-sets.