Before revision:  In this paper, we consider the case in which, during a preprocessing phase, we assign a label and a routing table to each node. The routing strategy must then decide where to send the package using only the label of the target node  and the routing table of the node the message is currently at.
After revision:  In this paper, we consider the case in which, during a preprocessing phase, we assign a label and a routing table for each vertex of P. Then, we must be able to route a data packet between any two vertices p and q of P, where each step must use only the label of the target node and the routing table of the node the message is currently at.