Compact-Port Routing Models and Applications to Distance-Hereditary Graphs

In this paper we introduce a new model for compact routing called the Compact-Port model. It is based on routing tables that have a different structure with respect to the previous schemes, and it gives a new way of succinctly representing the shortest-path information in interconnection networks. Although we combine it with Interval Routing, it is orthogonal to the known compact routing methods like Prefix Routing, Boolean Routing, and Multi-dimensional Interval Routing. We first show that there are situations in which the Compact-Port model significantly outperforms the classical Interval Routing. Moreover, we give applications to an interesting family of graphs called distance-hereditary, for which compact routing methods are still not known. Such a class of graphs has the desiderable property that whenever any subset of the node set fails, the distance between the nodes which are still connected remains the same. Finally, we introduce and discuss another compact-port model, called the Intersection model, that corresponds to a slightly different structure of the routing table and has similar properties.