A Routing Algorithm for Digraphs
E. Bedrosian · IEEE Transactions on Communications · 1977
A new algorithm for routing data packets in networks of computers connected by communication links is given by Chyung and Reddy. Because they assume that the communication links are two-way, their result applies, properly, to routing messages in a graph. However, some communication networks have asymmetrical cross links either by design or because the radio circuits that must be paralleled in opposite directions to compose them may fail. Such networks are represented by digraphs and it is clear that they require a generalized routing algorith. A simple modification of Chyung and Reddy's routing algorithm, shown below, provides this generalization.