We proposea simple distance-vectorprotocolfor routingin networkshavingunidirectional links. The protocol can be seen as an adaptation for these networks of the strategy as used in the popular RIP protocol. The protocol comprises two main algorithms, one for collecting \from" information, and the other one for generating and propagating \to" information. Like the RIP protocol, this one can handle dynamic changes and tolerate node and link failures in the network.