that is an abbreviation of the sequence of tokens represented in definition 606 to identify an abbreviation for a sequence of two or more tokens routing logic 210 searches token table 214 for a token definition whose definition 606 is that sequence the corresponding token 604 is the abbreviation in test step 504 fig5 routing logic 210 determines whether an abbreviation was found within token table 214 in step 502 if so routing logic 210 determines in step 506 that the retrieved abbreviation is the appropriate abbreviation for the sequence of tokens and processing according to logic flow diagram 408 and therefore step 408 fig4 completes in alternative embodiments routing logic 210 can use a hashing function to map multiple tokens to a single abbreviation token in such embodiments the look up and test of steps 502 and 504 can be replaced with a single hashing step in some embodiments the hashing function is designed to avoid producing hashed tokens that can be confused with a node token processing from such a hashing step would transfer to step 506 which is described above returning to logic flow diagram 408 fig5 if an abbreviation was not found within token table 214 in step 502 processing by routing logic 210 transfers from test step 504 to step 508 in step 508 routing logic 210 creates a token that is unique from all abbreviation tokens stored in token table 214 fig2 and from all tokens of nodes in network 106 fig1 in this illustrative embodiment the total range of values for legitimate tokens is divided into a range reserved for nodes of network.