… tables and we show that a wealth of practical policies can be classified by our results. By …
of compact routing schemes considered so far and we show that there are routing policies for …

… In particular, there exist compact routing schemes designed for grids, trees, and Internet-like …
In this paper, we demonstrate that in view of recent results in compact routing research, …

… framework for policy routing, … of policies that do not admit compact routing tables, we present
another surprising result. We show that there exist policies that do not admit compact routing …

… In this paper, we are mainly interested in compact solutions which minimize the number of
required forwarding rules. We say that an oblivious routing scheme is compact if the number …

… the complexity of forbiddenset routing. The only known algorithms for policy routing (such
as BGP) use Bellman-Ford iteration to construct so-called stable routing trees – for each des…

… The distinguishing component of a policy approach is the procedure by which the Policy
Route is synthesized. … Policy Route is carried only in the first packet of a sequence, and a …

… the power of transfer learning to achieve a compact representation of the DRL model. [51…
Routing in blockchain-based IoT. Therefore, we propose a compact DRLbased dynamic routing …

… compact routing but primarily from [21] and [11] to make an important key finding: when
constructing a routing … This is an inherent artifact of policy routing and the economic environment …

… In this section, we describe the two compact routing algorithms we evaluate in this paper.
Both algorithms as described require total knowledge of the graph to label nodes appropriately …

… We study the complexity of policy routing with forbidden-set policies – each node specifies a
… policy-based routing on the Internet, compact routing schemes are better than using routing …