A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a message-switched network. In this problem, we must manage resources of the system to deliver messages to any processor of the network. In this purpose, we use information given by a routing algorithm. By the context of stabilization (in particular, the system starts in any configuration), this information can be corrupted. In [1], authors show that there exists snap-stabilizing algorithms for this problem (in the state model). That implies that we can ask the system to begin forwarding messages without losses even if routing informations are initially corrupted. In this paper, we propose another snap-stabilizing algorithm for this problem which improves the space complexity of the one of [1].