The paper describes new method for routing classification of the packets in the networks with static routing. Static
routing is mostly used in the stable and well-controlled networks, which are sensitive to the additional complexity
introduced by the dynamic routing schemes. For example, it is a straightforward choice for the embedded networks on
terminal. The available solutions for the static routing require full-size or longest prefix-based aggregated routing table,
which is inefficient taking into account static nature of the performed routing decisions. The standard approach is based
on the full implementation of the route lookup procedure, which for every packet performs search for the longest prefix
match in the routing table. As a result, it increases implementation complexity of the network end points and switches,
requires high speed memory for storing routing tables, and leads to an additional processing delay and energy
consumption for each transmitted packet.
This work is based on the observation that clever planning of the networks with static routing allows applying new
principles of route lookup. As a consequence it allows significantly reduce complexity of the packet classification and
forwarding procedures and minimize amount of consumed resources. Complexity reduction of the packets classification
and forwarding procedures allows simplifying implementation of the networking part of the protocol stack, which results
in reduction of the device components cost, decrease of the power and memory consumption, as well as the packet
The paper contains a description of the proposed route classification method and discusses its applicability for
broad range of networks with static routing.