Hello, A while ago I asked about this scenario: Station A has a hop to Station B, but B doesn't have a hop to A. A is allowed to communicate with B, but is B allowed to communicate with A? Chris said he was thinking about how to resolve this, and I think we both forgot about it. Is there an update on an answer? If he can't decide, I'd like to make my case for allowing B to communicate with A. Suppose we have a network like this: A ---> B <---> C Where B and C can communicate because they have hops between them. A can communicate with B, but B cannot communicate with A because it doesn't have any hops to A. There obviously exists a one way trip from A to C. However, the result can't be returned to A because B can't talk to A. This means there would need to exist a valid round trip (starting from A and ending at A) in order for A to receive a result. The client at Station A would receive a response "no route found" despite there being a route. I don't think it makes sense for the client to ask "does a one-way trip exist" and then the server responds with "maybe, but a round trip certainly doesn't exist." If it's too late to make it a clarification, can my group add it as an assumption? Our fix is simple: make both stations as neighbours of each other, even if only one station has a hop between them. Thanks