In large processor networks it is desirable, that the amount of memory, used by processors to store routing information. is kept small. Thus, different types of compact routing schemes have been designed. Existing compact routing schemes do not guarantee optimal routings for all network topologies. A study will be made to determine precisely which compact routing schemes give optimal routings on which network topologies (including both regular interconnection networks and networks randomly chosen from an appropriate distribution).
New compact routing schemes will be designed and studied which are intended to give optimal routings for wider classes of practical networks. Also it will be studied whether more general applicability of compact routing can be obtained by allowing routings via near-optimal paths.