On the design of communication networks using restricted message routing
Werner Poguntke · 2002
Routing plans on graphs with a limited number of entries for each origination-destination pair are considered. For a given graph, the problem is to construct a routing plan satisfying several criteria. Some results concerning the criteria and their interrelationships are presented. There are graphs that do not allow certain criteria to be satisfied simultaneously. The aspect of graph design is also considered.>